An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem.     

Multiple Observations for Secret-Key Binding with SRAM PUFs

We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time.     

Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian–Wolf Codes

Typical random codes (TRCs) in a communication scenario of source coding with side information in the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random binning code ensemble. In this code ensemble, the relatively small type classes of the source are deterministically partitioned into the available bins in a one-to-one manner. As a consequence, the error probability decreases dramatically. The random binning error exponent and the error exponent of the TRCs are derived and proved to be equal to one another in a few important special cases. We show that the performance under optimal decoding can be attained also by certain universal decoders, e.g., the stochastic likelihood decoder with an empirical entropy metric. Moreover, we discuss the trade-offs between the error exponent and the excess-rate exponent for the typical random semi-deterministic code and characterize its optimal rate function. We show that for any pair of correlated information sources, both error and excess-rate probabilities exponential vanish when the blocklength tends to infinity.     

A Coupling Framework for Multi-Domain Modelling and Multi-Physics Simulations

This paper describes a coupling framework for parallel execution of different solvers for multi-physics and multi-domain simulations with an arbitrary number of adjacent zones connected by different physical or overlapping interfaces. The coupling architecture is based on the execution of several instances of the same coupling code and relies on the use of smart edges (i.e., separate processes) dedicated to managing the exchange of information between two adjacent regions. The collection of solvers and coupling sessions forms a flexible and modular system, where the data exchange is handled by independent servers that are dedicated to a single interface connecting two solvers’ sessions. Accuracy and performance of the strategy is considered for turbomachinery applications involving Conjugate Heat Transfer (CHT) analysis and Sliding Plane (SP) interfaces.     

pH‐induced on–off switching of polycarbonate track‐etched membranes by plasma‐induced surface grafting

Surface functionalization of the plasma‐pretreated polycarbonate (PC) track‐etched membranes via plasma‐induced thermally graft copolymerization of acrylic acid (AAc) was carried out. The resulting PC membranes with grafted AAc side chains were characterized by X‐ray photoelectron spectroscopy (XPS), Fourier transform infrared (FTIR) spectroscopy, and thermogravimetric (TG) analysis. The morphology of the PC membranes was studied by scanning electron microscopy (SEM). The results showed that the grafted PAAc polymers were formed uniformly inside the pores throughout the entire membrane thickness. With increase in the pore‐filling ratio, the pore diameters of PAAc‐grafted membranes became smaller. The PC‐g‐PAAc membranes exhibit rapid and reversible response of the flux to the environmental pH as pH is switched between 3 and 9. Between pH 3.5 and 5.5, the membranes demonstrate a pH‐valve function as the carboxyl group changes from neutral to charged with a corresponding variation in chain configuration. Copyright © 2009 John Wiley & Sons, Ltd.     

On the use of symmetry in the ab initio quantum mechanical simulation of nanotubes and related materials

Nanotubes can be characterized by a very high point symmetry, comparable or even larger than the one of the most symmetric crystalline systems (cubic, 48 point symmetry operators). For example, N = 2n rototranslation symmetry operators connect the atoms of the (n,0) nanotubes. This symmetry is fully exploited in the CRYSTAL code. As a result, ab initio quantum mechanical large basis set calculations of carbon nanotubes containing more than 150 atoms in the unit cell become very cheap, because the irreducible part of the unit cell reduces to two atoms only. The nanotube symmetry is exploited at three levels in the present implementation. First, for the automatic generation of the nanotube structure (and then of the input file for the SCF calculation) starting from a two‐dimensional structure (in the specific case, graphene). Second, the nanotube symmetry is used for the calculation of the mono‐ and bi‐electronic integrals that enter into the Fock (Kohn‐Sham) matrix definition. Only the irreducible wedge of the Fock matrix is computed, with a saving factor close to N. Finally, the symmetry is exploited for the diagonalization, where each irreducible representation is separately treated. When M atomic orbitals per carbon atom are used, the diagonalization computing time is close to Nt, where t is the time required for the diagonalization of each 2M × 2M matrix. The efficiency and accuracy of the computational scheme is documented. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010     

用DIS位移传感器研究气垫导轨上的阻尼振动

在简述阻尼振动实验原理的基础上,阐述了用DIS位移传感器研究气垫导轨上阻尼振动的方法,通过对比实验进一步论述了该方法的可行性.     

Constructions of optimal difference systems of sets

Difference systems of sets (DSSs) are combinatorial configurations which were introduced in 1971 by Levenstein for the construction of codes for synchronization. In this paper, we present two kinds of constructions of difference systems of sets by using disjoint difference families and a special type of difference sets, respectively. As a consequence, new infinite classes of optimal DSSs are obtained.     

两轴光电跟踪仪高仰角跟踪盲区分析

 从轴准直误差、动态滞后误差两方面分析了采用俯仰轴叠加于方位轴光机座结构方式的光电跟踪仪在高俯仰角跟踪时的误差变化及由此导致的盲区问题,从轴准直误差和动态滞后误差两方面对高仰角跟踪盲区的形成及其空间分布进行分析,并用MATLAB进行了仿真,给出跟踪盲区随方位、俯仰角变化的的分布图形。从盲区分布图形可以看出：光电跟踪仪在性能一定的情况下,跟踪盲区随着仰角增大而增大,并结合直线航路给出这两种误差导致的跟踪盲区的计算方法。跟踪直线航路实验数据显示跟踪误差随着仰角增大而增大。     

红外凝视系统下的多规则航迹起始算法

针对传统航迹起始算法在红外凝视跟踪系统应用中存在的弊端,提出了一种适用于凝视跟踪系统的多规则快速航迹起始算法.该方法通过深入分析红外凝视系统中目标自身特点及其运动特性,给出了能够对低速甚至静止的大威胁概率目标和断续点迹目标进行威胁概率判断和航向方差判断的起始规则,实现了凝视系统下对大威胁概率目标和断续点迹目标航迹的快速...