基于控制K次平方根非门的类Toffoli门构造方法

在量子电路综合算法中,由于非置换量子门比置换量子门具有更复杂的规则,直接使用非置换量子门会大幅度提高综合算法的复杂性,因此可先使用非置换量子门生成相应的置换量子门,然后再用这些置换量子门综合所求量子可逆逻辑电路,从而提高算法性能。本文重点研究如何用非置换量子门构造新的置换量子门,为此吸收了格雷码的思想,提出了一种高效的递归构造方法,实现使用控制非门和控制K次平方根非门(非置换量子门),快速生成最优的类Toffoli门(置换量子门)。     

经典逻辑门与量子逻辑门之比较

本文通过经典逻辑门与量子逻辑门之比较,论述了量子计算的特点、量子算法的巨大威力及量子逻辑门的实现问题。     

软件定义的无线电提供IoT远程联接

如果不联接,物联网(IoT)和工业物联网(IIoT)就会成为数十亿台设备的集合,其功能和用途有限。互联和联接到云的能力使得这些节点成为我们现在家庭、办公室、工厂和公共场所非常依赖的有用设备。虽然使用有线联接,但在许多情况下,无线技术是首选技术,但各种不同的节点类型和应用意味着没有单一的普遍方案.事实上,方案的数量在增加,包括以标准为导向的技术和在许可和无许可证频谱中运行的协议,以及专有技术。即使如此,情况也在发生变化,因为软件无线电(SDR)提供灵活性,而这种灵活性是纯硬件方案不可能做到的。     

Checking Simple Properties of Transition Systems Defined by Thue Specifications

In (possibly infinite) deterministic labeled transition systems defined by Thue congruences, labels are considered as functions of states into states. This paper provides a method for computing domains of such functions for a large class of transition systems. The latter are related to model checking of transition systems defined by Thue congruences.     

Symmetric sub-structures

The method presented applies to sub-structures when the stiffness matrix method is used, and the sub-structures have a single plane of symmetry, or two or three mutually perpendicular planes of symmetry. The symmetry is used to reduce the computation time. The method can be used when there are several levels of sub-structure, and applies to any symmetric sub-structure even if the sub-structures which it contains, or by which it is itself contained, are not symmetric.The difficulty of assessing the importance of the computational savings which can be made by using the symmetry of sub-structures is discussed. A simple but rather crude measure of these savings has been adopted and applied to eleven examples. The examples cover a wide range of structural problems, either directly or by extrapolation, and show that substantial computational savings can often be obtained.     

Algebraic Characterization of Reversible Logic Gates

Reversible logic plays an important role in quantum computing. This paper investigates the universality and composition power of various known and new reversible gates. We present the algebraic characterization of selected new families of Boolean reversible gates. Some theoretical results on the relation between reversible w*w gates and the corresponding symmetric group are derived. Different combinations of reversible gate classes are proven to generate the entire class of reversible w*w gates.     

智能软件定义网络

近年来,人工智能(artificial intelligence,简称AI)以强劲势头吸引着学术界和工业界的目光,并被广泛应用于各种领域.计算机网络为人工智能的实现提供了关键的计算基础设施.然而,传统网络固有的分布式结构往往无法快速、精准地提供人工智能所需要的计算能力,导致人工智能难以实际应用和部署.软件定义网络(so...     

Guaranteeing the Homotopy Type of a Set Defined by Non-Linear Inequalities

This paper provides an effective method to create an abstract simplicial complex homotopy equivalent to a given set described by non-linear inequalities (polynomial or not). To our knowledge, no other numerical algorithm is able to deal with this type of problem. The proposed approach divides into subsets that have been proven to be contractible using interval arithmetic. The method is close to Čech cohomology and uses the nerve theorem. Some examples illustrate the principle of the approach. This algorithm has been implemented.     

Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency

Submodular function minimization is a polynomially solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexity. In many applications the objective function is locally defined in that it is the sum of cost functions (also known as soft or valued constraints) whose arities are bounded by a constant. We prove that every valued constraint satisfaction problem with submodular cost functions has an equivalent instance on the same constraint scopes in which the actual minimum value of the objective function is rendered explicit. Such an equivalent instance is the result of establishing optimal soft arc consistency and can hence be found by solving a linear program. From a practical point of view, this provides us with an alternative algorithm for minimizing locally defined submodular functions. From a theoretical point of view, this brings to light a previously unknown connection between submodularity and soft arc consistency.     

多维云模型定义的危险信号产生机制

危险信号的产生机制是危险理论的核心问题。云模型是描述不确定性概念的工具。本文借鉴多维云模型的思想来判定计算机系统参数的变化,产生危险信号并构造多概念云,用以划分危险等级。最后,我们综合危险信号与现有AIS识别机制构造了协同免疫识别模型。     

Symmetric cellular automata

A class of cellular automata with permutation-invariant local rules acting on symmetric lattices is considered. In the case of two states, we show that these local rules are nothing else than a generalization of the rules of the game of Life. In view of the symmetry relative to the state renaming, we can further reduce the number of possible automata. For automata with symmetric rules acting on highly symmetric lattices, we can develop efficient algorithms to study their dynamics. Relevant examples are presented.     

Autonomous Vision-Based Helicopter Flights Through Obstacle Gates

The challenge for unmanned aerial vehicles to sense and avoid obstacles becomes even harder if narrow passages have to be crossed. An approach to solve a mission scenario that tackles the problem of such narrow passages is presented here. The task is to fly an unmanned helicopter autonomously through a course with gates that are only slightly larger than the vehicle itself. A camera is installed on the vehicle to detect the gates. Using vehicle localization data from a navigation solution, camera alignment and global gate positions are estimated simultaneously. The presented algorithm calculates the desired target waypoints to fly through the gates. Furthermore, the paper presents a mission execution plan that instructs the vehicle to search for a gate, to fly through it after successful detection, and to search for a proceeding one. All algorithms are designed to run onboard the vehicle so that no interaction with the ground control station is necessary, making the vehicle completely autonomous. To develop and optimize algorithms, and to prove the correctness and accuracy of vision-based gate detection under real operational conditions, gate positions are searched in images taken from manual helicopter flights. Afterwards, the integration of visual sensing and mission control is proven. The paper presents results from full autonomous flight where the helicopter searches and flies through a gate without operator actions.