异步片上网络研究综述

异步片上网络具有低动态功耗、对延迟抖动的不敏感、统一的网络接口、较低的系统集成复杂度和较好的电磁兼容能力等众多特性,是下一代片上多核微处理器和多核片上系统的标准片上通信架构之一.在简单介绍异步电路的相关理论后,从多个方面概述了当前异步片上网络的研究成果,包括网络拓扑、同步?异步接口、流控制、服务质量、路由算法、低功耗设计、容错和可测性设计以及设计自动化;然后介绍并分析了一些具有代表性的异步片上网络设计案例.研究显示,异步片上网络具有众多同步片上网络所不具备的优点,大量的片上多核系统将使用异步片上网络作为其片上通信系统,但它们的易用性和网络性能亟待提高.     

基于大数据的网络信息异步并行查询方法

针对大数据背景下海量网络信息实时数据查询效率低的问题,提出基于大数据的网络信息异步并行查询方法,并基于此方法处理网络信息数据集群,建立网络信息异步并行查询模型,打造异步并行模式下的新框架,以及分析集群队列界面端异步查询实现流程。实验证明,此方法能够在海量网络信息中完成精准、高效查询。     

网络瞄准环境下异步航迹融合策略及融合算法研究

多个网络节点的异步航迹融合是实现网络瞄准作战方式的关键技术之一．本文有效利用各网络节点的异步航迹信息, 提高瞄准的精度. 首先分析了网络瞄准环境下异步航迹融合的主要方式, 在此基础上结合工程实际, 提出了3种可适用于网络瞄准的异步航迹融合策略; 然后根据最优估计理论, 分别给出了不同策略下的异步融合算法与实现步骤; 最后通过仿真验证了所提出方法在解决异步航迹融合问题上的有效性, 并分析了不同航迹融合周期 对系统融合性能的影响.     

基于排队网络的异步非线性流水线性能分析

异步电路设计方法是现在集成电路研究的热点,得到越来越多的研究人员的关注。在异步电路设计过程中对异步流水线进行性能分析对异步电路的设计过程有着重要的指导意义,但现阶段缺乏有效的方法对异步流水线(尤其是复杂的非线性流水线)进行性能分析。而排队网络是一种能直观地对异步流水线进行建模的数学工具,但排队网络(尤其是复杂的非线性排队网络)的分析求解十分困难。本文提出了一种采用带Fork和Join的阻塞排队网络对异步流水线进行建模,采用其排队网络模型的平均周期作为异步电路的性能评价指标,并通过将其转化为等价的随机标记图对其平均周期进行分析,并给出了其平均周期的上限和下限。     

异步可验证秘密共享方案的构造方法

可验证秘密共享是分布式密码学中一种重要的基础性秘密共享方案。随着对可验证秘密共享系统认识的不断加深,人们开始重新审视同步网络的传统假设并由此开始了异步网络下新模型的研究。通过对国外现有异步网络下的可验证秘密共享模型进行研究,给出异步可验证秘密共享方案一般构造方法,并对异步网络下的公开可验证秘密共享方案进行探讨。     

一种用于异步流水线环性能分析的排队网络近似分析算法

异步电路的性能评测一直是异步电路设计技术研究的难点所在。本文提出了异步流水线环的一种排队网络近似分析算法。首先将异步流水线环建模为闭合阻塞排队网络,再使用近似分析算法分析阻塞排队网络的性能,包括吞吐率、响应时间等,进而得到异步流水线的吞吐率、周期时间和延迟等性能参数。通过将本文算法的计算结果和数值计算得到
的精确结果进行比较,证明了该算法的正确性和有效性。     

面向单目标跟踪的二进制无线传感器网络自组织方法

针对二进制无线传感器网络单目标跟踪,为了有效获取信息,并降低网络能耗,提出二进制传感器网络自组织算法:异步动态成簇算法(asynchronous dynamic cluster,ADC).该算法在时间异步条件下,用动态簇的方式来组织节点对目标进行跟踪.深入研究了目标发现及节点激活,异步动态跟踪簇的构建、调整和异步时间配准的问题.仿真分析证明,本算法具有一定的稳定性和收敛性,能在保证跟踪精度的同时降低网络能耗.     

入侵检测异步问题研究

围绕网络入侵检测系统遭受攻击的根源--网络入侵检测系统与其所保护网络之间的异步性,用具体实例分析了攻击方如何从TCP/IP层面对网络入侵检测系统发起基于异步性的攻击,并对攻击的特点和手段作了深入的剖析.从如何消除网络入侵检测系统与所保护网络之间的异步性的角度,提出了相应的防御对策,为入侵检测研究人员进一步完善网络入侵检测系统提供了清楚的思路和明确的目标.     

通信网络中一种基于流的异步平均一致性协议

大规模的异步通信网络中,实时获取系统级网络平均值对于指导系统进行控制决策,比如资源选择、负载均衡等,具有重要的意义。基于此,重点研究了异步网络环境中的平均一致性问题,提出了一种基于流的异步平均一致性协议FBAA。FBAA协议适用于动态的异步通信网络系统,而且运行过程不需要全局协调。实验表明该协议能够以较快的速度收敛到平均值,且收敛时间与网络规模无关。进一步通过对实验数据的统计分析,得出收敛时间与相关参数的关系以及算法达到最优收敛时间的参数设置。     

异步网络模型中轮询与选举算法的研究与实现

分布式算法是用于解决多个互连处理器运行问题的算法.分布式算法的各部分并发和独立地运行,每一部分只承载有限的信息.分布式算法的异步网络模型是一个输入/输出自动机模型,节点之间靠消息传递状态和数据信息.所描述的异步网络模型是建立在图论基础上的裸异步模型.分析了分布式算法的基本算法,研究了异步网络模型建立的基本方法.在该模型之上,重点讨论了分布式波动算法中的轮询与选举算法,并用C语言模拟实现了该算法.     

Vague集向Fuzzy集转化的一种新方法

提出Vague值向Fuzzy值转化的实用方法的定义。针对文献[6]中的一个Vague值向Fuzzy值转化的均值修正法,提出了加权均值修正法,并证明了这种方法同样是Vague值向Fuzzy转化的一种非常实用的方法。     

Detection of a brain aneurysm and a way to search for a brain aneurysm aimed at the development of a system to simulate an operation

In this article, a system is proposed for a simulated operation which would help a trainee surgeon to perform a medical operation to ensure that a cerebral aneurysm does not burst. The physician will have acquired empirical medical technologies from operations in traditional clinical teaching. However, there is a problem with safety and the burden to the patient. Therefore, recently a new training approach for a simulated medical operation using virtual reality has been explored. With the aim of developing a simulated system for a medical operation for a cerebral aneurysm, we considered the necessary functions such as detecting the brain aneurysm that is the target of the operation, and searching for a suitable blood vessel to make a plan for the operation.     

An optimal part sending policy for a production system in a generalconfiguration with a new control strategy

We consider a production system in a general configuration with a new control strategy: the push mechanism for the part transport and the kanban technique for the work-in-process (WIP). The production system is composed of many stations such as an entrance station, a set of work stations, a central station, and an exit station, that are arranged in a general configuration. The push mechanism is followed for transporting a part from a station to a destination station. The kanban technique is adopted for controlling the WIP in a work station. The production system is modeled by a closed queuing network in a general configuration with a Markov part sending mechanism and a machine no blocking (MNB) technique. An optimal part sending policy that maximizes the expected system throughput is formulated into a long run average semi-Markov decision process. Three solution approaches are developed for obtaining optimal or suboptimal solutions. Numerical examples are given to evaluate the quality of the solutions obtained by the solution approaches     

Applying the extended Kalman filter to systems described by nonlinear differential-algebraic equations

This paper describes a method for the state estimation of nonlinear systems described by a class of differential-algebraic equation models using the extended Kalman filter. The method involves the use of a time-varying linearisation of a semi-explicit index one differential-algebraic equation. The estimation technique consists of a simplified extended Kalman filter that is integrated with the differential-algebraic equation model. The paper describes a simulation study using a model of a batch chemical reactor. It also reports a study based on experimental data obtained from a mixing process, where the model of the system is solved using the sequential modular method and the estimation involves a bank of extended Kalman filters.     

HelSweeper: Screw-sweeps of canal surfaces

A tube is a solid bounded by the union of a one-parameter family of circles that may be decomposed into canal-surfaces and planar disks or annuli. A screw-sweep is the region swept by a shape during a screw motion. HelSweeper computes the boundary of a screw-sweep of an arbitrary union of tubes and polyhedra. To do so, it generates a superset of faces, splits them at their intersections, and selects the face portions that form the desired boundary. The novelty of the proposed approach lies in the fact that the faces contributed to this superset by a tube are each a screw-sweeps of a rigid curve (generator), which is the locus of grazing points, and that each grazing point is formulated as the intersection of a circle of the tube with a corresponding screw-plane. Hence, each such face is a one-parameter family of helices, each being the screw-sweep of a grazing point.     

Developing a vision-based auto-recharging system for mobile robots

This article describes a vision-based auto-recharging system that guides a mobile robot moving toward a docking station. The system contains a docking station and a mobile robot. The docking station contains a docking structure, a control device, a charger, a safety detection device, and a wireless RF interface. The mobile robot contains a power detection module (voltage and current), an auto-switch, a wireless RF interface, a controller, and a camera. The controller of the power detection module is a Holtek chip. The docking structure is designed with one active degree of freedom and two passive degrees of freedom. For image processing, the mobile robot uses a webcam to capture a real-time image. The image signal is transmitted to the controller of the mobile robot via a USB interface. We use an Otsu algorithm to calculate the distance and orientation of the docking station from the mobile robot. In the experiment, the proposed algorithm guided the mobile robot to the docking station.     

Construction of a supermicro sense of force feedback and vision for micro-objects: development of a haptic device

This research aims to develop a combined sense system that uses both the force feedback and visual feedback to establish the shape of microscopic features of a microsample. It is thought that the efficiency of minute procedures would be improved if the operator could obtain a sense of force while using a manipulator. We used a cantilever to touch a minute object and obtain a reaction force from the degree of bending. We made a haptic device which gives a sense of that force to the operator, who can feel the force when a user touches a sample with a cantilever. In addition, when the haptic device is used in simulations, the user can feel a force just as if the user had touched a sample.     

Formatting texts accessed randomly

Full-text systems that access text randomly cannot normally determine the format operations in effect for a given target location. The problem can be solved by viewing the format marks as the non-terminals in a format grammar. A formatted text can then be parsed using the grammar to build a data structure that serves both as a parse tree and as a search tree. While processing a retrieved segment, a full-text system can follow the search tree from root to leaf, collecting the format marks encountered at each node to derive the sequence of commands active for that segment. The approach also supports the notion of a ‘well formatted’ document and provides a means for verifying the well-formedness of a given text. To illustrate the approach, a sample set of format marks and a sample grammar are given suitable for formatting and parsing the article as a sample text.     

Control of Motion of an Actively Bending Body in Channels with Dry Friction

Mechanics is described and equations are given of the motion of an actively bending homogeneous body of a finite thickness in a channel with dry friction under conditions of a weak bending. Control is suggested of the motion of a body in a sinusoidal channel, which retains a continuous first derivative of the controlling moment and a bounded second derivative. A process is described of the maximization of the speed of motion by control and then by the choice of the best parameters of a channel. Control is also considered of other modes of the motion of a body in the same channel.     

The probabilistic orienteering problem

The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given budget to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has to be selected and a corresponding a priori path has to be determined such that the server can visit all nodes in the subset and reach the destination without exceeding the budget. The list of available nodes in the subset is then revealed. In a second stage, the server follows the a priori path by skipping the absent nodes. The POP consists in determining a first-stage solution that maximizes the expected profit of the second-stage path, where the expected profit is the difference between the expected total prize and the expected total cost.We discuss the relevance of the problem and formulate it as a linear integer stochastic problem. We develop a branch-and-cut approach for the POP and several matheuristic methods, corresponding to different strategies to reduce the search space of the exact method. Extensive computational tests on instances with up to 100 nodes show the effectiveness of the exact method and the efficiency of the matheuristics in finding high quality solutions in a few minutes. Moreover, we provide an extended analysis on a subset of instances to show the value of explicitly modeling the stochastic information in the problem formulation.