A weight based context analysis system to provide a required UMM service

Ubiquitous Computing is an emerging paradigm which facilitates user to access preferred services, wherever they are, whenever they want, and the way they need, with zero administration. While moving from one place to another the user does not need to specify and configure their surrounding environment, the system initiates necessary adaptation by itself to cope up with the changing environment. In this paper we propose a system to provide context-aware ubiquitous multimedia services, without user’s intervention. We analyze the context of the user based on weights, identify the UMMS (Ubiquitous Multimedia Service) based on the collected context information and user profile, search for the optimal server to provide the required service, then adapts the service according to user’s local environment and preferences, etc. The experiment conducted several times with different context parameters, their weights and various preferences for a user. The results are quite encouraging.

An innovative clustering technique for unsupervized learning in the context of remotely sensed earth resources data analysis

A new clustering technique, based on the concept of immediato neighbourhood, with a novel capability to self-learn the number of clusters expected in the unsupervized environment, has been developed. The method compares favourably with other clustering schemes based on distance measures, both in terms of conceptual innovations and computational economy. Test implementation of the scheme using C-l flight line training sample data in a simulated unsupervized mode has brought out the efficacy of the technique. The technique can easily be implemented as a front end to established pattern classification systems with supervized learning capabilities to derive unified learning systems capable of operating in both supervized and unsupervized environments. This makes the technique an attractive proposition in the context of remotely sensed earth resources data analysis wherein it is essential to have such a unified learning system capability.

Scalable Context-Sensitive Points-To Analysis Using Multi-Dimensional Bloom Filters

Context-sensitive points-to analysis is critical for several program optimizations. However, as the number of contexts grows exponentially, storage requirements for the analysis increase tremendously for large programs, making the analysis non-scalable. We propose a scalable flow-insensitive context-sensitive inclusion-based points-to analysis that uses a specially designed multi-dimensional bloom filter to store the points-to information. Two key observations motivate our proposal: (i) points-to information (between pointer-object and between pointer-pointer) is sparse, and (ii) moving from an exact to an approximate representation of points-to information only leads to reduced precision without affecting correctness of the (may-points-to) analysis. By using an approximate representation a multi-dimensional bloom filter can significantly reduce the memory requirements with a probabilistic bound on loss in precision. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that with an average storage requirement of 4MB, our approach achieves almost the same precision (98.6%) as the exact implementation. By increasing the average memory to 27MB, it achieves precision upto 99.7% for these benchmarks. Using Mod/Ref analysis as the client, we find that the client analysis is not affected that often even when there is some loss of precision in the points-to representation. We find that the NoModRef percentage is within 2% of the exact analysis while requiring 4MB (maximum 15MB) memory and less than 4 minutes on average for the points-to analysis. Another major advantage of our technique is that it allows to trade off precision for memory usage of the analysis.

Syntactic Approach to ECG Rhythm Analysis

A diagnostic system for ECG rhythm monitoring based on syntactic approaches to pattern recognition is presented here. The method proposed exploits the difference in shape and structure between arrhythmic and normal ECG patterns to generate distinctly different descriptions in terms of a chosen set of primitives. A given frame of signal is first approximated piecewise linearly into a set of line segments which are completely specified in terms of their length and slope values. The slope values are quantized into seven distinct levels and a unit-length line segment with a slope value in each of these levels is coded as a slope symbol. Seven such slope symbols constitute the set of primitives. The given signal is represented as a string of such symbols based on the length and angle of the line segments approximating the signal. Context-free languages are used for describing the classes of abnormal and normal ECG patterns considered here. Analysis of actual ECG data shows efficiency comparable with that of existing methods and a saving in processing time.

Multiobjective Analysis of Irrigation Planning in River Basin Development

A river basin that is extensively developed in the downstream reaches and that has a high potential for development in the upper reaches is considered for irrigation planning. A four-reservoir system is modeled on a monthly basis by using a mathematical programing (LP) formulation to find optimum cropping patterns, subject to land, water, and downstream release constraints. The model is applied to a fiver basin in India. Two objectives, maximizing net economic benefits and maximizing irrigated cropped area, considered in the model are analyzed in the context of multiobjective planning, and the tradeoffs are discussed.

Convergence analysis of the Newton algorithm and a pseudo-time marching scheme for diffuse correlation tomography

We propose a self-regularized pseudo-time marching scheme to solve the ill-posed, nonlinear inverse problem associated with diffuse propagation of coherent light in a tissuelike object. In particular, in the context of diffuse correlation tomography (DCT), we consider the recovery of mechanical property distributions from partial and noisy boundary measurements of light intensity autocorrelation. We prove the existence of a minimizer for the Newton algorithm after establishing the existence of weak solutions for the forward equation of light amplitude autocorrelation and its Frechet derivative and adjoint. The asymptotic stability of the solution of the ordinary differential equation obtained through the introduction of the pseudo-time is also analyzed. We show that the asymptotic solution obtained through the pseudo-time marching converges to that optimal solution provided the Hessian of the forward equation is positive definite in the neighborhood of optimal solution. The superior noise tolerance and regularization-insensitive nature of pseudo-dynamic strategy are proved through numerical simulations in the context of both DCT and diffuse optical tomography. (C) 2010 Optical Society of America.

Field Flow Sensitive Pointer and Escape Analysis for Java Using Heap Array SSA

Context sensitive pointer analyses based on Whaley and Lam’s bddbddb system have been shown to scale to large Java programs. We provide a technique to incorporate flow sensitivity for Java fields into one such analysis and obtain an escape analysis based on it. First, we express an intraprocedural field flow sensitive analysis, using Fink et al.’s Heap Array SSA form in Datalog. We then extend this analysis interprocedurally by introducing two new φ functions for Heap Array SSA Form and adding deduction rules corresponding to them. Adding a few more rules gives us an escape analysis. We describe two types of field flow sensitivity: partial (PFFS) and full (FFFS), the former without strong updates to fields and the latter with strong updates. We compare these analyses with two different (field flow insensitive) versions of Whaley-Lam analysis: one of which is flow sensitive for locals (FS) and the other, flow insensitive for locals (FIS). We have implemented this analysis on the bddbddb system while using the SOOT open source framework as a front end. We have run our analysis on a set of 15 Java programs. Our experimental results show that the time taken by our field flow sensitive analyses is comparable to that of the field flow insensitive versions while doing much better in some cases. Our PFFS analysis achieves average reductions of about 23% and 30% in the size of the points-to sets at load and store statements respectively and discovers 71% more “caller-captured” objects than FIS.

Stereochemical Analysis of Higher α,α-Dialkylglycine Containing Peptides. Characterization of Local Helical Conformations at Dipropylglycine Residues and Observation of a Novel Hydrated Multiple β-Turn Structure in Crystals of a Glycine Rich Peptide

The peptide Boc-Gly-Dpg-Gly-Gly-Dpg-Gly-NHMe (1) has been synthesized to examine the conformational preferences of Dpg residues in the context of a poor helix promoting sequence. Single crystals of 1 were obtained in the space group P21/c with a = 13.716(2) Å, b = 12.960(2) Å, c = 22.266(4) Å, and β = 98.05(1)°; R = 6.3% for 3660 data with |Fo| > 4σ. The molecular conformation in crystals revealed that the Gly(1)-Dpg(2) segment adopts φ, ψ values distorted from those expected for an ideal type II‘ β-turn (φGly(1) = +72.0°, ψGly(1) = −166.0°; φDpg(2) = −54.0°, ψDpg(2) = −46.0°) with an inserted water molecule between Boc-CO and Gly(3)NH. The Gly(3)-Gly(4) segment adopts φ, ψ values which lie broadly in the right handed helical region (φGly(3) = −78.0°, ψGly(3) = −9.0°; φGly(4) = −80.0°, ψGly(4) = −18.0°). There is a chiral reversal at Dpg(5) which takes up φ, ψ values in the left handed helical region. The Dpg(5)-Gly(6) segment closely resembles an ideal type I‘ β-turn (φDpg(5) = +56.0°, ψDpg(5) = +32.0°; φGly(6) = +85.0°, ψGly(6) = −3.0°). Molecules of both chiral senses are found in the centrosymmetric crystal. The C-terminus forms a hydrated Schellman motif, with water insertion into the potential 6 → 1 hydrogen bond between Gly(1)CO and Gly(6)NH. NMR studies in CDCl3 suggest substantial retention of the multiple turn conformation observed in crystals. In solution the observed NOEs support local helical conformation at the two Dpg residues.

Analysis of the impact of a uracil DNA glycosylase attenuated in AP-DNA binding in maintenance of the genomic integrity in Escherichia coli

Uracil DNA glycosylase (Ung)initiates the uracil excision repair pathway. We have earlier characterized the Y66W and Y66H mutants of Ung and shown that they are compromised by similar to 7- and similar to 170-fold, respectively in their uracil excision activities. In this study, fluorescence anisotropy measurements show that compared with the wild-type, the Y66W protein is moderately compromised and attenuated in binding to AP-DNA. Allelic exchange of ung in Escherichia coli with ung::kan, ungY66H:amp or ungY66W:amp alleles showed similar to 5-, similar to 3.0- and similar to 2.0-fold, respectively increase in mutation frequencies. Analysis of mutations in the rifampicin resistance determining region of rpoB revealed that the Y66W allele resulted in an increase in A to G (or T to C) mutations. However, the increase in A to G mutations was mitigated upon expression of wild-type Ung from a plasmid borne gene. Biochemical and computational analyses showed that the Y66W mutant maintains strict specificity for uracil excision from DNA. Interestingly, a strain deficient in AP-endonucleases also showed an increase in A to G mutations. We discuss these findings in the context of a proposal that the residency of DNA glycosylase(s) onto the AP-sites they generate shields them until recruitment of AP-endonucleases for further repair.

Genetic characterization of Indian type O FMD virus 3A region in context with host cell preference

The 3A region of foot-and-mouth disease virus has been implicated in host range and virulence. For example, amino acid deletions in the porcinophilic strain (O/TAW/97) at 93-102 aa of the 153 codons long 3A protein have been recognized as the determinant of species specificity. In the present study, 18 type 0 FMDV isolates from India were adapted in different cell culture systems and the 3A sequence was analyzed. These isolates had complete 3A coding sequence (153 aa) and did not exhibit growth restriction in cells based on species of origin. The 3A region was found to be highly conserved at N-terminal half (1-75 aa) but exhibited variability or substitutions towards C-terminal region (80-153). Moreover the amino acid substitutions were more frequent in recent Indian buffalo isolates but none of the Indian isolates showed deletion in 3A protein, which may be the reason for the absence of host specificity in vitro. Further inclusive analysis of 3A region will reveal interesting facts about the variability of FMD virus 3A region in an endemic environment. (C) 2010 Elsevier B.V. All rights reserved.

Conformational analysis of the right-hand twisted antiparallel β-Structure

The conformational analysis of a pair of two-linked peptide units in the anti-parallel arrangement is reported here with a view to study the effect of association of one chain with the other. The pair of two-linked peptide units were fixed in space through the hydrogen bonds between them, in accordance with certain hydrogen bond criteria. Model building was undertaken to ascertain whether the proximity of the side-chains could be used to eliminate any one of the right-hand twisted, left-hand twisted or regular β-structures. Stereochemically, it was found possible with all of them. The preference for a right-hand twisted β-structure, however, was indicated by the classical energy calculations. The relevance of the results thus obtained is discussed in the context of the preferential right-hand twist of the β-pleated sheets present in globular proteins. The agreement between the minimum energy conformations obtained for the pair of two-linked peptide units and the globular protein data is also indicated.

Functional Analysis of an Acid Adaptive DNA Adenine Methyltransferase from Helicobacter pylori 26695

HP0593 DNA-(N-6-adenine)-methyltransferase (HP0593 MTase) is a member of a Type III restriction-modification system in Helicobacter pylori strain 26695. HP0593 MTase has been cloned, overexpressed and purified heterologously in Escherichia coli. The recognition sequence of the purified MTase was determined as 5'-GCAG-3' and the site of methylation was found to be adenine. The activity of HP0593 MTase was found to be optimal at pH 5.5. This is a unique property in context of natural adaptation of H. pylori in its acidic niche. Dot-blot assay using antibodies that react specifically with DNA containing m6A modification confirmed that HP0593 MTase is an adenine-specific MTase. HP0593 MTase occurred as both monomer and dimer in solution as determined by gel-filtration chromatography and chemical-crosslinking studies. The nonlinear dependence of methylation activity on enzyme concentration indicated that more than one molecule of enzyme was required for its activity. Analysis of initial velocity with AdoMet as a substrate showed that two molecules of AdoMet bind to HP0593 MTase, which is the first example in case of Type III MTases. Interestingly, metal ion cofactors such as Co2+, Mn2+, and also Mg2+ stimulated the HP0593 MTase activity. Preincubation and isotope partitioning analyses clearly indicated that HP0593 MTase-DNA complex is catalytically competent, and suggested that DNA binds to the MTase first followed by AdoMet. HP0593 MTase shows a distributive mechanism of methylation on DNA having more than one recognition site. Considering the occurrence of GCAG sequence in the potential promoter regions of physiologically important genes in H. pylori, our results provide impetus for exploring the role of this DNA MTase in the cellular processes of H. pylori.

Points-to Analysis as a System of Linear Equations

We propose a novel formulation of the points-to analysis as a system of linear equations. With this, the efficiency of the points-to analysis can be significantly improved by leveraging the advances in solution procedures for solving the systems of linear equations. However, such a formulation is non-trivial and becomes challenging due to various facts, namely, multiple pointer indirections, address-of operators and multiple assignments to the same variable. Further, the problem is exacerbated by the need to keep the transformed equations linear. Despite this, we successfully model all the pointer operations. We propose a novel inclusion-based context-sensitive points-to analysis algorithm based on prime factorization, which can model all the pointer operations. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that our approach is competitive to the state-of-the-art algorithms. With an average memory requirement of mere 21MB, our context-sensitive points-to analysis algorithm analyzes each benchmark in 55 seconds on an average.