Final Year 2011-2012  ME / M.Tech, BE / B.Tech, M.Sc, MCA  IEEE 2011 12 software  Projects@ IRIS SOLUTIONS .pdf
Upcoming SlideShare
Loading in...5
×

Like this? Share it with your network

Share

Final Year 2011-2012 ME / M.Tech, BE / B.Tech, M.Sc, MCA IEEE 2011 12 software Projects@ IRIS SOLUTIONS .pdf

  • 7,936 views
Uploaded on

IRIS SOLUTIONS A Leading R&D Company ...

IRIS SOLUTIONS A Leading R&D Company
We provide better solutions for the students for their project On-site as well as Off-site High Quality Training at Affordable cost Inventive IEEE 2011 based project Details & keys
FINAL YEAR STUDENT PROJECTS & MINI PROJECTS
REALTIME PROJECT ASSISTANCE

*SAFTWARE PROJECTS:
. JAVA/J2EE/J2ME PROJECTS
. .Net PROJECTS,VB,C#
. IMAGE PROCESSING PROJECTS

FEATURES:
*HIGH QUALITY TRAINING AT AFFORDABLE COST
*INVENTIVE IEEE 2010 BASED PROJECTS DETAILS & KEY
*TO EMERGE AS A INNOVATIVE EXPERTISE IN DIFFERENT FIELDS
*QUALIFIED INDUSTRIAL EXPERT FOR TRAINING FOR THE STUDENTS
*JOB SUPPORT FOR QUALIFIED CANDIDATES
Eligibility:
M.E /M.TECH, MCA, M.Sc(CSE, IT)
B.E/ B.TECH (ECE, EEE, E&I, ICE, CSE, IT)
DIPLOMA (ECE, E&I, EEE, CSE, IT, ROBOTICS)
BCA, B.Sc (CSE, IT)

More in: Education , Technology
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
No Downloads

Views

Total Views
7,936
On Slideshare
7,936
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
108
Comments
0
Likes
1

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. Iris Solutions Titles For ME / M.Tech, BE / B.Tech, M.Sc, MCA TABLE OF CONTENTSABOUT IRIS 2JAVA IEEE TRANSACTIONS ON NETWORKING 3 IEEE TRANSACTIONS ON NETWORK SECURITY 6 IEEE TRANSACTIONS ON DATA MINING 9 IEEE TRANSACTIONS ON MOBILE COMPUTING 11 IEEE TRANSACTIONS ON IMAGE PROCESSING 13 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 14 IEEE TRANSACTIONS ON GRID & CLOUD COMPUTING 15 IEEE TRANSACTIONS ON J2EE 16DOTNET IEEE TRANSACTIONS ON NETWORKING 18 IEEE TRANSACTIONS ON NETWORK SECURITY 21 IEEE TRANSACTIONS ON DATA MINING 23 IEEE TRANSACTIONS ON MOBILE COMPUTING 25 IEEE TRANSACTIONS ON IMAGE PROCESSING 28 IEEE TRANSACTIONS ON GRID & CLOUD COMPUTING 29 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 31 1 Page#165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 2. Iris Solutions About Iris "Iris Solutions - A Boon for Young Technocrats" Global presence of technocrats is no more a dream in this world. We make it possible byensuring all the quality standards within an individual which has to be the identity of a successfultechnocrat. Irrespective of the technologies and the domain in which a particular project gets shaped, wesupport all kind of student needs in terms of monetary values as well as the time factor. Students apartfrom doing a particular project should know how the project is getting shaped. We are aware in makingthis thing to happen. Research and Development plays a vital role in enhancing one‘s self development in terms of upgradation and moving forward. When you are searching for a good channel to inhibit yourself with sucha platform, IRIS comes handy. Apart from providing simulation based training, we also provideindustrial experts in sharing their valuable suggestions and even Industry oriented training at requiredcases. In short we strive hard to fulfill the student requirements in terms of each and every departmentof the developing their skills. 2 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 3. Iris Solutions JAVATECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON NETWORKINGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJNW01 Self-Reconfigurable Wireless In this project, ARS outperforms existing 2011 Mesh Networks failure-recovery schemes in improving channel-efficiency by more than 90% and in the ability of meeting the application bandwidth demands. Multihop wireless mesh networks experience frequent link failures caused by channel interference. 2 ISJNW02 Delay-Optimal Opportunistic In this project, the design of multiuser 2011 Scheduling and Approximations opportunistic packet schedulers for users sharing a time-varying wireless channel from performance and robustness points of view. Markov decision process framework used to compute and characterize mean- delay-optimal scheduling policies. 3 ISJNW03 Adaptive Fault-Tolerant QoS Use of fault tolerance mechanisms through 2011 Control Algorithms for redundancy improves query reliability in the Maximizing System Lifetime of presence of unreliable wireless Query-Based Wireless Sensor communication and sensor faults; it cause Networks the energy of the system to be quickly depleted. 4 ISJNW04 Optimizing Resource Conflicts in The two factors are formulated in a matrix 2011 Workflow Management Systems form and the optimal solution is found by applying concepts of the generalized eigenvalue analysis. A rough outline of an agent-based architecture is proposed to achieve runtime integration of our algorithm into a functional WfMS. 5 ISJNW05 Predictable high performance In this project we present a design and 2011 Computing using Feedback and implementation of a predictable HPC admission control system using feedback control and admission control. By creating a virtualized 3 application layer and opportunistically Page multiplexing is the concurrent application. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 4. Iris Solutions6 ISJNW06 Attribute-Based Access Control A cryptographic approach to enforce a fine- 2011 with Efficient Revocation in Data grained access control on the outsourced Outsourcing Systems data that is dual encryption protocol exploiting the combined features of the cipher text policy attribute-based encryption and group key management algorithm.7 ISJNW07 Load Balance with Imperfect A novel load balancing algorithm that is 2011 Information in Structured Peer-to- unique in that each participating peer is Peer Systems 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.8 ISJNW08 A Distributed Algorithm for A distributed algorithm used for computing 2011 Finding All Best Swap Edges of a all best swap edges for a minimum-diameter Minimum-Diameter Spanning spanning tree. The best possible way of Tree reconnecting the network is to replace the failed link by a single other link called a swap link. A swap that minimizes the diameter of the resulting swap tree.9 ISJNW09 Decomposing Workload Bursts We present a new framework for runtime 2011 for Efficient Storage Resource scheduling of a client‘s workload based on Management decomposition and recombination of the request stream. Finally, we show how the framework can be used to improve estimates of the aggregate resource requirements of multiple concurrent clients.10 ISJNW10 Monitoring The Impact Of P2P We present an classification for broadband 2011 Users On A Broadband users into a P2P and non-P2P group based Operator‘s Network Over time on the amount of communication partners (―peers‖) they in a dedicated timeframe. We derive their impact on network characteristics like the number of active users and their aggregate bandwidth.11 ISJNW11 Metadata Distribution and This paper makes two contributions. First, 2011 Consistency Techniques for we present a dynamic metadata distribution Large-Scale Cluster File Systems policy (DDG) to improve the metadata throughput by using a triple-defined distribution. Second, S2PC-MP reduces the overhead of failure-free execution and ensures quick recovery in the presence of metadata server failures or client failures. 412 ISJNW12 Flexible Robust Group Key A novel 2-round GKA protocol that offers a 2011 Page Agreement natural trade-off between message size and #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 5. Iris Solutions the desired level of fault tolerance. The new protocol is also the disruption attack by the malicious insider.13 ISJNW13 Site-Based Partitioning And The pagerank algorithm is an important 2011 Repartitioning Techniques For component. The pagerank computation Parallel Page Rank Computation which is frequently repeated must be performed in parallel with high-efficiency and low-preprocessing overhead while considering the initial distributed nature of the web matrices.14 ISJNW14 Stabilization of Flood Sequencing In this project we discuss a family of four 2010 Protocols in Sensor Networks flood sequencing protocols that use sequence numbers to distinguish between fresh and redundant flood messages.15 ISJNW15 A Near-Optimal Algorithm In this project, we propose a novel topology 2010 Attacking the Topology Mismatch matching algorithm based on the Problem in Unstructured Peer-to- Metropolis-Hastings method. Our proposal Peer Networks. is guided by our insight analytical model and is close to the optimal design.16 ISJNW16 A Dynamic Performance-Based A protocol, Performance Adaptive UDP 2010 Flow Control Method for High- which aims to dynamically and Speed Data Transfer autonomously maximize performance under different systems. A mathematical model and related algorithms are proposed to describe the theoretical basis behind effective buffer and CPU management.17 ISJNW17 Priority of packet inference with We present an end-to-end approach for PFP 2010 back up path inference and its associated tool, POPI which enables users to discover such network policies through measurements of packet losses of different packet types.18 ISJNW18 On the Benefits of Cooperative Cooperative Cache can improve the system 2010 Proxy Caching for Peer-to-Peer performance in wireless P2P networks. We Traffic propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node. 5 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 6. Iris SolutionsTECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITYSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJNS01 SAT: A Security Architecture In this project, we propose SAT, a security 2011 Achieving Anonymity and architecture mainly consisting resolves the Traceability in Wireless Mesh conflicting security requirements of Networks unconditional anonymity for honest users and traceability of misbehaving users. 2 ISJNS02 Peering Equilibrium Multipath Our scheme relies on a game theory 2011 Routing: A Game Theory modeling, with a non-cooperative potential Framework for Internet Peering game considering both routing and Settlements congestions costs. We compare different PEMP policies to BGP Multipath schemes by emulating a realistic peering scenario. Our results show that the routing cost can be decreased by roughly 10% with PEMP. The stability of routes can be significantly improved and that congestion can be practically avoided on the peering links. 3 ISJNS03 An Obfuscation-Based Approach We address this problem and present a 2011 for Protecting Location Privacy solution based on different obfuscation operators introduce an adversary model and provide an analysis of the proposed obfuscation operators to evaluate their robustness against adversaries aiming to reverse the obfuscation effects to retrieve a location that better approximates the location of the users 4 ISJNS04 Providing Transaction Guarantees Aims to demonstrate that randomization can 2011 in Asynchronous Systems with be a very competitive approach even in No Assumptions on the Accuracy hostile environments where arbitrary faults of Failure Detection can occur. A stack of randomized intrusion- tolerant protocols is described and its performance evaluated under several settings in both local-area-network and wide-area- network environments. The stack provides a set of relevant services ranging from basic. 5 ISJNS05 Modeling and Detection of Our scheme uses the Power Spectral 2011 Camouflaging Worm Density (PSD) distribution of the scan traffic volume and its corresponding 6 Spectral Flatness Measure (SFM) to Page distinguish the C-Worm traffic from #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 7. Iris Solutions background traffic. The performance data clearly demonstrates that our scheme can effectively detect the C-Worm propagation.6 ISJNS06 Analysis of a Botnet Takeover We present the design of an advanced 2011 hybrid peer-to-peer botnet. Compared with current botnets, the proposed botnet is harder to be shut down, monitored, and hijacked. It provides individualized encryption and control traffic dispersion.7 ISJNS07 Efficient Network Modification to As real-time traffic such as video or voice 2011 Improve QoS Stability at Failures increases on the Internet, ISPs are required to provide stable quality as well as connectivity at failures. For ISPs, how to effectively improve the stability of these qualities at failures with the minimum investment cost is an important issue, and they need to effectively select a limited number of locations to add link facilities.8 ISJNS08 Comparative Evaluation of 1) Formalizing the problem of spoofed 2011 Spoofing Defenses traffic filtering and defining novel effectiveness measures, 2) observing each defense as selfish or altruistic and differentiating their performance goals, 3) defining optimal core deployment points for defenses that need core support, and 4) evaluating all defenses in a common and realistic setting.9 ISJNS09 Traceback of DDoS Attacks We categorize packets that are passing 2011 Using Entropy Variations through a router into flows, which are defined by the upstream router where a packet came from, and the destination address of the packet. In this project, we use flow entropy variation or entropy variation interchangeably.10 ISJNS10 Weak State Routing for Large- Weak State Routing (WSR) is a novel 2010 Scale Dynamic Networks routing protocol that uses weak state along with random directional walks for forwarding packets. When a packet reaches a node that contains a weak state about the destination with higher confidence than that held by the packet, the walk direction is biased. The packet reaches the destination 7 via a sequence of directional walks, Page punctuated by biasing decisions. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 8. Iris Solutions11 ISJNS11 On the Quality of Service of Estimating the parameters of the failure 2010 Crash-Recovery Failure Detectors detector to achieve a required QoS to configuring the crash-recovery failure detector. We investigate the impact of the dependability of the monitored process on the QoS of our failure detector12 ISJNS12 An Advanced Hybrid Peer-to- Compared with current botnets, the 2010 Peer Botnet 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.13 ISJNS13 Authenticated Group Key Key transfer protocols rely on a mutually 2010 Transfer Protocol Based on Secret trusted key generation center (KGC) to Sharing select session keys and transport session keys to all communication entities secretly. In this paper, we propose an authenticated key transfer protocol based on secret sharing scheme that KC can broadcast group key information to all group members at once and only authorized group members can recover the group key.14 ISJNS14 Secure Data Replication in Data Secret sharing with cryptography 2010 Grid approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical information. specifically, we investigate the problem of optimal allocation of sensitive data objects that are partitioned by using secret sharing scheme or erasure coding scheme and/or replicated. We develop two heuristic algorithms for the two sub problems.15 ISJNS15 Providing Witness Anonymity We introduce the concept of witness 2010 Under Peer-to-Peer Settings anonymity for peer-to-peer systems, as well as other systems with the peer-to-peer nature. We propose the Secure Deep Throat (SDT) protocol to provide anonymity for the witnesses of malicious or selfish behavior to enable such peers to report on this behavior without fear of retaliation. 8 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 9. Iris SolutionsTECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON DATA MININGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJDM01 Effective Navigation of Query Ranking and categorization, which can also 2011 Results Based on Concept be combined, have been proposed to Hierarchies alleviate this information overload problem. Results categorization for biomedical databases is the focus of this work. A natural way to organize biomedical citations is according to their MeSH annotations. 2 ISJDM02 Automatic Discovery of Personal We propose a novel, automatically extracted 2011 Name Aliases from the Web lexical pattern-based approach to efficiently extract a large set of candidate aliases from snippets retrieved from a web search engine. We define numerous ranking scores to evaluate candidate aliases using three approaches: lexical pattern frequency, word co-occurrences in an anchor text graph, and page counts on the web. 3 ISJDM03 An Efficient Index for Geographic Given a geographic query that is composed 2011 of query keywords and a location, a geographic search engine retrieves documents that are the most textually and spatially relevant to the query keywords and the location, respectively, and ranks the retrieved documents according to their joint textual and spatial relevances to the query. 4 ISJDM04 Anonymous Publication of The problem of anonymizing sparse, high 2011 Sensitive Transactional Data dimensional transactional data is solved through methods based on 1) local NN- search and 2) global data reorganization. 5 ISJDM05 Efficient Periodicity Mining in A time series is a collection of data values 2011 Time Series Databases Using gathered generally at uniform interval of Suffix Trees time to reflect certain behavior of an entity. Real life has several examples of time series such as stock growth, transactions in a superstore. A time series is mostly characterized by being composed of repeating cycles. 9 6 ISJDM06 Mining Iterative Generators and The iterative pattern mining which outputs 2011 Page Representative Rules for Software patterns that are repeated frequently within a #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 10. Iris Solutions Specification Discovery program trace, or across multiple traces, or both. Frequent iterative patterns reflect frequent program behaviors that likely correspond to software specifications.7 ISJDM07 Mining Web Graphs for The recommender systems are based on 2011 Recommendations Collaborative Filtering which is a technique that automatically predicts the interest of an active user by collecting rating information from other similar users or items8 ISJDM08 Managing Multidimensional A P2P-based framework supporting the 2010 Historical Aggregate Data in extraction of aggregates from historical Unstructured P2P Networks multidimensional data is proposed, which provides efficient and robust query evaluation9 ISJDM09 Multimodal Fusion for Video In this project, we present a flexible and 2010 Search Reranking effective reranking method, called CR- Reranking, to improve the retrieval effectiveness. Specifically, multimodal features are first utilized separately to rerank 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.10 ISJDM10 Prospective Infectious Disease We considered the problem of identifying 2010 Outbreak Detection Using outbreak patterns in a syndrome count time Markov Switching Models series using Markov switching models. The disease outbreak states are modeled as hidden state variables which control the observed time series.11 ISJDM11 LIGHT: A Query-Efficient yet LIGHT weight Hash Tree (LIGHT)—a 2010 Low-Maintenance Indexing query-efficient yet low-maintenance Scheme over DHTs indexing scheme. LIGHT employs a novel naming mechanism and a tree summarization strategy for graceful distribution of its index structure. We show through analysis that it can support various complex queries with near-optimal performance.12 ISJDM12 Deriving Concept-Based User User profiling is a fundamental component 2010 Profiles from Search Engine Logs of any personalization applications. We evaluate the proposed methods against our previously proposed personalized query clustering method. Experimental results 10 show that profiles which capture and utilize both of the user‘s positive and negative Page preferences perform the best. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 11. Iris SolutionsTECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTINGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJMC01 Design and Performance Analysis Here we develop two per-user-based 2011 of Mobility Management mobility management schemes for WMNs, Schemes Based on Pointer namely, the static anchor scheme and Forwarding for Wireless Mesh dynamic anchor scheme. Both schemes are Networks based on pointer forwarding. The optimal threshold of the forwarding chain length is determined for each individual mesh client dynamically based on the mesh client‘s specific mobility and service patterns. 2 ISJMC02 Dynamic Conflict-Free DCQS, a novel transmission scheduling 2011 Transmission Scheduling for technique specifically designed for query Sensor Network Queries services in wireless sensor networks. DCQS features a planner and a scheduler. The planner reduces query latency by constructing transmission plans based on the precedence constraints in in-network aggregation. The scheduler improves throughput by overlapping the transmissions of multiple query instances concurrently while enforcing a conflict-free schedule. 3 ISJMC03 Multipath Routing and Max-Min Ensure QoS, an interference-aware max-min 2011 Fair QoS Provisioning under fair bandwidth allocation algorithm, Interference Constraints in proposed where multiple paths (determined Wireless Multihop Networks by using the routing metric) coexist for each user to the base station succeed in improving network performance in terms of delay, packet loss ratio, and bandwidth usage. 4 ISJMC04 Detection of Selfish Manipulation CCA tuning can be exploited by selfish 2011 of Carrier Sensing in 802.11 nodes to obtain an unfair share of the Networks available bandwidth. Specifically, a selfish entity can manipulate the CCA threshold to ignore ongoing transmissions; this increases the probability of accessing the medium and provides the entity a higher, unfair share of the bandwidth. 5 ISJMC05 Message-Efficient Location A better prediction model can significantly 2011 11 Prediction for Mobile Objects in reduce power consumption in a wireless Wireless Sensor Networks Using a sensor network because fewer redundant Page Maximum Likelihood Technique sensors will be activated to keep monitoring #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 12. Iris Solutions the object. The Gauss-Markov mobility model is best mobility models to describe object trajectory because it can capture the correlation of object velocity in time.6 ISJMC06 Throughput-Lifetime Trade-Offs Operating a multi hop wireless network 2011 in Multi hop Wireless Networks while achieving both high throughput and under an SINR-Based high lifetime is a highly desirable design Interference Model goal.7 ISJMC07 Efficient Load-AwareRouting A cluster head estimates traffic load in its 2010 Scheme For Wireless Mesh cluster. As the estimated load gets higher, networks the cluster head increases the routing metrics of the routes passing through the cluster. Based on the routing metrics, user traffic takes a detour to avoid overloaded areas and, as a result, the WMN achieves global load balancing8 ISJMC08 Secure Data Collection in We generate randomized multipath routes, 2010 Wireless Sensor Networks Using the routes taken by the ―shares‖ of different Randomized Dispersive Routes packets change over time. The routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes.9 ISJMC09 VEBEK: Virtual Energy-Based We introduce an energy-efficient VEBEK 2010 Encryption and Keying for scheme for WSNs that significantly reduces Wireless Sensor Networks the number of transmissions needed for rekeying to avoid stale keys. In addition to the goal of saving energy, minimal transmission is imperative for some military applications of WSNs where an adversary could be monitoring the wireless spectrum10 ISDMC10 MABS: Multicast Authentication MABS, includes two schemes. The basic 2010 Based on Batch Signature scheme (MABS-B) eliminates the correlation among packets and thus provides the perfect resilience to packet loss, and it is also efficient in terms of latency, computation, and communication overhead due to an efficient cryptographic 12 primitive called batch signature, which supports the authentication of any number Page of packets simultaneously. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 13. Iris SolutionsTECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSINGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJIP01 Efficient Relevance Feedback Content-based image retrieval (CBIR) is the 2011 mainstay of image retrieval systems. Relevance feedback techniques were incorporated into CBIR such that more precise results can be obtained by taking user‘s Feedbacks into account. 2 ISJIP02 High-quality Reflection Deal with a problem of separating the effect 2011 Separation using Polarized Images of reflection from images captured behind glass. The input consists of multiple polarized images captured from the same view point but with different polarizer angles. The output is the high quality separation of the reflection layer and the background layer from the images. 3 ISJIP03 Active Learning for Solving the The result on the face recognition database 2011 Incomplete Data Problem in and palm print palm vein database showed Facial Age Classification by the that our approach can handle problems with Furthest Nearest-Neighbor large number of classes. Our contributions Criterion are twofold. 1. We proposed the FNN being our novel idea, as a generic on-line or active learning paradigm. 2. We showed that it can be another viable tool for active learning of facial age range classification. 4 ISJIP04 Practical Bounds on Image The bound was computed directly from the 2011 Denoising: From Estimation to noise-free image that was assumed to be Information available. We analyze the bounds formulation to show that these two parameters are interdependent and they, along with the bounds formulation as a whole, have a nice information-theoretic interpretation as well. 5 ISJIP05 An Affine Symmetric Image The affine symmetry is exploited between 2010 Model and Its Applications structural textures at a local level, the objective being to find the minimum residual error by estimating the affine transform relating two patches of texture. 13 Having developed a local model, the methodology is extended to the whole Page image to estimate the global affine relation. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 14. Iris SolutionsTECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERINGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJSE01 An Attack Surface Metric Formalize the notion of a system‘s attack 2011 surface and introduce an attack surface metric to measure the attack surface in a systematic manner. Our measurement method is agnostic to a software system‘s implementation language and is applicable to systems of all sizes. 2 ISJSE02 Genetic Algorithms for A system which uses a genetic algorithm to 2011 Randomized Unit Testing find parameters for randomized unit testing that optimize test coverage. Designing GAs is somewhat of a black art. We therefore use a feature subset selection tool to assess the size and content of the representations within the GA. 3 ISJSE03 Efficient Consistency We use behavioral profiles for the definition 2011 Measurement Based on of a formal notion of consistency which is Behavioral Profiles of Process less sensitive to model projections than Models common criteria of behavioral equivalence and allows for quantifying deviation in a metric way. The derivation of behavioral profiles and the calculation of a degree of consistency have been implemented. 4 ISJSE04 Web development Navigational We presents a general vision of NDT, 2010 Development Techniques which is an approach to deal with requirements in Web systems. It is based on conclusions obtained in several comparative studies and it tries to fill some gaps detected by the research community. 14 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 15. Iris SolutionsTECHNOLOGY: JAVADOMAIN : IEEE TRANSACTIONS ON GRID & CLOUD COMPUTINGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISJGC01 Adaptive grid risk-sensitive filter Based on point-mass approximation, is 2011 for non-linear problems called the adaptive grid risk-sensitive filter. Although risk-sensitive estimators have been known to be robust compared to their risk-neutral counterparts, the implementation of risk-sensitive filters (RSFs) is almost impossible except for very trivial systems like linear Gaussian systems. 2 ISJGC02 Multicloud Deployment of We deploy a computing cluster on the top of 2011 Computing Clusters for Loosely a multicloud infrastructure, for solving Coupled MTC Applications loosely coupled Many-Task Computing applications. In this way, the cluster nodes can be provisioned with resources from different clouds to improve the cost effectiveness of the deployment, or to implement high-availability strategies. 3 ISJCC03 Enabling Public Auditability and To achieve efficient data dynamics, we 2011 Data Dynamics for Storage improve the existing proof of storage Security in Cloud Computing models by manipulating the classic Merkle Hash Tree construction for block tag authentication. To support efficient handling of multiple auditing tasks, the technique of bilinear aggregate signature to extend our main result into a multiuser setting, where TPA can perform multiple auditing tasks simultaneously. 4 ISJGC04 SOAP Processing Performance SOAP communications produce considerable 2011 and Enhancement network traffic, making them unfit for distributed, loosely coupled and heterogeneous computing environments such as the open Internet. Also, they introduce higher latency and processing delays than other technologies, like Java RMI and CORBA. WS research has recently focused on SOAP performance enhancement. 5 ISJGC05 An Improved Ant Algorithm for Finding optimal schedules for such an 2011 Grid Scheduling Problem Using environment is an NP-hard problem, and so 15 Biased Initial Ants heuristic approaches must be used. The goal of grid task scheduling is to achieve high Page system throughput and to allocate various #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 16. Iris Solutions computing resources to applications. Many different methods have been proposed to solve this problem 6 ISJGC06 Weather data sharing system: an Intelligent agents can play an important role 2011 agent-based distributed data in helping achieve the ‗data grid‘ vision. In management this study, the authors present a multi-agent- based framework to implement manage, share and query weather data in a geographical distributed environment, named weather data sharing system 7 ISJGC07 Bi-Criteria Scheduling Of Bi-criteria scheduling approaches for 2010 Scientific Grid Workflows scientific work flows are usually restricted to certain criterion pairs and require the user to define his preferences either as weights assigned each criterion or as fixed constraints defined for one criterion. The first approach has the drawback that combining multiple criteria into a single objective function is not always intuitive to the end-user, while the second requires a priori knowledge about the result of the first criteria scheduling result 8 ISJGC08 A Distributed Protocol to Serve We propose a distributed overlay 2010 Dynamic Groups For Peer-to-Peer framework for dynamic groups where users Streaming may frequently hop from one group to another while the total pool of users remain stable. SMesh first builds a relatively stable mesh consisting of all hosts for control messaging. The mesh supports dynamic host joining and leaving, and will guide the construction of delivery trees J2EETECHNOLOGY: J2EEDOMAIN : IEEE TRANSACTIONS ON J2EESNO P.CODE TITLES DESCRIPTION YEAR 1 ISJ2EE1 Integrating Visual Saliency and Visual saliency. From visual aspect, it is 2011 Consistency for Re-ranking Image obvious that salient images would be easier 16 Search Results to catch users eyes and it is observed that Page these visually salient images in the front pages are often relevant to the users query. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 17. Iris Solutions2 ISJ2EE2 Information Security: End User Information security is to protect valuable 2011 Behavior and Corporate Culture assets. The majority of information security (Employee Information specialists believe that promoting good end Management System) user behavior and constraining bad end user behavior is an important component of an effective ISMS. Implementing effective information security involves understanding security-related risk, then developing and implementing appropriate controls.3 ISJ2EE3 Matching Estimates of the Effect We compare the use of OLS regression and 2011 of College Attendance on propensity score matching methods, and Individual Income incorporate the role of ldquo common support .rdquo Using data from the CHFLS Survey, we estimate career outcomes.4 ISJ2EE4 Attention modeling for video Overall quality of a distorted video is a 2011 quality assessment: balancing weighted average between the global quality global quality and local quality and the local quality. The proposed video quality modeling algorithm can improve the performance of image quality metrics on video quality assessment compared to the normal averaged spatiotemporal pooling.5 ISJ2EE5 Movie summarization based on Visual saliency is measured by means of a 2011 audiovisual saliency detection spatiotemporal attention model driven by various feature cues (intensity, color, motion). Audio and video curves are integrated in a single attention curve, where events may be enhanced. The presence of salient events is signified on this audiovisual curve by geometrical features such as local extreme, sharp transition points & level sets.6 ISJ2EE6 Research on B2B E-Business The model to B2B E-Business System of 2010 System of Bookshop Based on Bookshop, which includes the management Web Service subsystem of order, book information, bookshop information, bill information, and customer relations. 17 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 18. Iris Solutions DOTNETTECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON NETWORKINGSNO P.CODE TITLES DESCRIPTION YEAR 1 ISDNW01 Towards Realizable, Low-Cost In this project, popular broadcast scheduling 2011 Broadcast Systems for Dynamic approaches are tested from an Environments implementation cost aspect, and the results render them only conditionally realizable. 2 ISDNW02 Research on cloud computing A traditional method of using load balancing 2011 application in the peer-to-peer and multiple buffer servers we found that based video–on-demand systems the performance of Hadoop framework was improved significantly in feasibility and efficiency when dealing with large data. 3 ISDNW03 A Secure Communication Game A four terminal network with a source, a 2011 with a Relay Helping the destination, an eavesdropper and a jammer Eavesdropper relay is investigated. The source and the jammer relay have conflicting interests. This problem is formulated as a non-cooperative two-player zero sum continuous game. Two cases are studied: 1) the jammer relay does not hear the source, and 2) the jammer relay is given the source signal causally. 4 ISDNW04 Optical Layer Security in Fiber- Our goal is the security threats in an optical 2011 Optic Networks network as well as present several existing optical techniques to improve the security. In the first part of this paper, we discuss various types of security threats that could appear in the optical layer of an optical network, including jamming, physical infrastructure attacks, eavesdropping and interception. 5 ISDNW05 Model-Based Identification of A novel model-based approach for dominant 2011 Dominant Congested Links congested link identification that is based on interpreting probe loss as an unobserved (virtual) delay. We develop parameter inference algorithms for hidden Markov model (HMM) and Markov model with a 18 hidden dimension (MMHD) to infer this virtual delay. Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 19. Iris Solutions6 ISDNW06 Live Streaming With Receiver- Packet traces are collected from a single or a 2011 Based Peer-Division limited number of measurement points, to Multiplexing infer various properties of traffic on the control and data planes. Although such studies are useful to compare different systems from the end-users perspective, it is difficult to intuitively understand the observed properties without fully reverse- engineering the underlying systems.7 ISDNW07 Adjacent Link Failure Being reported as the most general 2011 Localization With Monitoring monitoring structure for out-of-band failure Trails in All-Optical Mesh localization approach, the monitoring trail Networks (m-trail) framework has been witnessed with great efficiency and promises to serve in the future Internet backbone with all-optical mesh wavelength division multiplex (WDM) networks.8 ISDNW08 Predictive Resource Management The monitoring system preserves a high 2011 of Multiple Monitoring degree of flexibility, increasing the range of Applications applications and network scenarios where it can be used. We implemented our load- shedding-based resource management scheme in an existing network monitoring system and deployed it in a large research and educational network.9 ISDNW09 Active Monitoring and Alarm It focuses the error locations (Localization) 2010 Management for Fault which is occurring on the Optical Networks Localization in Transparent All- and when we monitoring the fault Optical Networks localization, we arrange the alarm to make active the users.10 ISDNW10 Logoot-Undo: Distributed This project presents the Logoot-Undo 2010 Collaborative Editing System on Commutative Replicated Data Type P2P Networks algorithm, which integrates the ―undo anywhere, anytime‖ feature on the replicated data‘s in peer to peer network for reducing the cost of undo feature.11 ISDNW11 Multiuser Diversity Gain in An large cognitive networks granted 2010 Cognitive Networks concurrent spectrum access with license- holding users and Dynamic allocation of resources to the best link in multiuser n/w.12 ISDNW12 Correlation-Based Traffic This paper proposes attacks that exploit the 2010 19 Analysis Attacks on Anonymity timing behavior and applications in low- Networks latency Anonymity networks. Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 20. Iris Solutions13 ISDNW13 Optimal Resource Placement in This Paper proposes an optimal resource 2010 Structured Peer-to-Peer Networks (replica or link) placement strategy, which can optimally trade off the performance gain and paid cost in Peer-to-Peer Networks14 ISDNW14 SocioNet: A Social-Based This paper proposes SocioNet, based on the 2010 Multimedia Access System for relationship form social network and share Unstructured P2P Networks contents by preference. Sharing takes place in 3 ways such as regular, small world, random.15 ISDNW15 Load Balancing for Parallel A communication-aware load- balancing 2010 Applications on Group Of technique that is capable of improving the Systems performance of communication-intensive applications by increasing the effective utilization of networks in cluster environments. We introduce a behavior model for parallel applications with large requirements of network, CPU, memory, and disk I/O resources.16 ISDNW16 Cache Maintenance over Wireless The efficiency of data access in caching 2010 Ad Hoc Networks systems largely depends on the cost for maintaining cache consistency, which can be high in wireless ad hoc networks due to network dynamism. In this paper, we propose a general consistency model called Probabilistic Delta Consistency (PDC), which integrates the flexibility granted by existing consistency models, covering them as special cases.17 ISDNW17 Any Cast Based Packet We are interested in minimizing the delay 2010 Forwarding Scheme For MDML and maximizing the lifetime of event-driven wireless sensor networks for which events occur infrequently. Sleep–wake scheduling could result in substantial delays because a transmitting node needs to wait for its next- hop relay node to wake up. To reduce delays we use ―any cast‖-based packet forwarding schemes.18 ISDNW18 Sharing Memory between This system protecting shared memory from 2009 Byzantine Processes Using the unauthorized node in Network by fine- Policy-Enforced Tulle Spaces grained access policies and it will Transfer the data‘s in a network using byzantine process. 20 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 21. Iris SolutionsTECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON NETWORK SECURITYSNO P.CODE TITLES DESCRIPTION YEAR 1 ISDNS01 A Generic Framework for Three- A well designed three-factor authentication 2011 Factor Authentication: Preserving protocol can greatly improve the Security and Privacy in information assurance in distributed Distributed Systems systems. Three-factor authentication is introduced to incorporate the advantages of the authentication based on password, smart-card and biometrics. 2 ISDNS02 Deadlock-Free Adaptive Routing A new deadlock-free adaptive routing 2011 in Meshes with Fault-Tolerance algorithm for meshes was proposed for 3D Ability Based on Channel meshes based on a new virtual network Overlapping partitioning scheme called channel overlapping. The proposed deadlock-free adaptive routing algorithm was extended to a deadlock-free adaptive fault tolerant routing algorithm in 3D meshes with the same deadlock avoidance technique which can outperform other previous methods. 3 ISDNS03 RITAS: Services for Randomized A stack of randomized intrusion-tolerant 2011 Intrusion Tolerance protocols is described and its performance evaluated under several settings in both LAN and wide-area-network environments. The stack provides a set of relevant services ranging from basic communication primitives up to atomic broadcast. 4 ISDNS04 Online Intrusion Alert Alert aggregation is an important subtask of 2011 Aggregation with Generative intrusion detection. The goal is to identify Data Stream Modeling and to cluster different alerts—produced by low-level intrusion detection systems, firewalls, etc.—belonging to a specific attack instance which has been initiated by an attacker at a certain point in time. 5 ISDNS05 Replica Placement for Route Distributed hash tables share storage and 2011 Diversity in Tree-Based Routing routing responsibility among all nodes in a Distributed Hash Tables peer-to-peer network. These networks have bounded path length unlike unstructured networks. The impact of Max Disjoint on 21 routing robustness compared to other Page placements when nodes are compromised at random or in a contiguous run. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 22. Iris Solutions6 ISDNS06 Prime: Byzantine Replication This project demonstrates the extent of 2011 under Attack performance degradation possible in some existing protocols that do satisfy liveness and that do perform well absent Byzantine faults. We propose a new performance oriented Correctness criterion that requires a consistent level of performance, even with Byzantine faults.7 ISDNS07 Nymble: Blocking Misbehaving Anonymizing networks such as Tor allow 2011 Users in Anonymzing Networks users to access Internet services privately by using a series of routers to hide the clients IP address from the server. Nymble, a system in which servers can ―blacklist‖ misbehaving users, there by blocking users without compromising their anonymity.8 ISDNS08 Dynamics of Malware Spread in We formulate an analytical model to 2011 Decentralized Peer-to-Peer characterize the spread of malware in Networks decentralized, Gnutella type peer-to-peer (P2P) networks and study the dynamics associated with the spread of malware. Using a compartmental model, we derive the system parameters or network conditions under which the P2P network may reach a malware free equilibrium.9 ISDNS09 Improving Security and We propose a novel Cipher text policy 2011 Efficiency in Attribute-Based attribute-based encryption (CP-ABE) Data Sharing scheme for a data sharing system by exploiting the characteristic of the system architecture. The proposed scheme achievements:1) The key escrow problem could be solved by escrow-free key issuing protocol.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.10 ISDNS10 Using Web-Referral We systematically design a security-driven 2010 Architectures to Mitigate Denial- scheduling architecture that can dynamically of-Service Threats measure the trust level of each node in the system by using differential equations11 ISDNS11 Against Flooding Attacks Using In recent years, a number of puzzle-based 2010 22 Game Theory based Puzzle defense mechanisms have been proposed Approach against flooding denial-of-service (DoS) Page attacks in networks. This paper utilizes #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 23. Iris Solutions game theory to propose a series of optimal puzzle-based strategies for handling increasingly sophisticated flooding attack scenariosTECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON DATAMININGSNO P. CODE PROJECT TITLES DESCRIPTION YEAR 1 ISDDM01 Mining Group Movement Encryption and multiplexing technique not 2011 Patterns for Tracking Moving only enhances the security of confidential Objects Efficiently fingerprint information by making the information inaccessible to any intruder having a random code, but also improves the system resource utilization by reducing the storage and/or transmission bandwidth requirement 2 ISDDM02 Mining Iterative Generators and We introduce a novel concept of 2011 Representative Rules for representative rules expressing forward, Software Specification Discovery backward, and in-between temporal constraints. These rules characterize many real-world constraints including those found in software specifications and can be constructed by pairing iterative generators with closed iterative patterns. 3 ISDDM03 On Computing Farthest The concept of Data mining such as NN and 2011 Dominated Locations closest Pair is used. Based on the client‘s 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. 4 ISDDM04 Efficient Relevance Feedback for We propose a novel method NPRF to 2011 Content-Based Image Retrieval achieve the high efficiency and effectiveness by Mining User Navigation of CBIR in coping with the large-scale Patterns image data. In terms of efficiency, the iterations of feedback are reduced substantially by using the navigation patterns discovered from the user query log. Our proposed search use three kinds of query refinement strategies QPM, QR and 23 QEX to converge the search space toward Page the user‘s intention effectively. #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 24. Iris Solutions5 ISDDM05 Authenticated Multistep NN We are using NN concept to provide 2011 Nearest Neighbor Search 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.6 ISDDM06 Missing Value Estimation for Missing data imputation aims at providing 2011 Mixed-Attribute Data Sets estimations for missing values by reasoning from observed data. Missing data imputation is a key issue in learning from incomplete data. Various techniques have been developed with great successes on dealing with missing values in data sets with homogeneous attributes.7 ISDDM07 Extended XML Tree Pattern We research a large set of XML tree pattern, 2011 Matching: Theories and called extended XML tree pattern, which Algorithms may include P-C, A-D relationships, negation functions, wildcards, and order restriction. We establish a theoretical framework about ―matching cross‖ which demonstrates the intrinsic reason in the proof of optimality on holistic algorithms.8 ISDDM08 Bridging Domains Using World A novel transfer learning approach, called 2010 Wide Knowledge for Transfer BIG (Bridging information Gap), to Learning effectively extract useful knowledge in a worldwide knowledge base.9 ISDDM09 Closing the Loop in Webpage This project focuses on the concept of 2010 Understanding information extraction is processing from a web page and its content.10 ISDDM10 Knowledge-Based Interactive This paper proposes a new interactive 2010 Post mining of Association Rules approach to prune and filter discovered Using Ontologies rules.1) Integration of user knowledge in the post processing task. 2) The Rule Schema formalism extending the specification language for user expectations11 ISDDM11 Filtering Data flow for Query tolerance is expressed as a numerical 2010 Continuous Queries value, which may be difficult to specify. We observe that in many situations, users may not be concerned with the actual value of an answer, but rather which object satisfies a query. In this paper We develop fraction- based tolerance for two major classes of 24 entity-based queries Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 25. Iris Solutions12 ISDDM12 Through Linking for Transfer Our approach at automatically adapting the 2010 Learning Using Web information extraction knowledge previously learned from a source Web site to a new unseen site and discovering previously unseen attributes. Two kinds of text-related clues from the source Web site are considered. The first clue is obtained from the extraction pattern contained in the previously learned wrapper. The second clue is derived from the previously extracted or collected items.13 ISDDM13 A Binary String Approach for To facilitate XML query processing, several 2010 Updates XML Data labeling schemes have been proposed, in which the ancestor-descendant and parent- child relationships in XML queries can be quickly determined without accessing the original XML file. A novel labeling scheme, called IBSL (Improved Binary String Labeling), which supports order sensitive updates without relabeling or recalculation.TECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON MOBILE COMPUTINGSNO P. CODE PROJECT TITLES DESCRIPTION YEAR 1 ISDMC01 A Policy Enforcing Mechanism The design and implementation of a policy 2011 for Trusted Ad Hoc Networks enforcing mechanism based on Satem, a kernel-level trusted execution monitor built on top of the Trusted Platform Module. Under this mechanism, each application or protocol has an associated policy. Two instances of an application running on different nodes may engage in communication only if these nodes enforce the same set of policies for both the application and the underlying protocols used by the application. 2 ISDMC02 Call Admission Control In efficient CAC scheme for mobile networks 2011 Performance Analysis in Mobile that takes into account voice connections, Networks Using Stochastic Well- synchronous and asynchronous data 25 Formed Petri Nets connections. Furthermore, we use SWNs to model the system interaction, which consists Page of several mobile nodes, gateways, cells, and #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 26. Iris Solutions servers. We present analytical performance results using the WNSIM symbolic simulator of Great SPN tool.3 ISDMC03 An Adaptive Network Coded An adaptive scheme that maintains the 2011 Retransmission Scheme for highest bandwidth efficiency obtainable by Single-Hop Wireless Multicast both opportunistic and full network coding Broadcast Services schemes in wireless MBS. The proposed scheme adaptively selects, between these two schemes, i) To achieve the better bandwidth efficiency performance. ii) Using random graph theory.4 ISDMC04 An Optimal Algorithm for Relay Our goal is we study the relay node 2011 Node Assignment in Cooperative assignment problem in a cooperative ad hoc Ad Hoc Networks network environment, where multiple source–destination pairs compete for the same pool of relay nodes in the network. Our objective is to assign the available relay nodes to different source–destination pairs so as to maximize the minimum data rate among all pairs.5 ISDMC05 Localization of Mobile Nodes in Wireless sensor networks are an inherent 2011 Wireless Networks with part of decision making, object tracking, and Correlated in Time Measurement location awareness systems. This work is Noise focused on simultaneous localization of mobile nodes based on received signal strength indicators (RSSIs) with correlated in time measurement noises.6 ISDMC06 Load Shedding in Mobile The CQ server must receive and process 2011 Systems with MobiQual frequent position updates from the mobile nodes. It is difficult to obtain fresh and accurate CQ results simultaneously, due to 1) limited resources in computing and communication and 2) fast-changing load conditions caused by continuous mobile node movement. The MobiQual approach leads to much higher freshness and accuracy in the query results in all cases.7 ISDMC07 Cooperative Channelization in A health metric is proposed to allow 2011 Wireless Networks with Network comparison of need for channelization of Coding different multicast links. Cooperative channelization considers the impact of 26 channelization on overall network performance before resource reservation is Page triggered. Our results show that cooperative #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 27. Iris Solutions channelization improves overall network performance while being well suited for wireless networks using network coding.8 ISDMC08 Uncertainty Modeling and A technique to efficiently reduce uncertainty 2010 Reduction in MANETs and proactive Schemes exploit mobile nodes to collect and broadcast trust information to achieve trust convergence.9 ISDMC09 MABS: Multicast Authentication The scheme (MABS-B) eliminates the 2010 Based on Batch Signature correlation among packets by using batch signature. This supports the authentication of any number of packets Simultaneously.10 ISDMC10 Detection of Hacking in Wireless We explore the use of clock skew of a 2010 Using Access Points wireless local area network access point (AP) as its fingerprint to detect unauthorized APs quickly and accurately. The main goal behind using clock skews is to overcome— the inability to effectively detect Medium Access Control (MAC) addresses spoofing. We use two different methods for this purpose—one based on linear programming and the other based on least-square fit for differentiating original packets from those sent by the fake APs.11 ISDMC11 Secure Distance-Based We attempt to answer these and other related 2010 Localization in the Presence of questions by following a careful analytical Cheating Beacon Nodes approach. Specifically, we first show that when the number of cheating beacon nodes is greater than or equal to a given threshold, there do not exist any two-dimensional distance-based localization algorithms that can guarantee a bounded error.12 ISDMC12 Multicast Based Efficient and In a node replication attack, an adversary 2010 Distributed Replica Detection in can take advantage of the credentials of a Large-Scale Sensor Networks compromised node to surreptitiously introduce replicas of that node into the network. A novel distributed approach called Localized Multicast for detecting node replication attacks. The efficiency and security of our approach are evaluated both theoretically and via simulation. 27 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 28. Iris SolutionsTECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON IMAGE PROCESSINGSNO P.CODE PROJECT TITLES DESCRIPTION YEAR 1 ISDIP01 High-quality Reflection A problem of separating the effect of 2011 Separation using Polarized reflection from images captured behind Images glass. The input consists of multiple polarized images captured from the same view point but with different polarizer angles. The output is the high quality separation of the reflection layer and the background layer from the images. We propose a framework that allows us to fully exploit the mutually exclusive image information in our input data. 2 ISDIP02 PSF Estimation via Gradient An efficient method to estimate the PSF 2011 Domain Correlation (point spread function) of a blurred image using image gradients spatial correlation. A patch based image degradation model is proposed for estimating the sample covariance matrix of the gradient domain natural image. The PSF is computed using phase retrieval technique to remove the ambiguity introduced by the absence of the phase. 3 ISDIP03 Practical Bounds on Image The bound was computed directly from the 2011 Denoising: From Estimation to noise-free image that was assumed to be Information available. In this work, we extend the formulation to the more practical case where no ground truth is available. We show that the parameters of the bounds, namely the cluster co variances and level of redundancy for patches in the image, can be estimated directly from the noise corrupted image. 4 ISDIP04 A New Chaos-Based A novel and robust chaos-based 2011 Cryptosystem for Secure cryptosystem for secure transmitted images Transmitted Images and four other versions. In the proposed block encryption/decryption algorithm, a 2D chaotic map is used to shuffle the image pixel positions. 28 5 ISDIP05 An Optimum Land Cover Occurrence of shadowy pixels in remote 2011 Page Mapping Algorithm in the sensing images is a common phenomenon #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 29. Iris Solutions Presence of Shadows particularly with passive sensors. The main purpose of this algorithm is to find the most likely land cover map along with the shadow-free image and light intensity image as byproducts. Our results show that a large number of misclassified pixels can be corrected. 6 ISDIP06 In-Image Accessibility Indication An in-image accessibility indication scheme, 2010 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. 7 ISDIP07 Sparse Bayesian Learning of A framework for expanding a given image 2010 Filters for Efficient Image using an interpolator that is trained in Expansion advance with training data, based on sparse Bayesian estimation.TECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON GRID & CLOUD COMPUTINGSNO P. CODE PROJECT TITLES DESCRIPTION YEAR 1 ISDCC01 Supply Chain as a Service: A The idea of Cloud Computing for service 2011 Cloud Perspective on Supply representation and service composition in Chain Systems supply chain systems. The resulting models allow for representing operations in supply Chain systems as interconnected services and describing compositions of such services. Supply chains are characterized by multiple firms providing their resources and processes to meeting customer demand in an efficient manner. 2 ISDCC02 Performance Analysis of Cloud We quantify the presence in real scientific 2011 Computing Services for Many- computing workloads of Many-Task Tasks Scientific Computing Computing (MTC) users, that is, of users who employ loosely coupled applications comprising many tasks to achieve their scientific goals. We compare through trace- 29 based simulation the performance Page characteristics and cost models of clouds #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 30. Iris Solutions and other scientific computing platforms, for general and MTC-based scientific computing workloads.3 ISDCC03 Enabling Public Auditability and We consider the task of allowing a third 2011 Data Dynamics for Storage party auditor (TPA), on behalf of the cloud Security in Cloud Computing client, to verify the integrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of the client through the auditing of whether his data stored in the cloud are indeed intact, which can be important in achieving economies of scale for Cloud Computing.4 ISDCC04 A Venture Perspective on Cloud Cloud and mobile computing appear to 2011 Computing represent yet another software architecture change. Recognizing the changes in how customers and developers evaluate and adopt solutions, many start-ups are building new software services that can leverage cost advantages of massive scale while also taking advantage of online marketing to drive highly efficient customer adoption and retention.5 ISDGC05 Data Replication in Data Data replication has been well adopted in 2011 Intensive Scientific Applications data intensive scientific applications to with Performance Guarantee reduce data file transfer time and bandwidth consumption. In Grid simulator, we demonstrate that the distributed caching technique significantly outperforms an existing popular file caching technique in Data Grids, and it is more scalable and adaptive to the dynamic change of file access patterns in Data Grids.6 ISDGC06 Scheduling Grid Tasks in Face of Grid scheduling is essential to Quality of 2011 Uncertain Communication Service provisioning, efficient management Demands of grid resources. The IPDT-FUZZY scheduler, a scheduler which considers the demands of grid applications with such uncertainties. The scheduler uses fuzzy optimization, and both computational and communication demands are expressed as fuzzy numbers. The results reinforce its adequacy for dealing with the lack of 30 accuracy in the estimation of communication demands. Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 31. Iris Solutions 7 ISDGC07 Reputation-Based Trust for a This paper explores integrating a reputation- 2011 Cooperative Agent-Based Backup based trust mechanism with an agent-based Protection Scheme backup protection system to help protect against malicious or byzantine failures. The improved decision-making capability of agents who incorporate this cooperative trust method in the presence of failures in neighboring relays. 8 ISDGC08 ABACS: An Attribute-Based ABACS for emergency services with security 2011 Access Control System for assurance over VANETs. ABACS aims to Emergency Services over improve the efficiency of rescues mobilized Vehicular Ad Hoc Networks via emergency Communications over VANETs. ABACS can select the emergency vehicles that can most appropriately deal with an emergency and securely delegate the authority to control traffic facilities to the assigned emergency vehicles. 9 ISDGC09 Information Theoretic Aspects of This paper proposes an application of 2010 Users‘ Activity in a Wyner-Like multiuser information theory to the study of Cellular Model the uplink of a communication system with Randomly activated users.10 ISDGC10 Multifunctional MIMO Systems: In this project, the concept MIMO which is 2010 A Combined Diversity And collecting the INPUT (data) of the Client to Multiplexing Design Perspective provide the collected data to the receivers through a single way.TECHNOLOGY: DOTNETDOMAIN : IEEE TRANSACTIONS ON SOFTWARE ENGINEERINGSNO P.CODE PROJECT TITLES DESCRIPTION YEAR 1 ISDSE01 Plat_Forms: A Web Development Developing Web-based applications, there 2011 Platform Comparison by an exist several competing and widely used Exploratory Experiment technological platforms each with an Searching for Emergent Platform accompanying development culture and Properties style. In a nonrandomized, controlled experiment, framed as a public contest called ―Plat_Forms,‖ top-class teams of three professional programmers competed to 31 implement the same requirements for a Web based application. Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai
  • 32. Iris Solutions2 ISDSE02 Software Module Clustering as a The multi-objective paradigm for automated 2011 Multi–Objective Search Problem software module clustering is introduced. Two formulations of the multiple objective approaches are studied: the Equal-size Cluster Approach (ECA) and the Maximizing Cluster Approach (MCA).3 ISDSE03 Facilitating Trust in Privacy- We present a privacy-preserving reputation 2011 preserving E-learning management system which allows secure Environments 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.4 ISDSE04 Comparing the Defect Reduction We compared the software defect rates and 2011 Benefits of Code Inspection and implementation costs associated with two Test-Driven Development methods of software defect reduction: code inspection and test-driven development.5 ISDSE05 Efficient Consistency Engineering of process-driven business 2011 Measurement Based on applications can be supported by process Behavioral Profiles of Process modeling efforts in order to bridge the gap Models between business requirements and system specifications. We use behavioral profiles for the definition of a formal notion of consistency which is less sensitive to model projections than common criteria of behavioral equivalence and allows for quantifying deviation in a metric way.6 ISDSE06 Automated Test Generation From A fully automatic model-driven technique to 2010 A Behavioral Model generate test cases for Graphical user interfaces (GUIs)- based applications. The technique uses feedback from the execution of a ―seed test suite,‖ which is generated automatically using an existing structural event interaction graph model of the GUI. During its execution, the runtime effect of each GUI event on all other events pinpoints event semantic interaction (ESI) relationships, which are used to automatically generate new test cases. 32 Page #165, 1st Floor, 5th Street, Crosscut Road, Gandhipuram, Coimbatore-12 Ph: 0422-4372816 Mail: irisprojects@yahoo.com website: www.irisprojects.com, Our branches: Tanjore: 9943 317 317, Trichy: 9943 314 314, Kovai: 9943 357 357 Chennai, Nellai, Salem, Erode, Madurai