Dynamics of the periodic type-K competitive Kolmogorov systems

For time-periodic dissipative and irreducible type-K competitive Kolmogorov systems, it is proved that there is a canonically defined countable family F of unordered, disjoint invariant sets with the property that, for every persistent trajectory whose ω-limit set is not a cycle, there exists a unique trajectory in some element of F such that these two trajectories are asymptotic and the corresponding points in these two trajectories are K-related.     

MSP-G320240DBCW-211N大规模点阵式LCD与PIC单片机接口技术

介绍了大规模点阵式液晶显示器MSP-G320240DBCW-211N的特点及其与PIC18F6620单片机的接口技术，提出了应用过程中可能遇到的问题和解决方法．给出相关的C程序设计并在研制的智能光电检测仪器上得以成功地应用。     

Light Diffraction of Aligned Polymer Fibers Periodically Dispersed by Phase Separation of Liquid Crystal and Polymer

We have confirmed light diffraction of aligned polymer fibers obtained by a phase separation of an anisotropic-phase solution of liquid crystal and polymer. He—Ne laser light passing through the polymer fibers was scattered in the axis vertical to the fibers, and had two peaks of light intensity symmetrical to the center of the transmitting laser spot. The two peaks were found to be caused by light diffraction due to the periodic polymer-fiber dispersion because the peaks corresponded to values calculated by intervals between the fibers. The periodical fiber networks are considered to be formed by anisotropic spinodal decomposition. This effect can be used to measure the dispersion order of the polymer fibers. © 2004 The Optical Society of Japan     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

反对称正交对称矩阵反问题

本文讨论一类反对称正交对称矩阵反问题及其最佳逼近．研究了这类矩阵的一些性质，利用这些性质给出了反问题解存在的一些条件和解的一般表达式，不仅证明了最佳逼近解的存在唯一性，而且给出了此解的具体表达式．     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

On the spectra of finite-dimensional quadratic Bose operators

A complete study of the spectrum of a finite-dimensional Bose operator is carried out in the paper. The cases in which the spectrum is discrete or continuous are studied. Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 835–854, June, 1997. Translated by A. M. Chebotarev     

审讯过程的数学模型

本文从经济学的观点出发，利用对策论方法建立了审讯过程的数学模型，并由此研究了讯问人三种主要策略对审讯成功的效度。