On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.

A Flexible Class of Regenerating Codes for Distributed Storage

In the distributed storage setting introduced by Dimakis et al., B units of data are stored across n nodes in the network in such a way that the data can be recovered by connecting to any k nodes. Additionally one can repair a failed node by connecting to any d nodes while downloading at most beta units of data from each node. In this paper, we introduce a flexible framework in which the data can be recovered by connecting to any number of nodes as long as the total amount of data downloaded is at least B. Similarly, regeneration of a failed node is possible if the new node connects to the network using links whose individual capacity is bounded above by beta(max) and whose sum capacity equals or exceeds a predetermined parameter gamma. In this flexible setting, we obtain the cut-set lower bound on the repair bandwidth along with a constructive proof for the existence of codes meeting this bound for all values of the parameters. An explicit code construction is provided which is optimal in certain parameter regimes.

Test Application Time Minimization for RAS using Basis Optimization of Column Decoder

Random Access Scan, which addresses individual flip-flops in a design using a memory array like row and column decoder architecture, has recently attracted widespread attention, due to its potential for lower test application time, test data volume and test power dissipation when compared to traditional Serial Scan. This is because typically only a very limited number of random ``care'' bits in a test response need be modified to create the next test vector. Unlike traditional scan, most flip-flops need not be updated. Test application efficiency can be further improved by organizing the access by word instead of by bit. In this paper we present a new decoder structure that takes advantage of basis vectors and linear algebra to further significantly optimize test application in RAS by performing the write operations on multiple bits consecutively. Simulations performed on benchmark circuits show an average of 2-3 times speed up in test write time compared to conventional RAS.

Queued Cooperative Wireless Networks With Rateless Codes

Cooperative communication using rateless codes, in which the source transmits an infinite number of parity bits to the destination until the receipt of an acknowledgment, has recently attracted considerable interest. It provides a natural and efficient mechanism for accumulating mutual information from multiple transmitting relays. We develop an analysis of queued cooperative relay systems that combines the communication-theoretic transmission aspects of cooperative communication using rateless codes over Rayleigh fading channels with the queuing-theoretic aspects associated with buffering messages at the relays. Relay cooperation combined with queuing reduces the message transmission times and also helps distribute the traffic load in the network, which improves throughput significantly.

Cardiac remodeling in Drosophila arises from changes in actin gene expression and from a contribution of lymph gland-like cells to the heart musculature

Understanding the basis of normal heart remodeling can provide insight into the plasticity of the cardiac state, and into the potential for treating diseased tissue. In Drosophila, the adult heart arises during metamorphosis from a series of events, that include the remodeling of an existing cardiac tube, the elaboration of new inflow tracts, and the addition of a layer of longitudinal muscle fibers. We have identified genes active in all these three processes, and studied their expression in order to characterize in greater detail normal cardiac remodeling. Using a Transglutaminase-lacZ transgenic line, that is expressed in the inflow tracts of the larval and adult heart, we confirm the existence of five inflow tracts in the adult structure. In addition, expression of the Actin87E actin gene is initiated in the remodeling cardiac tube, but not in the longitudinal fibers, and we have identified an Act87E promoter fragment that recapitulates this switch in expression. We also establish that the longitudinal fibers are multinucleated, characterizing these cells as specialized skeletal muscles. Furthermore, we have defined the origin of the longitudinal fibers, as a subset of lymph gland cells associated with the larval dorsal vessel. These studies underline the myriad contributors to the formation of the adult Drosophila heart, and provide new molecular insights into the development of this complex organ. (C) 2011 Elsevier Ireland Ltd. All rights reserved.

Chemical Synthesis of Metal Nanoparticles Using Amine-Boranes

The development of new synthetic strategies to obtain mono-disperse metal nanoparticles on large scales is an attractive prospect in the context of sustainability. Recently, amine-boranes, the classical Lewis acid-base adducts, have been employed as reducing agents for the synthesis of metal nanoparticles. They offer several advantages over the traditional reducing agents like the borohydrides; for example, a much better control of the rate of reduction and, hence, the particle size distribution of metal nanoparticles; diversity in their reducing abilities by varying the substituents on the nitrogen atom; and solubility in various protic and aprotic solvents. Amine-boranes have not only been used successfully as reducing agents in solution but also in solventless conditions, in which along with the reduction of the metal precursor, they undergo in situ transformation to afford the stabilizing agent for the generated metal nanoparticles, thereby bringing about atom economy as well. The use of amine boranes for the synthesis of metal nanoparticles has experienced an explosive growth in a very short period of time. In this Minireview, recent progress on the use of amine boranes for the synthesis of metal nanoparticles, with a focus towards the development of pathways for sustainability, is discussed.

Optimal management of beaver population using a reduced-order distributed parameter model and single network adaptive critics

Beavers are often found to be in conflict with human interests by creating nuisances like building dams on flowing water (leading to flooding), blocking irrigation canals, cutting down timbers, etc. At the same time they contribute to raising water tables, increased vegetation, etc. Consequently, maintaining an optimal beaver population is beneficial. Because of their diffusion externality (due to migratory nature), strategies based on lumped parameter models are often ineffective. Using a distributed parameter model for beaver population that accounts for their spatial and temporal behavior, an optimal control (trapping) strategy is presented in this paper that leads to a desired distribution of the animal density in a region in the long run. The optimal control solution presented, imbeds the solution for a large number of initial conditions (i.e., it has a feedback form), which is otherwise nontrivial to obtain. The solution obtained can be used in real-time by a nonexpert in control theory since it involves only using the neural networks trained offline. Proper orthogonal decomposition-based basis function design followed by their use in a Galerkin projection has been incorporated in the solution process as a model reduction technique. Optimal solutions are obtained through a "single network adaptive critic" (SNAC) neural-network architecture.

Active vibration suppression of beams with discrete actuators using optimal dynamic inversion

Most of the structural elements like beams, cables etc. are flexible and should be modeled as distributed parameter systems (DPS) to represent the reality better. For large structures, the usual approach of 'modal representation' is not an accurate representation. Moreover, for excessive vibrations (possibly due to strong wind, earthquake etc.), external power source (controller) is needed to suppress it, as the natural damping of these structures is usually small. In this paper, we propose to use a recently developed optimal dynamic inversion technique to design a set of discrete controllers for this purpose. We assume that the control force to the structure is applied through finite number of actuators, which are located at predefined locations in the spatial domain. The method used in this paper determines control forces directly from the partial differential equation (PDE) model of the system. The formulation has better practical significance, both because it leads to a closed form solution of the controller (hence avoids computational issues) as well as because a set of discrete actuators along the spatial domain can be implemented with relative ease (as compared to a continuous actuator)

Buckling patterns in diamond-like carbon films

An optical microscopy study of stress relief patterns in diamond-like carbon films is presented. Interesting stress relief patterns are observed which include the well-known sinusoidal type, branching pattern and string-of-beads pattern. The last one is shown to relieve stresses under marginal conditions. Two new stress relief patterns are noted in the present study. One of them is of sinusoidal shape with two extra branches at every peak position. The distribution of different stress relief forms from the outer edge of the films towards the interior is markedly dependent on the film thickness. Our new patterns support the approach in which the stress relief forms have been analysed earlier using the theory of plate buckling.

Code Generation Paradigms On Optical Orthogonal And Other Codes In a Fiber Optic CDMA Lan

Code Division Multiple Access (CDMA) techniques, by far, had been applied to LAN problems by many investigators, An analytical study of well known algorithms for generation of Orthogonal codes used in FO-CDMA systems like those for prime, quasi-Prime, Optical Orthogonal and Matrix codes has been presented, Algorithms for OOCs like Greedy/Modified Greedy/Accelerated Greedy algorithms are implemented. Many speed-up enhancements. for these algorithms are suggested. A novel Synthetic Algorithm based on Difference Sets (SADS) is also proposed. Investigations are made to vectorise/parallelise SADS to implement the source code on parallel machines. A new matrix for code families of OOCs with different seed code-words but having the same (n,w,lambda) set is formulated.

Optimization of cold and warm workability in stainless steel type AISI 316L using instability maps

The deformation characteristics of stainless steel type AISI 316L under compression in the temperature range 20 to 600 degrees C and strain rate range 0.001 to 100 s(-1) have been studied with a view to characterizing the flow instabilities occurring in the microstructure. At temperatures lower than 100 degrees C and strain rates higher than 0.1 s(-1), 316L stainless steel exhibits flow localization whereas dynamic strain aging (DSA) occurs at intermediate temperatures and below 1 s(-1). To avoid the above flow instabilities, cold working should be carried out at strain rates less than 0.1 s(-1). Warm working of stainless steel type AISI 316L may be done in the temperature and strain rate regime of: 300 to 400 degrees C and 0.001 s(-1) 300 to 450 degrees C and 0.01 s(-1): 450 to 600 degrees C and 0.1 s(-1); 500 degrees C and 1 s(-1) since these regions are free from flow instabilities like DSA and flow localization. The continuum criterion, developed on the basis of the principles of maximum rate of entropy production and separability of the dissipation function, predicts accurately all the above instability features.

Generation of an eight node brick element using Papcovitch-Neuber functions

Some conventional finite elements suffer from drawbacks, such as shear locking, membrane locking, etc. To overcome them researchers have developed various techniques, termed as tricks by some and variational crimes by others. Many attempts have been made, but satisfactory explanations for why some of these techniques work have not been obtained, especially in the case of solid elements. This paper attempts a simple non-conforming solid element using assumed displacement fields which satisfy the Navier equation exactly. Its behaviour under simple loadings like bending, torsion and tension is examined and comparisons are made with existing elements.

Primary structure of a cytotoxin-like basic protein from Naja naja naja (Indian Cobra) venom

The complete amino acid sequence of a cytotoxin-like basic protein (CLBP) from the venom of Naja naja naja (Indian Cobra) was determined by manual degradation using a 4-dimethylaminoazobenzene-4'-isothiocyanate double-coupling method. Peptide fragments obtained by chemical cleavage with cyanogen bromide and enzymic cleavages with trypsin and Staphylococcus aureus proteases for sequence analysis were purified by reversed-phase chromatography. The total number of amino acid residues was 61, with leucine as the C-terminal residue. (C) Munksgaard 1995.

MIMO Precoding With X- and Y- Codes

We consider a slow fading multiple-input multiple-output (MIMO) system with channel state information at both the transmitter and receiver. A well-known precoding scheme is based upon the singular value decomposition (SVD) of the channel matrix, which transforms the MIMO channel into parallel subchannels. Despite having low maximum likelihood decoding (MLD) complexity, this SVD precoding scheme provides a diversity gain which is limited by the diversity gain of the weakest subchannel. We therefore propose X- and Y-Codes, which improve the diversity gain of the SVD precoding scheme but maintain the low MLD complexity, by jointly coding information across a pair of subchannels. In particular, subchannels with high diversity gain are paired with those having low diversity gain. A pair of subchannels is jointly encoded using a 2 2 real matrix, which is fixed a priori and does not change with each channel realization. For X-Codes, these rotation matrices are parameterized by a single angle, while for Y-Codes, these matrices are left triangular matrices. Moreover, we propose X-, Y-Precoders with the same structure as X-, Y-Codes, but with encoding matrices adapted to each channel realization. We observed that X-Codes/Precoders are good for well-conditioned channels, while Y-Codes/Precoders are good for ill-conditioned channels.

Selective deprotection of propargyl ethers using tetrathiomolybdate

Benzyltriethylammonium tetrathiomolybdate, [PhCH2NEt3](2)MoS4, 1 deprotects propargyl ethers of alcohols and phenols in a selective manner in high yields. Easily reducible groups like nitro, aldehyde, keto and allyl are not affected.