Electron attachment in binary mixtures of electronegative and buffer gases

The ratio of the electron attachment coefficient eta to the gas pressure p (reduced to 0 degrees C) evaluated from the Townsend current growth curves in binary mixtures of electronegative gases (SF6, CCl2F2, CO2) and buffer gases (N2, Ar, air) clearly indicate that the eta /p ratios do not scale as the partial pressure of electronegative gas in the mixture. Extensive calculations carried out using data experimentally obtained have shown that the attachment coefficient of the mixture eta mix can be expressed as eta mix= eta (1-exp- beta F/(100-F)) where eta is the attachment coefficient of the 100% electronegative gas, F is the percentage of the electronegative gas in the mixture and beta is a constant. The results of this analysis explain to a high degree of accuracy the data obtained in various mixtures and are in very good agreement with the data deduced by Itoh and co-workers (1980) using the Boltzmann equation method.

Low-frequency dielectric constant measurements in the critical polar + non-polar binary liquid system: Methanol + n-heptane

The low-frequency (5–100 kHz) dielectric constant ε has been measured in the temperature range 7 × 10−5 < T = (T − Tc)/Tc < 8 × 10−2. Near Tc an exponent ≈0.11 characterizes the power law behaviour of dε/dt consistent with the theoretically predicted t−α singularity. However, over the full range of t an exponent ≈0.35 is obtained.

Binary decompositions and acyclic schemes

It is well known that the notions of normal forms and acyclicity capture many practical desirable properties for database schemes. The basic schema design problem is to develop design methodologies that strive toward these ideals. The usual approach is to first normalize the database scheme as far as possible. If the resulting scheme is cyclic, then one tries to transform it into an acyclic scheme. In this paper, we argue in favor of carrying out these two phases of design concurrently. In order to do this efficiently, we need to be able to incrementally analyze the acyclicity status of a database scheme as it is being designed. To this end, we propose the formalism of "binary decompositions". Using this, we characterize design sequences that exactly generate theta-acyclic schemes, for theta = agr,beta. We then show how our results can be put to use in database design. Finally, we also show that our formalism above can be effectively used as a proof tool in dependency theory. We demonstrate its power by showing that it leads to a significant simplification of the proofs of some previous results connecting sets of multivalued dependencies and acyclic join dependencies.

A new formalism for representation of binary thermodynamic data

The applicability of a formalism involving an exponential function of composition x1 in interpreting the thermodynamic properties of alloys has been studied. The excess integral and partial molar free energies of mixing are expressed as: $$\begin{gathered} \Delta F^{xs} = a_o x_1 (1 - x_1 )e^{bx_1 } \hfill \\ RTln\gamma _1 = a_o (1 - x_1 )^2 (1 + bx_1 )e^{bx_1 } \hfill \\ RTln\gamma _2 = a_o x_1^2 (1 - b + bx_1 )e^{bx_1 } \hfill \\ \end{gathered} $$ The equations are used in interpreting experimental data for several relatively weakly interacting binary systems. For the purpose of comparison, activity coefficients obtained by the subregular model and Krupkowski’s formalism have also been computed. The present equations may be considered to be convenient in describing the thermodynamic behavior of metallic solutions.

A parallel-serial binary arbitration scheme for collision-free multi-access techniques

Multi-access techniques are widely used in computer networking and distributed multiprocessor systems. On-the-fly arbitration schemes permit one of the many contenders to access the medium without collisions. Serial arbitration is cost effective but is slow and hence unsuitable for high-speed multiprocessor environments supporting very high data transfer rates. A fully parallel arbitration scheme takes less time but is not practically realisable for large numbers of contenders. In this paper, a generalised parallel-serial scheme is proposed which significantly reduces the arbitration time and is practically realisable.

On the implication of the recently discovered 5 millisecond binary pulsar PSR 1855+09

e argue that the extraordinary fact that all three known millisecond pulsars are very close to the galactic plane implies that there must be ~100 potentially observable millisecond pulsars within ~4 kpc from the Sun. Our other main conclusion is that the dipole magnetic fields or old neutron stars probably saturate around 5 x 108 gauss.

Prediction of Breakdown Voltages of Binary Gas Mixtures in Uniform Electric Fields

A simple equation to predict the breakdown voltages for binary mixtures (Vmix) of electronegative gases (SF6, CCl2F2) and buffer gases (N2, N2O, CO2, air) under uniform electric field has been proposed. Values of Vmix evaluated using this equation for mixtures of SF6-N2, SF6-air, SF6-N2O, SF6-CO2 and CCl2F2-N2 over a wide range of pd show an excellent agreement with the experimentally measured data available in the literature.

Combustion and Thermal Decomposition of a Binary Oxidiser System: Ammonium Perchlorate-Potassium Perchlorate

Combustion behaviour of ammonium perchlorate-potassium perchlorate pellets is studied using Crawford strand burners. At low concentrations of potassium perchlorate (up to 30 percent potassium perchlorate) the burning rate of ammonium perchlorate-potassium perchlorate condensed mixtures increases with potassium perchlorate content. Above 40 percent potassium perchlorate content, combustion sustenance becomes difficult. Decomposition products of ammonium perchlorate sensitize the melting and subsequent decomposition of potassium perchlorate. The results are explained in terms of the melt layer thickness, flame temperature and the resultant surface temperature, and heat wave penetration into the solid. The study suggests the importance of melt layer on the burning surface in the deflagration behaviour of ammonium perchlorate-potassium perchlorate condensed mixtures

Low-frequency dielectric constant measurements in the critical polar + non-polar binary liquid system: Methanol + n-heptane

The low-frequency (5–100 kHz) dielectric constant epsilon (Porson) has been measured in the temperature range 7 × 10−5 < t = (T − Tc)/Tc < 8 × 10−2. Near Tc an exponent ≈0.11 characterizes the power law behaviour of Image consistent with the theoretically predicted t−α singularity. However, over the full range of t an exponent ≈0.35 is obtained.

Huffman Binary Coding of WLN Symbols for File-Compression

Construction of Huffman binary codes for WLN symbols is described for the compression of a WLN file. Here, a parenthesized representation of the tree structure is used for computer encoding.

Activity recognition using binary tree SVM

This paper presents an effective classification method based on Support Vector Machines (SVM) in the context of activity recognition. Local features that capture both spatial and temporal information in activity videos have made significant progress recently. Efficient and effective features, feature representation and classification plays a crucial role in activity recognition. For classification, SVMs are popularly used because of their simplicity and efficiency; however the common multi-class SVM approaches applied suffer from limitations including having easily confused classes and been computationally inefficient. We propose using a binary tree SVM to address the shortcomings of multi-class SVMs in activity recognition. We proposed constructing a binary tree using Gaussian Mixture Models (GMM), where activities are repeatedly allocated to subnodes until every new created node contains only one activity. Then, for each internal node a separate SVM is learned to classify activities, which significantly reduces the training time and increases the speed of testing compared to popular the `one-against-the-rest' multi-class SVM classifier. Experiments carried out on the challenging and complex Hollywood dataset demonstrates comparable performance over the baseline bag-of-features method.

Efficient search for statistically significant dependency rules in binary data

Analyzing statistical dependencies is a fundamental problem in all empirical science. Dependencies help us understand causes and effects, create new scientific theories, and invent cures to problems. Nowadays, large amounts of data is available, but efficient computational tools for analyzing the data are missing. In this research, we develop efficient algorithms for a commonly occurring search problem - searching for the statistically most significant dependency rules in binary data. We consider dependency rules of the form X->A or X->not A, where X is a set of positive-valued attributes and A is a single attribute. Such rules describe which factors either increase or decrease the probability of the consequent A. A classical example are genetic and environmental factors, which can either cause or prevent a disease. The emphasis in this research is that the discovered dependencies should be genuine - i.e. they should also hold in future data. This is an important distinction from the traditional association rules, which - in spite of their name and a similar appearance to dependency rules - do not necessarily represent statistical dependencies at all or represent only spurious connections, which occur by chance. Therefore, the principal objective is to search for the rules with statistical significance measures. Another important objective is to search for only non-redundant rules, which express the real causes of dependence, without any occasional extra factors. The extra factors do not add any new information on the dependence, but can only blur it and make it less accurate in future data. The problem is computationally very demanding, because the number of all possible rules increases exponentially with the number of attributes. In addition, neither the statistical dependency nor the statistical significance are monotonic properties, which means that the traditional pruning techniques do not work. As a solution, we first derive the mathematical basis for pruning the search space with any well-behaving statistical significance measures. The mathematical theory is complemented by a new algorithmic invention, which enables an efficient search without any heuristic restrictions. The resulting algorithm can be used to search for both positive and negative dependencies with any commonly used statistical measures, like Fisher's exact test, the chi-squared measure, mutual information, and z scores. According to our experiments, the algorithm is well-scalable, especially with Fisher's exact test. It can easily handle even the densest data sets with 10000-20000 attributes. Still, the results are globally optimal, which is a remarkable improvement over the existing solutions. In practice, this means that the user does not have to worry whether the dependencies hold in future data or if the data still contains better, but undiscovered dependencies.

The new binary pulsar and the observation of gravitational spin precession

The possibility of observing gravitational spin precession due to spin-orbit coupling in a binary pulsar system is considered. An analysis is presented which can aid in delineating the relevant physical effects from pulse-structure data. In this analysis, it is assumed that the pulsar radiation emanates from a cone whose axis is tilted with respect to the axis of rotation. It is found that the time-averaged pulse width and polarization sweep vary periodically with time and that this variation has a periodicity of the order of the spin-precession frequency averaged over a complete revolution. It is concluded that for an orbital period of about 180 years, it suffices to measure polarization data with an accuracy of a few parts in 100 over a period of six months to a year in order to uncover the effects of spin precession. The consistency of the analysis is checked, and the calculations are applied to a recently discovered binary pulsar.