Regenerating codes for errors and erasures in distributed storage

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures at the nodes or links, during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

Finite data performance of MUSIC and minimum norm methods

In the direction of arrival (DOA) estimation problem, we encounter both finite data and insufficient knowledge of array characterization. It is therefore important to study how subspace-based methods perform in such conditions. We analyze the finite data performance of the multiple signal classification (MUSIC) and minimum norm (min. norm) methods in the presence of sensor gain and phase errors, and derive expressions for the mean square error (MSE) in the DOA estimates. These expressions are first derived assuming an arbitrary array and then simplified for the special case of an uniform linear array with isotropic sensors. When they are further simplified for the case of finite data only and sensor errors only, they reduce to the recent results given in [9-12]. Computer simulations are used to verify the closeness between the predicted and simulated values of the MSE.

Distinct Roles of FANCO/RAD51C Protein in DNA Damage Signaling and Repair Implications for Fanconi Anemia and Breast Cancer Susceptibility

RAD51C, a RAD51 paralog, has been implicated in homologous recombination (HR), and germ line mutations in RAD51C are known to cause Fanconi anemia (FA)-like disorder and breast and ovarian cancers. The role of RAD51C in the FA pathway of DNA interstrand cross-link (ICL) repair and as a tumor suppressor is obscure. Here, we report that RAD51C deficiency leads to ICL sensitivity, chromatid-type errors, and G(2)/M accumulation, which are hallmarks of the FA phenotype. We find that RAD51C is dispensable for ICL unhooking and FANCD2 monoubiquitination but is essential for HR, confirming the downstream role of RAD51C in ICL repair. Furthermore, we demonstrate that RAD51C plays a vital role in the HR-mediated repair of DNA lesions associated with replication. Finally, we show that RAD51C participates in ICL and double strand break-induced DNA damage signaling and controls intra-S-phase checkpoint through CHK2 activation. Our analyses with pathological mutants of RAD51C that were identified in FA and breast and ovarian cancers reveal that RAD51C regulates HR and DNA damage signaling distinctly. Together, these results unravel the critical role of RAD51C in the FA pathway of ICL repair and as a tumor suppressor.

Design and Evaluation of a Robust Optical Beam-Interruption-Based Vehicle Classifier System

This paper presents the design and development of a novel optical vehicle classifier system, which is based on interruption of laser beams, that is suitable for use in places with poor transportation infrastructure. The system can estimate the speed, axle count, wheelbase, tire diameter, and the lane of motion of a vehicle. The design of the system eliminates the need for careful optical alignment, whereas the proposed estimation strategies render the estimates insensitive to angular mounting errors and to unevenness of the road. Strategies to estimate vehicular parameters are described along with the optimization of the geometry of the system to minimize estimation errors due to quantization. The system is subsequently fabricated, and the proposed features of the system are experimentally demonstrated. The relative errors in the estimation of velocity and tire diameter are shown to be within 0.5% and to change by less than 17% for angular mounting errors up to 30 degrees. In the field, the classifier demonstrates accuracy better than 97.5% and 94%, respectively, in the estimation of the wheelbase and lane of motion and can classify vehicles with an average accuracy of over 89.5%.

Impact Time Guidance for Large Heading Errors Using Sliding Mode Control

In this paper, sliding mode control-based impact time guidance laws are proposed. Even for large heading angle errors and negative initial closing speeds, the desired impact time is achieved by enforcing a sliding mode on a switching surface designed by using the concepts of collision course and estimated time-to-go. Unlike existing guidance laws, the proposed guidance strategy achieves impact time successfully even when the estimated interception time is greater than the desired impact time. Simulation results are also presented.

Non-linear flapping vibrations of rotating blades

The non-linear equations of motion of a rotating blade undergoing extensional and flapwise bending vibration are derived, including non-linearities up to O (ε3). The strain-displacement relationship derived is compared with expressions derived by earlier investigators and the errors and the approximations made in some of those are brought out. The equations of motion are solved under the inextensionality condition to obtain the influence of the amplitude on the fundamental flapwise natural frequency of the rotating blade. It is found that large finite amplitudes have a softening effect on the flapwise frequency and that this influence becomes stronger at higher speeds of rotation.

Non-linear flapping vibrations of rotating blades

The non-linear equations of motion of a rotating blade undergoing extensional and flapwise bending vibration are derived, including non-linearities up to O (ε3). The strain-displacement relationship derived is compared with expressions derived by earlier investigators and the errors and the approximations made in some of those are brought out. The equations of motion are solved under the inextensionality condition to obtain the influence of the amplitude on the fundamental flapwise natural frequency of the rotating blade. It is found that large finite amplitudes have a softening effect on the flapwise frequency and that this influence becomes stronger at higher speeds of rotation.

A playful side to twelfth-century mathematics

As editors of the book Lilavati's Daughters: The Women Scientists of India, reviewed by Asha Gopinathan (Nature 460, 1082; 2009), we would like to elaborate on the background to its title. Lilavati was a mathematical treatise of the twelfth century, composed by the mathematician and astronomer Bhaskaracharya (1114–85) — also known as Bhaskara II — who was a teacher of repute and author of several other texts. The name Lilavati, which literally means 'playful', is a surprising title for an early scientific book. Some of the mathematical problems posed in the book are in verse form, and are addressed to a girl, the eponymous Lilavati. However, there is little real evidence concerning Lilavati's historicity. Tradition holds that she was Bhaskaracharya's daughter and that he wrote the treatise to console her after an accident that left her unable to marry. But this could be a later interpolation, as the idea was first mentioned in a Persian commentary. An alternative view has it that Lilavati was married at an inauspicious time and was widowed shortly afterwards. Other sources have implied that Lilavati was Bhaskaracharya's wife, or even one of his students — raising the possibility that women in parts of the Indian subcontinent could have participated in higher education as early as eight centuries ago. However, given that Bhaskara was a poet and pedagogue, it is also possible that he chose to address his mathematical problems to a doe-eyed girl simply as a whimsical and charming literary device.

Hardness of approximation results for the problem of finding the stopping distance in Tanner graphs

Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).

A deep‐level spectroscopic technique for determining capture cross‐section activation energy of Si‐related DX centers in AlxGa1-xAs

A deep‐level transient spectroscopy (DLTS) technique is reported for determining the capture cross‐section activation energy directly. Conventionally, the capture activation energy is obtained from the temperature dependence of the capture cross section. Capture cross‐section measurement is often very doubtful due to many intrinsic errors and is more critical for nonexponential capture kinetics. The essence of this technique is to use an emission pulse to allow the defects to emit electrons and the transient signal from capture process due to a large capture barrier was analyzed, in contrast with the emission signal in conventional DLTS. This technique has been applied for determining the capture barrier for silicon‐related DX centers in AlxGa1−xAs for different AlAs mole fractions.

Optimum Load Shedding Through Programming Techniques

This paper obtains a new accurate model for sensitivity in power systems and uses it in conjunction with linear programming for the solution of load-shedding problems with a minimum loss of loads. For cases where the error in the sensitivity model increases, other linear programming and quadratic programming models have been developed, assuming currents at load buses as variables and not load powers. A weighted error criterion has been used to take priority schedule into account; it can be either a linear or a quadratic function of the errors, and depending upon the function appropriate programming techniques are to be employed.

Error Correcting Functional Source Coding with Decoder Side Information using Row-Latin Rectangles

The functional source coding problem in which the receiver side information (Has-set) and demands (Want-set) include functions of source messages is studied using row-Latin rectangle. The source transmits encoded messages, called the functional source code, in order to satisfy the receiver's demands. We obtain a minimum length using the row-Latin rectangle. Next, we consider the case of transmission errors and provide a necessary and sufficient condition that a functional source code must satisfy so that the receiver can correctly decode the values of the functions in its Want-set.