Smart Metro - Rail System

Railway transport system has proved to be a very sturdy and convenient mode of transport over the centuries. It still serves as the economic and most efficient means of mass transport in many countries. It is a widespread practice even today that most operations are manually carried out, leading to several dangerous accidents and mismanagement of the system. When it comes to the matter of scores of lives, error margin is of utmost importance to ensure an efficient and safe mode of travel. There is an utter need for a system that provides automation of the critical systems that play a pivotal role in the smooth functioning. The focus remains on certain key functions including locomotion, data logging for position, speed and health of he locomotive. This can increase the safety levels, while also reducing the time for relief in-case of unfortunate emergencies

Concurrent Program Verification with Invariant-Guided Underapproximation

Automatic verification of concurrent programs written in low-level languages like ANSI-C is an important task as multi-core architectures are gaining widespread adoption. Formal verification, although very valuable for this domain, rapidly runs into the state-explosion problem due to multiple thread interleavings. Recently, Bounded Model Checking (BMC) has been used for this purpose, which does not scale in practice. In this work, we develop a method to further constrain the search space for BMC techniques using underapproximations of data flow of shared memory and lazy demand-driven refinement of the approximation. A novel contribution of our method is that our underapproximation is guided by likely data-flow invariants mined from dynamic analysis and our refinement is based on proof-based learning. We have implemented our method in a prototype tool. Initial experiments on benchmark examples show potential performance benefit

Combinatorial CRISPR-Cas9 screens for de novo mapping of genetic interactions.

We developed a systematic approach to map human genetic networks by combinatorial CRISPR-Cas9 perturbations coupled to robust analysis of growth kinetics. We targeted all pairs of 73 cancer genes with dual guide RNAs in three cell lines, comprising 141,912 tests of interaction. Numerous therapeutically relevant interactions were identified, and these patterns replicated with combinatorial drugs at 75% precision. From these results, we anticipate that cellular context will be critical to synthetic-lethal therapies

Genome-Wide Association Data Reveal a Global Map of Genetic Interactions among Protein Complexes

This work demonstrates how gene association studies can be analyzed to map a global landscape of genetic interactions among protein complexes and pathways. Despite the immense potential of gene association studies, they have been challenging to analyze because most traits are complex, involving the combined effect of mutations at many different genes. Due to lack of statistical power, only the strongest single markers are typically identified. Here, we present an integrative approach that greatly increases power through marker clustering and projection of marker interactions within and across protein complexes. Applied to a recent gene association study in yeast, this approach identifies 2,023 genetic interactions which map to 208 functional interactions among protein complexes. We show that such interactions are analogous to interactions derived through reverse genetic screens and that they provide coverage in areas not yet tested by reverse genetic analysis. This work has the potential to transform gene association studies, by elevating the analysis from the level of individual markers to global maps of genetic interactions. As proof of principle, we use synthetic genetic screens to confirm numerous novel genetic interactions for the INO80 chromatin remodeling complex

The attentional blink reveals serial working memory encoding: Evidence from virtual and human event-related potentials

Observers often miss a second target (T2) if it follows an identified first target item (T1) within half a second in rapid serial visual presentation (RSVP), a finding termed the attentional blink. If two targets are presented in immediate succession, however, accuracy is excellent (Lag 1 sparing). The resource sharing hypothesis proposes a dynamic distribution of resources over a time span of up to 600 msec during the attentional blink. In contrast, the ST2 model argues that working memory encoding is serial during the attentional blink and that, due to joint consolidation, Lag 1 is the only case where resources are shared. Experiment 1 investigates the P3 ERP component evoked by targets in RSVP. The results suggest that, in this context, P3 amplitude is an indication of bottom.up strength rather than a measure of cognitive resource allocation. Experiment 2, employing a two-target paradigm, suggests that T1 consolidation is not affected by the presentation of T2 during the attentional blink. However, if targets are presented in immediate succession (Lag 1 sparing), they are jointly encoded into working memory. We use the ST2 model's neural network implementation, which replicates a range of behavioral results related to the attentional blink, to generate .virtual ERPs. by summing across activation traces. We compare virtual to human ERPs and show how the results suggest a serial nature of working memory encoding as implied by the ST2 model

Introduction Of Spatial Database Spatial Data Types, Spatial Indexing, Geographic Information Systems (Gis) & Query Structure

This paper covers the overview of Spatial Database System which offers Spatial Data Structure along with the Spatial Datatypes. It is most commonly used in Geographic Information Systems (GIS) and other applications. Many applications operate on spatial data which include lines, points, regions and polygons etc. Spatial data are large in size and complex in structure and relationship hence spatial indexes are required to retrieve the desired result-set from the large dataset in optimum timeframe. The main emphasis on hierarchical data structures, including the number of indexing techniques like HHCode, R-tree, R+tree, Quadtree, Octree, UBtree etc. which are often used to improve query processing time in spatial database. Such techniques are also known as spatial indexing methods. Comparative study also covered in the paper for the R*-Tree and R-Tree indexing techniques, and results shown that the better performance of the queries using appropriate index