Binary functions,degeneracy, and alternating dimaps

This paper continues the study of combinatorial properties of binary functions — that is, functions $f:2^E\to ?$ such that $f(0?)=1$, where $E$ is a finite set. Binary functions have previously been shown to admit families of transforms that generalise duality, including a trinity transform, and families of associated minor operations that generalise deletion and contraction, with both these families parameterised by the complex numbers. Binary function representations exist for graphs (via the indicator functions of their cutset spaces) and indeed arbitrary matroids (as shown by the author previously). In this paper, we characterise degenerate elements – analogues of loops and coloops – in binary functions, with respect to any set of minor operations from our complex-parameterised family. We then apply this to study the relationship between binary functions and Tutte’s alternating dimaps, which also support a trinity transform and three associated minor operations. It is shown that only the simplest alternating dimaps have binary representations of the form we consider, which seems to be the most direct type of representation. The question of whether there exist other, more sophisticated types of binary function representations for alternating dimaps is left open.     

二元液态金属Cu-Ni和Ag-Cu凝固过程的分子动力学模拟研究

用Quantum Sutton-Chen多体势对Ag6Cu4和CuNi液态金属凝固过程进行了分子动力学模拟研究.在冷却速率2×1012到2×1014K/s范围内,CuNi总是形成fcc晶体结构,而Ag6Cu4总是形成非晶态结构.考虑到CuNi及AgCu中原子半径之比分别为1.025和1.13,那么模拟结果证实了原子的尺寸差别是非晶态合金形成的一个主要影响因素.此外采用键对及原子多面体类型指数法对凝固过程中微观结构组态变化的分析,不但能说明二十面体结构在非晶态合金形成和稳定性中所起的关键作用,又有助于对液态金属的凝固过程、非晶态结构特征的深入理解.     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

Long range one-dimensional ordering of lead phthalocyanine monolayer on InSb(1 0 0) (4 × 2)/c(8 × 2)

Sub-monolayer and monolayer of lead phthalocyanine deposited on InSb(1 0 0) (4 × 2)/c(8 × 2) surface have been investigated by scanning tunneling microscopy and low energy electron diffraction. Molecules first adsorb on the indium rows of the (4 × 2)/c(8 × 2) structure in the [1 1 0] direction and diffuse at the surface in order to form two-dimensional islands. The molecule-substrate interaction stabilizes the PbPc molecules on the In rows. It weakens the interaction between molecules located in adjacent rows resulting in numerous gliding planes between the molecular chains, in the direction parallel to the rows. At monolayer completion, a long-range one-dimensional order is adopted by the molecules in the [1 1 0] direction.     

Quadrupole interactions at 57Fe and 119Sn in 3d-metal antimonides

3d-metal antimonides: Fe_1+x Sb, N_+x Sb, Co_+x Sb and the (Ni_1?y Fe _y )Sb solid solution have been studied by the Mössbauer effect method at ⁵⁷Fe and ¹¹⁹Sn. It was found that the quadrupole interactions at the Fe and Sn nucleus in 3d-metal antimonides are very sensitive to the filling of different crystallographic sites with metal atoms. The metal atoms in trigonal-bipyramidal sites have a strong effect on the quadrupole splitting of ¹¹⁹Sn. They are nearest to anions (Sb or Sn) with the typical axial ratio of c/a = 1.25. The QS(x) dependence of ¹¹⁹ Sn in 3d-metal antimonides in the 0 ≤ x ≤ 0.1 concentration range can be used to determine x – the concentration of transition metal excess relative to the stoichiometric composition.     

Towards the Exact Minimization of BDDs—An Elitism-Based Distributed Evolutionary Algorithm

Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks.     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

10.1007/s10955-006-9040-z

We derive hydrodynamic equations describing the evolution of a binary fluid segregated into two regions, each rich in one species,which are separated (on the macroscopic scale) by a sharp interface. Our starting point is a Vlasov-Boltzmann (VB) equation describing the evolution of the one particle position and velocity distributions, f_i (x, v, t), i = 1, 2. The solution of the VB equation is developed in a Hilbert expansion appropriate for this system. This yields incompressible Navier-Stokes equations for the velocity field u and a jump boundary condition for the pressure across the interface. The interface, in turn, moves with a velocity given by the normal component of u.     

Tracing of interference fringes using average gray value and simultaneous row and column scan

An algorithm for computer tracing of interference fringes is reported. The method uses the average gray-level value for thresholding, row and column scans for determining the type of the scan and simultaneous row and column scan for tracing. The proposed method yield good result even for low-contrast and high-noise images. The program for the interferogram tracing was written using MATLAB6.