Universal model of a ground vehicle for realization of integrated inertial-satellite navigation systems

Tight integration of satellite and strapdown inertial navigation systems is used for automotive vehicles and complicated by the necessity to design adequate models of the object of research. A universal stochastic model adequately reflecting the processes of arbitrary motion of a ground vehicle is synthesized in a canonical form. The model can be used for realization of tightly coupled inertialsatellite navigation systems. The results of simulation modelling are given, which confirm the efficiency of the synthesized model.     

泛逻辑泛运算模型之间的关系

研究泛逻辑的泛与运算模型、泛或运算模型与模糊非之间的关系。证明了零级泛与运算模型T(x,y,h)、零级泛或运算模型S(x, y, h)与强非N(x)=1-x形成De Morgan三元组,当h∈(0, 0.75), 零级泛或运算S(x, y, h)=(min(xm+ym, 1))1/m, N(x)=(1-xm)1/m时, T, S, N形成一个强De Morgan三元组。进一步证明了一级泛与运算模型T(x, y, h, k)、一级泛或运算模型S(x, y, h, k)与N(x)=(1-xn)1/n满足De Morgan定律;特别当h∈(0, 075), 一级泛或运算模型S(x, y, h, k)=(min(xnm+ynm, 1))1/nm, N(x)=(1-xnm)1/nm时, T, S, N形成一个强De Morgan三元组。     

万用继电器

本文介绍了万用继电器的概念，原理，结构及在变电站自动化中的作用及继电器的发展历史。     

Universal nonsingular controls

In this note we prove that, for analytical systems satisfying the strong accessibility rank condition, generic inputs produce trajectories along which the linearized system is controllable. Applications to the steering of systems without drift are briefly mentioned.     

Universal Boolean Systems

Boolean interaction systems and hard interaction systems define nets of interacting cells. They are based on the same local interaction principle between two cells as interaction nets but do not allow that the structure of nets may evolve. With boolean nets, it is not possible to create or destroy cells or links between existing cells. They are very similar to hardware circuits but based on an implicit rendez-vous information exchange mechanism.If we want to implement such systems using hardware circuits, it is important to define a set of universal combinators that reduces this task to the implementation of a fixed number of known agents. Here, we show how we can simulate every hard interaction system by a universal boolean interaction system composed of three combinators: a duplicator, a NAND gate and a three-state input/output channel.     

统一的自校正控制器

本文提出两种统一的广义最小方差自校正控制器,以控制具有任意维数输入/输出的(ADIADO)系统.这两种新的控制器解决了以前无法处理的输入/输出维数不等、Bo奇异系统的自校正控制问题.几个典型的仿真例子证明了这两种控制器的统一性和有效性.     

Universal dynamical systems

This paper is concerned with the problem of finding a universal dynamical system for all dynamical systems on separable metric spaces. Special care is given to exhibit a universal dynamical system which was used to motivate the definition of a dynamical system. We establish that this class of dynamical systems is topologically as narrow as a system describable by a first-order partial differential equation. We find that a classical solution space of this partial differential equation will serve as the phase space of a universal system for dynamical systems on locally compact separable metric spaces. In fact, the functions in this solution space areC and vanish at infinity. For the remaining dynamical systems on separable metric spaces we find a universal system similar to the shift system exhibited by Bebutov. The marked difference is that there is no restriction on the set of rest points. Further comments concerning the history of this problem follow some basic definitions given in the introduction.     

Universal Remote Control

虽然我们刚刚才进入Vista时代，但其先进性和易用性早已有目共睹，Vista更强调PC与家用电器的结合，让我们兴奋的是，支持Vista的多功能遥控器已粉墨登场，这一代产品综合了MCE遥控器和传统多媒体遥控其的特征，更强调易用性，交互性，外观么，当然更是一级棒了！[编者按]     

Universal wormhole routing

We examine the wormhole routing problem in terms of the “congestion” c and “dilation” d for a set of packet paths. We show, with mild restrictions, that there is a simple randomized algorithm for routing any set of P packets in O(cdη+dη log P) time with high probability, where L is the number of flits in a packet, and η=min {d, L}; only a constant number of flits are stored in each queue at any time. Using this result, we show that a fat tree network of area ⊖(A) can simulate wormhole routing on any network of comparable area with O(log³ A) slowdown, when all worms have the same length. Variable length worms are also considered. We run some simulations on the fat tree which show that not only does wormhole routing tend to perform better than the more heavily studied store and forward routing in this context, but that performance superior to our provable bound is attainable in practice     

Universal probability-free prediction

We construct universal prediction systems in the spirit of Popper’s falsifiability and Kolmogorov complexity and randomness. These prediction systems do not depend on any statistical assumptions (but under the IID assumption they dominate, to within the usual accuracy, conformal prediction). Our constructions give rise to a theory of algorithmic complexity and randomness of time containing analogues of several notions and results of the classical theory of Kolmogorov complexity and randomness.     

GPIB通用接口的研制

当前对新型的电子测量仪器的设计应具备能自动测试系统工作的能力.GPIB标准接口就是为此目的而设计的.本文以小信号直流电压的数据采集为例,着重介绍了接口板与计算机之间以IEEE-488进行数据传输以及接口板直接对其他智能仪器程控的硬件和软件的实现.     

Universal petri net

A universal inhibitor Petri net executing an arbitrary given inhibitor Petri net is constructed. An inhibitor Petri net graph, its marking, and transition firing sequence are encoded as 10 scalar nonnegative integer variables and are represented by the corresponding places of the universal net. An algorithm using only these scalar variables and executing an arbitrary inhibitor net is developed based on the state equation and is encoded by the universal inhibitor Petri net. Subnets that implement arithmetic, comparison, and copy operations are employed.     

通用模型转换器

通用模型转换器,以下称为UMC(UniversalModelConverter),是一个软件应用程序,它提供了灵活的集成方案,依据上层网管系统的需求,通过转换子网系统的信息模型和接口协议,使其映射到上层网管系统的信息模型和接口协议,并且,映射规则是可以实时修改。此方案采取中立于信息模型及接口协议的技术以支持多厂商环境。此文讨论了UMC的实现方案及原型系统实现的结果。     

Universal Sleptsov net

We construct a universal Sleptsov net (USN) with 13 places and 26 transitions that runs in polynomial time; a Sleptsov net is a place-transition net that allows multiple instances of transition firing within a single step. We simulate Neary and Woods’ small weakly universal Turing machine with two states and four symbols. Compared to previous results, we do not use separate encoding and decoding subnets, which implement such operations as: multiplication by a constant combined with addition and division by a constant combined with modulo, respectively, but overlap them in a special way that reduces the number of USN nodes by four. Besides, we present a thorough analysis of the source data encoding complexity. The obtained universal net is a prototype of a processor in the SN paradigm of computing that promises hyper-performance.     

Universal routing schemes

Summary.  In this paper, we deal with the compact routing problem, that is implementing routing schemes that use a minimum memory size on each router. A universal routing scheme is a scheme that applies to all n-node networks. In [31], Peleg and Upfal showed that one cannot implement a universal routing scheme with less than a total of Ω(n ^1+1/(2s+4)) memory bits for any given stretch factor s≧1. We improve this bound for stretch factors s, 1≦s<2, by proving that any near-shortest path universal routing scheme uses a total of Ω(n ²) memory bits in the worst-case. This result is obtained by counting the minimum number of routing functions necessary to route on all n-node networks. Moreover, and more fundamentally, we give a tight bound of Θ(n log n) bits for the local minimum memory requirement of universal routing scheme of stretch factors s, 1≦s<2. More precisely, for any fixed constant ɛ, 0<ɛ<1, there exists a n-node network G on which at least Ω(n ^ɛ) routers require Θ(n log n) bits each to code any routing function on G of stretch factor <2. This means that, whatever you choose the routing scheme, there exists a network on which one cannot compress locally the routing information better than routing tables do. Received: August 1995 / Accepted: August 1996     

Universal step-motor controller-indexer

A microprocessor-based controller for step motors is described. It is ‘universal’ inasmuch as the same unit can be used to control all types of permanent magnet (PM) and variable reluctance (VR) step motors. The system can also double up as a preset indexer that causes the step motor to cover a specified number of steps in the shortest possible time by automatically controlling its acceleration and deceleration.     

On partial realization

It is shown that the partial realization problem treated by Kalman [1] and Tether [2] can be solved in a simple way using the method of [3] instead of Ho's algorithm.