IEEE TRANSACTIONS 2012-2011-2010

JAVA
TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS ON NETWORKING S.NO 1. PROJECT CODE ITJNW01 PROJECT TITLES DESCRIPTION YEAR 2011 Load Balance with Imperfect In this paper, a novel load balancing Information in Structured Peer- algorithm that is unique in that each to-Peer Systems participating peer is based on the partial knowledge of the system to estimate the probability distributions of the capacities of peers and the loads of virtual servers, resulting in imperfect knowledge of the system state. On the Robustness of Bit In this work we study Bit Tyrant, a Torrent Swarms to Greedy recently proposed strategic client. Peers Bit Tyrant tries to determine the exact amount of contribution necessary to maximize its download rate by dynamically adapting and shaping the upload rate allocated to its neighbors. Analyzing the ResilienceComplexity Tradeoff of Network Coding in Dynamic P2P Networks In this paper, we quantitatively evaluate how network coding may improve content availability, block diversity and download performance in the presence of churn, as the number of blocks in each segment for coding varies.

2.

ITJNW02

2011

3.

ITJNW03

2011

4.

ITJNW04

Effective Delay-Controlled This paper proposes a new load Load Distribution over distribution model aiming to Multipath Networks minimize the difference among end to- end delays, thereby reducing packet delay variation and risk of packet reordering without additional network overhead.

2011

IEEE TRANSACTIONS 2012-2011-2010 5. ITJNW05 On the Market Power of In this paper, we develop an Network Coding in P2P analytical framework that Content Distribution Systems characterizes a coding based P2P content distribution market where rational agents seek for individual payoff maximization. Unlike existing game theoretical models, we focus on a decentralized resale marketthrough virtual monetary exchanges, agents buy the coded blocks from others and resell their possessions to those in need. Rumor Riding: Anonym zing We propose Rumor Riding (RR), a Unstructured Peer-to-Peer lightweight and non-path-based Systems mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly using the symmetric cryptographic algorithm. Node Reclamation and we propose a node replacement and Replacement for Long-lived reclamation (NRR) strategy, with Sensor Networks which a mobile robot or human labor called mobile repairman (MR) periodically traverses the sensor network, reclaims nodes with low or no power supply, replaces them with fully-charged ones, and brings the reclaimed nodes back to an energy station for recharging Energy Efficient Opportunistic In this paper, we focus on selecting Routing in Wireless Sensor and prioritizing forwarder list to Networks minimize energy consumptions by all nodes. We study both cases where the transmission power of each node is fixed or dynamically adjustable. We present an energy efficient opportunistic routing strategy, denoted as EEOR. Decomposing Workload In this paper, we present a novel Bursts for Efficient Storage approach to improve client Resource Management performance and reduce resource provisioning at the server. In our approach, we modify the characteristics of the arriving 2011

6.

ITJNW06

2011

7.

ITJNW07

2011

8.

ITJNW08

2011

9.

ITJNW09

2011

IEEE TRANSACTIONS 2012-2011-2010 workload so that its behavior is dominated by the largely wellbehaved portions of the request stream 10. ITJNW10 Yet Another Simple Solution In this paper uses unbounded size for the Concurrent timestamps. However, with a trivial Programming Control Problem modification, this algorithm is then Transformed to use bounded size registers. More importantly, the resulting algorithm retains all the properties of the original algorithm, including non atomicity property. Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks In this paper we present an efficient algorithm that constructs a range assignment schedule having length not smaller than 1=12 of the optimum with high probability. Then we design an efficient distributed version of the above algorithm, where nodes initially know n and their own position only. 2011

11.

ITJNW11

2011

12.

ITJNW12

Stability-Optimal Grouping Focusing on this topic, our main Strategy of Peer-to-Peer findings are three folds: 1) A Systems general analytical model to investigate the grouping process of P2P systems is established, in which the stability-scalability tradeoff problem is paid special attention to; 2) We formalize the target of grouping as the Maximum Stability Grouping (MSG) problem. It proves to be not only NP-hard, but also infeasible; therefore, we restrict it to a feasible Homogeneous MSG (HMSG) problem and deduce its optimal solution under the stochastic model; 3) We propose a homogeneous grouping strategy to fulfill the optimal solution. Predictable high performance In this project we present a design Computing using Feedback and implementation of a predictable and admission control HPC system using feedback control and admission control. By creating a virtualized application layer and

2011

13.

ITJNW13

2011

IEEE TRANSACTIONS 2012-2011-2010 opportunistically multiplexing concurrent applications through the application of formal control theory, we regulate a job s progress such that the job meets its deadline without requiring exclusive access to resources even in the presence of a wide class of unexpected events. 14. ITJNW14 A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks. In this project, we propose a novel topology matching algorithm based on the Metropolis-Hastings method. Our proposal is guided by our insight analytical model and is close to the optimal design. 2010

15.

ITJNW15

Stabilization of Flood In this project we discuss a family of Sequencing Protocols in four flood sequencing protocols that Sensor Networks use sequence numbers to distinguish between fresh and redundant flood messages. These four protocols are: a sequencing free protocol, a linear sequencing protocol, a circular sequencing protocol, and a differentiated sequencing protocol. An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems In this project we presents an Efficient and Adaptive Decentralized (EAD) file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to non-uniform and timevarying file popularity and node interest.

2010

16.

ITJNW16

2010

17.

ITJNW17

Group-Based Negotiations in In this project we propose a novel P2P System peer group joining protocol. We introduce a highly expressive resource negotiation language, able to support the specification of a large variety of conditions applying to single peers or groups of peers.

2010

IEEE TRANSACTIONS 2012-2011-2010 18. ITJNW18 Weak State Routing for Large- In this project we propose the Scale Dynamic Networks concept of weak state, which is interpreted as a probabilistic hint, not as absolute information about the destination nodes from routing table states. Weak state can remain valid without explicit messages by systematically reducing the confidence in its accuracy. 2010

TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS ON DATA MINING S.NO 19. PROJECT CODE ITJDM01 PROJECT TITLES A Machine Learning Approach for Identifying DiseaseTreatment Relations in Short Texts DESCRIPTION This paper describes a ML-based methodology for building an application that is capable of identifying and disseminating healthcare information. It extracts sentences from published medical papers that mention diseases and treatments, and identifies semantic relations that exist between diseases and treatments. Our evaluation YEAR 2011

IEEE TRANSACTIONS 2012-2011-2010 results for these tasks show that the proposed methodology obtains reliable outcomes that could be integrated in an application to be used in the medical care domain. 20. ITJDM02 Falcons Concept Search: A In this paper, we illustrate how the Practical Search Engine for proposed mode of interaction helps Web Ontologies users quickly find ontologies that satisfy their needs and present several supportive techniques including a new method of constructing virtual documents of concepts for keyword search, a popularity-based scheme to rank concepts and ontologies, and a way to generate query-relevant structured snippets. Privacy-Preserving Updates to In this paper, we propose two Anonymous and Confidential protocols solving this problem on Databases suppression-based and generalization-based k-anonymous and confidential databases. The protocols rely on well-known cryptographic assumptions, and we provide theoretical analyses to proof their soundness and experimental results to illustrate their efficiency. Improving Aggregate In this paper, we introduce and Recommendation Diversity explore a number of item ranking Using Ranking-Based Techniques that can generate Techniques recommendations that have substantially higher aggregate diversity across all users while maintaining comparable levels of recommendation accuracy. Comprehensive empirical evaluation consistently shows the diversity gains of the proposed techniques using several real-world rating datasets and different rating prediction algorithms.. 2011

21.

ITJDM03

2011

22.

ITJDM04

2011

IEEE TRANSACTIONS 2012-2011-2010 23. ITJDM05 Intertemporal Discount Factors as a Measure of Trustworthiness in Electronic Commerce In this paper we propose a general list of desiderata for trust systems and discuss how discount factors as trustworthiness meet these dsiderata. We discuss how discount factors are a robust measure when entering commitments that exhibit moral hazards. Using an online market as a motivating example, we derive some analytical methods both for ensuring discount factors and for aggregating the measurements. Scalable Learning of In this paper, we aim to learn to Collective Behavior predict collective behavior in social media. In particular, given information about some individuals, how can we infer the behavior of unobserved individuals in the same network? A social-dimension-based approach has been shown effective in addressing the heterogeneity of connections presented in social media. Query Planning for Continuous In this paper we provide a technique Aggregation Queries over a for getting the optimal set of subNetwork of Data Aggregators queries with their incoherency bounds which satisfies client querys coherency requirement with least number of refresh messages sent from aggregators to the client. For estimating the number of refresh messages, we build a query cost model which can be used to estimate the number of messages required to satisfy the client specified incoherency bound. Ontology for Developing Web Sites for Natural Disaster Management: Methodology and Implementation In this paper, we focus on enveloping an ontology structure of elements for Web-based disaster management systems. Web elements are identified, following a grounded-theory approach, from an inventory of 6032 Web pages drawn from 100 disaster management Web sites. 2011

24.

ITJDM06

2011

25.

ITJDM07

2011

26.

ITJDM08

2011

IEEE TRANSACTIONS 2012-2011-2010 27. ITJDM09 Multimodal Fusion for Video In this project, we present a flexible Search Re ranking and effective re ranking method, called CR-Re ranking, to improve the retrieval effectiveness. To offer high accuracy on the top-ranked results, CR-Re ranking employs a cross-reference (CR) strategy to fuse multimodal cues. Specifically, multimodal features are first utilized separately to re rank the initial returned results at the cluster level, and then all the ranked clusters from different modalities are cooperatively used to infer the shots with high relevance. Deriving Concept-Based User In this project we focus on search Profiles from Search Engine engine personalization and develop Logs several concept-based user profiling methods that are based on both positive and negative preferences. We evaluate the proposed methods against our previously proposed personalized query clustering method. Experimental results show that profiles which capture and utilize both of the users positive and negative preferences perform the best. Prospective Infectious Disease In this project We considered the Outbreak Detection Using problem of identifying outbreak Markov Switching Models patterns in a syndrome count time series using Markov switching models. The disease outbreak states are modeled as hidden state variables which control the observed time series. A jump component is introduced to absorb sporadic extreme values that may otherwise weaken the ability to detect slowmoving disease outbreaks. Effectively Indexing Uncertain Space the In this project we introduce a novel R-Tree based inverted index structure, named UI-Tree, to efficiently support various queries including range queries, similarity 2010

28.

ITJDM10

2010

29.

ITJDM11

2010

30.

ITJDM12

2010

IEEE TRANSACTIONS 2012-2011-2010 joins and their size estimation, as well as top-k range query, over multidimensional uncertain objects against continuous or discrete cases. 31. ITJDM13 Managing Multidimensional In this project a P2P-based Historical Aggregate Data in framework supporting the extraction Unstructured P2P Networks of aggregates from historical multidimensional data is proposed, which provides efficient and robust query evaluation. Clustering Uncertain Data In this project we propose pruning using Voronoi Diagrams and techniques that are based on R-Tree Index Voronoi diagrams to reduce the number of expected distance calculation. Then introduce an Rtree index to organize the uncertain objects so as to reduce pruning overheads. 2010

32.

ITJDM14

2010

IEEE TRANSACTIONS 2012-2011-2010

TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS ON NETWORK SECURITY S.NO 33. PROJECT CODE ITJNS01 PROJECT TITLES DESCRIPTION YEAR 2011

Dynamics of Malware Spread This model evaluates the effect of in Decentralized Peer-to-Peer control strategies like node Networks quarantine on stifling the spread of malware. he model is then extended to consider the impact of P2P networks on the malware spread in networks of smart cell phones. Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables In this paper we characterize treebased routing DHTs and define MAXDISJOINT, a replica placement that creates route diversity for these DHTs. We prove that this placement creates disjoint routes and find the replication degree necessary to produce a desired number of disjoint routes.

34.

ITJNS02

2011

35.

ITJNS03

Securing Topology We propose a meta protocol (MetaMaintenance Protocols for TMP) to represent the class of Sensor Networks topology maintenance protocols. The Meta-TMP provides us with a better understanding of the characteristics and of how a specific TMP works, and it can be used to study the vulnerabilities of a specific TMP. A Hybrid Algorithm of Backward Hashing and Automaton Tracking for Virus Scanning We propose a hybrid approach that partitions the signatures into long and short ones in the open-source Clam AV for virus scanning. An algorithm enhanced from the WuManber algorithm, namely the Backward Hashing algorithm.

2011

36.

ITJNS04

2011

IEEE TRANSACTIONS 2012-2011-2010

37.

ITJNS05

38.

ITJNS06

Towards Situational In this paper we design schemes to Awareness of Large-Scale extrapolate the global properties of Botnet Probing Events scanning events (e.g., total opulation and target scope) as inferred from the limited local view of a honey net Cross-validating with data from DShield shows that our inferences exhibit promising accuracy. Catching Packet Droppers and Many schemes have been proposed Modifiers in Wireless Sensor to mitigate or tolerate such attacks Networks but very few can effectively and efficiently identify the intruders. To address this problem, we propose a simple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets Modeling and Detection of In this project we investigate a new Camouflaging Worm class of active worms, referred to as Camouflaging Worm (C-Worm in short). The C-Worm is different from traditional worms because of its ability to intelligently manipulate its scan traffic volume over time. A Puzzle-Based Strategy Against Attacks Game Theory Defense This project utilizes game theory to Flooding propose a series of optimal puzzleUsing based strategies for handling increasingly sophisticated flooding attack scenarios. In this project, we present the design of an advanced hybrid peer-to-peer botnet. Compared with current botnets, the proposed botnet is harder to be shut down, monitored, and hijacked. It provides robust network connectivity, individualized encryption and control traffic dispersion, limited botnet exposure by each bot, and easy monitoring and recovery by its botmaster.

2011

2011

39.

ITJNS07

2011

40.

ITJNS08

2010

41.

ITJNS09

An Advanced Hybrid Peerto-Peer Botnet

2010

42.

ITJNS10

Cross-Domain Data Sharing in In this project we propose a secure Distributed Electronic Health EHR system, based on Record System cryptographic constructions, to

2010

IEEE TRANSACTIONS 2012-2011-2010 enable secure sharing of sensitive patient data during cooperation and preserve patient data privacy. Our EHR system further incorporates advanced mechanisms for finegrained access control, and ondemand revocation, as enhancements to the basic access control offered by the delegation mechanism, and the basic revocation mechanism.

TECHNOLOGY: JAVA

IEEE TRANSACTIONS 2012-2011-2010 DOMAIN: IEEE TRANSACTIONS ON CLOUD COMPUTING

S.NO 43.

PROJECT CODE ITJCC01

PROJECT TITLES Multi cloud Deployment of Computing Clusters for Loosely Coupled MTC Applications

DESCRIPTION We prove the viability of this kind of solutions by evaluating the scalability, performance, and cost of different configurations of a Sun Grid Engine cluster, deployed on a multi cloud infrastructure spanning a local data center and three different cloud sites: Amazon EC2 Europe, Amazon EC2 US, and Elastic Hosts. In this paper, we discuss the opportunities and challenges for efficient parallel data processing in clouds and present our research project Nephele. Nephele is the first data processing framework to explicitly exploit the dynamic resource allocation offered by todays IaaS clouds for both, task scheduling and execution.

YEAR 2011

44.

ITJCC02

Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud

2011

45.

ITJCC03

Collaborative Writing In this paper describe the architecture Support Tools on the Cloud for a new collaborative writing support environment used to embed such collaborative learning activities in engineering courses. iWrite provides tools for managing collaborative and individual writing assignments in largecohorts. It outsources the writing tools and the storage of student content to third party cloud-computing vendors (i.e., Google). We further describe how using machine learning and NLP techniques, Towards Secure and The proposed design allows users to Dependable Storage Services audit the cloud storage with very in Cloud Computing lightweight communication and computation cost. The auditing result not only ensures strong cloud storage

2011

46.

ITJCC04

2011

IEEE TRANSACTIONS 2012-2011-2010 correctness guarantee, but also simultaneously achieves fast data error localization, i.e., the identification of misbehaving server. 47. ITJCC05 A Privacy-Preserving Remote Data Integrity Checking Protocol with Data Dynamics and Public Veriability In this paper, we adapt Sebe et al.s protocol to support public verifiability. The proposed protocol supports public verifiability without help of a third party auditor. In addition, the proposed protocol does not leak any private information to third party verifiers. Through a formalanalysis, we show the correctness and security of the protocol. 2011

48.

ITJCC06

Independently Decentralized Delegation

Verifiable In this project we present an Role-Based independently verifiable delegation mechanism, where a delegation credential can be verified without the participation of domain administrators. Our protocol, called role-based cascaded delegation (RBCD), supports simple and efficient cross-domain delegation of authority. RBCD enables a role member to create delegations based on the dynamic needs of collaboration; in the meantime, a delegation chain can be verified by anyone without the participation of role administrators.

2010

TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS ON SOFTWARE ENGINEERING S.NO 49. PROJECT CODE ITJSW01 PROJECT TITLES Evaluation and Measurement of Software Process Improvement - A Systematic Literature Review DESCRIPTION This paper aims to identify and characterize evaluation strategies and measurements used to assess the impact of different SPI initiatives. YEAR 2011

IEEE TRANSACTIONS 2012-2011-2010 METHODThe systematic literature review includes 148 papers published between 1991 and 2008. The selected papers were classified according to SPI initiative, applied evaluation strategies and measurement perspectives. 50. ITJSW02 Facilitating Trust in Privacy- In this paper we present a privacypreserving E-learning preserving reputation management Environments system which allows secure transfer of reputation. A prototypical implementation of our reputation transfer protocol and the successful experimental deployment of our reputation management solution in an e-learning discussion forum serve as a proof of concept. Measuring the Effects of Virtual Pair Programming in an Introductory Programming Java Course This study investigated the effectiveness of virtual pair programming (VPP) on student performance and satisfaction in an introductory Java course. Students used online tools that integrated desktop sharing and real-time communication, and the metrics examined showed that VPP is an acceptable alternative to individual programming experience. An Experience in Testing the This project proposes major security Security of Real-World vulnerabilities that could compromise Electronic Voting Systems the confidentiality, integrity, and availability of the voting process. These vulnerabilities allowed us to develop virus-like malware that can spread from one component of the system to another, eventually taking control of all aspects of vote casting and tallying. Assessing Software Service This project describes a framework Quality and Trustworthiness for reputation-aware software service at Selection Time selection and rating. A selection algorithm is devised for service recommendation, providing SaaS consumers with the best possible choices based on quality, cost, and 2011

51.

ITJSW03

2011

52.

ITJSW04

2010

53.

ITJSW05

2010

IEEE TRANSACTIONS 2012-2011-2010 trust. An automated rating model, based on the expectancydisconfirmation theory from market science, is also defined to overcome feedback subjectivity issues. 54. ITJSW06 Empirical Studies of Pair This project is to present the current Programming for CS/SE evidence relative to the effectiveness Teaching in Higher Education of pair programming (PP) as a pedagogical tool in higher education CS/SE courses. METHOD We performed a systematic literature review (SLR) of empirical studies that investigated factors affecting the effectiveness of PP for CS/SE students and studies that measured the effectiveness of PP for CS/SE students. 2010

TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS ON IMAGE PROCESSING S.NO 55. PROJECT CODE ITJIM01 PROJECT TITLES HAIRIS: A Method for Automatic Image Registration Through Histogram-Based Image Segmentation DESCRIPTION In this paper, a method for automatic image registration through histogrambased image segmentation (HAIRIS) is proposed, which allows for a more detailed histogram based segmentation rather than the traditional methods, and consequently to an accurate image registration. This paper studies two classes of regularization strategies to achieve an improved tradeoff between image recovery and noise suppression in projection-based image deblurring. YEAR 2011

56.

ITJIM02

Fine-Granularity Spatially Regularization Projection-Based Deblurring

and Adaptive for Image

2011

IEEE TRANSACTIONS 2012-2011-2010 57. ITJIM03 On the Selection of Optimal Feature Region Set for Robust Digital Image Watermarking A novel feature region selection method for robust digital image watermarking is proposed in this paper. This method aims to select a non overlapping feature region set, which has the greatest robustness against various attacks and can preserve image quality as much as possible after watermarked. 2011

58.

ITJIM04

Improving Shape Retrieval In this project we propose two by Spectral Matching and computational approaches for Meta Similarity improving the retrieval of planar shapes. First, we suggest a geometrically motivated quadratic similarity measure We also introduce a shape meta-similarity measure that agglomerates pair wise shape similarities and improves the retrieval accuracy.

2010

59.

ITJIM05

An Affine Symmetric Image In this project, an affine symmetric Model and Its Applications image model is considered. It provides a flexible scheme to exploit geometric redundancy. A patch of texture from an image is rotated, scaled and sheared to approximate other similar parts in the image. A Two-Channel Overlapped In this project, a new two-channel Block Transform for Image overlapped block transform is Compression introduced by pre filtering the Haar transform. The pre filtering employs plane rotations with one single rotation angle to achieve high Computational efficiency. The resulting transform is equivalent to a periodically time-varying (PTV) filter Bank.

2010

60.

ITJIM06

2010

IEEE TRANSACTIONS 2012-2011-2010

TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS MOBILE COMPUTING S.NO 61. PROJECT CODE ITJMC01 PROJECT TITLES Towards Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks DESCRIPTION In this paper we propose an efficient Position based Opportunistic Routing protocol (POR) which takes advantage of the stateless property of geographic routing and the broadcast nature of wireless medium. When a data packet is sent out, some of the neighbor nodes that have overheard the transmission will serve as forwarding candidates, and take turn to forward the packet if it is not relayed by the specific best forwarder within a certain period of time. In this paper we deal with a mobile and distributed computing setting with the following Characteristics A network of mobile nodes (satellites) and stationary nodes (hubs). All nodes YEAR 2011

62.

ITJMC02

Information Dissemination between Mobile Nodes for Collaborative Context Awareness

2011

IEEE TRANSACTIONS 2012-2011-2010 receive and relay contextual information (context) to other nodes. Satellites attach to hubs stochastically. 63. ITJMC03 Supporting Efficient and In this paper we propose an efficient Scalable Multicasting over geographic multicast protocol, EGMP, Mobile Ad Hoc Networks which can scale to a large group size and large network size. The protocol is designed to be comprehensive and self-contained, yet simple and efficient for more reliable operation. Efficient Data Collection in Wireless Sensor Networks with Path-Constrained Mobile Sinks In this paper we propose a novel data collection scheme, called the Maximum Amount Shortest Path (MASP) that increases network throughput as well as conserves energy by optimizing the assignment of sensor nodes. MASP is formulated as an integer linear programming problem and then solved with the help of a genetic algorithm. A two-phase communication protocol based on zone partition is designed to implement the MASP scheme. 2011

64.

ITJMC04

2011

65.

ITJMC05

Energy-Efficient In this project, we propose ReMo, an Reprogramming of a Swarm energy-efficient, multihop of Mobile Sensors reprogramming protocol for mobile sensor networks. Without making any assumptions on the location of nodes, ReMo uses the LQI and RSSI measurements of received packets to estimate link qualities and relative distances with neighbors in order to select the best node for code exchange. Schedule Adaptation of Low-Power-Listening Protocols for Wireless Sensor Networks In this project we propose networkaware adaptation of the specific succession of repeated packets over the ti interval (the MAC schedule), which yields significant energy savings.

2010

66.

ITJMC06

2010

67.

ITJMC07

Optimize Storage Placement In this project the objective is to in Sensor Networks address the storage node placement problem aiming to minimize the total

IEEE TRANSACTIONS 2012-2011-2010 energy cost for gathering data to the storage nodes and replying queries. 68. ITJMC08 Efficient Load-Aware This project proposes a load-aware Routing Scheme for Wireless routing scheme for wireless mesh Mesh Networks networks (WMNs). In a WMN, the traffic load tends to be unevenly distributed over the network. In this situation, the load-aware routing scheme can balance the load, and consequently enhance the overall network capacity. 2010

TECHNOLOGY: JAVA DOMAIN: IEEE TRANSACTIONS ON GRID COMPUTING S.NO 69. PROJECT CODE ITJGC01 PROJECT TITLES DESCRIPTION YEAR 2011

Reputation-Based Trust for a In this paper explores integrating a Cooperative Agent-Based reputation-based trust mechanism with Backup Protection Scheme an agent-based backup protection system to help protect against malicious or byzantine failures. A distributed cooperative trust system has the potential to add an additional layer of protection designed to operate with greater autonomy. Privilege Management Infrastructure for Virtual Organizations in Healthcare Grids In this paper is focused on the management of virtual organizations (VO) inside healthcare environments where grid technology is used as middleware for a healthcare servicesoriented architecture (HSOA). Some of the main tasks considered for the provision of an efficient VO management are management of users, assignation of roles to users, assignation of privileges to roles, and definition of resources access policies.

70.

ITJGC02

2011

IEEE TRANSACTIONS 2012-2011-2010 71. ITJGC03 Collective Receiver-initiated In this paper we present Robber, a Multicast for Grid collective, receiver-initiated, highApplications throughput multicast approach inspired by the BitTorrent protocol. Unlike BitTorrent, Robber is specifically designed to maximize the throughput between multiple cluster computers. Nodes in the same cluster work together as a collective that tries to steal data from peer clusters. 2011

72.

ITJGC04

Expanding Service Capacities and Increasing Service Reliabilities for the Grid-Based Utility Computing

In this project, the considered problem is decomposed into master and slave sub problems, with theoretical justification, and a computationally efficient two-level iterative method that is used in solving it is proposed. The computational efficiency of the proposed method greatly exceeds a genetic algorithm with an exact model.

2011

73.

ITJGC05

Demand Scheduling SCUC

by

Response This project presents a stochastic Stochastic model to schedule reserves provided by DR in the wholesale electricity markets. Demand-side reserve is supplied by demand response providers (DRPs), which have the responsibility of aggregating and managing customer responses.

2010

IEEE TRANSACTIONS 2012-2011-2010

J2EE
TECHNOLOGY: J2EE DOMAIN: IEEE TRANSACTIONS S.NO 1 PROJECT PROJECT TITLES DESCRIPTION YEAR CODE ITJ2EE01 Identifying the Productive and In this paper investigates the issue of 2011 Influential Bloggers in a identifying bloggers who are both Community productive and influential by introducing the bloggers productivity index and bloggers influence index. The proposed metrics are evaluated against the state-of-the-art influential blogger identification methods by employing data collected from a realworld community blog site ITJ2EE02 A Web Search Engine-Based Approach to Measure Semantic Similarity between Words In this paper we proposed method outperforms various baselines and previously proposed web-based semantic similarity measures on three benchmark data sets showing a high correlation with human ratings. Moreover, the proposed method significantly improves the accuracy in a community mining task. 2011

ITJ2EE03

Interaction of Individual and In this paper we study integrates Social Antecedents of individual factors from the symbolic Learning Effectiveness: A cognition perspective with social

2011

IEEE TRANSACTIONS 2012-2011-2010 Study in the IT Research factors from the situated cognition Context view in a model to explain learning effectiveness. The model was tested through a survey of individual learners working on information technologyrelated research projects.

ITJ2EE04

iHelp: An Intelligent Online In this paper we develop iHelp, an Helpdesk System intelligent online helpdesk system, to automatically find problemsolution patterns from the past customer representative interactions. When a new customer request arrives, iHelp searches and ranks the past cases based on their semantic relevance to the request. Research and Implementation In the paper we describes the of the Credit Rating System construction of bank customers in the for Bank Customers background of credit rating system which is discussed in detail the application of Client/Web server/Application server/Database server system to achieve the main function and technical means. Research on B2B E-Business This project applies the model to B2B System of Bookshop Based on E-Business System of Bookshop, Web Service which includes the management subsystem of order, book information, bookshop information, bill information, and customer relations. Blog Miner: Web Blog We introduce an architecture, Mining Application for implementation, and evaluation of a Classification of Movie Web blog mining application, called Reviews the Blog Miner, which extracts and classifies peoples opinions and emotions (or sentiment) from the contents of weblogs about movie reviews. Ontology Concepts for This project develops ontology Requirements Engineering (mainly concepts) in the domain of Process in E-Government requirements engineering process for Applications E-gov applications. This contributes in enabling software engineers to find out shared-understandable and common concepts to describe

2011

ITJ2EE05

2011

ITJ2EE06

2010

ITJ2EE07

2010

ITJ2EE08

2010

IEEE TRANSACTIONS 2012-2011-2010 requirements for different domain models used in developing E-gov applications.

DOTNET
TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON NETWORKING S.NO 1. PROJECT PROJECT TITLES DESCRIPTION YEAR CODE ITDNW01 Toward Efficient and This paper proposes Load balancing is 2011 Simplified Distributed Data a computer networking methodology Intensive Computing to distribute workload across multiple computers or a computer cluster, network links, central processing units, disk drives, or other resources, to achieve optimal resource utilization, maximize throughput, minimize response time, and avoid overload. ITDNW02 Measuring Client-Perceived Page view Response Time of Internet Services This paper proposes, MAC algorithm, sometimes called a keyed (cryptographic) hash function, accepts as input a secret key and an arbitrarylength message to be authenticated, and outputs a MAC (sometimes known as a tag). The MAC value protects both a message's data integrity as well as its authenticity, by allowing verifiers (who also possess the secret key) to detect any changes to the message content. 2011

2.

3.

ITDNW03

A Distributed Algorithm for We propose a distributed the Replica Placement approximation algorithm, called DGR Problem (Distributed Greedy Replication), that solves the replica placement problem.

2011

IEEE TRANSACTIONS 2012-2011-2010

4.

ITDNW04

Quasi-Kautz Digraphs Peer-to-Peer Networks

for In this project, MOORE is the first efficient structured P2P network based on the quasi-Kautz digraph and is Ologd n in diameter with a constant node out-degree. It constructs an overlay digraph for all network sizes and any constant degree, and achieves optimal diameter, high performance, good connectivity, and low congestion (low traffic).

2011

5.

ITDNW05

The Small World of File This paper proposes peer-to-peer fileSharing sharing networks. Such networks are Organically resilient to random node failures, while they are highly exposed to informed attacks that target the well connected nodes. Generalized probabilistic The paper proposes a search algorithm flooding in unstructured peer- that exploits k random walkers for to-peer networks resource discovery. The bandwidth diversity problem in BitTorrent-like file-sharing applications. Trace back of DDoS Attacks Distributed Denial-of-Service (DDoS) Using Entropy Variations attacks in the Internet. In DDoS attacks, attackers generate a huge amount of requests to victims through compromised computers (zombies), with the aim of denying normal service or degrading of the quality of services. Approximation algorithms for This paper proposes manufacturing, the Multi-Organization the time difference between the start Scheduling Problem and finish of a sequence of jobs or tasks. Compressing Network Access Access control list (ACL)-When a Control Lists subject requests an operation on an object in an ACL-based security model the operating system first checks the ACL for an applicable entry to decide whether the requested operation is authorized.

2011

6.

ITDNW06

2011

7.

ITDNW07

2011

8.

ITDNW08

2011

9.

ITDNW09

2011

IEEE TRANSACTIONS 2012-2011-2010 10. ITDNW10 Active Queue Management This paper proposes, Two major goals for Flow Fairness and stable of queue management are flow Queue Length fairness and queue-length stability. High-bandwidth flows are identified via a multi-level caching technique On the Cost of Network This paper proposes to predict the Inference Mechanisms network traffic injected by inference mechanisms, and use this knowledge to replace direct measurement traffic by Inference when the cost of direct measurement exceeds that of inference. A Framework for Routing Performance Analysis in Delay Tolerant Networks with Application to Non Cooperative Networks In this paper, Routing in delaytolerant networking concerns itself with the ability to transport, or route, data from a source to a destination is a fundamental ability all communication networks must have. Delay- and disruption-tolerant networks (DTNs), are characterized by their lack of connectivity, resulting in a lack of instantaneous end-to-end paths. 2011

11.

ITDNW11

2011

12.

ITDNW12

2011

13.

ITDNW13

Compression of View on In this paper proposed, We call this Anonymous Networks Folded compressed form of a view a folded View view. This approach gives securable transaction among a network. Active Monitoring and Alarm Management for Fault Localization in Transparent All-Optical Networks It focuses the error locations (Localization) which is occurring on the Optical Networks and when we monitoring the fault localization, we arrange the alarm to make active the users. This project analyzes an evaluation of the convergence speed and the synchronization error to improve performance and very good selforganizing properties.

2011

14.

ITDNW14

2010

15.

ITDNW15

Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems

2010

IEEE TRANSACTIONS 2012-2011-2010 16. ITDNW16 SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks This paper proposes SocioNet, based on the relationship form social network and share contents by preference. Sharing takes place in 3 ways such as regular, small world, random. 2010

17.

ITDNW17

On the Benefits of This paper proposes a data storage Cooperative Proxy Caching technic in temporary manner during for Peer-to-Peer Traffic the traffic between peers to make them to access and replace the datas easily without collision. Correlation-Based Traffic This paper proposes attacks that Analysis Attacks on exploit the timing behavior and Anonymity Networks applications in low-latency Anonymity networks. Multiuser Diversity Gain in This paper proposes, An large Cognitive Networks cognitive networks granted concurrent spectrum access with license-holding users and Dynamic allocation of resources to the best link in multiuser networks

2010

18.

ITDNW18

2010

19.

ITDNW19

2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON DATA MINING

IEEE TRANSACTIONS 2012-2011-2010 S.NO PROJECT PROJECT TITLES DESCRIPTION YEAR CODE 20. ITDDM01 Automatic Discovery of In this project, We propose a novel, 2011 Personal Name Aliases from automatically extracted lexical the Web pattern-based approach to efficiently extract a large set of candidate aliases from snippets retrieved from a web search engine. 21. ITDDM02 A Query Formulation This paper proposes Retrieve all the Language for the Data Web titles, authors, and abstracts of the articles presented at the 4th European Semantic Web Conference that have a title that contains the word Semantic. A more difficult query, to show the querying efficiency of the two methods. Scalable Scheduling of This paper proposes On-Line stock Updates in Streaming Data trading, where recent transactions Warehouses generated by multiple stock exchange are compared against historical trend in nearly real time to identify profit opportunities. Traditional data warehouses are typically refreshed during downtimes, streaming warehouses are updated as new data arrive. Efficient Keyword-Based This project using Most of them focus Search for Top-K Cells in on ranking individual tuples from one Text Cube table or joins of multiple tables containing a set of keywords. We define a keyword-based query language and an IR-style relevance model for scoring/ranking cells in the text cube. SPARK2: Top-k Keyword We propose a new ranking formula by Query in Relational Databases adapting existing IR techniques based on a natural notion of virtual document. We also propose several efficient query processing methods for the new ranking method in terms of retrieval effectiveness and efficiency. Data mining for XML query- This project proposes mine all answering support frequent association rules without 2011

22.

ITDDM03

2011

23.

ITDDM04

2011

24.

ITDDM05

2011

25.

ITDDM06

2011

IEEE TRANSACTIONS 2012-2011-2010 imposing any a-priori restriction on the structure and the content of the rules. Store mined information in XML format. Extracted knowledge to gain information about the original datasets. 26. ITDDM07 Ranking Spatial Data Quality Preferences by This paper proposes real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood. 2011

27.

ITDDM08

Authenticated Multi-Step In this project, we are using NN Nearest Neighbor Search concept to provide similarity search results with trustiness to proof the result correctness. A client gives NN queries to a server that maintains a database signed by a trusted authority. On Computing Farthest This project using the concept of Data Dominated Locations mining such as NN and closest Pair. Based on the clients query, the database will be giving the nearest datasets and by the using Closest-Pair concept, we can point the object (data) location and neglect spatial location.

2011

28.

ITDDM09

2011

29.

ITDDM10

Towards an Effective XML This paper proposes specific Keyword Search guidelines that a search engine should meet in both search intention identification and Relevance oriented ranking for search results. -Presence without Complete This project are increasing both the World Knowledge need for anonymized data and the risks of poor anonymization and we presented a new privacy metric, presence, that clearly links the quality of anonymization to the risk posed by poor anonymization.

2010

30.

ITDDM11

2010

IEEE TRANSACTIONS 2012-2011-2010 31. ITDDM12 Asking Generalized Queries This paper proposes novel active to Domain Experts to Improve learning algorithm that asks good Learning generalized queries. then, extend our algorithm to construct New, hierarchical features for both nominal and numeric attributes. 2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON NETWORK SECURITY S.NO 32. PROJECT PROJECT TITLES DESCRIPTION YEAR CODE ITDNS01 Improving Security and The proposed scheme features the 2011 Efficiency in Attribute-Based following achievements: (1) the key Data Sharing escrow problem could be solved by escrow-free key issuing protocol, which is constructed using the secure two-party computation between the

IEEE TRANSACTIONS 2012-2011-2010 key generation center and the data storing center, (2) fine-grained user revocation per each attribute could be done by proxy encryption which takes advantage of the selective attribute group key distribution on top of the ABE. The performance and security analyses indicate that the proposed scheme is efficient to securely manage the data distributed in the data sharing system. 33. ITDNS02 Coding for Cryptographic The system setup is the wiretap Security Enhancement using channel model where transmitted data Stopping Sets traverse through independent packet erasure channels (PECs) with public feedback for authenticated automatic repeat-request (ARQ). The code design relies on puncturing nonsystematic low-density paritycheck (LDPC) codes with the intent of inflicting an eavesdropper with stopping sets in the decoder. A New Chaos-Based In the proposed block Cryptosystem for Secure encryption/decryption algorithm, a 2D Transmitted Images chaotic map is used to shuffle the image pixel positions. Then, substitution (confusion) and permutation (diffusion) operations on every block, with multiple rounds, are combined using two perturbed chaotic PWLCM maps. CASTLE: Continuously This projects proposes, Continuously Anonymizing Data Streams Anonymizing STreaming data via adaptive cLustEring (CASTLE),a cluster-based scheme that anonymizes data streams on-the-fly and, at the same time, ensures the freshness of the anonym zed data by satisfying specified delay constraints. Nymble: Blocking This projects to store IP address, Misbehaving Users in secure (encryption).whenever the Anonym zing Networks receive means decrypted the file intermediate some message keyword using (reliability of file). file file and or 2011

34.

ITDNS03

2011

35.

ITDNS04

2011

36.

ITDNS05

2011

IEEE TRANSACTIONS 2012-2011-2010 37. ITDNS06 Reliability for Storage Nodes Networked This paper proposes, an alternatives for distributing components and paths redundancy and models to determine the reliability of Distributed systems 2011

38.

ITDNS07

39.

ITDNS08

40.

ITDNS09

Shifting Inference Control to This project solve the issue of User Side: Architecture and database security to the inference Protocol problem by using ICM and ACM, which are used for control the information of database by security protocols. Using Web-Referral In this paper, we systematically design Architectures to Mitigate a security-driven scheduling Denial-of-Service Threats architecture that can dynamically measure the trust level of each node in the system by using differential equations In-Depth Packet Inspection This paper proposes a novel Enhanced Using a Hierarchical Pattern Hierarchical Multi pattern Matching Matching Algorithm Algorithm (EHMA) for packet inspection. Based on the occurrence frequency of grams, a small set of the most frequent grams is discovered and used in the EHMA

2010

2010

2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON CLOUD COMPUTING

S.NO 41.

PROJECT PROJECT TITLES CODE ITDCC01 Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing

DESCRIPTION This project proposes we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. 1. Data storage. 2. Public auditability. 3.data dynamics

YEAR 2011

42.

ITDCC02

Optimal service pricing for a This paper proposes a novel pricecloud cache demand model designed for a cloud

2011

IEEE TRANSACTIONS 2012-2011-2010 cache and a dynamic pricing scheme. The pricing solution employs a novel method that estimates the correlations of the cache services in an time-efficient manner for queries executed in the cloud cache. 43. ITDCC03 Optimization of Resource This project proposes cloud Provisioning Cost in Cloud computing environment consists of Computing four main components, namely cloud consumer, virtual machine (VM) repository, cloud providers, and cloud broker. The broker implements OCRP (optimal cloud resource provisioning) algorithm to make an optimal decision of resource provisioning. EduCloud: PaaS versus IaaS This study demonstrates that Cloud Usage for an Advanced platform clouds are valued by both Computer Science Course students and professors to achieve the course objectives and that clouds offer a significant improvement over the previous situation in labs where much effort was devoted to setting up the software necessary for course activities. A Data Throughput Prediction and Optimization Service for Widely Distributed Many-Task Computing In this paper, we present the design and implementation of an application-layer data throughput prediction and optimization service for many-task computing in widely distributed environments. This service uses multiple parallel TCP streams to improve the end-to-end throughput of data transfers. 2011

44.

ITDCC04

2011

45.

ITDCC05

2011

IEEE TRANSACTIONS 2012-2011-2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON SOFTWARE ENGINEERING S.NO 46. PROJECT PROJECT TITLES CODE ITDSW01 Comparing the Defect Reduction Benefits of Code Inspection and Test-Driven Development DESCRIPTION In this context, we compared the software defect rates and implementation costs associated with two methods of software defect reduction: code inspection and testdriven development. YEAR 2011

47.

ITDSW02

Exploiting the Essential This paper Proposes Estimation by Assumptions of Analogy- analogy can be significantly improved based Effort Estimation by a dynamic selection of nearest neighbors, using only the project data from regions with small variance. Software Module Clustering This Project proposes the multias a Multi-Objective Search objective paradigm for automated Problem software module clustering is introduced. Two formulations of the

2011

48.

ITDSW03

2011

IEEE TRANSACTIONS 2012-2011-2010 multiple objective approaches are studied: the Equal-size Cluster Approach (ECA) and the Maximizing Cluster Approach (MCA). 49. ITDSW04 Learning a Metric for Code In this project, we use the automated Readability code readability concept to check the manual readability effort of the people for testing the coding 2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON IMAGE PROCESSING S.NO PROJECT PROJECT TITLES DESCRIPTION CODE 50. ITDIP01 Real time artifact-free image This project proposes the solution up scaling to the problem, often referred to also as single image Super resolution, is related both to the statistical relationship between low resolution and high resolution image sampling and to the human perception of image quality. 51. ITDIP02 A Generalized Masking Algorithm Unsharp We propose a generalized unsharp masking algorithm using the exploratory data model as a unified framework The proposed algorithm is designed to address three issues 1. Simultaneously enhancing contrast and sharpness by means of YEAR 2011

2011

IEEE TRANSACTIONS 2012-2011-2010 individual treatment of the model component and the residual, 2. Reducing the halo effect by means of an edge-preserving filter 3. Solving the out-of-range problem by means of log-ratio and tangent operations. 52. ITDIP03 Fuzzy Random Impulse Noise In this paper, a new fuzzy filter for Removal From Color Image the removal of random impulse Sequences noise in color the noise is filtered step by step. In each step, noisy pixels are detected by the help of fuzzy rules, which are very useful for the processing of human knowledge where linguistic variables are used Pixels that are detected as noisy are filtered. The peak-signal-to-noise ratio (PSNR) and the normalized color difference (NCD). Sparse Bayesian Learning of This Paper proposes a framework Filters for Efficient Image for expanding a given image using Expansion an interpolator that is trained in advance with training data, based on sparse Bayesian estimation In-Image Indication Accessibility This paper proposes an in-image accessibility indication scheme, which aims to automatically point out regions in which the content can hardly be recognized by colorblind viewers in a manually designed image. The proposed method first establishes a set of points around which the patches are not prominent enough for colorblind viewers due to the loss of color information. 2011

53.

ITDIP04

2010

54.

ITDIP05

2010

55.

ITDIP06

Adaptive Kernel-Based Image The proposed methodology has the De noising Employing Semi- advantage that it is able to remove Parametric Regularization any kind of additive noise (impulse, Gaussian, uniform, etc.) using Adaptive Kernel-Based Image De noising techniques.

2010

IEEE TRANSACTIONS 2012-2011-2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS MOBILE COMPUTING S.NO 56. PROJECT PROJECT TITLES DESCRIPTION CODE ITDMC01 Network Connectivity with a In this paper we have to check Family of Group Mobility range of the mobile. Range means Models the Connectivity of the mobile should be bi-directional called the critical transmission range (CTR). Each mobile should communicate without interferences. ITDMC02 Energy-Efficient Strategies for This paper proposes MAC Cooperative Multi-Channel protocols, nodes make independent MAC Protocols decisions on when to transmit a packet and when to back-off from transmission. Nodes cooperate by helping each other select a free channel to use. Towards Reliable Data This paper addresses the problem of Delivery for Highly Dynamic delivering data packets for highly Mobile Ad Hoc Networks dynamic mobile ad hoc networks in a reliable and timely manner. We propose an efficient Position based Opportunistic Routing protocol (POR) which takes advantage of the YEAR 2011

57.

2011

58.

ITDMC03

2011

IEEE TRANSACTIONS 2012-2011-2010 stateless property of geographic routing and the broadcast nature of wireless medium. 59. ITDMC04 Load Shedding in Mobile In this project we are computing Systems with Mobi Qual. mobile fresheness and accuracy to communicate with other nodes without any interference between nodes. Achieving the highest possible quality of the CQ (Continous Query) results, in both freshness and accuracy, with currently available resources. Optimal Accounting Policies This Paper Proposes an adaptive for AAA Systems in Mobile optimization mechanism in Telecommunications Networks multiservice AAA systems which limits the potential loss without excessively generating unnecessary usage reports MABS: Multicast This paper proposes the scheme Authentication Based on Batch (MABS-B) eliminates the Signature correlation among packets by using batch signature. This supports the authentication of any number of packets Simultaneously. 2011

60.

ITDMC05

2010

61.

ITDMC06

2010

IEEE TRANSACTIONS 2012-2011-2010

TECHNOLOGY: DOTNET DOMAIN: IEEE TRANSACTIONS ON GRID COMPUTING S.NO 62. PROJECT PROJECT TITLES CODE ITDGC01 Efficiently Acquiring Communication Traces for Large-Scale Parallel Applications DESCRIPTION This paper proposes communication traces are collected during the execution (i.e., the message transfer information). The collected communication trace files record type, size, source and destination etc. for each message. This paper proposes resource allocation and job scheduling are the core functions of grid computing. These functions are based on adequate information of available resources. Timely acquiring resource status information is of great importance in ensuring overall performance of grid computing. This project using our method offers the ability to non-intrusively identify resources that have available CPU cycles; this is critical for lowering queue wait times in large cluster grid networks. Computing CPU Resources in large network and observing the correlation between CPU load and the timely response of network traffic. This Paper proposes an GC YEAR 2011

63.

ITDGC02

Online System for Grid Resource Monitoring and Machine Learning based Prediction

2011

64.

ITDGC03

A Passive Solution to the CPU Resource Discovery Problem in Cluster Grid Networks

2011

65.

ITDGC04

Global

Contribution

2010

IEEE TRANSACTIONS 2012-2011-2010 Approach to Maintain Fairness in P2P Networks approach achieves: 1.Efficiently preventing freeriding, 2.Naturally balancing the upload and download amounts in each peer, 3.Reducing rejections in transactions between cooperative peers