Rajesh M

The sentiment classification aims to identify the sentiment polarity of the reviews as positive or negative based on the subjective information expressed in the reviews. Generally, all learning techniques require labeled data to train a classifier. However, obtaining labeled data in every domain is impractical and also assigning label for each domain takes time consuming and cost effective. Moreover, the classifier trained in one domain may not produce good results when it is applied to another domain. In order to solve this issue, the proposed method develops the cross domain sentiment classification framework using dual transfer learning which learns both marginal and conditional distributions of features from source and target domain. The proposed method is based on joint nonnegative matrix tri factorizations (NMTF). The two distributions are learned from the decomposed latent factors that exhibit the duality property. Extensive experimental results were performed on Amazon data set which shows dual transfer learning is more effective than structural correspondence learning for cross domain sentiment classification.

Predicting Congestion Control in Heterogeneous Wireless Ad Hoc Networks is a complex task because heterogeneous resource nodes are involved in a distributed environment. Long execution workload on an Adhoc network is even harder to predict due to heavy load fluctuations. In this paper, we use Bloom filter to minimize the prediction errors. We apply Savitzky-Golay filter to train a sequence of confidence windows. The purpose is to smooth the prediction process from being disturbed by load fluctuations. We present a new self-adjust hybrid model (Proactive and Reactive Model) for load prediction guided by trained confidence windows. This will address excess bandwidth and long route request delay of proactive and reactive routing protocols. Self-adjust hybrid model (SH Model) provides a framework for other protocols. The significant gain in prediction accuracy makes the new SH Model very attractive to predict Congestion Control performance and also we propose path observation based physical routing protocol named POPR for WANET. The proposed routing protocol incorporates relative distance, direction and mid-range forwarder node with traffic density to forward the data toward destination in order to improve physical forwarding between and at the intersection. Simulation results show that the proposed routing protocol and SH Model performs better as compared to existing solutions. The model was proved especially effective to predict large workload that demands very long execution time as well. At the end, we discuss extended research issues and tool development for Congestion Control performance prediction.

In the corporate world, a large number of people store their data on clouds. For doing this they need to give their confidential data in the hands of the third party, commonly known as service providers. These cloud service providers cannot be trusted since the complete data is stored in one single cloud. This increases security risks to the user's sensitive data. Due to this issue of data integrity risk and service availability failure, the concept of " Cloud-of-Clouds " comes into picture. Cloud-of-clouds are also known as " inter-clouds " or " multi-clouds ". Use of cloud-of-clouds provides a higher level of security to the user's confidential data. The aim of this paper is to secure the user's data by using cloud-of clouds. A new approach for cloud data security: from single to cloud-of-clouds 605

Graphical passwords are believed to be more secure than traditional textual passwords, but the authentications are usually complex and boring for users. Furthermore, most of the existing graphical password schemes are vulnerable to spyware and shoulder surfing. A novel graphical password scheme ColorLogin is proposed in this paper. ColorLogin is implemented in an interesting game way to weaken the boring feelings of the authentication. ColorLogin uses background color, a method not previously considered, to decrease login time greatly. Multiple colors are used to confuse the peepers, while not burdening the legitimate users. Meanwhile, the scheme is resistant to shoulder surfing and intersection attack to a certain extent. Experiments illustrate the effectiveness of ColorLogin. Authentication scheme for session passwords using color and image 591

Big Data concern large-volume, complex, growing data sets with multiple, autonomous sources. With the fast development of networking, data storage, and the data collection capacity, Big Data are now rapidly expanding in all science and engineering domains, including physical, biological and biomedical sciences. This paper presents a HACE theorem that characterizes the features of the Big Data revolution, and proposes a Big Data processing model, from the data mining perspective. This data-driven model involves demand-driven aggregation of information sources, mining and analysis, user interest modeling, and security and privacy considerations. We analyze the challenging issues in the data-driven model and also in the Big Data revolution.

A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data Due to the increasing popularity of cloud computing, more and more data owners are motivated to outsource their data to cloud servers for great convenience and reduced cost in data management. In this project, present a secure multi-keyword ranked search scheme over encrypted cloud data, which simultaneously supports dynamic update operations like deletion and insertion of documents. Specifically, the vector space model and the widely-used TFIDF model are combined in the index construction and query generation. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold, and then partitions the resulting clusters into sub-clusters until the constraint on the maximum size of cluster is reached. In the search phase, this approach can reach a linear computational complexity against an exponential size increase of document collection. In order to verify the authenticity of search results, a structure called minimum hash sub-tree is designed in this paper. Due to the use of our special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the efficiency of the proposed scheme.

and phrases: AODV routing protocol, congestion control wireless ad hoc networks (WANETs), wireless agents (WA), total congestion metric (TCM), enhanced distributed channel access (EDCA), transmission opportunity limit (TXOP). Abstract In Wireless Ad-hoc Networks (WANETs) obstruction occurs due to the packet loss and it can be successfully reduced by involving congestion control scheme which includes routing algorithm and a flow control at the network layer. In this paper, we propose an agent based congestion control technique for WANETs. In our technique, the information about network congestion is collected and distributed by wireless agents (WA). A wireless agent based congestion control AODV routing protocol is proposed to avoid congestion in ad-hoc M. Rajesh and J. M. Gnanasekar 20 network. Some wireless agents are collected in ad-hoc network, which carry routing information and nodes congestion status. When wireless agent movements happen through the network, it can select a less-loaded neighbor node as its next hop and update the routing table according to the node's congestion status. With the support of wireless agents, the nodes can get the dynamic network topology in time. By simulation results, we have shown that our proposed technique attains high delivery ratio.

The aim of this paper is to discuss secure routing in Wireless Sensor networks. I have made an endeavor to present an
analysis on the security of Directed Diffusion, a protocol used for routing in wireless sensor networks. Along with this the
paper also discusses the various attacks possible on this routing protocol and the possible counter-measures to prevent
theses attacks.

As wireless adhoc network is often deployed in a hostile environment, nodes in the networks are prone to major-range
breakdown, resulting in the network not working normally. In this case, a useful Reinstallation scheme is needed to restore
the error network timely. Most of alive Reinstallation schemes believe more about the number of deployed nodes or error
tolerance alone, but unsuccessful to take into version the fact that network Exposure and topology quality are also vital to a
network. To address this issue, we present two algorithms named Packed 2-Connectivity Reinstallation Algorithm (P2CRA)
and Biased 3-Connectivity Reinstallation Algorithm (B3CRA), which restore an error ADHOC in different aspects. P2CRA
constructs the fan-shaped topology structure to reduce the number of deployed nodes, while B3CRA constructs the dual-ring
topology structure to improve the error tolerance of the network. P2CRA is suitable when the Reinstallation cost is given the
priority, and B3CRA is suitable when the network quality is believed first. Compared with other algorithms, these two
algorithms ensure that the network has stronger Error-Lenient function, major Exposure region and better balanced load after
the Reinstallation.

One of the grave problems after kidney transplantation is the recipient body’s immune rejection of the transplanted organ. T -cells and antibodies attack the organ, which in the worst case can lead to graft failure. Biopsy is an important diagnostic tool to evaluate a rejection episode. TBase© includes a biopsy protocol that can easily be filled out by the physician, which helped to collect and store 1447 biopsy cases in the TBase© database. With respect to different kinds of rejections, there exist some basic rules for the entered data that are enforced during completion of the protocol. Nevertheless, because so much biopsy data was entered in by hand, it was necessary to check the quality and plausibility of existing data with respect to more complex rules that
were not enforced during protocol completion. In this paper, we present the process of checking the biopsy data
for consistency with complex rules provided by an expert, as well as mining of new rules using interpretable rule-based classification methods. We discovered interesting rules and relationships between features with respect to T-cell mediated rejection (TCMR), antibody-mediated rejection (AMR), interstitial fibrosis and tubular atrophy (IF/TA), and polyoma virus (BKV) nephropathy, with negative results concerning acute tubular necrosis (ATN). The discovered rules further support the quality and plausibility of the data, and open avenues for further research.

Initially, object-orientation and parallelism originated and developed as separate and relatively independent areas. During the last decade, however, more and more researchers were attracted by the benefits from a potential marriage of the two powerful paradigms. Numerous research projects and an increasing number of practical applications were aimed at different forms of amalgamation of parallelism with object-orientation. It has been realized that parallelism is a inherently needed enhancement for the traditional object-oriented programming (OOP) paradigm, and that object
orientation can add significant flexibility to the parallel programming paradigm.

Adhoc sensor networks are ad hoc networks that are characterized by decentralized structure and adhoc deployment. Sensor networks have all the basic features of ad hoc networks but to different degrees – for example, much lower mobility and much more stringent energy equirements. We analyze the current state of research and evaluate open issues in development of routing techniques in wireless sensor networks.

The aim of this paper is to discuss secure routing in Wireless Sensor networks. I have made an endeavor to present an analysis on the security of Directed Diffusion, a protocol used for routing in wireless sensor networks. Along with this the paper also discusses the various attacks possible on this routing protocol and the possible counter-measures to prevent theses attacks.