A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

双线性系统的无反馈解耦线性化

用现代微分几何方法研究了双线性控制系统的解耦线性化问题，给出了一般双线性系统解耦线性化的充分条件及严格双线性系统解耦线性化的充要条件，并举例说明了本文的结论。     

广义分解定理与两个不等式

本文给出了Banach空间广义分解定理的一个初等证明,并利用它来证明两个对称不等式.这是首次在Banach空间获得这样的不等式.     

Harmonic Calculus on Fractals - A Measure Geometric Approach I

Differentiation of functions w.r.t. finite atomless measures with compact support on the real line is introduced. The related harmonic calculus is similar to that of the classical Lebesgue case. As an application we obtain the Weyl exponent for the spectral asymptotics of the Laplacians w.r.t. linear Cantor-type measures with arbitrary weights.     

A generic view of Dantzig-Wolfe decomposition in mixed integer programming

The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques.     

A note on continuously decomposed evolving exchange economies

It is routine to demonstrate in the exchange economy framework that small changes of individual preferences and endowments always result in small changes of the derived excess demand functions as one should expect. Though being as desirable for reasons of the consistency of the whole approach, however, a precise proof of the converse direction so far is still open to question. The present paper shows that it is actually true. We use a decomposition method for aggregate excess demand functions developed by Mas-Colell which is derived from the well-known decomposition method developed by Sonnenschein and perfected by Debreu and Mantel. Our result fills in a notorious gap in the line of economic justification usually given for this decomposition, or disaggregation, method in that comparative static analysis would be restricted if the decomposition of excess demand functions would not be continuous.     

基于阿贝尔黑格斯变量的杨-米尔斯理论的红外阿贝尔化

通过SU(2)规范场的法捷耶夫-Niemi分解给出了有效阿贝尔-黑格斯型作用量的 一个计算方法. 具体指出了该分解中所用的自然规范固定以及阿贝尔投射与杨-米尔斯理论的红外动力学之间的内在关系. 推导出了色电场的一个伦敦型方程.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18