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.

Fast matrix transposition computer implementation

Eklundh's (1972) algorithm to transpose a large matrix stored on an external device such as a disc has been programmed and tested. A simple description of computer implementation is given in this note.

Fast Public Key Cryptosystem Based On Matrix Rings

A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.

Fast Iterative Division of p-adic Numbers

A fast iterative scheme based on the Newton method is described for finding the reciprocal of a finite segment p-adic numbers (Hensel code). The rate of generation of the reciprocal digits per step can be made quadratic or higher order by a proper choice of the starting value and the iterating function. The extension of this method to find the inverse transform of the Hensel code of a rational polynomial over a finite field is also indicated.

Resistivity Maxima in Lithium Fast-Ion Conductors at High Pressure

The resistivity of two types of lithium fast-ion conductors, Li16-2xZnx(GeO4)4 (x=1,2) and Li3+xGexV1-xO4 (x=0.25,0.6,0.72), showed pronounced maxima as a function of pressure. For the first type, ln(ρ / ρ0) peaked at values of 0.12 (x=1) and 0.35 (x=2) near 20 kbar and decreased thereafter up to 80 kbar. Thermal activation energies and prefactors also showed corresponding maxima. For the second type, ln(ρ / ρ0) increased to 3-4 between 20 and 32 kbar. Near 80 kbar, ρ decreased (for x=0.25) by a factor of 250. The results are interpreted in terms of negative activation volumes.

Counting the cost of fast fashion

There’s a polyester mullet skirt gracing a derrière near you. It’s short at the front, long at the back, and it’s also known as the hi-lo skirt. Like fads that preceded it, the mullet skirt has a short fashion life, and although it will remain potentially wearable for years, it’s likely to soon be heading to the charity shop or to landfill...

A fast acting detector for abnormal output voltages of an UPS system

A new method of sensing the abnormal output voltage conditions of a single phase UPS system is presented, which provides the information almost instantaneously, so that a fast load transfer can be initiated. A continuous monitoring of the UPS output instantaneous voltage is used so that any under/over voltage, transients, or waveform distortion present can be detected.

Fast Accurate Transient Stability Simulations

The paper describes a Simultaneous Implicit (SI) approach for transient stability simulations based on an iterative technique using traingularised admittance matrix [1]. The reduced saliency of generator in the subtransient state is taken advantage of to speed up the algorithm. Accordingly, generator differential equations, except rotor swing, contain voltage proportional to fluxes in the main field, dampers and a hypothetical winding representing deep flowing eddy currents, as state variables. The simulation results are validated by comparison with two independent methods viz. Runge-Kutta simulation for a simplified system and a method based on modelling damper windings using conventional induction motor theory.

Gudinski, by Stuart Coupe is a wild and fast ride

Review of Stuart Coupe's biography of Australian music legend Michael Gudinski.

A simple and fast two-locus quality control test to detect false positives due to batch effects in genome-wide association studies

The impact of erroneous genotypes having passed standard quality control (QC) can be severe in genome-wide association studies, genotype imputation, and estimation of heritability and prediction of genetic risk based on single nucleotide polymorphisms (SNP). To detect such genotyping errors, a simple two-locus QC method, based on the difference in test statistic of association between single SNPs and pairs of SNPs, was developed and applied. The proposed approach could detect many problematic SNPs with statistical significance even when standard single SNP QC analyses fail to detect them in real data. Depending on the data set used, the number of erroneous SNPs that were not filtered out by standard single SNP QC but detected by the proposed approach varied from a few hundred to thousands. Using simulated data, it was shown that the proposed method was powerful and performed better than other tested existing methods. The power of the proposed approach to detect erroneous genotypes was approximately 80% for a 3% error rate per SNP. This novel QC approach is easy to implement and computationally efficient, and can lead to a better quality of genotypes for subsequent genotype-phenotype investigations.

Fast FIR Algorithms for the Continuous Wavelet Transform From Constrained Least Squares

New algorithms for the continuous wavelet transform are developed that are easy to apply, each consisting of a single-pass finite impulse response (FIR) filter, and several times faster than the fastest existing algorithms. The single-pass filter, named WT-FIR-1, is made possible by applying constraint equations to least-squares estimation of filter coefficients, which removes the need for separate low-pass and high-pass filters. Non-dyadic two-scale relations are developed and it is shown that filters based on them can work more efficiently than dyadic ones. Example applications to the Mexican hat wavelet are presented.

FreeS: A fast algorithm to discover frequent free subtrees using a novel canonical form

Web data can often be represented in free tree form; however, free tree mining methods seldom exist. In this paper, a computationally fast algorithm FreeS is presented to discover all frequently occurring free subtrees in a database of labelled free trees. FreeS is designed using an optimal canonical form, BOCF that can uniquely represent free trees even during the presence of isomorphism. To avoid enumeration of false positive candidates, it utilises the enumeration approach based on a tree-structure guided scheme. This paper presents lemmas that introduce conditions to conform the generation of free tree candidates during enumeration. Empirical study using both real and synthetic datasets shows that FreeS is scalable and significantly outperforms (i.e. few orders of magnitude faster than) the state-of-the-art frequent free tree mining algorithms, HybridTreeMiner and FreeTreeMiner.

A fast method of comparing protein structures

Comparative studies on protein structures form an integral part of protein crystallography. Here, a fast method of comparing protein structures is presented. Protein structures are represented as a set of secondary structural elements. The method also provides information regarding preferred packing arrangements and evolutionary dynamics of secondary structural elements. This information is not easily obtained from previous methods. In contrast to those methods, the present one can be used only for proteins with some secondary structure. The method is illustrated with globin folds, cytochromes and dehydrogenases as examples.

Block- and strand-multiplexing for fast computation of a class of transforms

The transforms dealt with in this paper are defined in terms of the transform kernels which are Kroneeker products of the two or more component kernels. The signal flow-graph for the computation of such a transform is obtained with the flow-graphs for the component transforms as building blocks.

Korteweg-de Vries equation for the propagation of fast ion-acoustic waves in multi-dimensions

Abstract is not available.