Discovering compressing serial episodes from event sequences

Most pattern mining methods yield a large number of frequent patterns, and isolating a small relevant subset of patterns is a challenging problem of current interest. In this paper, we address this problem in the context of discovering frequent episodes from symbolic time-series data. Motivated by the Minimum Description Length principle, we formulate the problem of selecting relevant subset of patterns as one of searching for a subset of patterns that achieves best data compression. We present algorithms for discovering small sets of relevant non-redundant episodes that achieve good data compression. The algorithms employ a novel encoding scheme and use serial episodes with inter-event constraints as the patterns. We present extensive simulation studies with both synthetic and real data, comparing our method with the existing schemes such as GoKrimp and SQS. We also demonstrate the effectiveness of these algorithms on event sequences from a composable conveyor system; this system represents a new application area where use of frequent patterns for compressing the event sequence is likely to be important for decision support and control.

Systematic search for optical Barker codes with minimum length

A method that yields optical Barker codes of smallest known lengths for given discrimination is described.

Length-scale-dependent ensemble-averaged conductance of a 1D disordered conductor: Conductance minimum

An exact numerical calculation of ensemble-averaged length-scale-dependent conductance for the one-dimensional Anderson model is shown to support an earlier conjecture for a conductance minimum. The numerical results can be understood in terms of the Thouless expression for the conductance and the Wigner level-spacing statistics.

Alamethicin and synthetic peptide fragments as uncouplers of mitochondrial oxidative phosphorylation. Effect of chain length and change

Alamethicin, its derivatives and some synthetic fragments have been shown to be uncouplers of oxidative phosphorylation in rat liver mitochondria. A minimum peptide chain length of 13 residues is necessary for this activity. Peptide esters are more efficient uncouplers than the corresponding peptide acids. Esterification of the Glu(18) γ-COOH group in alamethicin does not diminish uncoupling activity. The structural requirements for uncoupling activity parallel those determined for ionophoretic action in small, unilamellar liposomes. Aib, α-aminoisobutyric acid; Z, benzyloxycarbonyl; OMe, methyl ester; OBz, benzyl ester; Ac, acetyl; CTC, chlortetracycline.

Complexity of scheduling for minimum power on a GMAC

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.

Potential functions for hydrogen bond interactions - IV. Minimum Energy Conformation of the α-Helical Structure of PoIy-L-Alanine

Making use of the empirical potential functions for peptide NH .. O bonds, developed in this laboratory, the relative stabilities of the rightand left-handed α-helical structures of poly-L-alanine have been investigated, by calculating their conformational energies (V). The value of Vmin of the right-handed helix (αP) is about - 10.4 kcal/mole, and that of the left-handed helix (αM) is about - 9.6 kcal/mole, showing that the former is lower in energy by 0.8 kcal/mole. The helical parameters of the stable conformation of αP are n ∼ 3.6 and h ∼ 1.5 Å. The hydrogen bond of length 2.85 Å and nonlinearity of about 10° adds about 4.0 kcal/ mole to the stabilising energy of the helix in the minimum enregy region. The energy minimum is not sharply defined, but occurs over a long valley, suggesting that a distribution of conformations (φ{symbol}, ψ) of nearly the same energy may occur for the individual residues in a helix. The experimental data of a-helical fibres of poly-L-alanine are in good agreement with the theoretical results for αP. In the case of proteins, the mean values of (φ{symbol}, ψ) for different helices are distributed, but they invariably occur within the contour for V = Vmin + 2 kcal/mole for αP.

Relaxation behavior of twin nonlinear optical chromophores: Effect of the spacer length

A new series of twin nonlinear optical (NLO) molecules, having two 4-nitrophenol chromophores that are linked via a flexible polymethylene spacer of varying length [(CH2)(n), n = 1-12], were synthesized. Powder second harmonic generation measurements of these twin samples indicated a pronounced odd-even oscillation, with the odd twins exhibiting a high SHG value while the even ones gave no measurable SH signal. This behavior reflects the crystal packing preferences in such twin NLO systems that have odd and even numbers of atoms linking them - the even ones appear to prefer a centrosymmetric packing arrangement. The orientational/disordering dynamics of these twin NLO molecules, doped in a polymer (poly(methyl methacrylate)) matrix, has also been studied using SHG in electric field poled samples. Interestingly, the maximum attainable SH signal, chi((2)), in, the poled samples also showed an odd-even oscillation; the odd ones again having a higher value of chi((2)) This unprecedented odd-even oscillation in such molecularly doped systems is rationalized as being due to the intrinsically greater ease of a parallel alignment of the two chromophores in the twins with an odd spacer than in those with an even one. Further, the temporal stability of the SHG intensity at 70 degrees C, after the removal of the applied corona, was also studied. The relaxation of all the twin chromophores followed a biexponential decay; the characteristic relaxation time (tau(2)) for the slow decay component suggests that while the twin with a single methylene unit relaxes relatively slowly, the relaxation is significantly faster in cases where n = 2 and 3. In the twins with even longer spacer segments, the relaxation again becomes slower and reaches a saturation value. The observed minimum appears to reflect the interplay of two competing factors that affect the chromophore alignment in such twin systems, namely, the electrostatic repulsion between neighboring oriented dipoles and the intrinsic flexibility of the spacer.

Minimum error solutions of the Boltzmann equation for shock structure

‘Best’ solutions for the shock-structure problem are obtained by solving the Boltzmann equation for a rigid sphere gas by applying minimum error criteria on the Mott-Smith ansatz. The use of two such criteria minimizing respectively the local and total errors, as well as independent computations of the remaining error, establish the high accuracy of the solutions, although it is shown that the Mott-Smith distribution is not an exact solution of the Boltzmann equation even at infinite Mach number. The minimum local error method is found to be particularly simple and efficient. Adopting the present solutions as the standard of comparison, it is found that the widely used v2x-moment solutions can be as much as a third in error, but that results based on Rosen's method provide good approximations. Finally, it is shown that if the Maxwell mean free path on the hot side of the shock is chosen as the scaling length, the value of the density-slope shock thickness is relatively insensitive to the intermolecular potential. A comparison is made on this basis of present results with experiment, and very satisfactory quantitative agreement is obtained.

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.

Channel Hardening-Exploiting Message Passing (CHEMP) Receiver in Large-Scale MIMO Systems

In this paper, we propose a multiple-input multiple-output (MIMO) receiver algorithm that exploits channel hardening that occurs in large MIMO channels. Channel hardening refers to the phenomenon where the off-diagonal terms of the matrix become increasingly weaker compared to the diagonal terms as the size of the channel gain matrix increases. Specifically, we propose a message passing detection (MPD) algorithm which works with the real-valued matched filtered received vector (whose signal term becomes, where is the transmitted vector), and uses a Gaussian approximation on the off-diagonal terms of the matrix. We also propose a simple estimation scheme which directly obtains an estimate of (instead of an estimate of), which is used as an effective channel estimate in the MPD algorithm. We refer to this receiver as the channel hardening-exploiting message passing (CHEMP) receiver. The proposed CHEMP receiver achieves very good performance in large-scaleMIMO systems (e.g., in systems with 16 to 128 uplink users and 128 base station antennas). For the considered large MIMO settings, the complexity of the proposed MPD algorithm is almost the same as or less than that of the minimum mean square error (MMSE) detection. This is because the MPD algorithm does not need a matrix inversion. It also achieves a significantly better performance compared to MMSE and other message passing detection algorithms using MMSE estimate of. Further, we design optimized irregular low density parity check (LDPC) codes specific to the considered large MIMO channel and the CHEMP receiver through EXIT chart matching. The LDPC codes thus obtained achieve improved coded bit error rate performance compared to off-the-shelf irregular LDPC codes.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Synthesis of novel poly[(2,5-dimethoxy-p-phenylene)vinylene] precursors having two eliminatable groups: An approach for the control of conjugation length

Poly[(2,5-dimethoxy-p-phenylene)vinylene] (DMPPV) of varying conjugation length was synthesized by selective elimination of organic soluble precursor polymers that contained two eliminatable groups, namely, methoxy and acetate groups. These precursor copolymers were in turn synthesized by competitive nucleophilic substitution of the sulfonium polyelectrolyte precursor (generated by the standard Wessling route) using methanol and sodium acetate in acetic acid. The composition of the precursor copolymer, in terms of the relative amounts of methoxy and acetate groups, was controlled by varying the composition of the reaction mixture during nucleophilic substitution. Thermal elimination of these precursor copolymers at 250 degrees C, yielded partially conjugated polymers, whose color varied from light yellow to deep red. FT-IR studies confirmed that, while essentially all the acetate groups were eliminated, the methoxy groups were intact and caused the interruption in conjugation. Preliminary photoluminescence studies of the partially eliminated DMPPV samples showed a gradual shift in the emission maximum from 498 to 598 nm with increasing conjugation lengths, suggesting that the color of LED devices fabricated from such polymers can, in principle, be fine-tuned.

Telomere structure, replication and length maintenance

Telomeres are the termini of linear eukaryotic chromosomes consisting of tandem repeats of DNA and proteins that bind to these repeat sequences. Telomeres ensure the complete replication of chromosome ends, impart protection to ends from nucleolytic degradation, end-to-end fusion, and guide the localization of chromosomes within the nucleus. In addition, a combination of genetic, biochemical, and molecular biological approaches have implicated key roles for telomeres in diverse cellular processes such as regulation of gene expression, cell division, cell senescence, and cancer. This review focuses on recent advances in our understanding of the organization of telomeres, telomere replication, proteins that bind telomeric DNA, and the establishment of telomere length equilibrium.

A probabilistic constrained nonlinear optimization framework to optimize RED parameters

The random early detection (RED) technique has seen a lot of research over the years. However, the functional relationship between RED performance and its parameters viz,, queue weight (omega(q)), marking probability (max(p)), minimum threshold (min(th)) and maximum threshold (max(th)) is not analytically availa ble. In this paper, we formulate a probabilistic constrained optimization problem by assuming a nonlinear relationship between the RED average queue length and its parameters. This problem involves all the RED parameters as the variables of the optimization problem. We use the barrier and the penalty function approaches for its Solution. However (as above), the exact functional relationship between the barrier and penalty objective functions and the optimization variable is not known, but noisy samples of these are available for different parameter values. Thus, for obtaining the gradient and Hessian of the objective, we use certain recently developed simultaneous perturbation stochastic approximation (SPSA) based estimates of these. We propose two four-timescale stochastic approximation algorithms based oil certain modified second-order SPSA updates for finding the optimum RED parameters. We present the results of detailed simulation experiments conducted over different network topologies and network/traffic conditions/settings, comparing the performance of Our algorithms with variants of RED and a few other well known adaptive queue management (AQM) techniques discussed in the literature.

Growing length and time scales in glass-forming liquids

The glass transition, whereby liquids transform into amorphous solids at low temperatures, is a subject of intense research despite decades of investigation. Explaining the enormous increase in relaxation times of a liquid upon supercooling is essential for understanding the glass transition. Although many theories, such as the Adam-Gibbs theory, have sought to relate growing relaxation times to length scales associated with spatial correlations in liquid structure or motion of molecules, the role of length scales in glassy dynamics is not well established. Recent studies of spatially correlated rearrangements of molecules leading to structural relaxation, termed ``spatially heterogeneous dynamics,'' provide fresh impetus in this direction. A powerful approach to extract length scales in critical phenomena is finite-size scaling, wherein a system is studied for sizes traversing the length scales of interest. We perform finite-size scaling for a realistic glass-former, using computer simulations, to evaluate the length scale associated with spatially heterogeneous dynamics, which grows as temperature decreases. However, relaxation times that also grow with decreasing temperature do not exhibit standard finite-size scaling with this length. We show that relaxation times are instead determined, for all studied system sizes and temperatures, by configurational entropy, in accordance with the Adam-Gibbs relation, but in disagreement with theoretical expectations based on spin-glass models that configurational entropy is not relevant at temperatures substantially above the critical temperature of mode-coupling theory. Our results provide new insights into the dynamics of glass-forming liquids and pose serious challenges to existing theoretical descriptions.