基于双DSP平台的实时跟踪系统设计

本文以两片定点DSP TMS320C6203为核心,设计了一个用于处理1024×1024大小图像(12位数字相机)的电视跟踪系统,并对系统的硬件设计和软件设计分别进行了详细介绍。对实时图像序列进行预处理后,DSP1进行捕获和图像增强、显示,DSP2用于实时跟踪。主要解决了两个关键问题:第一,采用分段投影的方法,解决了对于大图像大数据量的目标全屏捕获问题,并满足实时要求;第二,根据目标大小动态调节跟踪窗,对目标进行实时跟踪。实验表明系统对目标的实时跟踪有很好的性能。     

多激光雷达行人跟踪安防系统设计研究

为了解决常规行人跟踪安防系统跟踪延时过高的问题,实现实时跟踪安防,设计多激光雷达行人跟踪安防系统。硬件部分,采用多激光跟踪雷达和DM1827芯片;软件部分,提取行人跟踪安防特征后设计安防架构和安防功能模块,从而实现行人实时跟踪安防。系统测试结果表明,设计的行人跟踪安防系统跟踪延时较低、性能良好,能够满足行人实时跟踪安防需求,具有一定的应用价值。     

基于PLC的碟式太阳能跟踪控制系统设计

设计了一种以FX3U系列PLC为控制核心的太阳能自动跟踪控制系统。该跟踪控制系统将视日运动轨迹跟踪与传感器跟踪相结合,即第一级采用视日运动轨迹跟踪,初步跟踪太阳的运行轨迹,第二级采用传感器跟踪校正,并采用双轴式跟踪调整装置。系统还设计了时间显示模块,能够显示实时时间,同时也可以对时间进行实时调整。     

WSN中利用改进FOA-GRNN和迭代Cubature卡尔曼滤波的实时目标跟踪方法

针对传统无线传感器网络(Wireless Sensor Network,WSN)对运动目标的定位和跟踪容易产生明显误差的问题,提出利用改进FOA-GRNN和迭代Cubature卡尔曼滤波的实时目标跟踪方法.基于改进FOA-GRNN法,利用从锚点接收到的运动目标的模拟(RSSI)值和相应的实际目标二维位置对GRNN进行训练,从而获得单个目标在二维运动时的准确初始位置;利用迭代Cubature卡尔曼滤波法对实时目标进行精准定位和测距,获得实时目标的准确定位和跟踪信息;将改进的FOA-GRNN法和迭代Cubature卡尔曼滤波法相结合用于WSN中实时目标跟踪和定位,在提高初始位置精度的同时,还提高了实时目标定位和跟踪信息的准确度.实验结果表明,相比其他几种较新的方法,该方法改善了WSN中实时目标的跟踪性能,降低了误差,提高了跟踪精度.     

基于传感器技术的心理健康自动监管与测评研究

为解决当前心理健康状态实时监测准确率低的问题，提出一种基于传感器技术的心理健康自动监管与测评装置。该装置利用传感器技术将心理健康信息转化为心理感知数据，从而实现对健康状态的实时跟踪。将提出的实时跟踪方法与其他跟踪方法进行对比实验，结果显示，该方法的准确率为96%,此结果说明基于传感器技术的实时跟踪方法具有更好的实时跟踪性能。利用研究提出的装置可以准确地对用户的心理健康状态进行实时跟踪，从而对用户的心理健康进行自动监管与测评。     

电子皮带秤计量准确性方法研究与设计

对目前散状物料计量现状、计量方法进行了比较分析,对皮带秤的误差分析进行了阐述,简述了阵列式皮带秤的原理、结构及特点。通过阵列式皮带秤的应用,对其功能进行扩展并研究开发了阵列式皮带秤实时监控跟踪系统,阐述了实时监控跟踪系统的方法原理及特点,以及采用阵列式电子皮带秤和实时监控跟踪系统的应用效果。该系统极大地提高了计量的准确性。实时监控跟踪系统能实时、直观地反映计量偏差及偏差趋势情况,能将计量偏差的事后分析前移为过程中的实时监控,为散状物料计量准确性的提高提供了一个新的思路。     

实时网络通信处理系统跟踪与审计设计

本文在分析实时网络通信处理系统的处理流程后,将实时网络通信处理系统的故障分类为预期故障和非预期故障.将实时网络通信处理系统的跟踪分类为完整级,基本级,最小级和不跟踪四个级别,并给出了相应的跟踪流程.同时设计了跟踪文件的格式.通过审计跟踪文件,可以监督系统的运行情况,改进系统设计,并对系统维护提供帮助.     

压缩传感目标跟踪在多实例中的应用

研究了一种基于压缩传感的实时目标跟踪算法。该算法结合多特征和压缩传感目标跟踪,增加随机测量矩阵提取多个特征用于检测,在跟踪时采用基于boosting的框架,利用多实例的正负样本包特性,提高置信区间估计,实现了实时的目标跟踪。实验结果及分析表明,本文方法在目标运动、姿态变化以及被部分遮挡的情况下,可在原压缩传感目标跟踪算法的基础上提高跟踪的可靠性;与传统的单一特征目标跟踪算法相比,由本方法提取的两种不同类型的特征具有互补性,使得跟踪的鲁棒性较好,能达到稳定、实时的跟踪效果。     

基于RTAI的数控系统跟踪调试模型的设计与实现

为了丰富数控系统的调试手段,本文在RTAI进程间通信和环形缓冲区技术的基础上,提出一种基于RTAI的数控系统实时任务跟踪调试模型.该模型实现了动态地对数控系统中的实时任务进行跟踪,获取有效的调试信息,并在进行跟踪时对实时任务的性能影响尽量小,而在不跟踪时对实时任务几乎没有性能影响.该模型已在我们开发的数控系统调试工具中得到实际应用.     

基于NoC的SoC中实时跟踪数据的传输

片上网络(NoC)技术使片上系统(SoC)的通信机制发生了根本改变,直接影响了SoC中处理器内核的实时跟踪技术。该文以ARM Coresight构架的实时跟踪机制为参考,分析了在NoC环境中实现实时跟踪数据传输的难点,提出相应的解决方案。通过对实验系统的仿真,验证了其中的关键技术。     

Trivium-like算法中可滑动Cube的研究

对于Trivium-like算法,cube攻击是最有效的攻击手段之一.在传统cube攻击中,攻击者主要利用线性检测等方法来寻找具有低次超多项式的cube.实验结果表明存在IV变元子集I1=(vi1,vi2,…,vid)和I2=(vi1-1,vi2-1,…,vid-1)满足pI2(k0,k1,…,kn-2)=σ(pI1(k1,k2,…,kn-1)),其中ki表示密钥变元,pI1是Cube CI1对于t时刻输出比特zt的超多项式,pI2是Cube CI2对于t+1时刻的输出比特zt+1的超多项式,并且变换\sigma将ki映射到ki-1.在本文中,称这种性质为cube的可滑动性.我们研究了Trivium-like算法的攻击中cube的可滑动性.特别地,我们给出了cube具有可滑动性的一个充分条件.此外,我们将充分条件的判断,转化到求解混合整数线性规划(MILP)模型,在实际中能够快速判断出具有滑动性的cube.最后,我们将充分条件应用到实验cube攻击、基于分离性质的cube攻击和相关cube攻击的已有结果,验证了方法的正确性并在实验cube攻击中得到了一个803-轮Trivium的新结果.     

Feedback control for linear time-invariant systems with state andcontrol bounds in the presence of disturbances

The problem of the stabilizing linear control synthesis in the presence of state and input bounds for systems with additive unknown disturbances is considered. The only information required about the disturbances is a finite convex polyhedral bound. Discrete- and continuous-time systems are considered. The property of positive D -invariance of a region is introduced, and it is proved that a solution of the problem is achieved by the selection of a polyhedral set S and the computation of a feedback matrix K such that S is positively D-invariant for the closed-loop system. It is shown that if polyhedral sets are considered, the solution involves simple linear programming algorithms. However, the procedure suggested requires a great amount of computational work offline if the state-space dimension is large, because the feedback matrix K is obtained as a solution of a large set of linear inequalities. All of the vertices of S are required     

Job scheduling in a partitionable mesh using a two-dimensionalbuddy system partitioning scheme

The job scheduling problem in a partitionable mesh-connected system in which jobs require square meshes and the system is a square mesh whose size is a power of two is discussed. A heuristic algorithm of time complexity O(n(log n+log p)), in which n is the number of jobs to be scheduled and p is the size of the system is presented. The algorithm adopts the largest-job-first scheduling policy and uses a two-dimensional buddy system as the system partitioning scheme. It is shown that, in the worst case, the algorithm produces a schedule four times longer than an optimal schedule, and, on the average, schedules generated by the algorithm are twice as long as optimal schedules     

An efficient digital search algorithm by using a double-arraystructure

An efficient digital search algorithm that is based on an internal array structure called a double array, which combines the fast access of a matrix form with the compactness of a list form, is presented. Each arc of a digital search tree, called a DS-tree, can be computed from the double array in 0(1) time; that is to say, the worst-case time complexity for retrieving a key becomes 0(k) for the length k of that key. The double array is modified to make the size compact while maintaining fast access, and algorithms for retrieval, insertion, and deletion are presented. If the size of the double array is n+cm, where n is the number of nodes of the DS-tree, m is the number of input symbols, and c is a constant particular to each double array, then it is theoretically proved that the worst-case times of deletion and insertion are proportional to cm and cm², respectively, and are independent of n. Experimental results of building the double array incrementally for various sets of keys show that c has an extremely small value, ranging from 0.17 to 1.13     

Constant time algorithms for the transitive closure and somerelated graph problems on processor arrays with reconfigurable bussystems

The transitive closure problem in O(1) time is solved by a new method that is far different from the conventional solution method. On processor arrays with reconfigurable bus systems, two O (1) time algorithms are proposed for computing the transitive closure of an undirected graph. One is designed on a three-dimensional n×n×n processor array with a reconfigurable bus system, and the other is designed on a two-dimensional n²×n² processor array with a reconfigurable bus system, where n is the number of vertices in the graph. Using the O(1) time transitive closure algorithms, many other graph problems are solved in O(1) time. These problems include recognizing bipartite graphs and finding connected components, articulation points, biconnected components, bridges, and minimum spanning trees in undirected graphs     

Interconnection of nonlinear causal systems

For nonlinear systems it is not a mathematically obvious fact that the simplest feedback system yields equations which are solvable, even when the gain in the loop is ⩽1. The authors treat this and more general issues. For example, it is not known (for a continuous-time system) if unity feedback for a plant C with gain <1 produces a well-posed system. It is shown that if the gain of C is <1 and C also loses sufficient efficiency at high frequency, then indeed the feedback system is well posed. The hypothesis that the gain of C is <1 can be replaced by the reasonable assumption that C saturates on large enough signals, and well posedness is still obtained. This approach also applies directly to electrical circuit connections. It is proved that rather general connections of amplifiers are well posed under the assumption that the amplifiers saturate and that they lose efficiency at high frequency     

The design of a precompensator for multivariable adaptive control-anetwork-theoretic approach

A network-theoretic approach to the design of a dynamic precompensator C(s) for a multiinput, multioutput plant T(s) is considered. The design is based on the relative degree of each element of T(s). Specifically, an efficient algorithm is presented for determining whether a given plant T(s) has a diagonal precompensator C( s) such that, for almost all cases, T(s)C (s) has a diagonal interactor. The algorithm also finds any optimal precompensator, in the sense that the total relative degree is minimal. The algorithm can be easily modified to work even when a T(s) represented by a nonsquare matrix is given     

Adaptive structuring of binary search trees using conditionalrotations

Consider a set A={A₁,A₂ ,. . ., A_n} of records, where each record is identified by a unique key. The records are accessed based on a set of access probabilities S=[s₁,s₂ ,. . ., s_N] and are to be arranged lexicographically using a binary search tree (BST). If S is known a priori, it is well known that an optimal BST may be constructed using A and S. The case when S is not known a priori is considered. A new restructuring heuristic is introduced that requires three extra integer memory locations per record. In this scheme, the restructuring is performed only if it decreases the weighted path length (WPL) of the overall resultant tree. An optimized version of the latter method, which requires only one extra integer field per record has, is presented. Initial simulation results comparing this algorithm with various other static and dynamic schemes indicates that this scheme asymptotically produces trees which are an order of magnitude closer to the optimal one than those produced by many of the other BST schemes reported in the literature     

A new realization theory

A realization theory that is based on the Kalman system theory and motivated by the Fuhrmann realization theory is presented. In the Fuhrmann realization theory, the realization state-space is defined by a natural polynomial module K_Q, which is related to a nonsingular polynomial matrix Q. The module K_Q is formed of all f where Q^-1f is strictly proper. In the realization theory proposed, the realization state-space is defined by a different module M_Q, which is formed of properly truncated, strictly proper formal power series of Q^-1f. The realization theory can be used to prove the dual-realization scheme induced by the Fuhrmann realization theory     

Optimal distributed t-resilient election in completenetworks

The problem of distributed leader election in an asynchronous complete network, in the presence of faults that occurred prior to the execution of the election algorithm, is discussed. Failures of this type are encountered, for example, during a recovery from a crash in the network. For a network with n processors, k of which start the algorithm that uses at most O(n log k +n+kt) messages is presented and shown to be optimal. An optimal algorithm for the case where the identities of the neighbors are known is also presented. It is noted that the order of the message complexity of a t-resilient algorithm is not always higher than that of a nonresilient one. The t-resilient algorithm is a systematic modification of an existing algorithm for a fault-free network