Multi-dimensional Goodness-of-Fit Tests for Spectrum Sensing Based on Stochastic Distances

In this paper, we study two multi-dimensional Goodness-of-Fit tests for spectrum sensing in cognitive radios. The multi-dimensional scenario refers to multiple CR nodes, each with multiple antennas, that record multiple observations from multiple primary users for spectrum sensing. These tests, viz., the Interpoint Distance (ID) based test and the h, f distance based tests are constructed based on the properties of stochastic distances. The ID test is studied in detail for a single CR node case, and a possible extension to handle multiple nodes is discussed. On the other hand, the h, f test is applicable in a multi-node setup. A robustness feature of the KL distance based test is discussed, which has connections with Middleton's class A model. Through Monte-Carlo simulations, the proposed tests are shown to outperform the existing techniques such as the eigenvalue ratio based test, John's test, and the sphericity test, in several scenarios.

Case for multiple views of function in design based on a common definition

Functions are important in designing. However, several issues hinder progress with the understanding and usage of functions: lack of a clear and overarching definition of function, lack of overall justifications for the inevitability of the multiple views of function, and scarcity of systematic attempts to relate these views with one another. To help resolve these, the objectives of this research are to propose a common definition of function that underlies the multiple views in literature and to identify and validate the views of function that are logically justified to be present in designing. Function is defined as a change intended by designers between two scenarios: before and after the introduction of the design. A framework is proposed that comprises the above definition of function and an empirically validated model of designing, extended generate, evaluate, modify, and select of state-change, and an action, part, phenomenon, input, organ, and effect model of causality (Known as GEMS of SAPPhIRE), comprising the views of activity, outcome, requirement-solution-information, and system-environment. The framework is used to identify the logically possible views of function in the context of designing and is validated by comparing these with the views of function in the literature. Describing the different views of function using the proposed framework should enable comparisons and determine relationships among the various views, leading to better understanding and usage of functions in designing.

Physical Layer Network Coding for the K-User Multiple Access Relay Channel

We propose a Physical layer Network Coding (PNC) scheme for the K-user wireless Multiple Access Relay Channel, in which K source nodes want to transmit messages to a destination node D with the help of a relay node R. The proposed scheme involves (i) Phase 1 during which the source nodes alone transmit and (ii) Phase 2 during which the source nodes and the relay node transmit. At the end of Phase 1, the relay node decodes the messages of the source nodes and during Phase 2 transmits a many-to-one function of the decoded messages. To counter the error propagation from the relay node, we propose a novel decoder which takes into account the possibility of error events at R. It is shown that if certain parameters are chosen properly and if the network coding map used at R forms a Latin Hypercube, the proposed decoder offers the maximum diversity order of two. Also, it is shown that for a proper choice of the parameters, the proposed decoder admits fast decoding, with the same decoding complexity order as that of the reference scheme based on Complex Field Network Coding (CFNC). Simulation results indicate that the proposed PNC scheme offers a large gain over the CFNC scheme.

Divide-and-Correct Algorithm for Division in a Negative Base

A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient.

Divide-and-Correct Algorithm for Division in a Negative Base

A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient.

Differential transcription of multiple copies of a silk worm gene encoding tRNA

Ten different tRNAGly1 genes from the silk worm, Bombyx mori, have been cloned and characterized. These genes were transcribed in vitro in homologous nuclear extracts from the posterior silk gland (PSG) or nuclear extracts derived from the middle silk gland or ovarian tissues. Although the transcription levels were much higher in the PSG nuclear extracts, the transcriptional efficiency of the individual genes followed a similar pattern in all the extracts. Based on the levels of in vitro transcription, the ten tRNAGly1 genes could be divided into three groups, viz., those which were transcribed at very high levels (e.g., clone pR8), high to medium levels (e.g., pBmil, pBmpl, pBmhl, pBmtl) and low to barely detectable levels (e.g., pBmsl, pBmjl and pBmkl). The coding sequences of all these tRNA genes being identical, the differential transcription suggested that the flanking sequences modulate their transcriptional efficiency. The presence of positive and negative regulatory elements in the 5' flanking regions of these genes was confirmed by transcription competition experiments. A positive element was present in the immediate upstream A + T-rich sequences in all the genes, but no consensus sequences correlating to the transcriptional status could be generated. The presence of negative elements on the other hand was indicated only in some of the genes and therefore may have a role in the differential transcription of these tRNAGly genes in vivo.

Comparative statistical aging studies on an oil-pressboard insulation model

Accelerated aging experiments have been conducted on a representative oil-pressboard insulation model to investigate the effect of constant and sequential stresses on the PD behavior using a built-in phase resolved partial discharge analyzer. A cycle of the applied voltage starting from the zero of the positive half cycle was divided into 16 equal phase windows (Φ1 to Φ16) and partial discharge (PD) magnitude distribution in each phase was determined. Based on the experimental results, three stages of aging mechanism were identified. Gumbel's extreme value distribution of the largest element was used to model the first stage of aging process. Second and subsequent stages were modeled using two-parameter Weibull distribution. Spearman's non-parametric rank correlation test statistic and Kolmogrov-Smirnov two sample test were used to relate the aging process of each phase with the corresponding process of the full cycle. To bring out clearly the effect of stress level, its duration and test procedure on the distribution parameters and hence of the aging process, non-parametric ANOVA techniques like Kruskal-Wallis and Fisher's LSD multiple comparison tests were used. Results of the analysis show that two phases (Φ13 and Φ14) near the vicinity of the negative voltage peak were found to contribute significantly to the aging process and their aging mechanism also correlated well with that of the corresponding full cycle mechanism. Attempts have been made to relate these results with the published work of other workers

Boundary Tracking using a Hybrid Cyclic Pursuit Scheme

There has been a lot of work in the literature, related to the mapping of boundaries of regions, using multiple agents. Most of these are based on optimization techniques or rely on potential fields to drive the agents towards the boundary and then retain them there while they space out evenly along the perimeter or surface (in two-dimensional and three-dimensional cases, respectively). In this paper an algorithm to track the boundary of a region in space is provided based on the cyclic pursuit scheme. This enables the agents to constantly move along the perimeter in a cluster, thereby tracking a dynamically changing boundary. The trajectories of the agents provide a sketch of the boundary. The use of multiple agents may facilitate minimization of tracking error by providing accurate estimates of points on the boundary, besides providing redundancy. Simulation results are provided to highlight the performance of the proposed scheme.

Large Diameter Triaxial Tests on Geosynthetic-Reinforced Granular Subbases

The estimation of strength and stiffness of reinforced aggregates is very important for the design and construction of reinforced unpaved/paved road sections. This paper presents the experimental results from static and cyclic triaxial tests carried out on granular subbase samples reinforced with multiple layers of geogrid reinforcement. Aggregates of different size ranges were mixed in calculated proportions by weight to obtain the gradation specified for rural roads. Triaxial samples of 300 mm diameter and 600 mm height were prepared using this sampled aggregate. The strength and stiffness characteristics of this aggregate reinforced with geogrids at different elevations were determined from static and cyclic triaxial tests. Triaxial tests were also carried out on geocell encased aggregates, and the results are compared. From the experimental results it is observed that reinforced systems carried more stresses than unreinforced systems at the same strain level. The beneficial effect increased with increase in the quantity of reinforcement, whereas for geocell reinforcement, the advantage was evident only at higher strains. (C) 2014 American Society of Civil Engineers.

Conservation law with the flux function discontinuous in the space variable- II - Convex-concave type fluxes and generalized entropy solutions

We deal with a single conservation law with discontinuous convex-concave type fluxes which arise while considering sign changing flux coefficients. The main difficulty is that a weak solution may not exist as the Rankine-Hugoniot condition at the interface may not be satisfied for certain choice of the initial data. We develop the concept of generalized entropy solutions for such equations by replacing the Rankine-Hugoniot condition by a generalized Rankine-Hugoniot condition. The uniqueness of solutions is shown by proving that the generalized entropy solutions form a contractive semi-group in L-1. Existence follows by showing that a Godunov type finite difference scheme converges to the generalized entropy solution. The scheme is based on solutions of the associated Riemann problem and is neither consistent nor conservative. The analysis developed here enables to treat the cases of fluxes having at most one extrema in the domain of definition completely. Numerical results reporting the performance of the scheme are presented. (C) 2006 Elsevier B.V. All rights reserved.

Glowworm-inspired robot swarm for simultaneous taxis towards multiple radiation sources

This paper presents a glowworm metaphor based distributed algorithm that enables a collection of minimalist mobile robots to split into subgroups, exhibit simultaneous taxis-behavior towards, and rendezvous at multiple radiation sources such as nuclear/hazardous chemical spills and fire-origins in a fire calamity. The algorithm is based on a glowworm swarm optimization (GSO) technique that finds multiple optima of multimodal functions. The algorithm is in the same spirit as the ant-colony optimization (ACO) algorithms, but with several significant differences. The agents in the glowworm algorithm carry a luminescence quantity called luciferin along with them. Agents are thought of as glowworms that emit a light whose intensity is proportional to the associated luciferin. The key feature that is responsible for the working of the algorithm is the use of an adaptive local-decision domain, which we use effectively to detect the multiple source locations of interest. The glowworms have a finite sensor range which defines a hard limit on the local-decision domain used to compute their movements. Extensive simulations validate the feasibility of applying the glowworm algorithm to the problem of multiple source localization. We build four wheeled robots called glowworms to conduct our experiments. We use a preliminary experiment to demonstrate the basic behavioral primitives that enable each glowworm to exhibit taxis behavior towards source locations and later demonstrate a sound localization task using a set of four glowworms.

Novel kinetic scheme for the ammonium perchlorate gas phase

A novel gas-phase kinetic scheme for ammonium perchlorate (AP) deflagration involving 22 reactions among 18 species is developed. The kinetic scheme is based on a study of the effect of initial conditions on the solution of the differential equations of adiabatic constant-pressure combustion kinetics. The existence of condensed-phase reaction products providesalternate pathways for the consumption of NH3 and HCIOl produced by gas-phase dissociation of AP. Theoretically obtained temperature-time profiles of the novel scheme do not change when the conventional reaction pathways are included, indicatingthat the novel scheme is a substantially faster rate process. The new scheme does not involve the species CIO, which has long been considered a critical component of the AP gas phase and which is included in the conventional reaction pathways.The new scheme develops faster overall reaction rates, steeper temperature-time profiles, and in a deflagration model will result in higher heat-transfer rates from gas phase to the condensed phase.

Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel

The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied. When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user’s alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable, but will result in enlargement of the capacity region. For this set-up, we identify the primary problem to be finding appropriate angle(s) of rotation between the alphabets such that the capacity region is maximally enlarged. It is shown that the angle of rotation which provides maximum enlargement of the capacity region also minimizes the union bound on the probability of error of the sumalphabet and vice-verse. The optimum angle(s) of rotation varies with the SNR. Through simulations, optimal angle(s) of rotation that gives maximum enlargement of the capacity region of GMAC with some well known alphabets such as M-QAM and M-PSK for some M are presented for several values of SNR. It is shown that for large number of points in the alphabets, capacity gains due to rotations progressively reduce. As the number of points N tends to infinity, our results match the results in the literature wherein the capacity region of the Gaussian code alphabet doesn’t change with rotation for any SNR.

Compiler-Directed Dynamic Voltage Scaling using Program Phases

Energy consumption has become a major constraint in providing increased functionality for devices with small form factors. Dynamic voltage and frequency scaling has been identified as an effective approach for reducing the energy consumption of embedded systems. Earlier works on dynamic voltage scaling focused mainly on performing voltage scaling when the CPU is waiting for memory subsystem or concentrated chiefly on loop nests and/or subroutine calls having sufficient number of dynamic instructions. This paper concentrates on coarser program regions and for the first time uses program phase behavior for performing dynamic voltage scaling. Program phases are annotated at compile time with mode switch instructions. Further, we relate the Dynamic Voltage Scaling Problem to the Multiple Choice Knapsack Problem, and use well known heuristics to solve it efficiently. Also, we develop a simple integer linear program formulation for this problem. Experimental evaluation on a set of media applications reveal that our heuristic method obtains a 38% reduction in energy consumption on an average, with a performance degradation of 1% and upto 45% reduction in energy with a performance degradation of 5%. Further, the energy consumed by the heuristic solution is within 1% of the optimal solution obtained from the ILP approach.