Testing predictions of macroscopic binary diffusion coefficients using lattice models with site heterogeneity

Quantitatively predicting mass transport rates for chemical mixtures in porous materials is important in applications of materials such as adsorbents, membranes, and catalysts. Because directly assessing mixture transport experimentally is challenging, theoretical models that can predict mixture diffusion coefficients using Only single-component information would have many uses. One such model was proposed by Skoulidas, Sholl, and Krishna (Langmuir, 2003, 19, 7977), and applications of this model to a variety of chemical mixtures in nanoporous materials have yielded promising results. In this paper, the accuracy of this model for predicting mixture diffusion coefficients in materials that exhibit a heterogeneous distribution of local binding energies is examined. To examine this issue, single-component and binary mixture diffusion coefficients are computed using kinetic Monte Carlo for a two-dimensional lattice model over a wide range of lattice occupancies and compositions. The approach suggested by Skoulidas, Sholl, and Krishna is found to be accurate in situations where the spatial distribution of binding site energies is relatively homogeneous, but is considerably less accurate for strongly heterogeneous energy distributions.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE

Efficient spatial clustering algorithm using binary tree

In this paper we present an efficient k-Means clustering algorithm for two dimensional data. The proposed algorithm re-organizes dataset into a form of nested binary tree*. Data items are compared at each node with only two nearest means with respect to each dimension and assigned to the one that has the closer mean. The main intuition of our research is as follows: We build the nested binary tree. Then we scan the data in raster order by in-order traversal of the tree. Lastly we compare data item at each node to the only two nearest means to assign the value to the intendant cluster. In this way we are able to save the computational cost significantly by reducing the number of comparisons with means and also by the least use to Euclidian distance formula. Our results showed that our method can perform clustering operation much faster than the classical ones. © Springer-Verlag Berlin Heidelberg 2005

Beyond the formal/informal economy binary hierarchy

Purpose – This paper aims to evaluate critically the conventional binary hierarchical representation of the formal/informal economy dualism which reads informal employment as a residual and marginal sphere that has largely negative consequences for economic development and needs to be deterred. Design/methodology/approach – To contest this depiction, the results of 600 household interviews conducted in Ukraine during 2005/2006 on the extent and nature of their informal employment are reported. Findings – Informal employment is revealed to be an extensively used form of work and, through a richer and more textured understanding of the multiple roles that different forms of informal employment play, a form of work that positively contributes to economic and social development, acting both as an important seedbed for enterprise creation and development and as a primary vehicle through which community self-help is delivered in contemporary Ukraine. Research limitations/implications – This survey reveals that depicting informal employment as a hindrance to development and deterring engagement in this sphere results in state authorities destroying the entrepreneurial endeavour and active citizenship that other public policies are seeking to nurture. The paper concludes by addressing how this public policy paradox might start to be resolved. Originality/value – This paper is one of the first to document the role of informal employment in nurturing enterprise creation and development as well as community exchange.

Binary sparse nonnegative matrix factorization

This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing process of B-SNMF are much faster than those of binary principal component analysis (B-PCA). Besides, B-SNMF is more robust to occlusions in images. Experimental results on face images demonstrate the effectiveness and the efficiency of the proposed B-SNMF.

40-Gbaud 16-QAM transmitter using tandem IQ modulators with binary driving electronic signals

We propose a novel 16-quadrature amplitude modulation (QAM) transmitter based on two cascaded IQ modulators driven by four separate binary electrical signals. The proposed 16-QAM transmitter features scalable configuration and stable performance with simple bias-control. Generation of 16-QAM signals at 40 Gbaud is experimentally demonstrated for the first time and visualized with a high speed constellation analyzer. The proposed modulator is also compared to two other schemes. We investigate the modulator bandwidth requirements and tolerance to accumulated chromatic dispersion through numerical simulations, and the minimum theoretical insertion attenuation is calculated analytically.

All-optical binary counter

We experimentally demonstrate an all-optical binary counter composed of four semiconductor optical amplifier based all-optical switching gates. The time-of-flight optical circuit operates with bit-differential delays between the exclusive-OR gate used for modulo-2 binary addition and the AND gate used for binary carry detection. A movie of the counter operating in real time is presented.

A non-linear encoder using a binary counterfor pulse-code modulation

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT