Implementing a Two-Photon Three-Degrees-of-Freedom Hyper-Parallel Controlled Phase Flip Gate Through Cavity-Assisted Interactions

Hyper-parallel quantum information processing is a promising and beneficial research field. Herein, a method to implement a hyper-parallel controlled-phase-flip (hyper-CPF) gate for frequency-, spatial-, and time-bin-encoded qubits by coupling flying photons to trapped nitrogen vacancy (NV) defect centers is presented. The scheme, which differs from their conventional parallel counterparts, is specifically advantageous in decreasing against the dissipate noise, increasing the quantum channel capacity, and reducing the quantum resource overhead. The gate qubits with frequency, spatial, and time-bin degrees of freedom (DOF) are immune to quantum decoherence in optical fibers, whereas the polarization photons are easily disturbed by the ambient noise.     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

基因芯片荧光图象采集与分析

描述了基因芯片荧光图象的光学共聚焦成象,大范围高速扫描与控制,数据采集的原理和方法.并讨论了基因芯片荧光图象的分析算法,即模板定位与阈值分割相结合的半自动算法,并将其计算结果与完全采用人工分割算法的结果进行了比较.     

量子计算与超冷离子

通过介绍量子计算的基本概念和特点，并对比目前人们使用的计算机的计算方式，对于如何利用囚禁在离子阱中的超冷离子进行量子计算作了简要的叙述．     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

Efficiency and effectiveness of Spanish football teams: a three-stage-DEA approach

In this paper, we apply a three-stage-DEA model to the Spanish Professional Football League, which means separating the teams’ economic behaviour into three components: operating efficiency—of the offence and defence—athletic or operating effectiveness, and social effectiveness. The results showed that the technical inefficiency of the defence is greater than that of the offence, both being caused by aspects linked to the poor management of players’ abilities and by the football team’s size. Teams showed a favourable evolution of their offensive and defensive efficiency during the 2004/2005 season and to a lesser extent in the season before. The point system assigned by the professional football league regulations evaluates the teams’ athletic effectiveness, but we detected that the teams with the most experience perform athletically in a more effective manner. Their social effectiveness is strongly related to the level of play in itself and to factors linked to their PFL ranking: participation in international competitions for important football teams; or the struggle of minor football teams to stay in the first division.     

Topics in data assimilation: Stochastic processes

Stochastic models with varying degrees of complexity are increasingly widespread in the oceanic and atmospheric sciences. One application is data assimilation, i.e., the combination of model output with observations to form the best picture of the system under study. For any given quantity to be estimated, the relative weights of the model and the data will be adjusted according to estimated model and data error statistics, so implementation of any data assimilation scheme will require some assumption about errors, which are considered to be random. For dynamical models, some assumption about the evolution of errors will be needed. Stochastic models are also applied in studies of predictability.

The formal theory of stochastic processes was well developed in the last half of the twentieth century. One consequence of this theory is that methods of simulation of deterministic processes cannot be applied to random processes without some modification. In some cases the rules of ordinary calculus must be modified.

The formal theory was developed in terms of mathematical formalism that may be unfamiliar to many oceanic and atmospheric scientists. The purpose of this article is to provide an informal introduction to the relevant theory, and to point out those situations in which that theory must be applied in order to model random processes correctly.     

长江堤防工程地质信息处理模型及技术方法

长江中下游的主要防洪工程是长江干堤 ,长江堤防线路长、工程浩大、堤基工程地质水文地质条件复杂 ,涉及大量的已有地质数据和资料。今后在整治加固堤防的工程地质勘察工作中 ,还需随时进行数据的收集、存储、检索、分析、统计和维护 ,随时调用这些数据进行综合处理、编制报告和图件 ;在防汛期间可以针对堤防险工险段的险情 ,随时查询和调用有关的资料、数据或者图件 ,提供采取抢险措施决策的地质依据。这既提高了地质数据的利用价值和利用率 ,又保证了信息的准确性、完整性和共享性。因此 ,建立合理的长江堤防工程地质信息处理模型及其成熟的技术方法具有重要的意义。     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.