WORK DONE ON MIDDLEWARE INFRASTRUCTURE FOR PREDICATE DETECTION

Context-awareness is an essential feature of pervasive applications, and runtime detection of contextual properties is one of the primary approaches to enabling context awareness. However, existing context-aware middleware does not provide sufficient support for detection of contextual properties in asynchronous environments. The contextual activities usually involve multiple context collecting devices, which are fully-decentralized and interact in an asynchronous manner. However, existing context consistency checking schemes do not work in asynchronous environments, since they implicitly assume the availability of a global clock or relay on synchronized interactions. To this end, we present the Middleware Infrastructure for Predicate detection in Asynchronous environments (MIPA), which supports context awareness based on logical time. Design and Structure of MIPA are explained in detail.

DETECTION OF DATA LEAKAGE

Sometimes sensitive data must be handed over to supposedly trust third parties. With the extensive application of database systems, the owners of the databases have urgent requirements to protect their copyright of databases. Some of the data is leaked and found in an unauthorized place the distributor must assess the likelihood that the leaked data came from one or more users. This paper contains concept of data leakage, its causes of leakage and different techniques to protect and detect the data leakage. In the field of IT huge database is being used. This database is shared with multiple people at a time. But during this sharing of the data, there are huge chances of data vulnerability, leakage or alteration. So, to prevent these problems, detection of data leakage system has been proposed. This paper includes brief idea about data leakage detection and a methodology to detect the data leakage persons. Data leakage is the main hindrance in data distribution. Traditionally this data leakage is handled by watermarking technique which requires modification of data.

HIDING SECRET DATA THROUGH STEGANOGRAPHY IN VOIP

Steganography is an effective way of hiding secret data, by this means of protecting the data from unauthorized or unwanted viewing. Using cryptography technique will encrypt and decrypt message to provide better security. Cryptography protects the message from being read by unauthorized parties, steganography lets the sender conceal the fact that he has even sent a message. One of the new and promising communication medium that can be used as steganography is the Voice over Internet Protocol. VOIP covers a wide range of information hiding techniques. The main idea is to use free unused fields of VOIP protocols like TCP, UDP etc. By hiding one secret text into the cover speech using steganography we can get a stego speech, which sounds indistinguishable from the original cover speech. So even if the Hackers/crackers catch the audio packets on network, they would not notice that there is some secret text hidden inside it. To develop a Voice Chat Tool, this can also enable us to send secret data hidden inside the voice packets at the same time. We used LSB method of steganography and for better security we provide encryption to the message to be sent. There is no restriction on the length of message as more the communicators talk larger the file is sent. Human auditory system (HAS) operates over a wide dynamic range. It is challenging to hide secret data inside audio.

PERFORMANCE ENHANCEMENT IN IRREGULAR NETWORK USING MULTIPLE ROOT

Irregular network is one of cheaper option for high-parallel performance computing from chip level to large workstation. Irregular networks provide wire flexibility as well as scalable system. But Irregular network always have problem of deadlock in routing and channel utilization. Different solution has been already proposed such as Prefix Routing [1], Up/Down Routing [1], L-turn routing [2], cut Through Switching [9],Wormhole switching [3]. But all these algorithms have different performance in different networks means their performance is depended on network topology and root that is selected during routing in directional routing and prefix routing. In this paper we have proposed a methodology by which we can select a better root for spanning tree, some solution to improve over all utilization of channel for Up/down algorithms and prefix Routing [1].

Cigarette-Smokers’ Problem with STM

The past few years have marked the start of a historic transition from sequential to parallel computation. The necessity to write parallel programs is increasing as systems are getting more complex while processor speed increases are slowing down. Current parallel programming uses low-level programming constructs like threads and explicit synchronization using locks to coordinate thread execution. Parallel programs written with these constructs are difficult to design, program and debug. Also locks have many drawbacks which make them a suboptimal solution. One such drawback is that locks should be only used to enclose the critical section of the parallel-processing code. If locks are used to enclose the entire code then the performance of the code drastically decreases. Software Transactional Memory (STM) is a promising new approach to programming shared-memory parallel processors. It is a concurrency control mechanism that is widely considered to be easier to use by programmers than locking. It allows portions of a program to execute in isolation, without regard to other, concurrently executing tasks. A programmer can reason about the correctness of code within a transaction and need not worry about complex interactions with other, concurrently executing parts of the program. If STM is used to enclose the entire code then the performance of the code is the same as that of the code in which STM is used to enclose the critical section only and is far better than code in which locks have been used to enclose the entire code. So STM is easier to use than locks as critical section does not need to be identified in case of STM. This paper shows the concept of writing code using Software Transactional Memory (STM) and the performance comparison of codes using locks with those using STM. It also shows why the use of STM in parallel-processing code is better than the use of locks.

E-GOVERNANCE IN INDIA: PROSPECTS AND CHALLENGES

Governments all over the world have been using ICTs such as internet, websites, computers and mobile phones to provide various government services in an efficient, equitable and transparent manner with less corruption. The purpose of this paper is to examine the challenges encountered in e-government as well as the potential opportunities available in the context of Indian society. The study reveal India is still lagging behind in utilizing information and communication technologies for delivering government services online.

VIDEO DENOISING BASED ON EXPLOITING INTRASCALE AND INTERSCALE DEPENDENCY IN WAVELET DOMAIN

In this paper, we propose a new video denoising algorithm which uses an efficient wavelet based spatio-temporal filter. The filter first applies 2D discrete wavelet transform (DWT) in horizontal and vertical directions on an input noisy video frame and then applies 1-D discrete cosine transform (DCT) in the temporal direction in order to reduce the redundancies which exist among the wavelet coefficients in the temporal direction. We observe that the subband coefficients with large magnitudes occur in clusters in locations corresponding to the edge locations even after applying the above spatiotemporal filter. In this paper, we propose to use two different low complexity wavelet shrinkage based methods to denoise the noisy wavelet coefficients in different subbands. The first method exploits the intra-scale dependencies between the coefficients and thresholds the wavelet coefficients based on the measure of sum of squares of all wavelet coefficients within a square neighborhood window. The second method exploits the inter-scale dependencies between the coefficients at different scales in an individual slice of coefficients. After filtering the individual slices of coefficients, the denoised video frames in time domain are obtained after inverse transforms. We propose to exploit the temporal redundancies between the successive frames again in the time domain using low complexity selective recursive temporal filtering (SRTF). In the proposed video denoising scheme, since the temporal redundancy is exploited both in the time and wavelet domain, the denoising capability of the scheme is hence increased. The video denoising performance using the two proposed approaches outperform many existing well known video denoising techniques including one recent well known method which uses the similar transformation, both in terms of PSNR and visual quality. We also show that, simple soft thresholding using Donoho’s threshold when used with this wavelet based spatio-temporal filter even outperforms many well known non linear based video denoising techniques.

Probabilistic Anonymous Routing in Mobile Ad-Hoc Networks

In this paper, we propose a routing protocol which ensures route anonymity, for the user. Amongst all suboptimal paths between source and destination, path for data transfer is chosen randomly at each intermediate node. Route anonymity becomes essential for preventing attacks like traffic monitoring. Bayesian approach has been employed for route discovery phase of the protocol. The protocol is simulated using NCTUNS network simulator. The robustness of our protocol is evaluated against known security attacks.

E-GOVERNANCE PRIVACY POLICY, TECHNICAL AND SOCIAL CONCERNS OF PRIVACY IN E-GOVERNANCE FOR INDIA

With the introduction of E-Governance, ambient intelligence and ICT applications affect all areas of citizen lives. The field of justice is presenting opportunities and risks that, if mastered now, may offer a route and solution to the dilemma of privacy and scope of encountering it by properly positioning the jurisdiction with better resolutions. Law must be better enforced and more consistently applied across the member states to retain and sustain public credibility, trust and respect by properly safeguarding citizen interests denudes them of government authority especially in a largest democratic country like India. Privacy in cyberspace has been a continuing congressional priority as ICT is becoming pervasive through the implementation of e-governance. There is a need for having privacy law explicitly to India especially within the scope of EGovernance. Discussions are taking place to in the form of proposing it. So this paper while eliciting some of the privacy concerns, suggests that ASCP model can help as an initial level driving index to position the privacy and hence expected to be considered as a prologue to Privacy policy design.

COMPREHENSIVE APPROACH FOR BILINGUAL MACHINE TRANSLATION

Machine Translation has been a major focus of the NLP group since 1999, the principal focus of the Natural Language Processing group is to build a machine translation system that automatically learns translation mappings from bilingual corpora. This paper explores a novel approach for phrase based machine translation from English to Kannada and Kannada to English. The source text is analyzed then simple sentences are translated using the rules and the complex sentences are split into simple sentences later translation is performed.