Elliptic slot antenna for broadband wireless communications

This paper presents the design of a broadband antenna suitable for wireless communications operating over the frequency range of 3.1-10.6 GHz. Parametric studies on the effect of stub and elliptic slot have been carried out to arrive at optimum dimensions to achieve enhanced bandwidth of the proposed antenna. An experimental antenna has been designed and tested to validate the proposed design. Measured return loss characteristics have been compared against the simulation results. Simulated radiation patterns at 3.1 GHz, 6.85 GHz and 10.6 GHz have also been presented in this paper.

Gene Expression Profiling of Preovulatory Follicle in the Buffalo Cow: Effects of Increased IGF-I Concentration on Periovulatory Events

The preovulatory follicle in response to gonadotropin surge undergoes dramatic biochemical, and morphological changes orchestrated by expression changes in hundreds of genes. Employing well characterized bovine preovulatory follicle model, granulosa cells (GCs) and follicle wall were collected from the preovulatory follicle before, 1, 10 and 22 h post peak LH surge. Microarray analysis performed on GCs revealed that 450 and 111 genes were differentially expressed at 1 and 22 h post peak LH surge, respectively. For validation, qPCR and immunocytochemistry analyses were carried out for some of the differentially expressed genes. Expression analysis of many of these genes showed distinct expression patterns in GCs and the follicle wall. To study molecular functions and genetic networks, microarray data was analyzed using Ingenuity Pathway Analysis which revealed majority of the differentially expressed genes to cluster within processes like steroidogenesis, cell survival and cell differentiation. In the ovarian follicle, IGF-I is established to be an important regulator of the above mentioned molecular functions. Thus, further experiments were conducted to verify the effects of increased intrafollicular IGF-I levels on the expression of genes associated with the above mentioned processes. For this purpose, buffalo cows were administered with exogenous bGH to transiently increase circulating and intrafollicular concentrations of IGF-I. The results indicated that increased intrafollicular concentrations of IGF-I caused changes in expression of genes associated with steroidogenesis (StAR, SRF) and apoptosis (BCL-2, FKHR, PAWR). These results taken together suggest that onset of gonadotropin surge triggers activation of various biological pathways and that the effects of growth factors and peptides on gonadotropin actions could be examined during preovulatory follicle development.

Kinetics of hydrogen evolution on submicron size Co, Ni, Pd and CoNi alloy powder electrodes by d.c. polarization and a.c. impedance studies

Submicron size Co, Ni and Co-Ni alloy powders have been synthesized by the polyol method using the corresponding metal malonates and Pd powder by reduction of PdOx in methanol. The kinetics of the hydrogen evolution reaction ( HER) in 6 M KOH electrolyte have been studied on electrodes made from the pressed powders. The d.c. polarization measurements have resulted in a value close to 120 mV decade(-1) for the Tafel slope, suggesting that the HER follows the Volmer-Heyrovsky mechanism. The values of exchange current density (i(o)) are in the range 1-10 mA cm(-2) for electrodes fabricated in the study. The a.c. impedance spectra measured at several potentials in the HER region showed a single semicircle in the Nyquist plots. Exchange current density (i(o)) and energy transfer coefficient (alpha) have been calculated by employing a nonlinear least square-fitting program.

New transparent crystallized glasses with optical nonlinear LiBGeO4 crystals

Crystallization behaviors of the glass with a composition of 25Li(2)O.25B(2)O(3).50GeO(2) corresponding to lithium borogermanate LiBGeO4 have been examined. It has been confirmed that the LiBGeO4 crystalline phase is formed at the surface of heat-treated glasses. The second harmonic (SH) generation is found from transparent surface crystallized glasses, demonstrating for the first time that the LiBGeO4 phase shows optical nonlinearity. The SH intensity of LiBGeO4 crystallites (powdered state) prepared through crystallization is about ten times as large as that of pulverized alpha-quartz. The SH intensity of transparent crystallized glasses (bulk state) with crystalline layers of 3-4.5 mum thickness increases with increasing heat treatment temperature (540-560degreesC) and time (1-6 h), and the maximum SH intensity among the samples studied is in the order of 1/10 in comparison with that of alpha-quartz single crystal. The transparent crystallized glass obtained by heat treatment at 550alphaC for 3 h exhibits a clear and fine Maker fringe pattern, indicating a highly orientation of LiBGeO4 crystals at the surface.

Photochemical behaviour of 4-styrylcoumarin polymorphs in the crystalline state

Addition of a small amount of coumarin during crystallization produces new polymorphic modifications in 4-styrylcoumarin and 4-(3-fluorostyryl)coumarin, which are photolabile. Interestingly, upon irradiation polymorphic modification of 4-(3-fluorostyryl)coumarin produces a mirror-symmetric photodimer in contrast to the centrosymmetric photodimer obtained without addition of coumarin during crystallization.

Studies on the structural and ionic transport properties at elevated temperatures of La1-xMnO3 +/-delta synthesized by a wet chemical method

Structural transformation and ionic transport properties are investigated on wet-chemically synthesized La1-xMnO3 (X=0.0-0.18) compositions. Powders annealed in oxygen/air at 1000-1080 K exhibit cubic symmetry and transform to rhombohedral on annealing at 1173-1573 K in air/oxygen. Annealing above 1773 K in air or in argon/helium at 1473 K stabilized distorted rhombohedral or orthorhombic symmetry. Structural transformations are confirmed from XRD and TEM studies. The total conductivity of sintered disks, measured by four-probe technique, ranges from 5 S cm(-1) at 298 K to 105 S cm(-1) at 1273 K. The ionic conductivity measured by blocking electrode technique ranges from 1.0X10(-6) S cm(-1) at 700 K to 2.0X10(-3) S cm(-1) at 1273 K. The ionic transference number of these compositions ranges from 3.0X10(-5) to 5.0X10(-5) at 1273 K. The activation energy deduced from experimental data for ionic conduction and ionic migration is 1.03-1.10 and 0.80-1.00 eV, respectively. The activation energy of formation, association and migration of vacancies ranges from 1.07 to 1.44 eV. (C) 2002 Elsevier Science B.V. All rights reserved.

Low complexity Bit allocation algorithms for AAC encoding

We have developed two reduced complexity bit-allocation algorithms for MP3/AAC based audio encoding, which can be useful at low bit-rates. One algorithm derives optimum bit-allocation using constrained optimization of weighted noise-to-mask ratio and the second algorithm uses decoupled iterations for distortion control and rate control, with convergence criteria. MUSHRA based evaluation indicated that the new algorithm would be comparable to AAC but requiring only about 1/10 th the complexity.

Performance analysis of a fluid queue with random service rate in discrete time

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.

A decidable temporal logic with repeating values

Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecidability. In this paper, we study a linear-time temporal logic with past-time operators such that the freeze operator is only used to express that some value from an infinite set is repeated in the future or in the past. Such a restriction has been inspired by a recent work on spatio-temporal logics. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets. This is a surprising result since the logic is closed under negation, contains future-time and past-time temporal operators and can express the nonce property and its negation. These ingredients are known to lead to undecidability with a more liberal use of the freeze quantifier.

Two-timescale Q-learning Algorithms with an Application to Routing in Networks

We propose two variants of the Q-learning algorithm that (both) use two timescales. One of these updates Q-values of all feasible state-action pairs at each instant while the other updates Q-values of states with actions chosen according to the ‘current ’ randomized policy updates. A sketch of convergence of the algorithms is shown. Finally, numerical experiments using the proposed algorithms for routing on different network topologies are presented and performance comparisons with the regular Q-learning algorithm are shown.

Incremental natural-gradient actor-critic algorithms

We present four new reinforcement learning algorithms based on actor-critic and natural-gradient ideas, and provide their convergence proofs. Actor-critic rein- forcement learning methods are online approximations to policy iteration in which the value-function parameters are estimated using temporal difference learning and the policy parameters are updated by stochastic gradient descent. Methods based on policy gradients in this way are of special interest because of their com- patibility with function approximation methods, which are needed to handle large or infinite state spaces. The use of temporal difference learning in this way is of interest because in many applications it dramatically reduces the variance of the gradient estimates. The use of the natural gradient is of interest because it can produce better conditioned parameterizations and has been shown to further re- duce variance in some cases. Our results extend prior two-timescale convergence results for actor-critic methods by Konda and Tsitsiklis by using temporal differ- ence learning in the actor and by incorporating natural gradients, and they extend prior empirical studies of natural actor-critic methods by Peters, Vijayakumar and Schaal by providing the first convergence proofs and the first fully incremental algorithms.

INTACTE: An Interconnect Area, Delay, and Energy Estimation Tool for Microarchitectural Explorations

Prior work on modeling interconnects has focused on optimizing the wire and repeater design for trading off energy and delay, and is largely based on low level circuit parameters. Hence these models are hard to use directly to make high level microarchitectural trade-offs in the initial exploration phase of a design. In this paper, we propose INTACTE, a tool that can be used by architects toget reasonably accurate interconnect area, delay, and power estimates based on a few architecture level parameters for the interconnect such as length, width (in number of bits), frequency, and latency for a specified technology and voltage. The tool uses well known models of interconnect delay and energy taking into account the wire pitch, repeater size, and spacing for a range of voltages and technologies.It then solves an optimization problem of finding the lowest energy interconnect design in terms of the low level circuit parameters, which meets the architectural constraintsgiven as inputs. In addition, the tool also provides the area, energy, and delay for a range of supply voltages and degrees of pipelining, which can be used for micro-architectural exploration of a chip. The delay and energy models used by the tool have been validated against low level circuit simulations. We discuss several potential applications of the tool and present an example of optimizing interconnect design in the context of clustered VLIW architectures. Copyright 2007 ACM.

Faster algorithms for all-pairs small stretch distances in weighted graphs

Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1

Multi-agent Search using Voronoi partitions

This paper addresses the problem of multiagent search in an unknown environment. The agents are autonomous in nature and are equipped with necessary sensors to carry out the search operation. The uncertainty, or lack of information about the search area is known a priori as a probability density function. The agents are deployed in an optimal way so as to maximize the one step uncertainty reduction. The agents continue to deploy themselves and reduce uncertainty till the uncertainty density is reduced over the search space below a minimum acceptable level. It has been shown, using LaSalle’s invariance principle, that a distributed control law which moves each of the agents towards the centroid of its Voronoi partition, modified by the sensor range leads to single step optimal deployment. This principle is now used to devise search trajectories for the agents. The simulations were carried out in 2D space with saturation on speeds of the agents. The results show that the control strategy per step indeed moves the agents to the respective centroid and the algorithm reduces the uncertainty distribution to the required level within a few steps.

An algorithm for dynamic optimal bandwidth allocation in communication networks

We study the problem of optimal bandwidth allocation in communication networks. We consider a queueing model with two queues to which traffic from different competing flows arrive. The queue length at the buffers is observed every T instants of time, on the basis of which a decision on the amount of bandwidth to be allocated to each buffer for the next T instants is made. We consider a class of closed-loop feedback policies for the system and use a twotimescale simultaneous perturbation stochastic approximation(SPSA) algorithm to find an optimal policy within the prescribed class. We study the performance of the proposed algorithm on a numerical setting. Our algorithm is found to exhibit good performance.