Stability of scheduled multi-access communication over quasi-static flat fading channels with random coding and independent decoding

The stability of scheduled multiaccess communication with random coding and independent decoding of messages is investigated. The number of messages that may be scheduled for simultaneous transmission is limited to a given maximum value, and the channels from transmitters to receiver are quasistatic, flat, and have independent fades. Requests for message transmissions are assumed to arrive according to an i.i.d. arrival process. Then, we show the following: (1) in the limit of large message alphabet size, the stability region has an interference limited information-theoretic capacity interpretation, (2) state-independent scheduling policies achieve this asymptotic stability region, and (3) in the asymptotic limit corresponding to immediate access, the stability region for non-idling scheduling policies is shown to be identical irrespective of received signal powers.

Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

Dipole patterns in the structures of some ferroelectrics and antiferroelectrics

The dipole patterns in the ferroelectric and antiferroelectric structures are drawn according to experimentally determined symmetry changes in the ferroelectrics and antiferroelectrics. For the ferroelectrics the dipoles of the unit cells for one domain are oriented in parallel and the directions of the polarisation in the adjacent domains are at definite angles to each other. It is assumed for the antiferroelectrics, that the superstructural unit cell is formed by the adjacent cells of the paraelectrical modification; the subcells having the antiparallel directions of the polarisation. It is these superstructural cells of the antiferroelectrics that are determined during the experimental investigations of the antiferroelectrics. The superstructural cells of the adjacent domains are different. In one case, the difference is that in the adjacent domains, the directions of the polarisation in the subcells form an angle (e.g., in PbZrO3). In other cases the superstructural cells have not only different directions of the polarisation in the subcells but different signs of the enantiomorphism (e.g., NH4H2PO4). In the third case, the only difference is that the superstructural unit cells in the adjacent domains are turned by an angle to each other round the direction of the subcell polarisation [e.g., (NH4)2H3IO6], etc.

Natural modes of a coupled non-linear system

The natural modes of a non-linear system with two degrees of freedom are investigated. The system, which may contain either hard or soft springs, is shown to possess three modes of vibration one of which does not have any counterpart in the linear theory. The stability analysis indicates the existence of seven different modal stability patterns depending on the values of two parameters of non-linearity.

Electron diffraction patterns from the Al-Mn decagonal phase

The variety of electron diffraction patterns arising from the decagonal phase has been explored using a stereographic analysis for generating the important zone axes as intersection points corresponding to important relvectors. An indexing scheme employing a set of five vectors and an orthogonal vector has been followed. A systematic tilting from the decagonal axis to one of the twofold axes has been adopted to generate a set of experimental diffraction patterns corresponding to the expected patterns from the stereographic analysis with excellent agreement.

Molecular Caches: A caching structure for dynamic creation of application-specific Heterogeneous cache regions

CMPs enable simultaneous execution of multiple applications on the same platforms that share cache resources. Diversity in the cache access patterns of these simultaneously executing applications can potentially trigger inter-application interference, leading to cache pollution. Whereas a large cache can ameliorate this problem, the issues of larger power consumption with increasing cache size, amplified at sub-100nm technologies, makes this solution prohibitive. In this paper in order to address the issues relating to power-aware performance of caches, we propose a caching structure that addresses the following: 1. Definition of application-specific cache partitions as an aggregation of caching units (molecules). The parameters of each molecule namely size, associativity and line size are chosen so that the power consumed by it and access time are optimal for the given technology. 2. Application-Specific resizing of cache partitions with variable and adaptive associativity per cache line, way size and variable line size. 3. A replacement policy that is transparent to the partition in terms of size, heterogeneity in associativity and line size. Through simulation studies we establish the superiority of molecular cache (caches built as aggregations of molecules) that offers a 29% power advantage over that of an equivalently performing traditional cache.

Stability of scheduled message communication over degraded broadcast channels

We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) under an asymptotic regime, we show that the stability region of information arrival rate vectors is the information-theoretic capacity region of a degraded broadcast channel.

Ecology of the Asian Elephant in Southern India. I. Movement and Habitat Utilization Patterns

The movement and habitat utilization patterns were studied in an Asian elephant population during 1981-83 within a 1130 km2 area in southern India (110 30' N to 120 0' N and 760 50' E to 770 15' E). The study area encompasses a diversity of vegetation types from dry thorn forest (250-400 m) through deciduous forest (400-1400 m) to stunted evergreen shola forest and grassland (1400-1800 m). Home range sizes of some identified elephants were between 105 and 320 km2. Based on the dry season distribution, five different elephant clans, each consisting of between 50 and 200 individuals and having overlapping home ranges, could be defined within the study area. Seaso- nal habitat preferences were related to the availability of water and the palatability of food plants. During the dry months (January-April) elephants congregated at high densities of up to five individuals kM-2 in river valleys where browse plants had a much higher protein content than the coarse tall grasses on hill slopes. With the onset of rains of the first wet season (May- August) they dispersed over a wider area at lower densities, largely into the tall grass forests, to feed on the fresh grasses, which then had a high protein value. During the second wet season (September-December), when the tall grasses became fibrous, they moved into lower elevation short grass open forests. The normal movement pattern could be upset during years of adverse environmental con- ditions. However, the movement pattern of elephants in this region has not basically changed for over a century, as inferred from descriptions recorded during the nineteenth century.

Convolutional Codes for Network-Error Correction

In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors are separated by a certain interval. We also give some bounds on the field size and the number of errors that can get corrected in a certain interval. Compared to previous network error correction schemes, using convolutional codes is seen to have advantages in field size and decoding technique. Some examples are discussed which illustrate the several possible situations that arise in this context.

Reducing the babel in plant volatile communication: using the forest to see the trees

While plants of a single species emit a diversity of volatile organic compounds (VOCs) to attract or repel interacting organisms, these specific messages may be lost in the midst of the hundreds of VOCs produced by sympatric plants of different species, many of which may have no signal content. Receivers must be able to reduce the babel or noise in these VOCs in order to correctly identify the message. For chemical ecologists faced with vast amounts of data on volatile signatures of plants in different ecological contexts, it is imperative to employ accurate methods of classifying messages, so that suitable bioassays may then be designed to understand message content. We demonstrate the utility of `Random Forests' (RF), a machine-learning algorithm, for the task of classifying volatile signatures and choosing the minimum set of volatiles for accurate discrimination, using datam from sympatric Ficus species as a case study. We demonstrate the advantages of RF over conventional classification methods such as principal component analysis (PCA), as well as data-mining algorithms such as support vector machines (SVM), diagonal linear discriminant analysis (DLDA) and k-nearest neighbour (KNN) analysis. We show why a tree-building method such as RF, which is increasingly being used by the bioinformatics, food technology and medical community, is particularly advantageous for the study of plant communication using volatiles, dealing, as it must, with abundant noise.

Direct Writing of Copper Film Patterns by Laser-Induced Decomposition of Copper Acetate

Direct writing of patterns is being widely attempted in the field of microelectronic circuit/device manufacture. Use of this technique eliminates the need for employing photolithographic process. Laser induced direct writing can be achieved by (i) Photochemical reaction [i] , (ii) Evaporation from target material [2], and (iii) decomposition.Micron size features of palladium and copper through decomposition of palladium acetate and copper formate respectively on quartz and silicon using Argon ion laser have been reported [3,4] .In this commuication we report a technique for both single line and large area depositon of copper through decomposition of copper acetate,(CH3COO)2Cu, on alumina substrates.Nd:YAG laser known for its reliability and low maintenance cost as compared to excimer and other gas lasers is used. This technique offers an attractive and economical alternative for manufacture of thin film microcircuits.

Communication: Evidence of dynamic heterogeneity in glassy polymer monolayers from interface microrheology measurements

We have developed a novel nanoparticle tracking based interface microrheology technique to perform in situ studies on confined complex fluids. To demonstrate the power of this technique, we show, for the first time, how in situ glass formation in polymers confined at air-water interface can be directly probed by monitoring variation of the mean square displacement of embedded nanoparticles as a function of surface density. We have further quantified the appearance of dynamic heterogeneity and hence vitrification in polymethyl methacrylate monolayers above a certain surface density, through the variation of non-Gaussian parameter of the probes. (C) 2010 American Institute of Physics. [doi:10.1063/1.3471584].

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.

An algorithm to detect linearly separable clusters of binary patterns

The clusters of binary patterns can be considered as Boolean functions of the (binary) features. Such a relationship between the linearly separable (LS) Boolean functions and LS clusters of binary patterns is examined. An algorithm is presented to answer the questions of the type: “Is the cluster formed by the subsets of the (binary) data set having certain features AND/NOT having certain other features, LS from the remaining set?” The algorithm uses the sequences of Numbered Binary Form (NBF) notation and some elementary (NPN) transformations of the binary data.