Maturation of a transient outward potassium current in mouse fetal hypothalamic neurons in culture

The whole-cell voltage clamp technique was used to record potassium currents in mouse fetal hypothalamic neurons developing in culture medium from days 1 to 17. The neurons were derived from fetuses of IOPS/OF1 mice on the 14th day of gestation. The mature neurons (>six days in culture) showed both a transient potassium current and a non-inactivating delayed rectifier potassium current. These were identified pharmacologically by using the potassium channel blockers tetraethyl ammonium chloride and 4-aminopyridine, and on the basis of their kinetics and voltage sensitivities. The delayed rectifier potassium current had a threshold of −20 mV, a slow time-course of activation, and was sustained during the voltage pulse. The 4-aminopyridine-sensitive current was transient, and was activated from a holding potential more negative (−80 mV) than that required for evoking the delayed rectifier potassium current (−40 mV). The delayed rectifier potassium current was detectable from day 1 onwards, while the transient potassium current showed a distinct developmental trend. The time-constant of inactivation became faster with age in culture. The half steady-state inactivation potential showed a shift towards less negative membrane potentials with age, and the relationship was best described by a logarithmic regression equation.The developmental trend of the transient potassium current may relate functionally to the progressive morphological changes, and the appearance of synaptic connections during ontogenesis.

Branch-branch connections in trees analogous to hyphal fusions in fungal colonies

the leopard tree Caesalpinia ferrea (Leguminosae) a native of eastern Brazil-some of the leader branches connect to and fuse with neighbouring branches of the same tree. The bridge initials project out as pegs or protuberances and apparently extend in a coordinated manner, connecting branches up to 4 ft apart. The fusion of two branches of the same tree implies intra-plant communication involving signaling factor(s). The bridges resemble fusions between hyphae in a fungal colony. Whereas hyphal fusions are common and the process is apparently completed in <1 h, branch fusions in C. ferrea tree are limited and a slow process, apparently requiring several months to years to complete. Branch fusions in C. ferrea are in accord with Claus Mattheck's analysis that tree branches actually seek contact rather than avoid contacts.

Flat connections, geometric invariants and the symplectic nature of the fundamental group of surfaces

In this paper we associate a new geometric invariant to the space of fiat connections on a G (= SU(2))-bundle on a compact Riemann surface M and relate it tcr the symplectic structure on the space Hom(pi(1)(M), G)/G consisting of representations of the fundamental group pi(1)(M) Of M into G module the conjugate action of G on representations.

On some geometric invariants associated to the space of flat connections on an open space

A geometric invariant is associated to the parabolic moduli space on a marked surface and is related to the symplectic structure of the moduli space.

Flat connections, geometric invariants and energy of harmonic functions on compact Riemann surfaces

A geometric invariant is associated to the space of fiat connections on a G-bundle over a compact Riemann surface and is related to the energy of harmonic functions.

Punching shear strength of flat slab corner column connections .1. Reinforced concrete connections

This paper presents the details of an experimental study on punching shear strength and behaviour of reinforced concrete corner column connections in flat slabs; a quasi-empirical method is proposed for computing the punching shear strength. The method has also been extended for punching shear strength prediction at interior and edge column connections. The test results compare better with the strengths predicted by the proposed method than those by Ingvarson, Zaglool and Pollet available in the literature. Further, the experimental strengths of interior, edge and corner column connections have been compared with the strengths predicted by the proposed method and the two codes of practice, viz. ACI and BS code, to demonstrate the usefulness of the method.

Punching shear strength of flat slab corner column connections .2. Fibre-reinforced concrete connections

This paper gives the details of the studies undertaken to examine the strength and behaviour of fibre-reinforced concrete corner column connections in flat slabs. Tests have been conducted on 16 specimens with varying reinforcement ratio, moment/shear ratio (load eccentricity) and volume fraction of fibres. A quasi-empirical method has been proposed for computing the punching shear strength. The method has also been extended to fibre-reinforced concrete interior column connections, tests on which are available in the literature. The test results have been compared with the strength predicted by the proposed method for corner column as well as interior column connections and a satisfactory agreement noticed.

Analytical model for congestion control and throughput with TCP CUBIC connections

We develop a Markov model for a TCP CUBIC connection. Next we use it to obtain approximate expressions for throughput when there may be queuing in the network. Finally we provide the throughputs different TCP CUBIC and TCP NewReno connections obtain while sharing a channel when they may have different round trip delays and packet loss probabilities.

Performance analysis of data and voice connections in a cognitive radio network

We study the performance of cognitive (secondary) users in a cognitive radio network which uses a channel whenever the primary users are not using the channel. The usage of the channel by the primary users is modelled by an ON-OFF renewal process. The cognitive users may be transmitting data using TCP connections and voice traffic. The voice traffic is given priority over the data traffic. We theoretically compute the mean delay of TCP and voice packets and also the mean throughput of the different TCP connections. We compare the theoretical results with simulations.

Intra and Inter-Molecular Communications Through Protein Structure Network

Communication within and across proteins is crucial for the biological functioning of proteins. Experiments such as mutational studies on proteins provide important information on the amino acids, which are crucial for their function. However, the protein structures are complex and it is unlikely that the entire responsibility of the function rests on only a few amino acids. A large fraction of the protein is expected to participate in its function at some level or other. Thus, it is relevant to consider the protein structures as a completely connected network and then deduce the properties, which are related to the global network features. In this direction, our laboratory has been engaged in representing the protein structure as a network of non-covalent connections and we have investigated a variety of problems in structural biology, such as the identification of functional and folding clusters, determinants of quaternary association and characterization of the network properties of protein structures. We have also addressed a few important issues related to protein dynamics, such as the process of oligomerization in multimers, mechanism on protein folding, and ligand induced communications (allosteric effect). In this review we highlight some of the investigations which we have carried out in the recent past. A review on protein structure graphs was presented earlier, in which the focus was on the graphs and graph spectral properties and their implementation in the study of protein structure graphs/networks (PSN). In this article, we briefly summarize the relevant parts of the methodology and the focus is on the advancement brought out in the understanding of protein structure-function relationships through structure networks. The investigations of structural/biological problems are divided into two parts, in which the first part deals with the analysis of PSNs based on static structures obtained from x-ray crystallography. The second part highlights the changes in the network, associated with biological functions, which are deduced from the network analysis on the structures obtained from molecular dynamics simulations.

Understanding Protein Structure from a Percolation Perspective

Underlying the unique structures and diverse functions of proteins area vast range of amino-acid sequences and a highly limited number of folds taken up by the polypeptide backbone. By investigating the role of noncovalent connections at the backbone level and at the detailed side-chain level, we show that these unique structures emerge from interplay between random and selected features. Primarily, the protein structure network formed by these connections shows simple (bond) and higher order (clique) percolation behavior distinctly reminiscent of random network models. However, the clique percolation specific to the side-chain interaction network bears signatures unique to proteins characterized by a larger degree of connectivity than in random networks. These studies reflect some salient features of the manner in which amino acid sequences select the unique structure of proteins from the pool of a limited number of available folds.

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called View the MathML source’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of View the MathML source’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].

An efficient algorithm for scheduling in bluetooth piconets and scatternets

Bluetooth is a short-range radio technology operating in the unlicensed industrial-scientific-medical (ISM) band at 2.45 GHz. A piconet is basically a collection of slaves controlled by a master. A scatternet, on the other hand, is established by linking several piconets together in an ad hoc fashion to yield a global wireless ad hoc network. This paper proposes a scheduling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in bluetooth piconets and scatternets. We propose a novel algorithm for scheduling slots to slaves for both piconets and scatternets using multi-layered parameterized policies. Our scheduling scheme works with real data and obtains an optimal feedback policy within prescribed parameterized classes of these by using an efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. We show the convergence of our algorithm to an optimal multi-layered policy. We also propose novel polling schemes for intra- and inter-piconet scheduling that are seen to perform well. We present an extensive set of simulation results and performance comparisons with existing scheduling algorithms. Our results indicate that our proposed scheduling algorithm performs better overall on a wide range of experiments over the existing algorithms for both piconets (Das et al. in INFOCOM, pp. 591–600, 2001; Lapeyrie and Turletti in INFOCOM conference proceedings, San Francisco, US, 2003; Shreedhar and Varghese in SIGCOMM, pp. 231–242, 1995) and scatternets (Har-Shai et al. in OPNETWORK, 2002; Saha and Matsumot in AICT/ICIW, 2006; Tan and Guttag in The 27th annual IEEE conference on local computer networks(LCN). Tampa, 2002). Our studies also confirm that our proposed scheme achieves a high throughput and low packet delays with reasonable fairness among all the connections.

An efficient and optimized bluetooth scheduling algorithm for piconets

Bluetooth is an emerging standard in short range, low cost and low power wireless networks. MAC is a generic polling based protocol, where a central Bluetooth unit (master) determines channel access to all other nodes (slaves) in the network (piconet). An important problem in Bluetooth is the design of efficient scheduling protocols. This paper proposes a polling policy that aims to achieve increased system throughput and reduced packet delays while providing reasonably good fairness among all traffic flows in a Bluetooth Piconet. We present an extensive set of simulation results and performance comparisons with two important existing algorithms. Our results indicate that our proposed scheduling algorithm outperforms the Round Robin scheduling algorithm by more than 40% in all cases tried. Our study also confirms that our proposed policy achieves higher throughput and lower packet delays with reasonable fairness among all the connections.