Binary concepts and standardization in counter-current separation technology

Counter-current separation (CS) technology is currently faced with the challenge of being fit for the purpose of omics analysis, which involves highly complex samples and digitized research environments. Resembling a network of binary decisions, CS requires standardization of operation parameters in order to be efficient. While recent CS engineering solutions uniformly involve centrifugal force designs to overcome the limitation of the earth's 1 × g force, factors of instrument design, operation, and graphical representation of the outcome are equally important targets for standardization. For example, chromatograms that emphasize the unique K-based nature of CS, such as reciprocal symmetry (ReS) plots, foster the fundamental understanding of CS operation. Because significant differences exist in underlying mechanism (e.g., stationary phase volume), outcome (e.g., construction of chromatograms), and scale (e.g., factors affecting overall method sensitivity) of solid–liquid vs. liquid–liquid chromatography technologies, standardization will enable the systematic exploration of the differential properties of the two LC technologies, and will be key to making CS fit for the digital omics age.     

Binary group and Chinese postman polyhedra

A new proof of the characterization of the Chinese postman polyhedra is given. In developing this proof, a theorem of Gomory about homomorphic lifting of facets for group polyhedra is generalized to subproblems. Some results for the Chinese postman problem are generalized to binary group problems. In addition, a connection is made between Fulkerson's blocking polyhedra and a blocking pair of binary group problems. A connection is also developed between minors and lifting of facets for group problems.     

Lower bounds on the minimum average distance of binary codes

Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2ⁿ⁻¹/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using a linear programming approach. In particular, it is proved that lim_n→∞β(n,2n)=5/2. We also give a new recursive inequality for β(n,M).     

A novel frequency encoded all optical CNOT gate exploiting difference frequency generation and implementation of fast binary adders using frequency encoding and nonlinear dielectric films

Optics has an important role in logic implementation and computation is established in two and half decades by many researchers. Recently frequency encoding technique is established. This technique does not suffer from intensity dependent loss problems like other schemes. Amorphous dielectric thin films with reflecting edges can also be used for logic realization and has very fast response speed. It also does not use any semiconductor device and simple to construct. In this communication the authors have proposed all optical CNOT gate using frequency encoded difference frequency generation exploiting nonlinear response of some material and implementation of binary adders by CNOT gate and dielectric thin film AND gate.     

Digital information encrypted in an image using binary encoding

This paper proposes a new type of encoding methods to encrypt hidden (covert) information in host images. The encrypted information can be plot, fax, word, or network data, and it must be encoded with binary codes. All the pixels in an encoded (overt) image modulated from a host image are classified into three groups. The first group of pixels is called identification codes, used to judge whether the overt image is encoded by a method proposed in this paper or not. The second group of pixels is called type codes, used to judge the encoding type. The third group of pixels is called information codes, used to decode the encoded information. Applying the proposed encoding methods is quite convenient, and host images are not needed for decoding. Decoding covert information from overt images is rather difficult for un-authorized persons, whereas it is very easy for designers or authorized persons. Therefore, the proposed methods are very useful.     

Crowding with nearest neighbors replacement for multiple species niching and building blocks preservation in binary multimodal functions optimization

This paper introduces a novel niching scheme called the q-nearest neighbors replacement (q-NNR) method in the framework of the steady-state GAs (SSGAs) for solving binary multimodal optimization problems. A detailed comparison of the main niching approaches are presented first. The niching paradigm and difference of the selection-recombination genetic algorithms (GAs) and the recombination-replacement SSGAs are discussed. Then the q-NNR is developed by adopting special replacement policies based on the SSGAs; a Boltzmann scheme for dynamically sizing the nearest neighbors set is designed to achieve a speed-up and control the proportion of individuals adapted to different niches. Finally, experiments are carried out on a set of test functions characterized by deception, epistasis, symmetry and multimodality. The results are satisfactory and illustrate the effectivity and efficiency of the proposed niching method.     

Determination of phenylephrine hydrochloride and chlorpheniramine maleate in binary mixture using chemometric-assisted spectrophotometric and high-performance liquid chromatographic-UV methods

Four methods have been developed for the simultaneous determination of phenylephrine hydrochloride and chlorpheniramine maleate without previous separation. In the first method both drugs are determined using first derivative UV spectrophotometry, with zero-crossing measurement. The second method depends on first derivative of the ratios spectra. The third method describes the use of multivariate spectrophotometric calibration for the simultaneous determination of the analyzed binary mixture where the resolution is accomplished by using partial least squares (PLS) regression analysis. In the fourth method (HPLC), a reversed-phase column and a mobile phase of methanol:water:acetonitrile (80:12:8 v/v/v/) at 0.9 ml/min flow rate have been used to separate both drugs with a UV detection at 270 nm. All the proposed methods are extensively validated. They have the advantage to be economic and time saving. All the described methods can be readily utilized for analysis of pharmaceutical formulations. The results obtained using the proposed methods are statistically analyzed and compared with some reported methods.     

Simultaneous establishing of stationary growth rate and composition of supercritical droplets at isothermal binary condensation in the diffusion-controlled regime

General integral relations expressing the droplet radius and time of the droplet nonstationary growth as nonlinear functions of solution concentration in the droplet have been derived. These relations are valid for a supercritical droplet (i.e., sufficiently large droplet, for which the Laplace pressure effect on the concentration at saturation of vapors is negligible) isothermally growing via stationary diffusion in the mixture of two condensing vapors and an incondensable carrier gas. The initial composition in the droplet may be arbitrary and partial molecular volumes of components are not fixed. Explicit analytical relations have been found for droplet composition and the droplet size as functions of time at small deviations from the stationary concentration in the growing droplet. These relations show that the assumption of the steady droplet growth rate is not valid for non-small deviations from the stationary concentration. Some illustrations of the general nonlinear theory have been done in situation when solution in the droplet can be considered ideal.     

Decision making with imprecise probabilities and utilities by means of statistical preference and stochastic dominance

A problem of decision making under uncertainty in which the choice must be made between two sets of alternatives instead of two single ones is considered. A number of choice rules are proposed and their main properties are investigated, focusing particularly on the generalizations of stochastic dominance and statistical preference. The particular cases where imprecision is present in the utilities or in the beliefs associated to two alternatives are considered.