Crystallization and preliminary X-ray crystallographic analysis of a galactose-specific lectin from Dolichos lablab

The galactose-specific lectin from the seeds of Dolichos lablab has been crystallized using the hanging-drop vapour-diffusion technique. The crystals belong to space group P1, with unit-cell parameters a = 73.99, b = 84.13, c = 93.15 angstrom, alpha = 89.92, beta = 76.01, gamma = 76.99 degrees. X-ray diffraction data to a resolution of 3.0 angstrom have been collected under cryoconditions ( 100 K) using a MAR imaging-plate detector system mounted on a rotating-anode X-ray generator. Molecular-replacement calculations carried out using the available structures of legume lectins as search models revealed that the galactose-specific lectin from D. lablab forms a tetramer similar to soybean agglutinin; two such tetramers are present in the asymmetric unit.

Crystallization and preliminary X-ray diffraction analysis of a galactose-specific lectin from the seeds of Butea monosperma

The galactose-specific lectin from the seeds of Butea monosperma has been crystallized by the hanging-drop vapour-diffusion technique. The crystals belonged to space group P1, with unit-cell parameters a = 78.45, b = 78.91, c = 101.85 A, alpha = 74.30, beta = 76.65, gamma = 86.88 degrees. X-ray diffraction data were collected to a resolution of 2.44 A under cryoconditions (100 K) using a MAR image-plate detector system mounted on a rotating-anode X-ray generator. Molecular-replacement calculations carried out using the coordinates of several structures of legume lectins as search models indicate that the galactose-specific lectin from B. monosperma forms an octamer.

Crystallization and preliminary X-ray diffraction analysis of a galactose-specific lectin from the seeds of Butea monosperma

The galactose-specific lectin from the seeds of Butea monosperma has been crystallized by the hanging-drop vapour-diffusion technique. The crystals belonged to space group P1, with unit-cell parameters a = 78.45, b = 78.91, c = 101.85 A, alpha = 74.30, beta = 76.65, gamma = 86.88 degrees. X-ray diffraction data were collected to a resolution of 2.44 A under cryoconditions (100 K) using a MAR image-plate detector system mounted on a rotating-anode X-ray generator. Molecular-replacement calculations carried out using the coordinates of several structures of legume lectins as search models indicate that the galactose-specific lectin from B. monosperma forms an octamer.

Two-agent cooperative search using game models with endurance-time constraints

In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

Negotiation schemes for multi-agent cooperative search

Because of limited sensor and communication ranges, designing efficient mechanisms for cooperative tasks is difficult. In this article, several negotiation schemes for multiple agents performing a cooperative task are presented. The negotiation schemes provide suboptimal solutions, but have attractive features of fast decision-making, and scalability to large number of agents without increasing the complexity of the algorithm. A software agent architecture of the decision-making process is also presented. The effect of the magnitude of information flow during the negotiation process is studied by using different models of the negotiation scheme. The performance of the various negotiation schemes, using different information structures, is studied based on the uncertainty reduction achieved for a specified number of search steps. The negotiation schemes perform comparable to that of optimal strategy in terms of uncertainty reduction and also require very low computational time, similar to 7 per cent to that of optimal strategy. Finally, analysis on computational and communication requirement for the negotiation schemes is carried out.

Analyzing information flow in brain networks with nonparametric Granger causality

Multielectrode neurophysiological recording and high-resolution neuroimaging generate multivariate data that are the basis for understanding the patterns of neural interactions. How to extract directions of information flow in brain networks from these data remains a key challenge. Research over the last few years has identified Granger causality as a statistically principled technique to furnish this capability. The estimation of Granger causality currently requires autoregressive modeling of neural data. Here, we propose a nonparametric approach based on widely used Fourier and wavelet transforms to estimate both pairwise and conditional measures of Granger causality, eliminating the need of explicit autoregressive data modeling. We demonstrate the effectiveness of this approach by applying it to synthetic data generated by network models with known connectivity and to local field potentials recorded from monkeys performing a sensorimotor task.

Self Assessment-Based Decision Making for Multiagent Cooperative Search

This paper addresses a search problem with multiple limited capability search agents in a partially connected dynamical networked environment under different information structures. A self assessment-based decision-making scheme for multiple agents is proposed that uses a modified negotiation scheme with low communication overheads. The scheme has attractive features of fast decision-making and scalability to large number of agents without increasing the complexity of the algorithm. Two models of the self assessment schemes are developed to study the effect of increase in information exchange during decision-making. Some analytical results on the maximum number of self assessment cycles, effect of increasing communication range, completeness of the algorithm, lower bound and upper bound on the search time are also obtained. The performance of the various self assessment schemes in terms of total uncertainty reduction in the search region, using different information structures is studied. It is shown that the communication requirement for self assessment scheme is almost half of the negotiation schemes and its performance is close to the optimal solution. Comparisons with different sequential search schemes are also carried out. Note to Practitioners-In the futuristic military and civilian applications such as search and rescue, surveillance, patrol, oil spill, etc., a swarm of UAVs can be deployed to carry out the mission for information collection. These UAVs have limited sensor and communication ranges. In order to enhance the performance of the mission and to complete the mission quickly, cooperation between UAVs is important. Designing cooperative search strategies for multiple UAVs with these constraints is a difficult task. Apart from this, another requirement in the hostile territory is to minimize communication while making decisions. This adds further complexity to the decision-making algorithms. In this paper, a self-assessment-based decision-making scheme, for multiple UAVs performing a search mission, is proposed. The agents make their decisions based on the information acquired through their sensors and by cooperation with neighbors. The complexity of the decision-making scheme is very low. It can arrive at decisions fast with low communication overheads, while accommodating various information structures used for increasing the fidelity of the uncertainty maps. Theoretical results proving completeness of the algorithm and the lower and upper bounds on the search time are also provided.

Features in visual search combine linearly

Single features such as line orientation and length are known to guide visual search, but relatively little is known about how multiple features combine in search. To address this question, we investigated how search for targets differing in multiple features ( intensity, length, orientation) from the distracters is related to searches for targets differing in each of the individual features. We tested race models (based on reaction times) and coactivation models ( based on reciprocal of reaction times) for their ability to predict multiple feature searches. Multiple feature searches were best accounted for by a co-activation model in which feature information combined linearly (r = 0.95). This result agrees with the classic finding that these features are separable i.e., subjective dissimilarity ratings sum linearly. We then replicated the classical finding that the length and width of a rectangle are integral features-in other words, they combine nonlinearly in visual search. However, to our surprise, upon including aspect ratio as an additional feature, length and width combined linearly and this model outperformed all other models. Thus, length and width of a rectangle became separable when considered together with aspect ratio. This finding predicts that searches involving shapes with identical aspect ratio should be more difficult than searches where shapes differ in aspect ratio. We confirmed this prediction on a variety of shapes. We conclude that features in visual search co-activate linearly and demonstrate for the first time that aspect ratio is a novel feature that guides visual search.

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.

Regolith mass balance inferred from combined mineralogical, geochemical and geophysical studies: Mule Hole gneissic watershed, South India

The aim of this study is to propose a method to assess the long-term chemical weathering mass balance for a regolith developed on a heterogeneous silicate substratum at the small experimental watershed scale by adopting a combined approach of geophysics, geochemistry and mineralogy. We initiated in 2003 a study of the steep climatic gradient and associated geomorphologic features of the edge of the rifted continental passive margin of the Karnataka Plateau, Peninsular India. In the transition sub-humid zone of this climatic gradient we have studied the pristine forested small watershed of Mule Hole (4.3 km(2)) mainly developed on gneissic substratum. Mineralogical, geochemical and geophysical investigations were carried out (i) in characteristic red soil profiles and (ii) in boreholes up to 60 m deep in order to take into account the effect of the weathering mantle roots. In addition, 12 Electrical Resistivity Tomography profiles (ERT), with an investigation depth of 30 m, were generated at the watershed scale to spatially characterize the information gathered in boreholes and soil profiles. The location of the ERT profiles is based on a previous electromagnetic survey, with an investigation depth of about 6 m. The soil cover thickness was inferred from the electromagnetic survey combined with a geological/pedological survey. Taking into account the parent rock heterogeneity, the degree of weathering of each of the regolith samples has been defined using both the mineralogical composition and the geochemical indices (Loss on Ignition, Weathering Index of Parker, Chemical Index of Alteration). Comparing these indices with electrical resistivity logs, it has been found that a value of 400 Ohm m delineates clearly the parent rocks and the weathered materials, Then the 12 inverted ERT profiles were constrained with this value after verifying the uncertainty due to the inversion procedure. Synthetic models based on the field data were used for this purpose. The estimated average regolith thickness at the watershed scale is 17.2 m, including 15.2 m of saprolite and 2 m of soil cover. Finally, using these estimations of the thicknesses, the long-term mass balance is calculated for the average gneiss-derived saprolite and red soil. In the saprolite, the open-system mass-transport function T indicates that all the major elements except Ca are depleted. The chlorite and biotite crystals, the chief sources for Mg (95%), Fe (84%), Mn (86%) and K (57%, biotite only), are the first to undergo weathering and the oligoclase crystals are relatively intact within the saprolite with a loss of only 18%. The Ca accumulation can be attributed to the precipitation of CaCO3 from the percolating solution due to the current and/or the paleoclimatic conditions. Overall, the most important losses occur for Si, Mg and Na with -286 x 10(6) mol/ha (62% of the total mass loss), -67 x 10(6) mol/ha (15% of the total mass loss) and -39 x 10(6) mol/ha (9% of the total mass loss), respectively. Al, Fe and K account for 7%, 4% and 3% of the total mass loss, respectively. In the red soil profiles, the open-system mass-transport functions point out that all major elements except Mn are depleted. Most of the oligoclase crystals have broken down with a loss of 90%. The most important losses occur for Si, Na and Mg with -55 x 10(6) mol/ha (47% of the total mass loss), -22 x 10(6) mol/ha (19% of the total mass loss) and -16 x 10(6) mol/ha (14% of the total mass loss), respectively. Ca, Al, K and Fe account for 8%, 6%, 4% and 2% of the total mass loss, respectively. Overall these findings confirm the immaturity of the saprolite at the watershed scale. The soil profiles are more evolved than saprolite but still contain primary minerals that can further undergo weathering and hence consume atmospheric CO2.

Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

Electrochemical phase formation (ECPF): Nucleation growth vis-a-vis adsorption models

The nucleataon growth model of electrochemical phase formation is analysed for the hnear potential sweep input Apart from deducing diagnostic criteria and method~ of estimating model parameters, the predictions of the nucleation growth model are compared and contrasted with those of a sample adsorption model A dastlnCtlOn is made possible between adsorption and phase transition, which seems useful for understanding the nature of ECPF phenomena, especially underpotentlal deposition (UPD).

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.

On the shear deformation theory for dynamic analysis of beams

Timoshenko's shear deformation theory is widely used for the dynamical analysis of shear-flexible beams. This paper presents a comparative study of the shear deformation theory with a higher order model, of which Timoshenko's shear deformation model is a special case. Results indicate that while Timoshenko's shear deformation theory gives reasonably accurate information regarding the set of bending natural frequencies, there are considerable discrepancies in the information it gives regarding the mode shapes and dynamic response, and so there is a need to consider higher order models for the dynamical analysis of flexure of beams.

Adsorption isotherms for neutral organic compounds - A hierarchy in modelling: Part V. Models for the inner layer potential difference in the presence of dipolar adsorption

The relations for the inner layer potential &fference (E) in the presence of adsorbed orgamc molecules are derived for three hterarchlcal models, m terms of molecular constants like permanent &pole moments, polarlzablhtles, etc It is shown how the experimentally observed patterns of the E vs 0 plots (hnear m all ranges of $\sigma^M$, non-linear in one or both regions of o M, etc ) can be understood in a serm-quantltatlve manner from the simplest model in our hierarchy, viz the two-state site panty version Two-state multi-site and three-state (sxte panty) models are also analysed and the slope (3E/80),,M tabulated for these also The results for the Esm-Markov effect are denved for all the models and compared with the earlier result of Parsons. A comparison with the GSL phenomenologlcal equation is presented and its molecular basis, as well as the hmltatlons, is analysed. In partxcular, two-state multa-slte and three-state (site panty) models yield E-o M relations that are more general than the "umfied" GSL equation The posslblhty of vaewlng the compact layer as a "composite medium" with an "effective dlelectnc constant" and obtaimng novel phenomenological descnptions IS also indicated.