Fault-tolerant Video on Demand in RSerPool Architecture

With the advent of Internet, video over IP is gaining popularity. In such an environment, scalability and fault tolerance will be the key issues. Existing video on demand (VoD) service systems are usually neither scalable nor tolerant to server faults and hence fail to comply to multi-user, failure-prone networks such as the Internet. Current research areas concerning VoD often focus on increasing the throughput and reliability of single server, but rarely addresses the smooth provision of service during server as well as network failures. Reliable Server Pooling (RSerPool), being capable of providing high availability by using multiple redundant servers as single source point, can be a solution to overcome the above failures. During a possible server failure, the continuity of service is retained by another server. In order to achieve transparent failover, efficient state sharing is an important requirement. In this paper, we present an elegant, simple, efficient and scalable approach which has been developed to facilitate the transfer of state by the client itself, using extended cookie mechanism, which ensures that there is no noticeable change in disruption or the video quality.

A Scalable Architecture for VoIP Conferencing

Real-Time services are traditionally supported on circuit switched network. However, there is a need to port these services on packet switched network. Architecture for audio conferencing application over the Internet in the light of ITU-T H.323 recommendations is considered. In a conference, considering packets only from a set of selected clients can reduce speech quality degradation because mixing packets from all clients can lead to lack of speech clarity. A distributed algorithm and architecture for selecting clients for mixing is suggested here based on a new quantifier of the voice activity called “Loudness Number” (LN). The proposed system distributes the computation load and reduces the load on client terminals. The highlights of this architecture are scalability, bandwidth saving and speech quality enhancement. Client selection for playing out tries to mimic a physical conference where the most vocal participants attract more attention. The contributions of the paper are expected to aid H.323 recommendations implementations for Multipoint Processors (MP). A working prototype based on the proposed architecture is already functional.

Site-specific N-Linked Glycosylation of Receptor Guanylyl Cyclase C Regulates Ligand Binding, Ligand-mediated Activation and Interaction with Vesicular Integral Membrane Protein 36, VIP36

Guanylyl cyclase C (GC-C) is a multidomain, membrane-associated receptor guanylyl cyclase. GC-C is primarily expressed in the gastrointestinal tract, where it mediates fluid-ion homeostasis, intestinal inflammation, and cell proliferation in a cGMP-dependent manner, following activation by its ligands guanylin, uroguanylin, or the heat-stable enterotoxin peptide (ST). GC-C is also expressed in neurons, where it plays a role in satiation and attention deficiency/hyperactive behavior. GC-C is glycosylated in the extracellular domain, and differentially glycosylated forms that are resident in the endoplasmic reticulum (130 kDa) and the plasma membrane (145 kDa) bind the ST peptide with equal affinity. When glycosylation of human GC-C was prevented, either by pharmacological intervention or by mutation of all of the 10 predicted glycosylation sites, ST binding and surface localization was abolished. Systematic mutagenesis of each of the 10 sites of glycosylation in GC-C, either singly or in combination, identified two sites that were critical for ligand binding and two that regulated ST-mediated activation. We also show that GC-C is the first identified receptor client of the lectin chaperone vesicular integral membrane protein, VIP36. Interaction with VIP36 is dependent on glycosylation at the same sites that allow GC-C to fold and bind ligand. Because glycosylation of proteins is altered in many diseases and in a tissue-dependent manner, the activity and/or glycan-mediated interactions of GC-C may have a crucial role to play in its functions in different cell types.

An inquisitive analysis on the temporal variation of return stroke current essential for producing observed remote electro-magnetic fields

The gross characteristics of spatio-temporal current evolution in the return stroke phase of a cloud-to-ground lightning are rather well defined. However, they by themselves do not ensure the salient features for the resulting remote Electro- Magnetic Fields (EMFs). In spite of significant efforts in the engineering models wherein, the spatio-temporal current distribution all along the channel is specified by the design, all the salient features of remote EMFs could not be achieved. Only the current evolution that ensures the basic characteristics along with its ability to reproduce all the salient features of remote EMFs ranging from 50 m – 200 km from the lightning channel, can be considered as a realistic return stroke channel current. In view of this, the present work intends to investigate on the required fine features of the return stroke current evolution that yields all the desired features. To ensure that the current evolution is not arbitrary but obeys the involved basic physical processes, a recently developed physical model will be employed for the analysis.

Functional specificity among yeast mitochondrial Hsp70s paralogs and orthologs

The evolutionary diversity of the HSP70 gene family at the genetic level has generated complex structural variations leading to altered functional specificity and mode of regulation in different cellular compartments. By utilizing Saccharomyces cerevisiae as a model system for better understanding the global functional cooperativity between Hsp70 paralogs, we have dissected the differences in functional properties at the biochemical level between mitochondrial heat shock protein 70 (mtHsp70) Ssc1 and an uncharacterized Ssc3 paralog. Based on the evolutionary origin of Ssc3 and a high degree of sequence homology with Ssc1, it has been proposed that both have a close functional overlap in the mitochondrial matrix. Surprisingly, our results demonstrate that there is no functional cross-talk between Ssc1 and Ssc3 paralogs. The lack of in vivo functional overlap is due to altered conformation and significant lower stability associated with Ssc3. The substrate-binding domain of Ssc3 showed poor affinity toward mitochondrial client proteins and Tim44 due to the open conformation in ADP-bound state. In addition to that, the nucleotide-binding domain of Ssc3 showed an altered regulation by the Mge1 co-chaperone due to a high degree of conformational plasticity, which strongly promotes aggregation. Besides, Ssc3 possesses a dysfunctional inter-domain interface thus rendering it unable to perform functions similar to generic Hsp70s. Moreover, we have identified the critical amino acid sequence of Ssc1 and Ssc3 that can “make or break” mtHsp70 chaperone function. Together, our analysis provides the first evidence to show that the nucleotide-binding domain of mtHsp70s plays a critical role in determining the functional specificity among paralogs and orthologs across kingdoms.

A Secure and Efficient Authentication Protocol (SEAP) for MANETs with Membership Revocation

In this paper, we propose a novel authentication protocol for MANETs requiring stronger security. The protocol works on a two-tier network architecture with client nodes and authentication server nodes, and supports dynamic membership. We use an external membership granting server (MGS) to provide stronger security with dynamic membership. However, the external MGS in our protocol is semi-online instead of being online, i.e., the MGS cannot initiate a connection with a network node but any network node can communicate with the MGS whenever required. To ensure efficiency, the protocol uses symmetric key cryptography to implement the authentication service. However, to achieve storage scalability, the protocol uses a pseudo random function (PRF) to bind the secret key of a client to its identity using the secret key of its server. In addition, the protocol possesses an efficient server revocation mechanism along with an efficient server re-assignment mechanism, which makes the protocol robust against server node compromise.

Counterfactual quantum certificate authorization

We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.

Effect of ultrasonic treatment on surface crystallization of calcium bismuth borate glasses

Transparent glasses in CaO-Bi2O3-B2O3 system were fabricated via the conventional melt-quenching technique. X-ray powder diffraction (XRD) and differential thermal analysis (DTA) carried out on the as-quenched samples confirmed their amorphous and glassy nature respectively. The surface crystallization behaviour of these glasses with and without ultrasonic surface treatment (UST) was monitored using XRD, optical microscopy and scanning electron microscopy (SEM). The volume fraction, depth of crystallization and the (001) orientation factor for the heat treated samples with and without UST were compared. The ultrasonically-treated samples on subsequent heat treatment were found to crystallize at lower temperatures associated with the highest degree of orientation factor (0.95) in contrast with those of non-UST samples. These surface crystallized glasses were found to exhibit nonlinear optical behaviour emitting green light (532 nm) when they were exposed to the infrared radiation (1064 nm) using Nd:YAG laser.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Prevalence and clinical correlates of obsessive-compulsive disorder in schizophrenia

Obsessive compulsive symptoms frequently occur in a substantial proportion of patients with schizophrenia. The term schizoobsessive has been proposed to delineate this subgroup of schizophrenia patients who present with obsessive compulsive symptoms/disorder. However, whether this co-occurrence is more than just co-morbidity and represents a distinct subgroup remains controversial. A striking variation is noted across studies examining prevalence of obsessive compulsive symptoms/disorder in schizophrenia patients and their impact on clinical profile of schizophrenia. Hence, in this study, we examined the prevalence of obsessive compulsive symptoms/disorder in a large sample of consecutively hospitalized schizophrenia patients and compared the clinical and functional characteristics of schizophrenia patients with and without obsessive compulsive symptoms/disorder. We evaluated 200 consecutive subjects with the DSM-IV diagnosis of schizophrenia using the Structured Clinical Interview for DSM-IV Axis I disorders, Positive and Negative Syndrome Scale, Yale Brown Obsessive Compulsive Scale, Brown Assessment of Beliefs Scale, Clinical Global Impression-Severity scale, Global Assessment of Functioning Scale, Family Interview for Genetic Studies and World Health Organization Quality of Life scale. The prevalence of obsessive compulsive symptoms in patients with schizophrenia was 24% (n = 48); 37 of them had obsessive compulsive disorder (OCD) and II had obsessive compulsive symptoms not amounting to a clinical diagnosis of OCD (OCS). Schizophrenia patients with OCS/OCD had an earlier age at onset of schizophrenia symptoms, lower positive symptoms score, higher co-morbidity with Axis II disorders, higher occurrence of OCD in family and better quality of life. Findings of the study indicate a higher prevalence of OCS/OCD in schizophrenia. Schizophrenia patients with and without OCS/OCD have comparable clinical profile with few exceptions. High rates of OCD in first degree relatives suggest possible genetic contributions and differences in neurobiology. Finally, evidence to consider schizoobsessive as a distinct diagnostic entity is inconclusive and warrants further studies. (C) 2014 Elsevier Inc. All rights reserved.

Online_DPI: a web server to calculate the diffraction precision index for a protein structure

An online computing server, Online_DPI (where DPI denotes the diffraction precision index), has been created to calculate the `Cruickshank DPI' value for a given three-dimensional protein or macromolecular structure. It also estimates the atomic coordinate error for all the atoms available in the structure. It is an easy-to-use web server that enables users to visualize the computed values dynamically on the client machine. Users can provide the Protein Data Bank (PDB) identification code or upload the three-dimensional atomic coordinates from the client machine. The computed DPI value for the structure and the atomic coordinate errors for all the atoms are included in the revised PDB file. Further, users can graphically view the atomic coordinate error along with `temperature factors' (i.e. atomic displacement parameters). In addition, the computing engine is interfaced with an up-to-date local copy of the Protein Data Bank. New entries are updated every week, and thus users can access all the structures available in the Protein Data Bank. The computing engine is freely accessible online at http://cluster.physics.iisc.ernet.in/dpi/.

Synthesizing Racy Tests

Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static techniques. On the other hand, the effectiveness of dynamic race detectors is critically dependent on multithreaded test suites whose execution can be used to identify and trigger races. Usually, such multithreaded tests need to invoke a specific combination of methods with objects involved in the invocations being shared appropriately to expose a race. Without a priori knowledge of the race, construction of such tests can be challenging. In this paper, we present a lightweight and scalable technique for synthesizing precisely these kinds of tests. Given a multithreaded library and a sequential test suite, we describe a fully automated analysis that examines sequential execution traces, and produces as its output a concurrent client program that drives shared objects via library method calls to states conducive for triggering a race. Experimental results on a variety of well-tested Java libraries yield 101 synthesized multithreaded tests in less than four minutes. Analyzing the execution of these tests using an off-the-shelf race detector reveals 187 harmful races, including several previously unreported ones.