Guessing based on length functions

Close relationships between guessing functions and length functions are established. Good length functions lead to good guessing functions. In particular, guessing in the increasing order of Lempel-Ziv lengths has certain universality properties for finite-state sources. As an application, these results show that hiding the parameters of the key-stream generating source in a private key crypto-system may not enhance the privacy of the system, the privacy level being measured by the difficulty in brute-force guessing of the key stream.

Landau-Zener problem with waiting at the minimum gap and related quench dynamics of a many-body system

We discuss a technique for solving the Landau-Zener (LZ) problem of finding the probability of excitation in a two-level system. The idea of time reversal for the Schrodinger equation is employed to obtain the state reached at the final time and hence the excitation probability. Using this method, which can reproduce the well-known expression for the LZ transition probability, we solve a variant of the LZ problem, which involves waiting at the minimum gap for a time t(w); we find an exact expression for the excitation probability as a function of t(w). We provide numerical results to support our analytical expressions. We then discuss the problem of waiting at the quantum critical point of a many-body system and calculate the residual energy generated by the time-dependent Hamiltonian. Finally, we discuss possible experimental realizations of this work.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Effect of Chain Length of Alcohol on the Lipase-Catalyzed Esterification of Propionic Acid in Supercritical Carbon Dioxide

The esterification of propionic acid was investigated using three different alcohols, namely, isopropyl alcohol, isobutyl alcohol, and isoamyl alcohol. The variation of conversion with time for the synthesis of isoamyl propionate was investigated in the presence of five enzymes. Novozym 435 showed the highest activity, and this was used as the enzyme for investigating the various parameters that influence the esterification reaction. The Ping-Pong Bi-Bi model with inhibition by both acid and alcohol was used to model the experimental data and determine the kinetics of the esterification reaction.

High-Throughput Flexible Constraint Length Viterbi Decoders on De Bruijn, Shuffle-Exchange and Butterfly Connected Architectures

Flexible constraint length channel decoders are required for software defined radios. This paper presents a novel scalable scheme for realizing flexible constraint length Viterbi decoders on a de Bruijn interconnection network. Architectures for flexible decoders using the flattened butterfly and shuffle-exchange networks are also described. It is shown that these networks provide favourable substrates for realizing flexible convolutional decoders. Synthesis results for the three networks are provided and a comparison is performed. An architecture based on a 2D-mesh, which is a topology having a nominally lesser silicon area requirement, is also considered as a fourth point for comparison. It is found that of all the networks considered, the de Bruijn network offers the best tradeoff in terms of area versus throughput.

Studies on the conformation of amino acids XII. Energy calculations on prolyl residue

The favoured conformations of the prolyl residue have been obtained by calculating their potential energies arising from bond-angle strain, torsion-angle strain, non-bonded and electrostatic interatomic energies. In addition to the five membered ring, the peptide unit at the amino end (with ω = 180°) and the C′ atom at the carboxyl end have been taken into account. It is found that there are two local minima in the configurational space of the parameters defining the conformation, as is actually observed-one (denoted by B) with Cγ displaced on the same side as C′, which is lower in energy than the other (denoted by A) with Cγ displaced on the opposite side of C′. The other four atoms Cδ, N, Cα, Cβ are nearly in a plane. The conformations of minimum energy (for both A and B) have bond angles very close to the mean observed values while the torsion angles are well within the range observed in various structures for each type. Taking into account the fact that the influence of neighbouring molecules in a crystal structure may make the conformation of a molecule different from the minimal one, the ranges of the conformational parameters for which the energy is within 0.6 kcal/mole above the minimum value (called the "most probable range") and within 1.2 kcal/mole (called the "probable range") have been determined. The ranges thus obtained, agree well with observation, and most of the observed data lie within the most probable ranges, although differing appreciably from the conformation of minimum energy. The study has been extended, in a limited way, to the conformation of the ring in the amino acid proline. Since the nitrogen is tetrahedral in this (as contrasted with being planar in the prolyl residue), it is found that any one of the five atoms can be out of plane (either way), with the other four lying nearly in a plane. These correspond to low energy conformations (up to 1.2 kcal/mole above the minimum). One such example, in which the Cα atom is out of plane is known for dl-proline · HCl. It is also shown that in these calculations energies due to bond length distortions can be neglected to a good degree of approximation, provided the 'best' values of the bond lengths for the particular compound are used in the theoretical calculations.

The Line Spectral Frequency Model of a Finite-Length Sequence

The line spectral frequency (LSF) of a causal finite length sequence is a frequency at which the spectrum of the sequence annihilates or the magnitude spectrum has a spectral null. A causal finite-length sequencewith (L + 1) samples having exactly L-LSFs, is referred as an Annihilating (AH) sequence. Using some spectral properties of finite-length sequences, and some model parameters, we develop spectral decomposition structures, which are used to translate any finite-length sequence to an equivalent set of AH-sequences defined by LSFs and some complex constants. This alternate representation format of any finite-length sequence is referred as its LSF-Model. For a finite-length sequence, one can obtain multiple LSF-Models by varying the model parameters. The LSF-Model, in time domain can be used to synthesize any arbitrary causal finite-length sequence in terms of its characteristic AH-sequences. In the frequency domain, the LSF-Model can be used to obtain the spectral samples of the sequence as a linear combination of spectra of its characteristic AH-sequences. We also summarize the utility of the LSF-Model in practical discrete signal processing systems.

Method for obtaining minimum noise in a general purpose hot wire amplifier

It has been shown that the conventional practice of designing a compensated hot wire amplifier with a fixed ceiling to floor ratio results in considerable and unnecessary increase in noise level at compensation settings other than optimum (which is at the maximum compensation at the highest frequency of interest). The optimum ceiling to floor ratio has been estimated to be between 1.5-2.0 ωmaxM. Application of the above considerations to an amplifier in which the ceiling to floor ratio is optimized at each compensation setting (for a given amplifier band-width), shows the usefulness of the method in improving the signal to noise ratio.

Dry sliding wear behavior of Al2O3 fiber reinforced aluminum composites

Dry sliding wear behavior of die-cast ADC12 aluminum alloy composites reinforced with short alumina fibers were investigated by using a pin-on-disk wear tester. The Al2O3 fibers were 4 mu m in diameter and were present in volume fractions (T-f)ranging from 0.03 to 0.26, The length of the fiber varied from 40 to 200 mu m. Disks of aluminum-alumina composites were rubbed against a pin of nitrided stainless steel SUS440B with a load of 10 N at a sliding velocity of 0.1 m/s. The unreinforced ADC 12 aluminum alloy and their composites containing low volume fractions of alumina (V-f approximate to 0.05) showed a sliding-distance-dependent transition from severe to mild wear. However, composites containing high volume fractions of alumina ( V-f > 0.05) exhibited only mild wear for all sliding distances. The duration of occurrence of the severe wear regime and the wear rate both decrease with increasing volume fraction. In MMCs the wear rate in the mild wear regime decreases with increase in volume fraction: reaching a minimum value at V-f = 0.09 Beyond V-f = 0.09 the wear rate increasesmarginally. On the other hand, the wear rate of the counterface (steel pin) was found to increase moderately with increase in V-f. From the analysis of wear data and detailed examination of (a) worn surfaces, (b) their cross-sections and (c) wear debris, two modes of wear mechanisms have been identified to be operative, in these materials and these are: (i) adhesive wear in the case of unreinforced matrix material and in MMCs with low Vf and (ii) abrasive wear in the case of MMCs with high V-f. (C) 2000 Elsevier Science Ltd. All rights reserved.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

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.

Minimum enclosing spheres formulations for support vector ordinal regression

We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. Both approaches guarantee that the radii of the spheres are properly ordered at the optimal solution. The size of the optimization problem is linear in the number of training samples. The popular SMO algorithm is adapted to solve the resulting optimization problem. Numerical experiments on some real-world data sets verify the usefulness of our approaches for data mining.