Completely J —positive linear systems of finite order

Completely J — positive linear systems of finite order are introduced as a generalization of completely symmetric linear systems. To any completely J — positive linear system of finite order there is associated a defining measure with respect to which the transfer function has a certain integral representation. It is proved that these systems are asymptotically stable. The observability and reachability operators obey a certain duality rule and the number of negative squares of the Hankel operator is estimated. The Hankel operator is bounded if and only if a certain measure associated with the defining measure is of Carleson type. We prove that a real symmetric operator valued function which is analytic outside the unit disk has a realization with a completely J — symmetric linear space which is reachable, observable and parbalanced. Uniqueness and spectral minimality of the completely J — symmetric realizations are discussed.     

无穷限积分的控制收敛理论

本文根据有限区间上Ｒｉｅｍａｎｎ积分的Ａｒｚｅｌａ控制收敛定理［１］，给出无穷限积分的控制收敛定理，并做了相应的推广。     

Simulating synchronized traffic flow and wide moving jam based on the brake light rule

A new cellular automaton (CA) model based on brake light rules is proposed, which considers the influence of deterministic deceleration on randomization probability and deceleration extent. To describe the synchronized flow phase of Kerner’s three-phase theory in accordance with empirical data, we have changed some rules of vehicle motion with the aim to improve speed and acceleration vehicle behavior in synchronized flow simulated with earlier cellular automaton models with brake lights. The fundamental diagrams and spatial–temporal diagrams are analyzed, as well as the complexity of the traffic evolution, the emergence process of wide moving jam. Simulation results show that our new model can reproduce the three traffic phases: free flow, synchronized flow and wide moving jam. In addition, our new model can well describe the complexity of traffic evolution: (1) with initial homogeneous distribution and large densities, the traffic will evolve into multiple steady states, in which the numbers of wide moving jams are not invariable. (2) With initial homogeneous distribution and the middle range of density, the wide moving jam will emerge stochastically. (3) With initial mega-jam distribution and the density close to a point with the low value, the initial mega-jam will disappear stochastically. (4) For the cases with multiple wide moving jams, the process is analyzed involving the generation of narrow moving jam due to “pinch effect”, which leads to wide moving jam emergence.     

求解交通均衡配流问题的新算法

给出了一个求解交通均衡配流问题的新算法,证明了新算法的收敛性,并在小型交通网络上进行了初步的数值试验.     

A diagrammatic view of the equals sign: arithmetical equivalence as a means,not an end

It is recommended in the mathematics education literature that pupils be presented with equality statements that can be assessed for numerical balance by attending to notational structure rather than computation. I describe an alternative, diagrammatic approach in which pupils do not assess statements but instead use them to make substitutions of notation. I report on two trials of a computer-based task conducted with pairs of pupils and highlight two findings. First, the pupils found it useful to articulate the distinct substitutive effects of commutative (‘swap’, ‘switch’) and partitional (‘split’, ‘separate’) statements when working on the task. Secondly, the pupils did not notice that some of the statements presented were in fact false, which suggests their substituting activities were independent of numerical equivalence conceptions. This demonstrates that making substitutions offers task designers a mathematical utility for equality statements that is distinct from, but complementary to, assessing numerical balance.     

有机锗（Ge—132）对交警健康作用的研究

初步观察了给交警服用Ｇｅ－１３２的效果，表明Ｇｅ－１３２有一定保健作用。     

The absolute sign of J coupling constants determined using the order matrix calculation

A novel methodology using the order matrix calculation to determine the absolute sign of spin-spin couplings based on the structure of organic compounds is presented. The sign of the residual dipolar coupling (RDC) depends on the sign of corresponding scalar spin-spin coupling constant and the sign of the RDC has a dramatic influence on the order matrix calculation. Therefore, the sign of the spin-spin coupling constant can be obtained by an order matrix calculation through the corresponding RDC. Six types of spin-spin coupling constants, including 2J(H,H), 1J(C,F), 2J(C,F), 3J(C,F), 2J(F,H) and 3J(F,H), were obtained simultaneously. Except for 3J(C,F) where the measured RDCs have very small magnitudes, the signs were determined unambiguously.     

SQSQh: 1H‐detected SQ–SQ experiment for determination of signed silicon–carbon coupling constants

A new variant of SQ–SQ pulse sequence (SQSQh) for relative sign determination and detection of small silicon–carbon couplings over more than one bond is presented. In the SQSQh sequence, proton detection replaces carbon detection used in the original SQ–SQ pulse sequence (SQSQc). The theoretical gain in sensitivity was experimentally tested on two samples (trimethylsiloxyethane, 1, and 1,2,4‐tris(trimethylsiloxy)benzene, 2), the experimentally found gain provided by the SQSQh over the SQSQc method varied between 6 and 8. The method can be applied to linear spin systems, i.e. to systems where the silicon is coupled to the carbon in question and to any hydrogen not necessarily bonded to the carbon. Copyright © 2010 John Wiley & Sons, Ltd.     

CS-POSA: A High Performance Scheduling Algorithm for WDM Star Networks

In this paper a new packet scheduling algorithm for WDM star networks is introduced. The protocol adopted is pre-transmission coordination-based and packet collisions have been eliminated due to predetermination of the timeslots each node transmits in a demand matrix. The requests of the transmitted packets are predicted through Markov chains in order to reduce the calculation time of the final scheduling matrix. This is accomplished by pipelining the schedule computation. The innovation that this algorithm introduces is to modify the service sequence of the node. The proposed algorithm is studied via extensive simulation results and it is proved that changing the sequence that nodes transmit, from the node with the largest number of requests to the node with the fewest requests, that there is an increase in the throughput of the network, with a minimum (almost zero) cost in mean time delay and in delay variance.     

一种基于证书的登录控制实现

实施建立一套较好的登录控制机制,能够为用户提供统一的信息资源认证访问入口,建立统一的、基于角色和个性化的信息访问、集成平台。通过实施单点登录功能,使用户只需一次登录就可以根据相关的规则去访问不同的应用系统,提高信息系统的易用性、安全性、稳定性,并在此基础上进一步实现政府、企业用户高速协同办公。