Final Year Projects in Chennai

TTA
FINAL YEAR PROJECTS TITLES WITH ABSTRACT IEEE 2011, 2010, 2009, 2008 , etc Projects for B.E/B.Tech/M.E/Bsc/Msc For complete base paper, call now and talk to our expert 89397 22135 | 89397 22145 | 044 4218 1385
TTA
Final year projects by IT professionals
JAVA - DOMAIN : MOBILE COMPUTING
CODE
PROJECT TITLE
DESCRIPTION
REFERENCE
YJM01
Reliability Improvement Using Receive Mode Selection in the Deviceto-Device Uplink Period Under laying Cellular Networks
A new interference management scheme is proposed to improve the reliability of a device-to-device (D2D) communication in the uplink (UL) period wit hout reducing the power of cellular user equipment (UE). To improve the reliability of the D2D receiver, two conventional receive techniques and one proposed method are introduced. One Technical enhancements of mobile technologies are paving the way to the definition of high-quality and accurate geolocation solutions based on data collected and managed by GSM/3G networks. We present a technique that provides geolocation and mobility prediction both at network and service level, does not require any change to the existing mobile network infrastructure, and i s entirely performed on the mobile network side A widely applied strategy for workload sharing is to equalize the workload assigned to each resource. In mobilemultiagent systems, this principle directly leads to equitable partitioning policies whereby: 1) the environment is equitably divided into subregions of equal measure; 2) one agent is assigned to each subregion; and 3) each agent is responsible for service requests originating within its own subregion. In this paper new photo retrieval system for mobile device s is proposed. The system can be used to search for photos withsimilar spatial layouts efficiently, and it adopts an image segmentation algorithm that extracts features of image regions based on K-Means clustering. Since K-Means is computationally intensive for real-time applications and prone to generate clustering
IEEE 2011
YJM02
Map-Based Location and Tracking in Multipath Outdoor Mobile Networks
IEEE 2011
YJM03
Distributed lgorithms for Environment Partitioning in Mobile Robotic Networks
IEEE 2011
YJM04
Photo Retrieval based on Spatial Layout with Hardware Acceleration for Mobile Devices
IEEE 2011
For base paper and detailed discussion, call 89397
22135 |
89397 22145 | 044 4218 1385

Web: www.talhunt.co.in
TTA
YJM05
Hop-by-hop Routing in Wireless Mesh Networks with Bandwidth Guarantees
YJM06
Cooperating with Smartness: Using Heterogeneous Smart Antennas in Multi-hop Wireless Networks
YJM07
Local Greedy Approximation for Scheduling in Multi-hop Wireless Networks
YJM08
Network Connectivity with a Family of Group Mobility Models
results with local optima, parallel hardware architectures are designed to meet the real-time requirement of the retrieval process. Wireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-ofservice in WMNs The use of smart antennas in multihop wireless networks (MWNs) has garnered significant attention over the last few years. While homogeneous MWNs with all nodes having the same antenna capabilities will have certain applications, we argue that MWNs with nodes having heterogeneous antenna capabilities are more likely to be the norm due to a variety of motivating factors. In recent years, there has been a significant amount of work done in developing lowcomplexity schedulingschemes to achieve high performance in multihop wireless networks. A centralized suboptimal schedulingpolicy, called Greedy Maximal Scheduling (GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings. We investigate the communication range of the nodes necessary for network connectivity, which we call bidirectional connectivity, in a simple setting. Unlike in most of existing studies, however, the locations ormobilities of the nodes may be correlated through group mobility: Nodes are broken into groups, with each groupcomprising the same number of nodes, and lie on a unit circle. The locations of the nodes in the same group are not mutually independent, but are instead conditionally independent given the location of the group. We examine the distribution of the smallest communication
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJM09 Towards Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
YJM10
Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions
YJM11
A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks
YJM12
Optimal Stochastic Location Updates in Mobile Ad Hoc Networks
This paper addresses the problem of delivering data packets for highly dynamic m obile ad hoc networks in areliable and timely manner. Most existing ad hoc routing protocols are susceptible to node mobility, especially forlarge-scale networks. Driven by this issue, 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. There are two main approaches, static and dynamic, in broadcast algorithms in wireless ad hoc networks. In thestatic approach, local algorithms determine the sta tus (forwarding/non-forwarding) of each node proactively based on local topology information and a globally known priority function. In this paper, we first show that localbroadcast algorithms based on the static approach cannot achieve a good approximation factor to the optimum solution (an NP-hard problem). Monitoring personal locations with a potentia lly untrusted server poses privacy threats to the monitored individuals. To this end, we propose a privacypreserving location monitoring system for wi reless sensornetworks. In our system, we design two innetwork location anonymization algorithms, namely, resource and quality-aware algorithms, that aim to enable the system to provide highquality location monitoring services forsyste m users, while preserving personal location privacy We consider the location service in a mobile adhoc network (MANET), where each node needs to maintain itslocation information by 1) frequently updating its location information within its neighboring region, which is called neighborhood update (NU), and 2) occasionally updating its location information to certain distributedlocation server in the network, which is called location server update (LSU).
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJM13 Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks
Group communications are important in Mobile Ad hoc Networks (MANETs). Multicast is an efficient method for implementing group communications. However, it is challenging to implement efficient and scalable multicast in MANET due to the difficulty in group membership management and multicast packet forwarding over a dynamic topology. We propose a novel Efficient Geographic Multicast Protocol (EGMP).
IEEE 2011
JAVA - DOMAIN : KNOWLEDGE AND DATA ENGINEERING CODE YJK01 PROJECT TITLE Motion Segmentation using the Hadamard Product and Spectral Clustering DESCRIPTION Group communications are important in Mobile Ad hoc Networks (MANETs). Multicast is an efficient method for implementing group communications. However, it is challenging to implement efficient and scalable multicas t in MANET due to the difficulty in group membership management and multicast packet forwarding over a dynamic topology In this paper, we formalize the problem in a unified probabilisticframewo rk, which incorporates both attributes and relationships. Specifically, we define a disambiguationobjective function for the problem and propose a two-step parameter estimation algorithm. We also investigate adynamic approach for estimating the number of people K. In this paper, we introduce and explore a number of item ranking techniques that can generate 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 REFERENCE IEEE 2011
YJK02
A Unified Probabilistic Framework for Name Disambiguation in Digital Library
IEEE 2011
YJK03
Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
the proposed techniques using several real-world rating datasets and different rating prediction algorithms. YJK04 Publishing Search Logs A Comparative Study of Privacy Guarantees In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of kanonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by epsilondifferential privacy unfortunately does not provide any utility for this problem. We then propose a novel algorithm ZEALOUS and show how to set its parameters to achieve (epsilon, delta)probabilistic privacy. This paper presents a novel cluster oriented ensemble classifier . The proposed ensemble classifier is based onoriginal concepts such as learning of cluster boundaries by the base classifiers and mapping of clusterconfidences to class decision using a fusion classifier. The categorised data set is characterised into multipleclusters and fed to a number of distinctive base classifiers. This paper offers a new role engineering approach to Role-Based Access Control (RBAC), referred to as visualrole mining. The key idea is to graphically represent user-permission assignments to enable quick analysis and elicitation of meaningful roles. First, we formally define the problem by introducing a metric for the quality of the visualization. This paper introduces a knowledgedriven approach to real-time, continuous activity recognition based on multi-sensor data streams in smart homes. The approach goes beyond the traditional data-centric methods for activityrecognition in three ways. Firstly, it makes extensive use of domain knowledge in the lifecycle of activityrecognition. Secondly, it uses IEEE 2011
YJK05
Cluster Oriented Ensemble Classifier: Impact of Multi-cluster Characterization on Ensemble Classifier Learning.
IEEE 2011
YJK06
Visual Role Mining: A Picture Is Worth a Thousand Roles
IEEE 2011
YJK07
A Knowledge-Driven Approach to Activity Recognition in Smart Homes
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJK08
Finding Top-k Answers in Keyword Search over Relational Databases Using Tuple Units
YJK09
Efficient Iceberg Query Evaluation using Compressed Bitmap Index
ontologies for explicit context and activity modeling and representation. Thirdly and finally, it exploits semantic reasoning and classification for activity inferencing, thus enabling both coarse-grained and finegrained activity recognition. in this paper, we study how to integrate multiple related tuple units to effectively answerkeyword queries. To achieve a high performance, we devise two novel indexes, single-keyword-based structure-aware index and keyword-pairbased structure-aware index, and incorporate structural relationships between different tuple units into the indexes. We use the indexes to efficiently identify the answers of integrated tupleunits. In this paper, we exploited the property of bitmap index and developed a very effective bitmappruning strategy for processing iceberg queries. Our index-pruning based approach eliminates the need of scanning and processing the entire data set (table) and thus speeds up the iceberg query processing significantly. Experiments show that our approach is much more efficient than existing algorithms commonly used in row-oriented and column-oriented databases in this study, we propose a novel CP-ABE scheme for a data sharing system by exploiting the characteristic of the system architecture. The proposed scheme features the following achievements: (1) the key escrow problem could be solved by escrow-free key issuing protocol, (2) fine-grained user revocation per each attribute could
IEEE 2011
IEEE 2011
YJK10
Improving Security and Efficiency in AttributeBased Data Sharing
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJK11
Clustering with MultiViewpoint based Similarity Measure
YJK12
Manifold Adaptive Experimental Design for Text Categorization
YJK13
Multi-resolution Web link analysis using generalised link relations
YJK14
Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks
be done by proxy encryption which takes advantage of the selective attribute group key distribution on top of the ABE. In this paper, we introduce a novel multiviewpoint based similarity measure and two related clustering methods. The major difference between a traditional dissimilarity/similarity measure and ours is that the former uses only a single viewpoint, which is the origin, while the latter utilizes many different viewpoints, which are objects assumed to not be in the same cluster with the two objects being measured. Using multiple viewpoints, more informative assessment of similarity could be achieved. In this paper, we propose a novel active learning algorithm which is performed in the data manifold adaptive kernel space. The manifold structure is incorporated into the kernel space by using graph Laplacian. This way, the manifold adaptive kernel space reflects the underlying geometry of the data. In this paper, we generalize the multiresolution popularity analysis to use any form of Web page link relations. We provide results for both the PageRank relations and the Indegree relations. By utilizing the multiresolution popularity lists, we achieve a 13 percent and 25 percent improvement in mean average precision over In-degree and PageRank, respectively. In this paper, we introduce the notion of sufficient set and necessary set for distributed processing ofprobabilistic t op-k queries in clusterbased wireless sensor networks. These two concepts have very nice properties that can facilitate localized data pruning in clusters. Accordingly, we develop a suite of algorithms, namely, sufficient set-based (SSB), necessary
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJK15
Cost-aware rank join with random and sorted access
YJK16
Joint Top-K Spatial Keyword Query Processing
set-based (NSB) and boundary-based (BB), for intercluster queryprocessing with bounded rounds of communications. We address the problem of joining ranked results produced by two or more services on the Web. We consider services endowed with two kinds of access that are often available: i) sorted access, which returns tuplessorted by score; ii) random access, which returns tuples matching a given join attribute value. Rank joinoperators combine objects of multiple relations and output the K combinations with the highest aggregate score. Web users and content are increasingly being geo-positioned, and increased focus is being given to serving local content in response to web queries. This development calls for spatial keyword queries that take into account both the locations and textual descriptions of content. We study the efficient, joint processing of multiple topkspatial keyword queries. Such joint processing is attractive during high query loads and also occurs when multiplequeries are used to obfuscate a user's true query.
IEEE 2011
IEEE 2011
YJK17
YJK18
Adaptive Provisioning of Human Expertise in Service-oriented Systems Improving Aggregate Recommendation Diversity Using RankingBased Techniques
IEEE 2011
YJK19
Publishing Search Logs A Comparative Study of
In this paper, we introduce and explore a number of item ranking techniques that can generate 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. In this paper we analyze algorithms for publishing frequent keywords, queries
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
Privacy Guarantees
YJK20
A Link-Analysis Extension of Correspondence Analysis for Mining Relational Databases
YJK21
Adaptive Cluster Distance Bounding for High Dimensional Indexing
YJK22
Discovering Conditional Functional Dependencies
YJK23
Effective Navigation of Query Results Based on Concept Hierarchies
and clicks of a search log. We first show how methods that achieve variants of kanonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured by epsilondifferential privacy unfortunately does not provide any utility for this problem. This work introduces a link analysis procedure for d iscovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. It is based on a random walk model through thedatabase defining a Markov chain having as many states as elements in the database. Suppose we are interested in analyzing the relationships between some elements (or records) contained in two different tables ofthe relational database We consider approaches for similarity search in correlated, highdimensional data sets, which are derived within a clustering framework. We note that indexing by vector approximation (VA-File), which was proposed as a technique to combat the Curse of Dimensionality, employs scalar quantization, and hence necessarily ignores dependencies across dimensions, which represents a source of suboptimality. In this paper, we present the BioNav system, a novel search interface that enables the user to navigate large number of query results by organizing them using the MeSH concept hierarchy. First, the query results are organized into a navigation tree. At each node expansion step, BioNav reveals only a small subset of the concept nodes, selected such that the expected user navigationcost is minimized. In this paper, we propose a novel algorithm, called Semisupervised SemiRiemannianMetric Map (S3RMM), following the geometric framework of semi Riemannian manifolds. S3RMM
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJK24
Learning SemiRiemannian Metrics for Semi supervised Feature Extraction
maximizes the discrepancy of the separability and similarity measures of scatters formulated by using semiRiemannian metric tensors. In this paper, we propose a novel algorithm, called Semisupervised SemiRiemannianMetric Map (S3RMM), following the geometric framework of semi Riemannian manifolds. S3RMM maximizes the discrepancy of the separability and similarity measures of scatters formulated by using semiRiemannian metric tensors. The metric tensor of each sample is learned via semisupervised regression
IEEE 2011
YJK25 YJK26
Load Shedding in Mobile Systems with Mobi Qual Ranking Spatial Data by Quality Preferences
IEEE 2011 A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a 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. Such a neighborhood concept can be specified by the user via different functions IEEE 2011
DOMAIN : NETWORK SECURITY CODE YJS01 PROJECT TITLE Secret Key Agreement from Vector Gaussian Sources by Rate Limited Public Communication DESCRIPTION REFERENCE IEEE 2011 We investigate the secret key agreement from correlate d vector Gaussian sources in which legitimate parties can use public communication with limited ra te. For the class of protocols with oneway public communication, we show that
22135 |
89397 22145 | 044 4218 1385

TTA
YJS02
Detecting Recompression of JPEG Images via Periodicity Analysis of Compression Artifacts for Tampering Detection
YJS03
Privacy-Preserving ECG Classification With Branching Programs and Neural Networks
YJS04
Restoring Degraded Face Images: A Case Study in Matching Faxed, Printed, and Scanned Photos
YJS05
Keys Through ARQ: Theory and Practice
the optimal trade-off between the rate of key generation and the rate of the publiccommunication is characterized as an optimization problem of a Gaussian random variable. In this paper, we present a new technique to discover traces caused by recompression. We assume all source images are in JPEG format and propose to formulate the periodic characteristics of JPEG images both in spatial and transform domains. Using theoretical analysis, we design a robust detection approach which is able to detect either block-aligned or misaligned recompression. The paper deals with all the requirements anddifficulties related to working with data that must stay encrypted during all the computation steps, including the necessity of working with fixed point arithmetic with no truncation while guaranteeing the same performance of a floating point implementation in the plain domain. The purpose of this paper is to illustrate the complexity of face recognition in such realistic scenarios and to provide a viable solution to it. The contributions of this work are two-fold. First, a database of face images is assembled and used to illustrate the challenges associated with matching severely degraded face im ages. Second, a preprocessing scheme with low computational complexity is developed in order to eliminate the noise present in degraded images and restore their quality. This paper develops a novel framework for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and temporal correlation function. Our analysis reveals a novel role of dumb antennas in overcoming
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJS06 Digital Image Authentication From JPEG Headers
YJS07
A Message-Passing Approach to Combating Desynchronization Attacks
YJS08
Nonlinearity Estimation for Specific Emitter Identification in Multipath Channels
YJS09
Physical-Layer Secret Key Agreement in Two-Way Wireless Relaying Systems
YJS10
Secure Type-Based Multiple Access
the negative impact of spatial correlation on the achievable secrecy rates. It is often desirable to determine if an image has been modified in any way from its original recording. The JPEGformat affords engineers many implementation trade-offs which give rise to widely varying JPEG headers. We exploit these variations for image authentication. We propose a new paradigm for blind watermark decoding in the presence of desynchronization attacks. Employing Forney-style factor graphs to model the watermarking system, we cast the blind watermark decoding problem as a probabilistic inference problem on a graph, and solve it via messagepassing. We present a radio frequency (RF) frontend nonlinearity estimator that is based on the knowledge of a training sequence to perform specific emitter identification (SE I), which discerns radio emitters of interest. Design and fabrication variations provide unique signal signatures for each emitter, and we extract those characteristics through the estimation of transmitter nonlinearity coefficients. In thissystem, Alice and Bob share secret keys generated from measured radio propagation characteristics with the help of the relay in the presence of an eavesdropper. We present four secret key agreement schemes: an amplify-and-forward (AF) scheme, a signal-combining amplify-and-forward (SC-AF) scheme, a multiple-access amplify-and-forward (MA-AF) scheme, and an amplify-and-forward with artificial noise (AF with AN) scheme We consider data confidentiality in a distributed detection scenario with a type-based multiple-access (TBMA) protocol where a large set of sensors sends local measurements to an ally
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJS11 Key Agreement Over Multiple Access Channel
YJS12
Strongly Secure Communications Over the Two-Way Wiretap Channel
YJS13
Using a Knowledge-Based Approach to Remove Blocking Artifacts in Skin Images for Forensic Analysis
YJS14
Improved Differential Fault Analysis on AES Key Schedule
YJS15
Blind Forensics of Median Filtering in Digital Images
fusion center (FC) over an insecure wireless medium called the main channel. In this paper, a generalized multiple access channel (MA C) model for secret key sharing between three terminals is considered. In this model, there are two transmitters and a receiver where all three terminals receive noisychannel outputs. We consider the problem of secure communications over the twoway wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit boththe interference at the eavesdropper's terminal and cooperation between legitimate users. In this paper, a knowledgebased (KB) approach, which simultaneouslyremoves JPEG blocking art ifacts, and recovers skin features, is proposed. Given a training set containing both original and compressed skin images, the relationship between original blocks and compressed blocks can be established. This prior information is used to infer the original blocks of compressed evidence images. Differential Fault Analysis (DFA) finds the key of a block cipher using differential information between correct and faulty ciphertexts obtained by inducing faults during the computation of ciphertexts. Among many ciphers Advanced Encryption Standard (AES) has been the main target of DFA due to its popularity. This paper proposes a novel approach for detecting median filtering in digitalimage s, which can 1) accurately detect median filtering in arbitrary image s, even reliably detect median filteringin low-resolution and JPEG compressed images; 2) reliably detect tampering when part of a medianfiltered imageis inserted into a nonmedian-filtered image, or vice versa.
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJS16 Improved Radiometric Identification of Wireless Devices using MIMO Transmission
YJS17
Robust Image Watermarking Based on Multi scale Gradient Direction Quantization
This paper experimentally demonstratesimproved identification acc uracy and reduced sensitivity to identification parameters when such techniques are applied to the multiple transmitters within multiple-input multiple-output devices. It further studies an information theoretic technique for determining which radiometric features are most effective in discriminating devices and analyzes the identification performance as a function of the number of features used. We propose a robust quantizationbased image watermarking scheme, called the gradient direction watermarking(GD WM), based on the uniform quantization of the direction of gradient vectors. In GDWM, the watermark bits are embedded by quantizing the angles of significant gradient vectors at multiple wavelet scales.
IEEE 2011
IEEE 2011
DOMAIN : NETWORKING
CODE YJS01
PROJECT TITLE Cluster-Based Back-Pressure Routing Algorithm the back-pressure algorithmrequires routers to maintain a separate queue for each destination, which precludes its implementation in large-scale networks. In this paper, we propose a distributed cluster-based backpressure routing algorithm that retains the adaptability of backpressure routing while significantly reducing the number of queues that have to be maintained at each node. We extend the analysis of the scaling laws of wireless ad hoc networks to the case of correlated nodes movements, which are commonly found in real mobility processes. We
REFERENCE IEEE 2011
YJS02
Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
consider a simple version of the Reference Point Group Mobility model, in which nodes belonging to the same group are constrained to lie in a disc area, whose center moves uniformly across the network YJS03 On the Price of Security in Large-Scale Wireless Ad Hoc Networks In this paper, based on a general random network model, theasymptotic behaviors of secure throughput and delay with the common transmission range rn and the probability pf of neighboring nodes having a primary security association are quantified when the network size n is sufficiently large. The costs and benefits of secure-link-augmentation operations on the secure throughput and delay are also analyzed. A cross-layer design along with an optimal resource allocation framework is formulated for wireless fadingnetworks, where the nodes are allowed to perform network coding. The aim is to jointly optimize end-to-end transportlayer rates, network code design variabl es, broadcast link flows, link capacities, average power consumption, and shortterm power allocation policies. This paper settles an open question with a positive answer: Optimal traffic engineering (or optimalmulticommodity flow) can be realized using just linkstate routing protocols with hop-byhop forwarding. Today's typical versions of these protocols, Open Shortest Path First (OSPF) and Intermediate SystemIntermediate System (IS-IS), split traffic evenly over shortest paths based on link weights. IEEE 2011
YJS04
Cross-Layer Designs in Coded Wireless Fading Networks With Multicast
IEEE 2011
YJS05
Link-State Routing With Hopby-Hop Forwarding Can Achieve Optimal Traffic Engineering
IEEE 2011
YJS06
Stability and Benefits of
Network utility maximization has been
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
Suboptimal Utility Maximization
widely used to model resource allocation and network architectures. However, in practice, often it cannot be solved optimally due to complexity reasons. Thus motivated, we address the following two questions in this paper: 1) Can suboptimal utility maximization mai ntain queue stability? 2) Can underoptimization of utility objective function in fact benefit other network design objectives? Many congestion control protocols have been recently proposed in order to alleviate the problems encountered by TCP in high-speed networks and wireless links. Protocols utilizing an architecture that is in the same spirit asthe ABR service in ATM networks require estimates of the effective number of use rs utilizing each link in thenetwork to maintain stability in the presence of delays. In thi s paper, we propose a novel estimation algorithm that is based on online parameter identification techniques and is shown through analysis and simulations to converge to the effective number of users utilizing each link In this paper, we utilize multiple frequency channels and design an efficient link scheduling protocol that gives a constant factor approximation on the optimal throughput in delivering aggregated data from all the nodes to the sink. To minimize the maximum delay subject to a given throughput bound, we also design an $(alpha, beta)$-bicriteria approximation algorithm to construct a Bounded-Degree MinimumRadius Spanning Tree, with the radius of thetree at most $beta$ times the minimum possible radius for a given degree bound $Delta^*$, and the IEEE 2011
YJS07
A New Estimation Scheme for the Effective Number of Users in Internet Congestion Control
YJS08
Multichannel Scheduling and Spanning Trees: Throughput Delay Tradeoff for Fast DataCollection in Sensor Networks
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
degree of any node at most $Delta^* + alpha$ , where $alpha$ and $beta$ are positive constants. YJS09 DAC: Generic and Automatic Address Configuration for Data Center Networks In this paper, we present DAC, a generic andautomatic Data center Add ress Configuration system. With an automatically generated blueprint that defines the connections of servers and switches labeled by logical IDs, e.g., IP addresses, DAC first learns the physical topology labeled by device IDs, e.g., MAC addresses. In this paper, we develop a framework for user association in infrastructurebased wireless networks, specifically focused on flowlevel cell load balancing under spatially inhomogeneous traffic distributions. Our work encompasses several different user association policies: rateoptimal, throughput-optimal, delayoptimal, andload-equalizing, which we collectively denote $alpha$optimal user association. Monitoring transit traffic at one or more points in a network is of interest to network operators for reasons oftraffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Previous research in the area has focused on deriving a placement of monitors across the network toward the end of maximizing the monitoringutility of the network operator for a given traffic routing. However, both traffic characteristics and measurement objectives can dynamically change over time, rendering a previously optimal placement of monitors suboptimal. System level modeling is widely employed at early stages of system development for IEEE 2011
YJS10
Distributed -Optimal User Association and Cell Load Balancing in Wireless Networks
IEEE 2011
YJS11
MeasuRouting: A Framework for Routing Assisted Traffic Monitoring
IEEE 2011
YJS12
Automatic Generation of Assertions from System Level Design Using Data Mining
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
simplifying designverification and architectural exploration. Assertion based verification has become a well established part of RTL verification methodology. In the traditional assertion based verification flow, assertions are manually written. In this paper, we generate assertions from system level d esigns using GoldMine, an automatic assertion generationengin e that uses data mining and static analysis. YJS13 Spatial Correlation and MobilityAware Traffic Modeling for Wireless Sensor Networks In this paper, a novel trafficmodeling scheme for capturi ng these dynamics is proposed that takes into account the statistical patterns of node mobility and spatial correlation. The contributions made in this paper are twofold. First, it is shown that the joint effects of mobility and spatial correlation can lead to bursty traffic. More specifically, high mobilityvariance and small spatial c orrelation can give rise to pseudo-longrange-dependent (LRD) traffic (high burstytraffic), whose autocorrelation function decays slowly and hyperbolically up to a certain cutoff time lag. Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this paper, we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate thistraffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. In this work, we develop the mathematical framework and novel design methodologies needed to support IEEE 2011
YJS14
Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection
IEEE 2011
YJS15
A Unified Approach to Optimizing Performance in Networks serving
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
Heterogeneous Flows
such heterogeneous requirements and propose provably optimal network algorithms that account for the multilevel interactions between the flows. To that end, we first formulate a network optimization problem that incorporates the above throughput and service prioritization requirements of the two traffic types. We, then develop a distributed joint load-balancing and congestion control algorithm that achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the fixed throughput and prioritization requirements of the inelastic flows This paper focuses on designing and analyzing throughputoptimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, andpotentially improve the delay performance, for multihop wireless networks under general interference constraints In this paper, we unify the aforementioned thrusts by defining and studying the selfish neighbor selection (SNS) game and its application to overlay routing. At the heart of SNS stands the restriction that peers are allowed up to a certain number of neighbors. This makes SNS substantially different from existingnetwork formation games that impose no bounds on peer degrees. Having bounded degrees has important practical consequences as it permits the creation of overlay structures that require $O(n)$ instead of $O(n^2)$link monitoring overhead. IEEE 2011
YJS16
Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks
YJS17
Selfish Overlay Network Creation and Maintenance
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
DOMAIN : PARALLEL DISTRIBUTION
CODE YJP01
PROJECT TITLE EBRP: Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks n this paper, enlightened by the concept of potential in common physics, we design an EnergyBalanced Routing Protocol (EBRP) by constructing a mixed virtual potential field, including depth, energy density and residual energy to force packets to move towards the sink through the dense energy area so as to protect the nodes with relatively low residual energy. The design principle and guidelines are presented in detail. This paper proposes a new load distribution model aiming to minimize the difference among end-toend delays, thereby reducing packet delay variation and risk of packet reordering without additional network overhead. In general, the lower the risk of packet reordering, the smaller the delay induced by the packet reordering recovery process, i.e., extra delay induced by the packet reordering recovery process is expected to decrease. We examine the problem of tracking dynamic boundaries occurri ng in natural phenomena using a network of range sensors. Two main challenges of the boundary tracking problem are accurate boundary estimation from noisy observations and continuous tracking of the boundary. We propose Dynamic Boundary Tracking ( DBTR), an algorithm that combines the spatial estimation and temporal
REFERENCE IEEE 2011
YJP02
Effective Delay-Controlled Load Distribution over Multipath Networks
IEEE 2011
YJP03
Tracking Dynamic Boundaries using Sensor Network
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJP04 CACAO: Distributed ClientAssisted Channel Assignment Optimizationfor Uncoordinated WLANs
estimation techniques. In CACAO, the clients feed back traffic information to their APs. This leads to better network condition knowledge and betterchannel assignment decisions at the APs. We conduct extensive simulation study and comparisons using Network Simulator 2 (NS2). Our results show that CACAO outperforms other traditional and recent schemes in terms of TCP and UDP throughputs with a similar level of fairness. This article presents Athanasia, a usertransparent and faulttolerant system, for parallel application s running on large-scale cluster systems. Cluster systems have been regarded as a de facto standard to achieve multitera-flop computing power. These cluster systems, as we know, have an inherent failure factor that can cause computation failure. The reliability issue in parallel computing systems, therefore, has been studied for arelatively long time in the literature, and we have seen many theoretical promises arise from the extensive research. Inthis paper, we propose a novel bandwidthefficient cooperative authentication (BE CAN) scheme for filteringinjected false data. Based on the random graph characteristics of sensor node deployment and the cooperativebitcompressed authentication technique, the proposed BECAN scheme can save energy by early detecting andfiltering the majority of injected false data with minor extra overheads at the en-route nodes. IEEE 2011
YJP05
Athanasia: A UserTransparent and FaultTolerant System for Parallel Applications
IEEE 2011
YJP06
BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJP07 Delay Constrained Subtree Homeomorphism Problem with Applications
Virtual world and other collaborative applications are increasingly becoming popular among Internet users. In such applications, users interact with each other through digital entities or avatars. In order to preserve the user experience, it is important that certain Quality of Service (QoS) requirements (e.g. delay, bandwidth) are satisfied by the interactions. These QoS requirements are usually defined by the application designer. Whenapplications with such QoS requirements are being deployed on a network of servers, an appropriate set of servers capable of satisfying the QoS constraints of the interactions must be identified. In this article we show the hexagonal mesh networks develope d in the early 1990s are a special case of the EJnetworks that have been considered more recently. Using a node addressing scheme based on the EJ number system, we give a shortest path routing algorithm for hexagonal mesh n etworks. This paper proposes predict and relay (PER), an efficient routing algorithm for DTNs, where nodes determine the probability distribution of future contact times and choose a proper nexthop in order to improve the end-to-end delivery probability. The algorithm is based on two observations: one is that nodes usually move around a set of well-visited landmark points instead of moving randomly; the other is that node mobility behavior is semideterministic and could be predicted once there is sufficient mobility history information. Self-stabilization is a versatile approach
IEEE 2011
YJP08
Efficient communication algorithms in hexagonal mesh interconnection networks
IEEE 2011
YJP09
An Efficient Prediction-based Routing in DisruptionTolerant Networks
IEEE 2011
YJP10
Bounding the Impact of
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
Unbounded Attacks in Stabilization
to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of all memories in the system. Byzantine tolerance is an attractive feature of distributed systems that permits to cope with arbitrary malicious behaviors. Combining these two properties proved difficult: it is impossible to contain the spatial impact of Byzantine nodes in a self-stabilizing context for global tasks such as tree orientation and tree construction. In this paper, we propose a policy that allows links to transmit data in any future frame by means of frame reservations. The new, reservationbased distributed scheduling approach will improve the capacity of the system and provide greater throughput. This paper proposes three authentication schemes to remove those security vulnerabilities. First, we prevent replay attacks on data messages by inserting Request Counter (RC) into request messages. Second, we also use RC to detect integrity attacks on control messages. Third, we propose a new counter, referred to as GCC Counter (GC), to protect the global counter messages. We simulated our design with SPLASH-2 benchmarks on up to 16processor sharedmemory multiprocess or systems by using Simics with Wisconsin multifacet General ExecutiondrivenMultiprocessor Simulator (GEMS). IEEE 2011
YJP11
Stability Analysis of Reservation-Based Scheduling Policies in Wireless Networks
YJP12
Fast Secure Communications in Shared Memory Multiprocessor Systems
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
CODE YJI01 PROJECT TITLE A Generalized Accelerated Proximal Gradient Approach for Total Variation-Based Image Restoration DESCRIPTION
DOMAIN : IMAGE PROCESSING REFERENCE IEEE 2011
This paper proposes a generalized accelerated proximal gradient (GAPG) approach for solving total variation(TV)based image restoration problems. The GAPG algorithm generalizes the original APG algorithm by replacing the Lipschitz constant with an appropriate positive-definite matrix, resulting in faster convergence. For TVbasedimage restoration problems, we further introduce two auxiliary variables that approximate the partial derivatives. Constraints on the variables can easily be imposed without modifying the algorithm much, and the TV regularization can be either isotropic or anisotropic. In this paper, the phase unwrappingproblem is abstracted as solving a largescale system of inconsistent linear equations. With the difficulties oflargescale phase unwrapping analyzed, L 0 -norm criterion is found to have potentials in efficient image tiling andsplicing. Making use of the clustering characteristic of residue distribution, a tiling strategy is proposed for L0-norm criterion. Unfortunately, L0-norm is an NP-hard problem, which is very difficult to find an exact solution in a polynomial time. Digital imaging devices are increasingly used for color measurements in fields such as forensics, the food industry, and ecological and medical research. Especially concerning the skin, in the follow-up of benign or malignant
YJI02
Residues Cluster Based Segmentation and OutlierDetection Method for LargeScale Phase Unwrapping
IEEE 2011
YJI03
An a priori shading correction technique for contact imaging devices
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
YJI04
Spread Spectrum Image Watermarking Based on Perceptual Quality Metric
lesions, it is crucial to ensure that the measured colors are accurate and reproducible. Several color calibration methods having been presented over the last few years Efficient image watermark calls for full exploitation of the perceptual distortion constraint. Second-order statistics of visual stimuli are regarded as critical features for perception. This paper proposes a second-order statistics (SOS) based image quality metric, which considers the texture masking effect and the contrast sensitivity in Karhunen-Love transform domain. Hysteresis thresholding is a method that offers enhanced object detection. Due to its recursive nature, it is time consuming and requires a lot of memory resources. This makes it avoided in streaming processors with limitedmemory. We propose two versions of a memoryefficient and fast architecture for hy steresis thresholding: a highaccuracy pixelbased architecture and a faster block-based one at the expense of some loss in the accuracy. In this paper, we propose a novel probabilistic modelbased fusion technique for multiexposure images. Unlike previousmultiexposure fusion methods, our method aims to achieve an optimal balance between two quality measures, i.e., local contrast and color consistency, while combining the scene details revealed under different exposures. We propose an orientationfree edge strength lter and apply it
IEEE 2011
YJI05
Memory-Efficient Architecture for Hysteresis Thresholding and Object Feature Extraction
IEEE 2011
YJI06
Generalized Random Walks for Fusion of Multi-Exposure Images
IEEE 2011
YJI07
Edge Strength Filter Based Color Filter Array
IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
Interpolation
to the demosaicing problem. Edge strength lter output is utilized both to improve the initial green channel interpolation and to apply the constant color dierence rule adaptively. This simple edge directed method yields visually pleasing results with high CPSNR. mage processing methods that utilize characteristics of the human visual system require color spaces with certain properties to operate effectively. After analyzing different types of perceptionbased image processingproblems, we present a list of properties a unified color space sho uld have. Due to contradictory perceptual phenomena and geometric issues a color space cannot incorporate all these properties. In compressive sensing (CS) a challenge is to find a space in which the signal is sparse and hence recoverable faithfully. Since many natural signals such as images have locally varying statistics, the sparse space varies in time/spatial domain. As such, CS recovery should be conducted in locally adaptive, signal-dependent spaces to counter the fact that the CS measurements are global and irrespective of signal structures IEEE 2011
YJI08
Towards a Unified Color Space for Perception-Based Image Processing
YJI09
Model-guided Adaptive Recovery of Compressive Sensing
IEEE 2011
DOMAIN : MOBILE COMPUTING CODE YDM01 YDM02 PROJECT TITLE Providing Secure Integrity in Peer-to-peer Oriented Mobile Environments RAM: Rate Adaptation in Mobile Environments IEEE IIEEE REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
YDM03 Robust Relative Location Estimation in Wireless Sensor Networks with Inexact Position Problems On the Cost of Knowledge of Mobility in Dynamic Networks: An Information-Theoretic Approach A Novel MAC Scheme for Multi-Channel Cognitive Radio Ad Hoc Networks Efficient Virtual Backbone Construction with Routing Cost Constraint in Wireless Networks using Directional Antennas Color Based Fruits Classification Using GPU Wireless Multicast Optimization : A Cross-Layer Approach Web Content Recommender System based on Consumer Behavior Modeling STORM: A Framework for Integrated Routing, Scheduling and Traffic Management in Ad Hoc Networks Throughput Optimization in Mobile Backbone Networks IEEE
YDM04
IEEE
YDM05 YDM06
IEEE IEEE
YDM07 YDM08 YDM09 YDM10
IIEEE IEEE IEEE IEEE
YDM11
IEEE
DOMAIN : KNOWLEDGE AND DATA ENGINEERING CODE YDK01 PROJECT TITLE Motion Segmentation in the Presence of Outlying, Incomplete, or Corrupted Trajectories Segmentation and Sampling of Moving Object Trajectories based on Representativeness A Query Formulation Language for the Data Web Optimizing Multiway Joins in DESCRIPTION IEEE REFERENCE
YDK02
IIEEE
YDK03 YDK04
IEEE IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
YDK05 a Map-Reduce Environment A Survey on Graphical Methods for Classification Predictive Performance Evaluation Efficient and Accurate Discovery of Patterns in Sequence Data Sets Energy Efficient Schemes for Accuracy-Guaranteed Sensor Data Aggregation using Scalable Counting Optimizing the Calculation of Conditional Probability Tables in Hybrid BayesianNetworks using Binary Factorization A performance anomaly detection and analysis framework for DBMS development Increasing retrieval quality in conversational recommenders Optimizing Multiway Joins in a Map-Reduce Environment Coupled Behavior Analysis with Applications Cascading spatio-temporal pattern discovery Mining Order-Preserving Submatrices from Data with Repeated Measurements Network Similarity Decomposition (NSD): A Fast and Scalable Approach to NetworkAlignment Data Integrity Proofs in Cloud Storage Efficient Computation of Range Aggregates against Uncertain Location Based Queries Exploring Application-Level Semantics for Data Compression Monitoring Service Systems from a Language-Action Perspective IEEE
YDK06 YDK07
IEEE IIEEE
YDK08
IEEE
YDK09
IEEE
YDK10 YDK11 YDK12 YDK13 YDK14 YDK15
IEEE IEEE IEEE IEEE IIEEE IEEE
YDK16 YDK17
IEEE IEEE
YDK18 YDK19
IEEE IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
YDK20 One Size Does Not Fit All: Towards User- and QueryDependent Ranking For Web Databases Optimal service pricing for a cloud cache A Personalized Ontology Model for Web Information Gathering Scalable Learning of Collective Behavior The World in a Nutshell: Concise Range Queries Decision Trees for Uncertain Data The CoQUOS Approach to Continuous Queries in Unstructured Overlays IEEE
YDK21 YDK22 YDK23 YDK24 YDK25 YDK26
IIEEE IEEE IEEE IIEEE IEEE IEEE
DOMAIN : MOBILE COMPUTING(j) CODE SJM01 PROJECT TITLE Continuous Monitoring of Spatial Queries in Wireless Broadcast SJM02 Energy Maps For Mobile Wireless networks coherence Time Versues Spreding Period SJM03 Energy-Efficient SINRBased Routing for Multihop Wireless SJM04 Mitigation of Control Channel Jamming Under Node Capture Attacks SJM05 Mobility Management IEEE-2009 IEEE-2009 IEEE-2009 IEEE-2009 DESCRIPTION IEEE-2009 REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
Approaches for Mobile IP Networks SJM06 SJM07 SIMPS Using Sociology for Personal Mobility Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks SJM08 Bandwidth Estimation for IEEE 802.11Based Ad Hoc Networks SJM09 Location Based Spatial Query Processing In Wireless Broadcast Environments SJM10 Bandwidth Efficient Video Multicasting in Multiradio Muilticellular Wireless IEEE-2008 IEEE-2008 IEEE-2008 IEEE-2009 IEEE-2008
DOMAIN : NETWORK COMPUTING CODE SJN01 PROJECT TITLE Measuring Capacity Bandwidth of Targeted Path Segments Evaluating the Vulnerability of Network Traffic Using Joint DESCRIPTION IEEE-2009 REFERENCE
SJN02
IEEE-2009
22135 |
89397 22145 | 044 4218 1385

TTA
SJN03 SJN04 Capturing Router Congestion and Delay Multiple Routing Configurations for Fast IP Network Recovery SJN05 Residual-Based Estimation of Peer and Link Lifetimes in P2P Networks SJN06 Spatio-Temporal Network Anomaly Detection by Assessing Deviations of Empirical Measures A Geometric Approach to Improving Active Packet Loss Measurement Benefit Based Data Caching In Ad Hoc Networks SJN09 Minimizing File Download Time in Stochastic Peer-toPeer Networks SJN10 Rate & Delay Guarantees Provided By Close Packet Switches with Load Balancing SJN11 Performance of a Speculative Transmission Scheme for SchedulingLatency Reduction IEEE-2009 IEEE-2009 IEEE-2009 IEEE-2009 IEEE-2009 IEEE-2009 IEEE-2009
SJN07
IEEE-2009
SJN08
IEEE-2009
22135 |
89397 22145 | 044 4218 1385

TTA
SJN12 Dual-Link Failure Resiliency through Backup Link Mutual Exclusion SJN13 BRA A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks Securing UserControlled Routing Infrastructures Two Techniques for Fast Computation of Constrained Shortest Paths Predictive Job Scheduling in a Connection Limited System using Parallel Genetic Algorithm A Distributed Database Architecture for Global Roaming in Next-Generation Mobile Networks Location Aided Routing In Mobile ADHOC Networks SJN19 IEEE-2007 An AcknowledgmentBased Approach For The Detection Of Routing Misbehavior In MANETs XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks SJN21 A near-optimal multicast scheme for mobile ad hoc IEEE-2005 IEEE-2004 IEEE-2009 IEEE-2009
SJN14
IEEE-2009
SJN15
IEEE 2008
SJN16
IEEE-2005
SJN17
IEEE-2004
SJN18
IEEE-2004
SJN20
22135 |
89397 22145 | 044 4218 1385

TTA
networks using a hybrid genetic algorithm SJN22 Network border patrol: preventing congestion collapse and promoting fairness in the Internet SJN23 An Agent Based Intrusion Detection, Response and Blocking using signature method in Active Network. SJN24 ITP: An Image Transport Protocol for the Internet SJN25 SJN26 Performance Evaluation of RMI Genetic Algorithm Based Train Simulation Using Concurrent Engineering SJN27 SJN28 Public Key Validation for DNS security Extension Homogenous Network Control and Implementation IEEE REFERENCE IEEE REFERENCE IEEE REFERENCE IEEE REFERENCE IEEE-2002 IEEE-2006 IEEE-2004
DOMAIN : DISTRIBUTE COMPUTING(j) CODE SJD01 PROJECT TITLE Detecting Malicious Packet Losses DESCRIPTION IEEE-2009 REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
SJD02 A Distributed Stream Query Optimization Framework through Integrated Planning and Deployment SJD03 SJD04 QUIVER Consistent Object Sharing For Edge Services Efficient and Secure Content Processing and Distribution by Cooperative Intermediaries Efficient and Secure Content Processing and Distribution by Cooperative Intermediaries Distributed cache updating for the Dynamic source routing protocol IEEE-2008 IEEE-2008 IEEE-2009
SJD05
IEEE-2008
SJD06
IEEE-2006
DOMAIN : SECURE COMPUTING CODE SJS01 PROJECT TITLE Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing SJS02 Dynamic Routing with Security Considerations SJS03 Modeling & Automated Containment of Worms Controlling IP IEEE-2008 IEEE-2009 DESCRIPTION IEEE-2009 REFERENCE
SJS04
IEEE-2008
22135 |
89397 22145 | 044 4218 1385

TTA
SJS05 Spoofing Through Inter Domain Packet Filters Protection of Database Security via Collaborative Inference Detection A Precise Termination Condition of the Probabilistic Packet Marking Algorithm An Adaptive Programming Model for Fault-Tolerant Distributed Computing Hybrid Intrusion Detection with Weighted Signature Generation over Anomalous Internet Episodes (HIDS) SJS09 Application of BPCS steganography to wavelet compressed video IEEE-2004 IEEE-2008
SJS06
IEEE-2008
SJS07
IEEE-2007
SJS08
IEEE-2007
DOMAIN : IMAGE PROCESSING CODE SJI01 PROJECT TITLE Adaptive Fuzzy IEEE-2009 REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
Filtering for Artifact Reduction in Compressed Images and Videos SJI01 Facial Recognition using multisensor images based on localized kernel eigen spaces SJI03 SJI04 Face Recognition Using Laplacian faces Noise Reduction by Fuzzy Image Filtering Image Processing SJI05 Online Handwritten Script Recognition Image Processing SJI06 Structure and Texture Filling-In of Missing Image Blocks in Wireless Transmission and Compression App SJI07 Image Stream Transfer Using RealTime Transmission Protocol SJI08 Personal Identification Based On Iris Texture Analysis Personal Authentication Using 3-D Finger Geometry SJI10 Image Compression IEEE REFERENCE IEEE-2003 IEEE-2006 IEEE-2004 IEEE-2004 IEEE-2005 IEEE-2006 IEEE-2009
SJI09
IEEE-2006
22135 |
89397 22145 | 044 4218 1385

TTA
and De-compression SJI11 Java water marking and image combustion IEEE REFERNCE
DOMAIN : DATA MINING SJDM01 Online Index Recommendations for High-Dimensional Databases Using Query Workloads SJDM02 A Signature-Based Indexing Method for Efficient ContentBased Retrieval of Relative Temporal Pattern SJDM03 An Efficient Association Rule Mining Algorithm In Distributed Databases SJDM04 Truth Discovery with multiple Conflicting Information Providers on web ODAM: An Optimized SJDM05 Distributed Association Rule Mining Algorithm SJDM06 GHIC A Hierarchical Pattern-Based Clustering Algorithm for Grouping Web Transactions DOMAIN : MULTIMEDIA CODE PROJECT TITLE
IEEE-2008
IEEE-2008
IEEE-2008
IEEE-2008
IEEE-2004
IEEE-2005
DESCRIPTION
REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
SJMUO1 Mobile Agents In Distributed Multimedia Database Systems IEEE-2004
DOMAIN : MOBILE COMPUTING CODE SDM01 PROJECT TITLE A Gen2-based RFID Authentication Protocol for Security and Privacy SDM02 A Tabu Searching Algorithm For Cluster Building in Wireless Sensor Networks SDM03 Biased Random Walks in Uniform Wireless Networks SDM04 Cell Breathing Techniques for Load Balancing in Wireless LANs SDM05 Greedy Routing with Anti-Void Traversal for Wirless Sensor Networks SDM06 Information ContentBased Sensor Selection and Transmission Power Adjustment for Collaborative Target IEEE IEEE IEEE IEEE IEEE DESCRIPTION IEEE-2009 REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
Tracking SDM07 Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks SDM08 On the Planning of Wireless Sensor Networks EnergyEfficient Clustering under the Joint Rout Random Cast An Energy Efficient Communication Scheme for Mobile Ad Hoc Networks Route Stability in MANETs under the Random Direction Mobility Model Large Connectivity for Dynamic Random Geometric Graphs IEEE IEEE
SDM09
IEEE
SDM10
IEEE
SDM11
IEEE
DOMAIN : NETWORK COMPUTING CODE SDN01 PROJECT TITLE Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks Delay Analysis for Maximal Scheduling With Flow Control in Wireless Networks With Bursty Traffic Explicit Load Balancing Technique for NGEO Satellite Ip Networks With OnBoard Processing Capabilities Resequencing Analysis of Stop-and-Wait ARQ DESCRIPTION IEEE-2009 REFERENCE
SDN02
IEEE-2009
SDN03
IEEE-2009
SDN04
IEEE-2009
22135 |
89397 22145 | 044 4218 1385

TTA
for Parallel Multichannel Communications SDN05 PRESTO FeedbackDriven Data Management in Sensor Networks Resource Allocation in OFDMA Wireless Communications Systems Supporting Multimedia Services Secure and PolicyComplaint Source Routing Single-Link Failure Detection in AllOptical Networks Using Two Blocking Algorithm on Adaptive Binary Splitting Single and Pair Resolutions for RFID Tag Identification SDN10 SDN11 Virus Spread in Networks Rate Allocation & Network Lifetime Problem for Wireless Sensor Networks Probabilistic Packet Marking For Large Scale IP Trace Back SDN13 Statistical Techniques for Detecting Traffic Anomalies through Packet Header Data SDN14 Efficient Broadcasting IEEE-2005 IEEE-2008 IEEE-2008 IEEE-2009 IEEE-2009
SDN06
IEEE-2009
SDN07 SDN08
IEEE-2009 IEEE-2009
SDN09
IEEE-2009
SDN12
IEEE-2008
22135 |
89397 22145 | 044 4218 1385

TTA
with Guaranteed Coverage in Mobile Ad Hoc Networks SDN15 Multiple Ant Colonies Optimization for Load Balancing in Distributed Systems IEEE REFERNCE
DOMAIN : DISTRIBUTE COMPUTING CODE SDD01 PROJECT TITLE Compaction of Schedules and a TwoStage Approach for Duplication-Based DAG Scheduling Enforcing MinimumCost Multicast Routing against Shelfish Information Flows Movement-Assisted Connectivity Restoration in Wireless Sensor and HBA Distributed Metadata Management for Large ClusterBased Storage Systems DESCRIPTION IEEE-2009 REFERENCE
SDD02
IEEE-2009
SDD03
IEEE-2009
SDD04
IEEE
DOMAIN : SECURE COMPUTING CODE SDS01 PROJECT TITLE Performance of Orthogonal Fingerprinting Codes under Worst-Case Noise Spread-Spectrum Watermarking Security DESCRIPTION IEEE-2009 REFERENCE
SDS02
IEEE-2009
22135 |
89397 22145 | 044 4218 1385

TTA
SDS03 The Effectiveness of Checksums for Embedded Control Networks SDS04 On the Security of Route Discovery in MANETs SDS05 Steganography for Hiding Data in Wave Audio Files Hiding messages in the Noise of a Picture IEEE REFERNCE IEEE-2009 IEEE-2009
SDS06
IEEE REFERNCE
DOMAIN : IMAGE PROCESSING CODE SDJ01 PROJECT TITLE Adaptive Fuzzy Filtering for Artifact Reduction in Compressed Images and Videos Facial Recognition using multisensor images based on localized kernel eigen spaces SDJ03 Active Learning Methods for Interactive Image Retrieval SDJ04 Vision Based Processing For RealTime 3-D Data Acquisition Based On Coded Structured Light IEEE-2008 IEEE-2008 DESCRIPTION IEEE-2009 REFERENCE
SDJ02
IEEE-2009
22135 |
89397 22145 | 044 4218 1385

TTA
SDJ05 Efficient 2-D Grayscale Morphological Transformations With Arbitraly Flat Structuring Elements Image Processing Techniques for the Detection and Removal of Cracks in Digitized Paintings Neural Networks for Unicode Optical Character Recognition SDJ08 SDJ09 SDJ10 Back Propagation Neural Network for Image Recognition Image Processing for Edge Detection Hopfield model of neural network for pattern recognition IEEE REFERENCE IEEE REFERENCE IEEE REFERENCE IEEE-2008
SDJ06
IEEE-2006
SDJ07
IEEE-2004
DOMAIN :
CODE SDDM01
PROJECT TITLE Hardware enhanced association rule mining with Hashing and Pipelining Watermarking Relational Databases Using Optimization Based Techniques Workflow Mining Discovering Process Models from Event Logs
DESCRIPTION IEEE-2008
REFERENCE
SDDM02
IEEE-2008
SDDM03
IEEE-2004
22135 |
89397 22145 | 044 4218 1385

TTA
DOMAIN : NETWORKING CODE SDN01 PROJECT TITLE Efficient Routing In Intermittently Connected Mobile Networks The Multiple Copy Case DESCRIPTION IEEE 2008
REFERENCE
DOMAIN : MULTIMEDIA CODE SDMU01 PROJECT TITLE Orthogonal Data Embedding for Binary Images in Morphological Transform DomainA High-Capacity Approach DESCRIPTION IEEE2008 REFERENCE
DOMAIN : TRANSPORTATION SYSTEM CODE SDT01 PROJECT TITLE Fuzzy Control Model Optimization for Behavior-Constent Traffic Routing Under Information Provision REFERENCE IEEE-2008
DOMAIN : SOFTWARE ENGINEERING CODE SDSE01 PROJECT TITLE Estimation of Defects Based On Defect Decay Model ED3M DESCRIPTION IEEE-2008 REFERENCE
DOMAIN : DATA MINING CODE PROJECT TITLE DESCRIPTION REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
JJD01 JJD02 Answering Frequent Probabilistic Inference Queries in Databases A Dual Framework and Algorithms for Targeted Online Data Delivery A Fuzzy SelfConstructing Feature Clustering Algorithm for Text Classification A Link-Analysis Extension of Correspondence Analysis for Mining RDs Adaptive Cluster Distance Bounding for High Dimensional Indexing Adaptive Provisioning of Human Expertise in Service-oriented Systems Data Integrity Proofs in Cloud Storage Decision Trees for Uncertain Data Discovering Conditional Functional Dependencies Effective Navigation of Query Results Based on Concept Hierarchies Efficient Computation of Range Aggregates against Uncertain Location Based Queries Exploring ApplicationLevel Semantics for Data Compression Extended XML Tree Pattern Matching: Theories and Algorithms Improving Aggregate Recommendation IEEE IEEE
JJD03
IEEE
JJD04
IEEE
JJD05
IEEE
JJD06
IEEE
JJD07 JJD08 JJD09 JJD10
IEEE IEEE IEEE IEEE
JJD11
IEEE
JJD12
IEEE
JJD13
IEEE
JJD14
IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
JJD15 Diversity Using Ranking-Based Techniques Integration of Sound Signature in Graphical Password Authentication System Learning SemiRiemannian Metrics for Semi supervised Feature Extraction One Size Does Not Fit All: Towards User- and Query-Dependent Ranking For Web Databases Ranking Spatial Data by Quality Preferences Scalable Learning of Collective Behavior The CoQUOS Approach to Continuous Queries in Unstructured Overlays The World in a Nutshell:Concise Range Queries Estimating the Helpfulness and Economic Impact of Product Reviews: MiningText and Reviewer Characteristics Publishing Search Logs A Comparative Study of Privacy Guarantees IEEE
JJD16
IEEE
JJD17
IEEE
JJD18 JJD19 JJD20
IEEE IEEE IEEE
JJD21
IEEE
JJD22
IEEE
JJD23
IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
DOMAIN : CLOUD COMPUTING CODE PROJECT TITLE JJC01 Going Back and Forth: Efficient Multideployment and Multisnapshotting on Clouds Improving Utilization of Infrastructure 26 Secure and Practical Outsourcing of Linear Programming in Cloud Computing Optimal service pricing for a cloud cache Automated Certification for Compliant Cloudbased Business Processes DESCRIPTION IEEE
REFERENCE
JJC02 JJC03
IEEE IEEE
JJC04 JJC05
IEEE IEEE
DOMAIN : SERVICE COMPUTING CODE PROJECT TITLE JJS01 Vulnerability Analysis in SOA-based Business Processes
DESCRIPTION REFERENCE IEEE
DOMAIN : WEB SERVICE CODE PROJECT TITLE JJW01 A Personalized Ontology Model for Web Information Gathering
DESCRIPTION REFERENCE IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
DOMAIN : MOBILE COMPUTING CODE PROJECT TITLE JJM01 A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks Optimal Stochastic Location Updates in Mobile Ad Hoc Networks Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks Throughput Optimization in Mobile Backbone Networks Load Shedding in Mobile Systems with MobiQual Cognitive Radio based Wireless Sensor Network Architecture for Smart Grid Utility A Cooperative Diversity- Based Robust MAC Protocol in Wireless Ad Hoc Performance C haracterization for IEEE 802.11p Network With Single Channel Devices Energy Efficiency of MAC protocols in Wireless Sensor Networks Energy efficient localized routing algorithm for Wireless Sensor Networks Energy Efficient Routing Protocol for Wireless Sensor Networks with Node and Sink Mobility DESCRIPTION IEEE
REFERENCE
JJM02
IEEE
JJM03
IEEE
JJM04 JJM05 JJM06
IEEE IEEE IEEE
JJM07
IEEE
JJM08
IEEE
JJM09
IEEE
JJM10
IEEE
JJM011
IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
JJM012 Dynamic Location Update Scheme for Mobile Sinks in Wireless Sensor Networks 98 Modeling and Improving TCP Performance over Cellular Link with Variable Bandwidth Expected Routing Overhead for Location Service in MANETs under Flat Geographic Routing Temporal Link Signature Measurements for Location Distinction IEEE
JJM013
IEEE
JJM014
IEEE
JJM015
IEEE
DOMAIN : NETWORK AND SERVICE MANAGEMENT CODE PROJECT TITLE DESCRIPTION JJN01 Locating Equivalent Servants over P2P Networks IEEE
REFERENCE
DOMAIN : NETWORK COMPUTING CODE JJN01 PROJECT TITLE Improved division by invariant integers DESCRIPTION IEEE REFERENCE
DOMAIN : PARALLEL AND DISTRIBUTED COMPUTING CODE PROJECT TITLE DESCRIPTION
REFERENCE
22135 |
89397 22145 | 044 4218 1385

TTA
JJP01 A Generic Framework for Three-Factor Authentication: Preserving Security and Privacy in Distributed Systems Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud IEEE
JJP02
IEEE
DOMAIN : SECURE COMPUTING CODE PROJECT TITLE JJS01 A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree A Fault-Tolerant TokenBased Atomic Broadcast Algorithm A Policy Enforcing Mechanism for Trusted Ad Hoc Networks A Tamper-Resistant Programming Language System Adaptive Fault Tolerant QoS Control Algorithms for Maximizing System Lifetime of Query-Based Wireless Sensor Networks Balancing Revocation and Storage Trade-Offs in Secure Group Communication
DESCRIPTION IEEE
REFERENCE
JJS02 JJS03 JJS04 JJS05
IEEE IEEE IEEE IEEE
JJS06
IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
JJS07 Chip Self-Organization and Fault-Tolerance in Massively Defective Multicore Arrays Comparative Evaluation of Spoofing Defenses 48 Mechanism DesignBased Secure Leader Election Model for Intrusion Detection in MANET Modeling and Detection of Camouflaging Worm Nymble: Blocking Misbehaving Users in Anonymizing Networks RITAS: Services for Randomized Intrusion Tolerance Robust Correlation of Encrypted Attack Traffic through Stepping Stones by Flow Watermarking SAT: A Security Architecture AchievingAnonymity and Traceability in Wireless Mesh Networks The Geometric Efficient Matching Algorithm for Firewalls Analyzing a Family of Key Protection Schemes against Modification Attacks Distributed Detection of Clone Attacks in Wireless Sensor Network Prime: Byzantine Replication under Attack Securing Topology Maintenance Protocols for Sensor Networks ELMO: Energy Aware Local Monitoring in IEEE
JJS08 JJS09
IEEE IEEE
JJS10 JJS11 JJS12 JJS13
IEEE IEEE IEEE IEEE
JJS14
IEEE
JJS15 JJS16
IEEE IEEE
JJS17
IEEE
JJS18 JJS19 JJS20
IEEE IEEE IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
Sensor Networks
DOMAIN : SOFTWARE ENGINEERING CODE PROJECT TITLE JJSE01 A Comparative Study of Software Model Checkers as Unit Testing Tools:An Industrial Case Study JJSE02 Developing a Single Model and Test Prioritization Strategies for Event-Driven Software JJSE03 Genetic Algorithms for Randomized Unit Testing JJSE04 Semi-Proving: An Integrated Method for Program Proving, Testing, and Debugging JJSE05 Software Module Clustering as a Multi Objective Search Problem JJSE06 The Awareness Network, To Whom Should I Display My Actions? And, Whose Actions Should I Monitor? JJSE07 Verifying the Evolution of Probability Distributions Governed by a DTMC
DESCRIPTION IEEE
REFERENCE
IEEE
IEEE IEEE
IEEE
IEEE
IEEE
DOMAIN : WIRELESS COMMUNICATION
22135 |
89397 22145 | 044 4218 1385

TTA
CODE JJW01 PROJECT TITLE A Spatiotemporal Approach for Secure Range Queries in Tiered Sensor Networks A Threshold-Selective Multiuser Downlink MACscheme for 802.11n Wireless Networks Blind Channel Estimation for STBC Systems Using HigherOrder Statistics Distributed Adaptation of Quantized Feedback for Downlink Network MIMO Systems Fundamental Limits of Information Dissemination in Wireless Ad Hoc NetworksPart II: Multi-Packet Reception Generalized Analysis of a Distributed Energy Efficient Algorithm for Change Detection Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design Network Coding Based Privacy Preservation against Traffic Analysis in Multi-hop Wireless Networks Throughput Optimization in High Speed DownlinkPacket Access (HSDPA) Utility-Optimal MultiPattern Reuse in MultiCell Networks Weighted Energy Detection for Noncoherent UltraWideband Receiver DESCRIPTION IEEE
REFERENCE
JJW02
IEEE
JJW03
IEEE
JJW04
IEEE
JJW05
IEEE
JJW06
IEEE
JJW07
IEEE
JJW08
IEEE
JJW09
IEEE
JJW10 JJW11
IEEE IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
Design
DOMAIN : NETWORKING CODE PROJECT TITLE JJN01 A Unified Approach to Optimizing Performance in Networks serving Heterogeneous Flows JJN02 Buffer Sizing for 802.11 Based Networks JJN03 Continuous Neighbor Discovery in Asynchronous Sensor Networks JJN04 Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks JJN05 Is Cloned Code older than Non-Cloned Code? JJN06 Jamming-Aware Traffic Allocation for MultiplePath Routing Using Portfolio Selection JJN07 Live Streaming with Receiver-based Peerdivision Multiplexing JJN08 Monitoring Service Systems from a Language-Action Perspective JJN09 ProgME: Towards Programmable Network Measurement JJN10 Selfish Overlay Network Creation and Maintenance JJN11 SPAF: Stateless FSAbased Packet Filters JJN12 Topological Transformation Approaches to TCAMBased Packet Classification JJN13 Achieving Bounded
DESCRIPTION IEEE
REFERENCE
IEEE IEEE
IEEE
IEEE IEEE
IEEE IEEE
IEEE IEEE
IEEE IEEE
IEEE
22135 |
89397 22145 | 044 4218 1385

TTA
Matching Delay and Maximized Throughput in Information
JM01
MATLAB Scalable Face Image Retrieval with IdentityBased Quantization and Multi-Reference Re-ranking No-Reference Metric Design With Machine Learning for Local Video Compression Artifact Level Enhanced Assessment of the Wound-Healing Process by Accurate Multiview Tissue Classification Enhanced Assessment of the Wound-Healing Process by Accurate Multiview Tissue Classification Face Recognition by Exploring Information Jointly in Space, Scale and Orientation Mixture of Gaussians-Based Background Subtraction for Bayer-Pattern Image Sequences A Novel 3-D Color Histogram Equalization Method With Uniform 1-D Gray Scale Histogram Color Extended Visual Cryptography Using Error Diffusion Using a Visual Discrimination Model for the Detection of Compression Artifacts in Virtual Pathology Images Detection of Architectural Distortion in Prior Mammograms A Differential Geometric Approach to Automated Segmentation of Human Airway Tree
IEEE 2011
JM02
IEEE 2011
JM03
IEEE 2011
JM04
IEEE 2011
JM05 JM06
IEEE 2011 IEEE 2011
JM07
IEEE 2011
JM08 JM09
IEEE 2011 IEEE 2011
JM10 JM11
IEEE 2011 IEEE 2011
22135 |
89397 22145 | 044 4218 1385

TTA
JM12 A Supervised Framework for the Registration and Segmentation of White Matter Fiber Tracts Curvature Interpolation Method for Image Zooming IMAGE Resolution Enhancement by Using Discrete and Stationary Wavelet Decomposition Text Segmentation for MRC Document Compression
IEEE 2011
JM13 JM14
IEEE 2011 IEEE 2011
JM16
IEEE 2011
NON IEEE JNIEEJD01 JNIEEJD02 JNIEEJD03 JNIEEJD04 JNIEEJD05 JNIEEJD06 JNIEEJD07 JNIEEJD08 JNIEEJD09 JNIEEJD10 JNIEEJD11 JNIEEJD12 JNIEEJD13 JNIEEJD14 JNIEEJD15 JNIEEJD16 JNIEEJD17 JNIEEJD18 JNIEEJD19 JNIEEJD20 Airline Reservation System Appointment Scheduler B2C-Ecommerce Portal E RP for Small Business Workflow Automation System Website Search Engine Web portal for Internet and Intranet Warehouse Management System Webportal on online community System Travel Management System Payroll Processing System Resume Tracking Sys tem Purchase Order System Online File Uploading System Quality Function Deployment Operation Scheduling Online-Shopping Banking Browsing Centre Automation Boutique Management System
22135 |
89397 22145 | 044 4218 1385

TTA
JNIEEJD21 JNIEEJD22 JNIEEJD23 JNIEEJD24 JNIEEJD25 JNIEEJD26 JNIEEJD27 JNIEEJD28 JNIEEJD29 JNIEEJD30 JNIEEJD31 JNIEEJD32 JNIEEJD33 JNIEEJD34 JNIEEJD35 JNIEEJD36 JNIEEJD37 JNIEEJD38 JNIEEJD39 JNIEEJD40 JNIEEJD41 JNIEEJD42 JNIEEJD43 JNIEEJD44 JNIEEJD45 JNIEEJD46 JNIEEJD47 JNIEEJD48 JNIEEJD49 JNIEEJD50 JNIEEJD51 JNIEEJD52 Call Management System
Cement Dealer Management System Civil supply maintenance System Consensus of commission agency Electricity Firm Management system Hotel Management System Insurance Journal Management L IC Management Information System Mobile service Provider System Multiplexx Production and Planning Control Project Cargo Stock Inventory System Super Market Trade Management System B U S Reservation System IT Tutor Automation Online Certification Exam Civil Registry System Hospital Medi Fedora Budget Analyzer Centralized Vendor Management Portal Digital Library Management System Railway Management System Sniffer Mail Bar Coding System E-Fund Transfer Chat Engine in E-Banking FTP and S MTP Server
SYSTEM /NETWORK PROJECT TITLE
22135 |
89397 22145 | 044 4218 1385

TTA
JNIEENS01 JNIEENS02 JNIEENS03 JNIEENS04 JNIEENS05 JNIEENS06 JNIEENS07 JNIEENS08 JNIEENS09 JNIEENS10 JNIEENS11 JNIEENS12 JNIEENS13 JNIEENS14 JNIEENS15 JNIEENS16 JNIEENS17 JNIEENS18 JNIEENS19 JNIEENS20 JNIEENS21 JNIEENS22 JNIEENS23 JNIEENS24 JNIEENS25 ATM Network Simulation(System)
Advanced File Splitter and Merger(System)
Communication Management Protocol Library COOL-PIE(System) Enumerating Login Session(System) Execute Application on Remote System(System) Firewall Protection(System) File Management(System) File Transfer(System) File Watch(System) File Spy(System) HTTP Tunneling(System) Image Compression(System) Image Compression Using Port (System) HTML Editor (Application) J-Messenger(Application) Net Watchman(System) NetBIOS Enumerator(System) Network Analyzer(System) Mini Server(System) Port Scanner(System) Proxy Server Remote Control PC Through Internet Remote Control PC Through LAN Remote Processes and Machine Control
We are open to prepare and guide any new ideas on any domain/Technology. If you have any topics that should be done, please send the topic to leads@talhunt.co.in
22135 |
89397 22145 | 044 4218 1385


Final Year Projects in Chennai

Transféré par

Informations du document

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Final Year Projects in Chennai

Transféré par

Droits d'auteur :

Formats disponibles

TTA

Final year projects by IT professionals

JAVA - DOMAIN : MOBILE COMPUTING

Map-Based Location and Tracking in Multipath Outdoor Mobile Networks

Distributed lgorithms for Environment Partitioning in Mobile Robotic Networks

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Hop-by-hop Routing in Wireless Mesh Networks with Bandwidth Guarantees

Local Greedy Approximation for Scheduling in Multi-hop Wireless Networks

Network Connectivity with a Family of Group Mobility Models

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks

Optimal Stochastic Location Updates in Mobile Ad Hoc Networks

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

A Unified Probabilistic Framework for Name Disambiguation in Digital Library

Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Visual Role Mining: A Picture Is Worth a Thousand Roles

A Knowledge-Driven Approach to Activity Recognition in Smart Homes

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Efficient Iceberg Query Evaluation using Compressed Bitmap Index

Improving Security and Efficiency in AttributeBased Data Sharing

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Clustering with MultiViewpoint based Similarity Measure

Manifold Adaptive Experimental Design for Text Categorization

Multi-resolution Web link analysis using generalised link relations

Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Cost-aware rank join with random and sorted access

Joint Top-K Spatial Keyword Query Processing

Publishing Search Logs A Comparative Study of

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

A Link-Analysis Extension of Correspondence Analysis for Mining Relational Databases

Adaptive Cluster Distance Bounding for High Dimensional Indexing

Discovering Conditional Functional Dependencies

Effective Navigation of Query Results Based on Concept Hierarchies

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Learning SemiRiemannian Metrics for Semi supervised Feature Extraction

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals

Privacy-Preserving ECG Classification With Branching Programs and Neural Networks

Keys Through ARQ: Theory and Practice

For base paper and detailed discussion, call 89397

89397 22145 | 044 4218 1385

Final year projects by IT professionals