Interplay Between Optimal Selection Scheme, Selection Criterion, and Discrete Rate Adaptation in Opportunistic Wireless Systems

An opportunistic, rate-adaptive system exploits multi-user diversity by selecting the best node, which has the highest channel power gain, and adapting the data rate to selected node's channel gain. Since channel knowledge is local to a node, we propose using a distributed, low-feedback timer backoff scheme to select the best node. It uses a mapping that maps the channel gain, or, in general, a real-valued metric, to a timer value. The mapping is such that timers of nodes with higher metrics expire earlier. Our goal is to maximize the system throughput when rate adaptation is discrete, as is the case in practice. To improve throughput, we use a pragmatic selection policy, in which even a node other than the best node can be selected. We derive several novel, insightful results about the optimal mapping and develop an algorithm to compute it. These results bring out the inter-relationship between the discrete rate adaptation rule, optimal mapping, and selection policy. We also extensively benchmark the performance of the optimal mapping with several timer and opportunistic multiple access schemes considered in the literature, and demonstrate that the developed scheme is effective in many regimes of interest.

On Guo and Nixon's Criterion for Feature Subset Selection: Assumptions, Implications,and Alternative Options

Guo and Nixon proposed a feature selection method based on maximizing I(x; Y),the multidimensional mutual information between feature vector x and class variable Y. Because computing I(x; Y) can be difficult in practice, Guo and Nixon proposed an approximation of I(x; Y) as the criterion for feature selection. We show that Guo and Nixon's criterion originates from approximating the joint probability distributions in I(x; Y) by second-order product distributions. We remark on the limitations of the approximation and discuss computationally attractive alternatives to compute I(x; Y).

A thermodynamic criterion for selection of gas compositions for diamond deposition

Isoactivity lines for carbon with respect to diamond as the standard state have been calculated in the ternary system C-H-O at 1223 K to identify the diamond deposition domain. The gas composition is calculated by suppressing the formation of all condensed forms of carbon using the SOLGASMIX free-energy minimization program. Thirty six gas species were included in the calculation. From the gas composition, isoactivity lines are computed using recent data on the Gibbs energy of diamond. Except for activities less than 0.1, the isoactivity lines are almost linear on the C-H-O ternary diagram. Gas compositions which generate activity of diamond ranging from 1 to 100 at 1223 K fall inside a narrow wedge originating from the point representing CO. This wedge is very similar to the revised lens-shaped diamond growth domain identified by Bachman et al., using inputs from experiment. The small difference between the calculated and observed domains may be attributed to variation in the supersaturation required for diamond deposition with gas composition. The diamond solubility in the gas phase along the isoactivity line for a(di)=100 and P=6.7 kPa exhibits a minimum at 1280 K, which is close to the optimum temperature found experimentally. At higher supersaturations, non-diamond forms of carbon, including amorphous varieties, are expected. The results suggest that thermodynamic calculations can be useful for locating diamond growth domains in more complex CVD systems containing halogens, for which very little experimental data is available.

Random security scheme selection for mobile transactions

Security in a mobile communication environment is always a matter for concern, even after deploying many security techniques at device, network, and application levels. The end-to-end security for mobile applications can be made robust by developing dynamic schemes at application level which makes use of the existing security techniques varying in terms of space, time, and attacks complexities. In this paper we present a security techniques selection scheme for mobile transactions, called the Transactions-Based Security Scheme (TBSS). The TBSS uses intelligence to study, and analyzes the security implications of transactions under execution based on certain criterion such as user behaviors, transaction sensitivity levels, and credibility factors computed over the previous transactions by the users, network vulnerability, and device characteristics. The TBSS identifies a suitable level of security techniques from the repository, which consists of symmetric, and asymmetric types of security algorithms arranged in three complexity levels, covering various encryption/decryption techniques, digital signature schemes, andhashing techniques. From this identified level, one of the techniques is deployed randomly. The results shows that, there is a considerable reduction in security cost compared to static schemes, which employ pre-fixed security techniques to secure the transactions data.

Optimal Joint Antenna Selection and Power Adaptation in Underlay Cognitive Radios

Transmit antenna selection (AS) is a popular, low hardware complexity technique that improves the performance of an underlay cognitive radio system, in which a secondary transmitter can transmit when the primary is on but under tight constraints on the interference it causes to the primary. The underlay interference constraint fundamentally changes the criterion used to select the antenna because the channel gains to the secondary and primary receivers must be both taken into account. We develop a novel and optimal joint AS and transmit power adaptation policy that minimizes a Chernoff upper bound on the symbol error probability (SEP) at the secondary receiver subject to an average transmit power constraint and an average primary interference constraint. Explicit expressions for the optimal antenna and power are provided in terms of the channel gains to the primary and secondary receivers. The SEP of the optimal policy is at least an order of magnitude lower than that achieved by several ad hoc selection rules proposed in the literature and even the optimal antenna selection rule for the case where the transmit power is either zero or a fixed value.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Electronic Control of Facial Selection in Additions to Sterically Unbiased Ketones and Olefins

By definition, the two faces of a pi bond are equivalent.1 However, they are rendered nonequivalent in most molecules because of the absence of a plane of symmetry encompassing the double bond and the adjacent substituents. As a result, additions to trigonal centers from the two faces need not be equally facile. Exploiting this stereodifferentiation in a controlled manner represents one of the core problems in organic synthesis. Evidently, the factors which determine such diastereoselection need to be delineated in as much detail as possible.

Perception of ultraviolet light by crab spiders and its role in selection of hunting sites

The perception of ultraviolet (UV) light by spiders has so far been only demonstrated in salticids. Crab spiders (Thomisidae) hunt mostly on flowers and need to find appropriate hunting sites. Previous studies have shown that some crab spiders that reflect UV light use UV contrast to enhance prey capture. The high UV contrast can be obtained either by modulation of body colouration or active selection of appropriate backgrounds for foraging. We show that crab spiders (Thomisus sp.)hunting on Spathiphyllum plants use chromatic contrast, especially UV contrast, to make themselves attractive to hymenopteran prey. Apart from that, they are able to achieve high UV contrast by active selection of non-UV reflecting surfaces when given a choice of UV-reflecting and non-UV reflecting surfaces in the absence of odour cues. Honeybees (Apis cerana) approached Spathiphyllum plants bearing crab spiders on which the spiders were high UV-contrast targets with greater frequency than those plants on which the UV-contrast of the spiders was low. Thus, crab spiders can perceive UV and may use it to choose appropriate backgrounds to enhance prey capture, by exploiting the attraction of prey such as honeybees to UV.

Synthesis and characterisation of heterometallic molecular triangles using ambidentate linker: self-selection of a single linkage isomer

The coordination driven self-assembly of discrete molecular triangles from a non-symmetric ambidentate linker 5-pyrimidinecarboxylate (5-pmc) and Pd(II)/Pt(II) based 90◦ acceptors is presented. Despite the possibility of formation of a mixture of isomeric macrocycles (linkage isomers) due to different connectivity of the ambidentate linker, formation of a single and symmetrical linkage somer in both the cases is an interesting observation. Moreover, the reported macrocycles represent the first example of discrete metallamacrocycles of bridging 5-pmc. While solution composition in both the cases was characterised by multinuclear NMR study and electrospray ionization mass spectrometry (ESI-MS), the identity of the assemblies in the solid state was established by X-ray single crystals structure analysis. Variable temperature NMR study clearly ruled out the formation of any other macrocycles by [4 + 4] or [2 + 2] self-assembly of the reacting components.

Fast Multiple Access Selection through variable power transmissions

Many wireless applications demand a fast mechanism to detect the packet from a node with the highest priority ("best node") only, while packets from nodes with lower priority are irrelevant. In this paper, we introduce an extremely fast contention-based multiple access algorithm that selects the best node and requires only local information of the priorities of the nodes. The algorithm, which we call Variable Power Multiple Access Selection (VP-MAS), uses the local channel state information from the accessing nodes to the receiver, and maps the priorities onto the receive power. It is based on a key result that shows that mapping onto a set of discrete receive power levels is optimal, when the power levels are chosen to exploit packet capture that inherently occurs in a wireless physical layer. The VP-MAS algorithm adjusts the expected number of users that contend in each step and their respective transmission powers, depending on whether previous transmission attempts resulted in capture, idle channel, or collision. We also show how reliable information regarding the total received power at the receiver can be used to improve the algorithm by enhancing the feedback mechanism. The algorithm detects the packet from the best node in 1.5 to 2.1 slots, which is considerably lower than the 2.43 slot average achieved by the best algorithm known to date.

A New Criterion for the Metallicity of Elements

A vast majority of elements are metallic in the liquid state. The latent heat of vapourization, ΔHv, of such elements is greater than the critical value of not, vert, similar 42 kJ mol−1 (0.44 eV mol−) which demarcates metals from non-metals. It is shown that ΔHv can be related to the Fermi energy as well as to the Herzfeld criterion involving atomic polarizability.

On the moulding of population viscosity by natural selection

In this paper, we explore the conjoint evolution of dispersal and social behaviour. The model investigated is of a population distributed over a number of sites each with a carrying capacity of two adults and an episode of dispersal in the juvenile stage. The fertilities are governed by whether an individual and its neighbour are selfish or co-operative. It is shown that the best dispersal strategy for the co-operative genotype always involves lower levels of dispersal; and further that ecological conditions favouring low levels of dispersal increase the selective advantage of a co-operative genotype. Given this positive feedback, we suggest that in any taxon viscosity and co-operativity will tend to be correlated and bimodally distributed. Hence we predict the existence of two kinds of animal societies; viscous and co-operative (e.g. quasi-social wasps such as Mischocyttarus), and non-viscous and selfish (e.g. communal sphecid wasps such as Cerceris), and relatively few social groups with intermediate levels of co-operativity and viscosity. We also suggest that when one of the two sexes disperses, it will be the sex with lower potential for co-operative behaviour.

A global convergence criterion for discrete-time multivariable adaptive systems

The paper deals with the basic problem of adjusting a matrix gain in a discrete-time linear multivariable system. The object is to obtain a global convergence criterion, i.e. conditions under which a specified error signal asymptotically approaches zero and other signals in the system remain bounded for arbitrary initial conditions and for any bounded input to the system. It is shown that for a class of up-dating algorithms for the adjustable gain matrix, global convergence is crucially dependent on a transfer matrix G(z) which has a simple block diagram interpretation. When w(z)G(z) is strictly discrete positive real for a scalar w(z) such that w-1(z) is strictly proper with poles and zeros within the unit circle, an augmented error scheme is suggested and is proved to result in global convergence. The solution avoids feeding back a quadratic term as recommended in other schemes for single-input single-output systems.

Genetic analysis of foot-and-mouth disease virus serotype A of Indian origin and detection of positive selection and recombination in leader protease- and capsid-coding regions

The leader protease (L-pro) and capsid-coding sequences (P1) constitute approximately 3 kb of the foot-and-mouth disease virus (FMDV). We studied the phylogenetic relationship of 46 FMDV serotype A isolates of Indian origin collected during the period 1968-2005 and also eight vaccine strains using the neighbour-joining tree and Bayesian tree methods. The viruses were categorized under three major groups - Asian, Euro-South American and European. The Indian isolates formed a distinct genetic group among the Asian isolates. The Indian isolates were further classified into different genetic subgroups (<5% divergence). Post-1995 isolates were divided into two subgroups while a few isolates which originated in the year 2005 from Andhra Pradesh formed a separate group. These isolates were closely related to the isolates of the 1970s. The FMDV isolates seem to undergo reverse mutation or onvergent evolution wherein sequences identical to the ancestors are present in the isolates in circulation. The eight vaccine strains included in the study were not related to each other and belonged to different genetic groups. Recombination was detected in the L-pro region in one isolate (A IND 20/82) and in the VP1 coding 1D region in another isolate (A RAJ 21/96). Positive selection was identified at aa positions 23 in the L-pro (P<0.05; 0.046*) and at aa 171 in the capsid protein VP1 (P<0.01; 0.003**).

Stream power criterion and design of sand bed channels at incipient motion

The critical stream power criterion may be used to describe the incipient motion of cohesionless particles of plane sediment beds. The governing equation relating ``critical stream power'' to ``shear Reynolds number'' is developed by using the present experimental data as well as the data from several other sources. Simultaneously, a resistance equation, relating the ``particle Reynolds number'' to the``shear Reynolds number'' is developed for plane sediment beds in wide channels with little or no transport. By making use of these relations, a procedure is developed to design plane sediment beds such that any two of the four design variables, including particle size, energy/friction slope, flow depth, and discharge per unit width in the channel should be known to predict the remaining two variables. Finally, a straightforward design procedure using design tables/design curves and analytical methods is presented to solve six possible design problems.