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.     

Halomethanes in tri-n-octylamine and squalane mixtures at infinite dilution

The retention behavior of eight halomethanes and four saturated hydrocarbons was measured in gas chromatographic stationary phases consisting in tri-n-octylamine (TOA), squalane (SQ) and six TOA+SQ mixtures, at 55.0, 58.5, 62.5 and 65.0°C. Equlibrium constants for complex formation were extracted from experimental data by using a lattice model developed by Martire. The results may be interpreted in terms of the formation of weak hydrogen-bonded complexes, with sociation constants of about 0.13 L-mol^–1 for haloforms and 0.07 L-mol^–1 for dihalomethanes at 60°C.     

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

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

Fracture toughening of epoxy matrices with blends of resins of different molecular weights and other modifiers

The microstructure and fracture behavior of epoxy mixtures containing two monomers of different molecular weights were studied. The variation of the fracture toughness by the addition of other modifiers was also investigated. Several amounts of high‐molecular‐weight diglycidyl ether of bisphenol A (DGEBA) oligomer were added to a nearly pure DGEBA monomer. The mixtures were cured with an aromatic amine, showing phase separation after curing. The curing behavior of the epoxy mixtures was investigated with thermal measurements. A significant enhancement of the fracture toughness was accompanied by slight increases in both the rigidity and strength of the mixtures that corresponded to the content of the high‐molecular‐weight epoxy resin. Dynamic mechanical and atomic force microscopy measurements indicated that the generated two‐phase morphology was a function of the content of the epoxy resin added. The influence of the addition of an oligomer or a thermoplastic on the morphologies and mechanical properties of both epoxy‐containing mixtures was also investigated. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 3920–3933, 2004     

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.     

非共沸制冷剂R417A在水平光滑管内的沸腾传热

应用一种快速、准确的隐式格式迭代数值计算方法 ,对非共沸制冷剂 R41 7A在水平光滑管内的蒸发过程进行了数值模拟。通过应用纯质的传热公式计算后与实验值相比较 ,数值计算结果高于实验值。     

On existence and stability in the theory of swelling porous elastic soils

The aim of this paper is to introduce a new functional in thestudy of swelling porous elastic soils saturated by a fluid.This new functional is a useful tool; it allows us to provethe existence of solutions in the case of a compressible fluid.We also prove the stability of solutions and the exponentialdecay in the case of an incompressible fluid. We study as wellthe continuous dependence with respect to the initial time.     

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.