Changing resonator geometry to boost sound power decouples size and song frequency in a small insect

Despite their small size, some insects, such as crickets, can produce high amplitude mating songs by rubbing their wings together. By exploiting structural resonance for sound radiation, crickets broadcast species-specific songs at a sharply tuned frequency. Such songs enhance the range of signal transmission, contain information about the signaler's quality, and allow mate choice. The production of pure tones requires elaborate structural mechanisms that control and sustain resonance at the species-specific frequency. Tree crickets differ sharply from this scheme. Although they use a resonant system to produce sound, tree crickets can produce high amplitude songs at different frequencies, varying by as much as an octave. Based on an investigation of the driving mechanism and the resonant system, using laser Doppler vibrometry and finite element modeling, we show that it is the distinctive geometry of the crickets' forewings (the resonant system) that is responsible for their capacity to vary frequency. The long, enlarged wings enable the production of high amplitude songs; however, as a mechanical consequence of the high aspect ratio, the resonant structures have multiple resonant modes that are similar in frequency. The drive produced by the singing apparatus cannot, therefore, be locked to a single frequency, and different resonant modes can easily be engaged, allowing individual males to vary the carrier frequency of their songs. Such flexibility in sound production, decoupling body size and song frequency, has important implications for conventional views of mate choice, and offers inspiration for the design of miniature, multifrequency, resonant acoustic radiators.

Constraining complex aquifer geometry with geophysics (2-D ERT and MRS measurements) for stochastic modelling of groundwater flow

Stochastic modelling is a useful way of simulating complex hard-rock aquifers as hydrological properties (permeability, porosity etc.) can be described using random variables with known statistics. However, very few studies have assessed the influence of topological uncertainty (i.e. the variability of thickness of conductive zones in the aquifer), probably because it is not easy to retrieve accurate statistics of the aquifer geometry, especially in hard rock context. In this paper, we assessed the potential of using geophysical surveys to describe the geometry of a hard rock-aquifer in a stochastic modelling framework. The study site was a small experimental watershed in South India, where the aquifer consisted of a clayey to loamy-sandy zone (regolith) underlain by a conductive fissured rock layer (protolith) and the unweathered gneiss (bedrock) at the bottom. The spatial variability of the thickness of the regolith and fissured layers was estimated by electrical resistivity tomography (ERT) profiles, which were performed along a few cross sections in the watershed. For stochastic analysis using Monte Carlo simulation, the generated random layer thickness was made conditional to the available data from the geophysics. In order to simulate steady state flow in the irregular domain with variable geometry, we used an isoparametric finite element method to discretize the flow equation over an unstructured grid with irregular hexahedral elements. The results indicated that the spatial variability of the layer thickness had a significant effect on reducing the simulated effective steady seepage flux and that using the conditional simulations reduced the uncertainty of the simulated seepage flux. As a conclusion, combining information on the aquifer geometry obtained from geophysical surveys with stochastic modelling is a promising methodology to improve the simulation of groundwater flow in complex hard-rock aquifers. (C) 2013 Elsevier B.V. All rights reserved.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

Void Geometry Driven Spin Crossover in Zeolite-Encapsulated Cobalt Tris(bipyridyl) Complex Ion

The cobalt(II) tris(bipyridyl) complex ion encapsulated in zeolite-Y supercages exhibits a thermally driven interconversion between a low-spin and a high-spin state-a phenomenon not observed for this ion either in solid state or in solution. From a comparative study of the magnetism and optical spectroscopy of the encapsulated and unencapsulated complex ion, supported by molecular modeling, such spin behavior is shown to be intramolecular in origin. In the unencapsulated or free state, the [Co(bipy)(3)](2+) ion exhibits a marked trigonal prismatic distortion, but on encapsulation, the topology of the supercage forces it to adopt a near-octahedral geometry. An analysis using the angular overlap ligand field model with spectroscopically derived parameters shows that the geometry does indeed give rise to a low-spin ground state, and suggests a possible scenario for the spin state interconversion.

Reconstruction from incomplete data in cone-beam tomography

A method for reconstruction of an object f(x) x=(x,y,z) from a limited set of cone-beam projection data has been developed. This method uses a modified form of convolution back-projection and projection onto convex sets (POCS) for handling the limited (or incomplete) data problem. In cone-beam tomography, one needs to have a complete geometry to completely reconstruct the original three-dimensional object. While complete geometries do exist, they are of little use in practical implementations. The most common trajectory used in practical scanners is circular, which is incomplete. It is, however, possible to recover some of the information of the original signal f(x) based on a priori knowledge of the nature of f(x). If this knowledge can be posed in a convex set framework, then POCS can be utilized. In this report, we utilize this a priori knowledge as convex set constraints to reconstruct f(x) using POCS. While we demonstrate the effectiveness of our algorithm for circular trajectories, it is essentially geometry independent and will be useful in any limited-view cone-beam reconstruction.

PocketMatch: A new algorithm to compare binding sites in protein structures

Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. Conclusion: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th) second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.

Collision-Geometry-Based Pulsed Guidance Law for Exoatmospheric Interception

No abstract is available.

G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage

Protocols for secure archival storage are becoming increasingly important as the use of digital storage for sensitive documents is gaining wider practice. Wong et al.[8] combined verifiable secret sharing with proactive secret sharing without reconstruction and proposed a verifiable secret redistribution protocol for long term storage. However their protocol requires that each of the receivers is honest during redistribution. We proposed[3] an extension to their protocol wherein we relaxed the requirement that all the recipients should be honest to the condition that only a simple majority amongst the recipients need to be honest during the re(distribution) processes. Further, both of these protocols make use of Feldman's approach for achieving integrity during the (redistribution processes. In this paper, we present a revised version of our earlier protocol, and its adaptation to incorporate Pedersen's approach instead of Feldman's thereby achieving information theoretic secrecy while retaining integrity guarantees.

Synthesis, crystal structures and protease activity of amino acid Schiff base iron(III) complexes

Iron(III) complexes, (NHEt3)[Fe(III)(sal-met)(2)] and (NHEt3)[Fe(III)(sal-phe)(2)], of amino acid Schiffbase ligands, viz., N-salicylidene-L-methionine and N-salicylidene L-phenylalanine, have been prepared and their binding to bovine serum albumin (BSA) and photo-induced BSA cleavage activity have been investigated. The complexes are structurally characterized by single crystal X-ray crystallography. The crystal Structures of the discrete mononuclear rnonoanionic complexes show FeN2O4 octahedral coordination geometry in which the tridentate dianionic amino acid Schiff base ligand binds through phenolate and carboxylate oxygen and imine nitrogen atoms. The imine nitrogen atoms are trans to each other. The Fe-O and Fe-N bond distances range between 1.9 and 2.1 angstrom. The sal-met complex has two pendant thiomethyl groups. The high-spin iron(III) complexes (mu(eff) similar to 5.9 mu(B)) exhibit quasi-reversible Fe(III)/Fe(II) redox process near -0.6 V vs. SCE in water. These complexes display a visible electronic hand near 480 nm in tris-HCl buffer assignable to the phenolate-to-iron(III) charge transfer transition. The water soluble complexes bind to BSA giving binding constant values of similar to 10(5) M-1. The Complexes show non-specific oxidative cleavage of BSA protein on photo-irradiation with UV-A light of 365 nm.

Information theory and one-dimensional disordered conductors

A novel method is proposed to treat the problem of the random resistance of a strictly one-dimensional conductor with static disorder. It is suggested, for the probability distribution of the transfer matrix of the conductor, the distribution of maximum information-entropy, constrained by the following physical requirements: 1) flux conservation, 2) time-reversal invariance and 3) scaling, with the length of the conductor, of the two lowest cumulants of ζ, where = sh2ζ. The preliminary results discussed in the text are in qualitative agreement with those obtained by sophisticated microscopic theories.

ADAMIS: a database for medical information systems

This paper describes the design and implementation of ADAMIS (‘A database for medical information systems’). ADAMIS is a relational database management system for a general hospital environment. Apart from the usual database (DB) facilities of data definition and data manipulation, ADAMIS supports a query language called the ‘simplified medical query language’ (SMQL) which is completely end-user oriented and highly non-procedural. Other features of ADAMIS include provision of facilities for statistics collection and report generation. ADAMIS also provides adequate security and integrity features and has been designed mainly for use on interactive terminals.

Geometry Of Proline And Hydroxyproline .1. An Analysis Of X-Ray Crystal-Structure Data

We have carried out an analysis of crystal structure data on prolyl and hydroxyprolyl moieties in small molecules. The flexibility of the pyrrolidine ring due to the pyramidal character of nitrogen has been defined in terms of two projection angles δ1 and δ2. The distribution of these parameters in the crystal structures is found to be consistent with results of the energy calculations carried out on prolyl moieties in our laboratory.

Structural Basis of Drug Resistance by Genetic Variants of HIV Type 1 Clade C Protease from India

Using computer modeling of three-dimensional structures and structural information available on the crystal structures of HIV-1 protease, we investigated the structural effects of mutations, in treatment-naive and treatment-exposed individuals from India and postulated mechanisms of resistance in clade C variants. A large number of models (14) have been generated by computational mutation of the available crystal structures of drug bound proteases. Localized energy minimization was carried out in and around the sites of mutation in order to optimize the geometry of interactions present. Most of the mutations result in structural differences at the flap that favors the semiopen state of the enzyme. Some of the mutations were also found to confer resistance by affecting the geometry of the active site. The E35D mutation affects the flap structure in clade B strains and E35N and E35K mutation, seen in our modeled strains, have a more profound effect. Common polymorphisms at positions 36 and 63 in clade C also affected flap structure. Apart from a few other residues Gln-58, Asn-83, Asn-88, and Gln-92 and their interactions are important for the transition from the closed to the open state. Development of protease inhibitors by structure-based design requires investigation of mechanisms operative for clade C to improve the efficacy of therapy.