Randomization helps to perform independent tasks reliably

This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Anti-Stokes Bands of Intrinsic Radiation in Undoped GaAs Crystals

It has been established that undoped gallium crystals exhibit anti-Stokes radiation with energy corresponding to the interband recombination of these crystals. Its appearance is most probably determined by EL2 defects, and its intensity depends on the product of the cross sections for photoionization of electrons and the holes from these defects.     

Practical algorithms for transposition-invariant string-matching

We consider the problems of (1) longest common subsequence (LCS) of two given strings in the case where the first may be shifted by some constant (that is, transposed) to match the second, and (2) transposition-invariant text searching using indel distance. These problems have applications in music comparison and retrieval. We introduce two novel techniques to solve these problems efficiently. The first is based on the branch and bound method, the second on bit-parallelism. Our branch and bound algorithm computes the longest common transposition-invariant subsequence (LCTS) in time O((m²+loglogσ)logσ) in the best case and O((m²+logσ)σ) in the worst case, where m and σ, respectively, are the length of the strings and the size of the alphabet. On the other hand, we show that the same problem can be solved by using bit-parallelism and thus obtain a speedup of O(w/logm) over the classical algorithms, where the computer word has w bits. The advantage of this latter algorithm over the present bit-parallel ones is that it allows the use of more complex distances, including general integer weights. Since our branch and bound method is very flexible, it can be further improved by combining it with other efficient algorithms such as our novel bit-parallel algorithm. We experiment on several combination possibilities and discuss which are the best settings for each of those combinations. Our algorithms are easily extended to other musically relevant cases, such as δ-matching and polyphony (where there are several parallel texts to be considered). We also show how our bit-parallel algorithm is adapted to text searching and illustrate its effectiveness in complex cases where the only known competing method is the use of brute force.     

Lorentz Invariant Decompositions of the State Vector Spaces and the Basis Problem

We consider a representation of the state reduction which depends neither on its reality nor on the details of when and how it emerges. Then by means of the representation we find necessary conditions, even if not the sufficient ones, for a decomposition of the state vector space to be a solution to the basis problem. The conditions are that the decomposition should be Lorentz invariant and orthogonal and that the associated projections should be continuous. They are shown to be able to determine a decomposition in each of a few examples considered if the other circumstances are taken into account together.     

利用拉曼型的Jaynes-Cummings模型传送两比特的未知原子态

实现量子态的隐形传送、尤其是多比特量子态的隐形传送在量子信息领域中有非常重要的作用，提出了一种隐形传送两比特未知原子态的方案，在此方案中，用两个两粒子纠缠态代替一个三粒子纠缠态作为量子信道，而且此方案可推广到隐形传送N比特的未知原子态。     

单粒子势模型下价核子的密度分布

依据实验事实，利用单粒子势模型，计算了一些核态外层价核子的密度分布.计算给出了价核子在核外部分布的概率和贡献，以此作为晕核态的判断标准.通过研究均方根半径随结合能变化的规律，指出了晕核态存在的条件，尤其是质子晕核态存在的条件.这些对判断和寻找晕核态有现实的指导意义. 关键词： 单粒子势模型 价核子 密度分布 中子晕核态 质子晕核态     

Probabilistic Teleportation of a Three-Particle State

A scheme for teleporting a three-particle state is proposed when three pairs of entangled particles are used as quantum channels. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by the smaller coetficients of the three entangled pairs.     

On perturbations of matrix pencils with real spectra, a revisit

This paper continues earlier studies by Bhatia and Li on eigenvalue perturbation theory for diagonalizable matrix pencils having real spectra. A unifying framework for creating crucial perturbation equations is developed. With the help of a recent result on generalized commutators involving unitary matrices, new and much sharper bounds are obtained.

     

压缩偶相干态的制备及其非经典特性

通过保持非耗散介观LC电路的固有频率不变，而使电路参数作阶跃函数变化，就可将介观LC电路由初始的偶相干态制备到压缩偶相干态；在压缩偶相干态下，介观电路系统不仅有非经典的量子压缩效应，而且有非经典的反聚束效应. 关键词： 介观LC电路 单位阶跃函数 压缩算符 压缩偶相干态     

线性电压扫描下1VIIS器件瞬态的简单模型

本文用准平衡模型分析讨论了线性电压扫描下MIS器件的I/V瞬态.文中除了给出一般的处理方法以外，还给出了几种不同电压扫描率下I/Y特性的计算结果，并与已往的模型作了比较.