基于纠缠态的量子通信网络的量子信道建立速率模型

针对基于纠缠态的量子通信网络, 提出了网络模型. 基于网络模型, 首先分析了基础链路的量子信道建立速率. 然后根据基础链路的量子信道建立速率, 针对不同的量子信道建立方法, 对中继长链路上的量子信道建立速率进行分析, 得到在逐点方法和分段方法下所对应的量子信道建立速率. 最后, 利用逾渗模型, 对大规模纠缠态量子通信网络中任意两点间的量子信道建立速率进行分析, 推导出n个节点量子通信网络中, 量子信道建立速率为Ω (1/n).     

Multi-target pursuit formation of multi-agent systems

The main goal of this paper is to design a team of agents that can accomplish multi-target pursuit formation using a developed leader--follower strategy. It is supposed that every target can accept a certain number of agents. First, each agent can automatically choose its target based on the distance from the agent to the target and the number of agents accepted by the target. In view of the fact that all agents are randomly dispersed in the workplace at the initial time, we present a numbering strategy for them. During the movement of agents, not every agent can always obtain pertinent state information about the targets. So, a developed leader--follower strategy and a pursuit formation algorithm are proposed. Under the proposed method, agents with the same target can maintain a circle formation. Furthermore, it turns out that the pursuit formation algorithm for agents to the desired formation is convergent. Simulation studies are provided to illustrate the effectiveness of the proposed method.     

Rigidity based formation tracking for multi-agent networks

This paper considers the formation tracking problem under a rigidity framework, where the target formation is specified as a minimally and infinitesimally rigid formation and the desired velocity of the group is available to only a subset of the agents. The following two cases are considered: the desired velocity is constant, and the desired velocity is timevarying. In the first case, a distributed linear estimator is constructed for each agent to estimate the desired velocity. The velocity estimation and a formation acquisition term are employed to design the control inputs for the agents, where the rigidity matrix plays a central role. In the second case, a distributed non-smooth estimator is constructed to estimate the time-varying velocity, which is shown to converge in a finite time. Theoretical analysis shows that the formation tracking problem can be solved under the proposed control algorithms and estimators. Simulation results are also provided to show the validity of the derived results.     

Peak-Power Instabilities of Laser Pulses Retroreflected by a Corner-Cube Retroreflector at Different Distances

In order to obtain the change in the return laser-pulse peak-power instability with the distance between two communication terminals in a free-space optical communication (FSO) asymmetric link, which uses a corner-cube retroreflector (CCR) and a high peak-power pulse laser, we present the peak power instability of laser pulses retroreflected by the CCR at different distances. The CCR bottom surface was a circle with a diameter of 1 in., and three mirrors of the CCR were coated with silver. The weather was cloudy with winds of Category 4. The distances from the transmitter to the CCR were 120, 1,550, 3,900, and 5,240 m. The laser emitted 100 laser pulses with a peak power of 5 MW at each distance. The results of the experiments show that the increase in both absolute and relative peakpower instabilities with the distance is approximately linear. The absolute peak-power instability is more than 58.7 mV and the relative peak-power instability is more than 11.8 % if the distance increases 1 km.     

Yang–Lee zeros of the Ising model on random graphs of non planar topology

We obtain in a closed form the 1/N² contribution to the free energy of the two Hermitian N×N random matrix model with nonsymmetric quartic potential. From this result, we calculate numerically the Yang–Lee zeros of the 2D Ising model on dynamical random graphs with the topology of a torus up to n=16 vertices. They are found to be located on the unit circle on the complex fugacity plane. In order to include contributions of even higher topologies we calculated analytically the nonperturbative (sum over all genus) partition function of the model for the special cases of N=1,2 and graphs with n≤20 vertices. Once again the Yang–Lee zeros are shown numerically to lie on the unit circle on the complex fugacity plane. Our results thus generalize previous numerical results on random graphs by going beyond the planar approximation and strongly indicate that there might be a generalization of the Lee–Yang circle theorem for dynamical random graphs.     

Leader-following formation control of multi-agent networks based on distributed observers

To investigate the leader-following formation control, in this paper we present the design problem of control protocols and distributed observers under which the agents can achieve and maintain the desired formation from any initial states, while the velocity converges to that of the virtual leader whose velocity cannot be measured by agents in real time. The two cases of switching topologies without communication delay and fixed topology with time-varying communication delay are both considered for multi-agent networks. By using the Lyapunov stability theory, the issue of stability is analysed for multi-agent systems with switching topologies. Then, by considering the time-varying communication delay, the sufficient condition is proposed for the multi-agent systems with fixed topology. Finally, two numerical examples are given to illustrate the effectiveness of the proposed leader-following formation control protocols.     

A universal protocol for bidirectional controlled teleportation with network coding

We investigate bidirectional teleportation that works in a fair and efficient manner. Two explicit protocols are proposed to realize bidirectional teleportation with a controller. One is a symmetric protocol for two-qubit states. The other is an asymmetric protocol for single-and two-qubit states. We then devise a universal protocol for arbitrary n_1-and n_2-qubit states via a(2n_1+2n_2+1)-qubit entangled state, where n_1≤n_2.The receiver only needs to perform the single-qubit recovery operation, which is derived by a general expression. Moreover, a(2n_1+1)-bit classical communication cost can be saved within the controller's broadcast channel by the use of network coding technology.     

A model for the size distribution of customer groups and businesses

We present a generalization of the dynamical model of information transmission and herd behavior proposed by Eguíluz and Zimmermann. A characteristic size of group of agents s₀ is introduced. The fragmentation and coagulation rates of groups of agents are assumed to depend on the size of the group. We present results of numerical simulations and mean field analysis. It is found that the size distribution of groups of agents n_s exhibits two distinct scaling behavior depending on ss₀ or s>s₀. For ss₀, n_ss^−(5/2+δ), while for s>s₀,n_ss^{−(5/2−δ)}, where δ is a model parameter representing the sensitivity of the fragmentation and coagulation rates to the size of the group. Our model thus gives a tunable exponent for the size distribution together with two scaling regimes separated by a characteristic size s₀. Suitably interpreted, our model can be used to represent the formation of groups of customers for certain products produced by manufacturers. This, in turn, leads to a distribution in the size of businesses. The characteristic size s₀, in this context, represents the size of a business for which the customer group becomes too large to be kept happy but too small for the business to become a brand name.     

一种新的自由空间光通信调制方式——圆偏振位移键控

自由空间光通信(FSO)在开放的大气链路中传输光信号, 不可避免地会受到大气扰动和背景光噪声的影响, 导致系统的可靠性降低。为了抑制大气扰动等对FSO系统造成的不利影响, 提出一种新的光信号调制方式——圆偏振位移键控(CPOLSK)。该调制方式利用圆偏振光的两种旋光状态进行数据的传送, 接收端结合差分方法进行光信号接收。给出了CPOLSK的装置模型, 并对其性能进行了分析。与目前广泛采用的开关键控(OOK)、脉冲位置调制(PPM)方式相比, CPOLSK很好地抑制了背景光噪声的影响, 同时对光电探测器内部噪声也有一定的抑制效果。     

Cooperative impulsive formation control for networked uncertain Euler–Lagrange systems with communication delays

This paper investigates the cooperative formation problem via impulsive control for a class of networked Euler–Lagrange systems. To reduce the energy consumption and communication frequency, the impulsive control method and cooperative formation control approach are combined. With the consideration of system uncertainties and communication delays among agents, neural networks-based adaptive technique is used for the controller design. Firstly, under the constraint that each agent interacts with its neighbors only at some sampling moments, an adaptive neural-networks impulsive formation control algorithm is proposed for the networked uncertain Euler–Lagrange systems without communication delays. Using Lyapunov stability theory and Laplacian potential function in the graph theory, we conclude that the formation can be achieved by properly choosing the constant control gains. Further, when considering communication delays,a modified impulsive formation control algorithm is proposed, in which the extended Halanay differential inequality is used to analyze the stability of the impulsive delayed dynamical systems. Finally, numerical examples and performance comparisons with continuous algorithm are provided to illustrate the effectiveness of the proposed methods.     

Blind channel estimation for DCO-OFDM based vehicular visible light communication

Blind channel estimation (CE) methods for OFDM based RF communication provide high-rate transmission by eliminating pilot overhead in conventional pilot-based methods, at the cost of lower accuracy. However, there is no work on the blind CE for OFDM based visible light communication (VLC) systems. In this paper, we propose a novel blind CE method for vehicular VLC with the goal of improving CE accuracy based on the exploitation of the channel statistics derived, by utilizing extensive amount of data collected for different communication angles, distances, and ambient light conditions. First, the normalized channel frequency response (CFR) of the V2LC channel is demonstrated to be invariant of inter-vehicular distance, relative transmitter/receiver zenith angle and ambient light. Then, this channel characteristic is exploited in the blind CE to improve its accuracy with two-step estimation of normalization factor. Extensive simulations at different vehicle speeds show that the proposed method outperforms the pilot-based and superimposed training-based CE methods in terms of spectral efficiency both for all modulation schemes and at all relative speeds. The proposed blind channel estimation (CE) method provides 9.77% increase in the spectral efficiency, compared to the second best method, superimposed training-based CE, at 20 dB signal-to-noise ratio (SNR) and 160 km/h relative speed, for 64-Quadrature Amplitude Modulation (QAM) Direct Current-Biased Optical Orthogonal Frequency Division Multiplexing (DCO-OFDM). Moreover, the real-time performance of the proposed blind CE is demonstrated for a realistic vehicle mobility scenario extracted from SUMO.     

Collective composite-rotating consensus of multi-agent systems

This paper investigates a distributed composite-rotating consensus problem of second-order multi-agent systems, where all agents move in a nested circular orbit. A distributed control law is proposed which contains two parts： the local state feedback that guarantees the circular motion and the distributed relative state feedback that guarantees the consensus of all agents. A sufficient condition is derived to drive all agents as well as ensure their circle centers make circular motion in a distributed manner. Finally, a numerical simulation is included to demonstrate our theoretical results.     

Generation of optimal persistent formations for heterogeneous multi-agent systems with a leader constraint

In this study, we consider the generation of optimal persistent formations for heterogeneous multi-agent systems,with the leader constraint that only specific agents can act as leaders. We analyze three modes to control the optimal persistent formations in two-dimensional space, thereby establishing a model for their constrained generation. Then, we propose an algorithm for generating the optimal persistent formation for heterogeneous multi-agent systems with a leader constraint(LC-HMAS-OPFGA), which is the exact solution algorithm of the model, and we theoretically prove its validity.This algorithm includes two kernel sub-algorithms, which are optimal persistent graph generating algorithm based on a minimum cost arborescence and the shortest path(MCA-SP-OPGGA), and the optimal persistent graph adjusting algorithm based on the shortest path(SP-OPGAA). Under a given agent formation shape and leader constraint, LC-HMAS-OPFGA first generates the network topology and its optimal rigid graph corresponding to this formation shape. Then, LC-HMASOPFGA uses MCA-SP-OPGGA to direct the optimal rigid graph to generate the optimal persistent graph. Finally, LCHMAS-OPFGA uses SP-OPGAA to adjust the optimal persistent graph until it satisfies the leader constraint. We also demonstrate the algorithm, LC-HMAS-OPFGA, with an example and verify its effectiveness.     

Anisotropic and valley-resolved beam-splitter based on a tilted Dirac system

We investigate theoretically valley-resolved lateral shift of electrons traversing an n–p–n junction bulit on a typical tilted Dirac system (8-Pmmn borophene). A gauge-invariant formula on Goos–Hänchen (GH) shift of transmitted beams is derived, which holds for any anisotropic isoenergy surface. The tilt term brings valley dependence of relative position between the isoenergy surface in n region and that in the p region. Consequently, valley double refraction can occur at the n–p interface. The exiting positions of two valley-polarized beams depend on the incident angle and energy of incident beam and barrier parameters. Their spatial distance D can be enhanced to be ten to a hundred times larger than the barrier width. Due to tilting-induced high anisotropy of the isoenergy surface, D depends strongly on the barrier orientation. It is always zero when the junction is along the tilt direction of Dirac cones. Thus GH effect of transmitted beams in tilted Dirac systems can be utilized to design anisotropic and valley-resolved beam-splitter.     

Ptn(n=1-9)团簇结构及磁性的第一性原理计算

采用密度泛函理论中的广义梯度近似泛函BPW91和三参数杂化密度泛函B3LYP研究Ptn团簇的结构,稳定性和磁性.两种方法得到了相同的稳定结构,基态结构也相同,只是次稳定结构的稳定顺序稍有不同.两种方法得到的平均配位数和平均键长有相似的变化规律,总体上随团簇尺寸的增大而增大,n=2-3时增幅较大,n=4-9时增幅较小,且有一定的振荡.两种方法得到团簇能量的二阶差分、分裂能、HOMO-LUMO能隙随团簇尺寸的演化都没有表现出明显的奇偶振荡行为,但在n=2、5、8时均有较大的值,说明相对应的团簇具有较高的稳定性.两种方法得到团簇的平均每原子磁矩随团簇尺寸的增大有逐渐减小的趋势,个别团簇有振荡.结果表明两种泛函都可以描述团簇结构、稳定性和磁性.     

基于介质环形柱结构的二维光子晶体中Dirac点的实现

利用偶然简并方法在二维正方格子介质环形柱结构光子晶体中成功实现了Dirac点, 并利用平面波展开法对实现Dirac点的过程进行了研究. 研究结果表明, 对于二维正方格子介质环形柱结构光子晶体, 在一定的外径R_O范围内(0.37a<R_O<0.5a), 当Dirac点存在时(n>1.4), 介质环内径R_I与外径R_O满足一个不随介质环折射率n变化的恒定关系式. 同时, Dirac点对应的光子约化频率f随折射率n及外径R_O的增大而减小. 利用所得的关系式对特定介质环折射率n条件下能实现Dirac点的环形光子晶体进行了预判设计.     

Control schemes for synchronizing two subnetworks with weak couplings

In this paper, we propose a well-designed network model with a parameter and study full and partial synchronization of the network model based on the stability analysis. The network model is composed of a star-coupled subnetwork and a globally coupled subnetwork. By analyzing the special coupling configuration, three control schemes are obtained for synchronizing the network model. Further analysis indicates that even if the inner couplings in each subnetwork are very weak, two of the control schemes are still valid. In particular, if the outer coupling weight parameter θ is larger than (n2 2n)/4, or the subnetwork size n is larger than θ2, the two subnetworks with weak inner couplings can achieve synchronization. In addition, the synchronizability is independent of the network size in case of 0 < θ < n/(n + 1). Finally, we carry out some numerical simulations to confirm the validity of the obtained control schemes. It is worth noting that the main idea of this paper also applies to any network consisting of a dense subnetwork and a sparse network.     

半覆盖锥束CT中扁平物体的高效反投影滤波重建

全覆盖圆轨迹扫描的成像视野受探测器宽度限制, 对于大物体的成像效率较低.半覆盖扫描可以将成像视野扩展近1倍, 图像重建首推使用反投影滤波型算法. 反投影滤波型算法按PI线重建, 各PI线积分区间的不一致性导致通信和计算消耗大, 影响重建效率. 针对半覆盖成像中扁平形状物体的重建问题, 提出了一种改进的反投影滤波型算法, 且证明了当扁平物体的厚度小于2Rsin(2π/N_p) (R为扫描半径, N_p 为圆扫描一周均匀采集的投影数量)时, PI线积分区间的不一致性在数值计算过程中的误差是可以忽略的. 改进后的算法相比原半覆盖反投影滤波算法具有两个明显的优势: 一是数值计算过程中角度循环移至PI线循环之外, 算法的通信需求显著降低; 二是投影数据求导、反投影和沿PI线滤波三个步骤均能够并行计算, 算法的并行性得到增强.数值仿真与实际数据的实验结果表明, 本文算法与原半覆盖反投影滤波算法的重建精度相当, 但计算效率提高了4.6倍. 关键词： 锥束CT 半覆盖成像 反投影滤波 PI线     

紫外LED圆环阵列均匀照明的实现方法

为构造指纹荧光检测中所需的均匀照明紫外光源,选择紫外LED阵列照明。采用光电探测器检测单颗LED的辐射角分布,拟合单个LED角分布函数;用8颗LED均匀置于半径为10 mm的圆环上,在圆环上方5 mm处的中心轴上放置一个LED;在给定的观察屏上照度不均匀误差下,根据斯派罗法则,确定观测屏与圆环阵列之间的距离,从而实现LED圆环阵列的照度分布均匀化。也可以给定观测屏到圆环的距离,确定轴上LED放置点到圆环的距离。实验结果表明,观测屏到圆环距离为11.0 cm时,在半径为10.0 mm的圆域内,照度不均匀相对误差小于1.27%。