Investigations of Solid State Dynamics at the NRSSR Beamline at PETRA II. An Overview

The present status of the new nuclear resonance beamline PETRA 1 at HASYLAB, DESY, Hamburg is described. Besides an overview of the experimental setup some examples of recent experiments are given. Those cover the main applications, i.e., inelastic scattering from iron alloys and quasielastic scattering from glass-forming liquids. This revised version was published online in August 2006 with corrections to the Cover Date.     

切伦柯夫相互作用中分段式慢波结构与均匀慢波结构的比较研究

 分析了切伦柯夫束波相互作用中使用单段慢波结构的缺点。指出在分段式慢波结构中，漂移段及其两端的慢波结构组成一Bragg谐振腔，当漂移段长度合适时，根据渡越时间效应理论，这种结构能减小调制束中电子的速度分散，提高束波转化效率。通过粒子模拟方法，比较了均匀慢波结构与分段式慢波结构中束波相互作用的物理图像，验证了理论分析结果，并说明了后者有束密度群聚充分，束电子速度分散小，产生微波功率高、频谱质量好，最佳工作电流大，输入电功率高等优点。     

X波段六腔渡越管振荡器的高频特性研究

 从麦克斯韦方程出发，采用时域有限差分法（FDTD）和离散傅里叶变换（DFFT）相结合的方法，通过数值计算得出了六腔开放式谐振腔中前四个谐振频率和场分布，计算出的谐振频率与实验测量结果基本相同。比较了开放腔和封闭腔谐振频率，验证了TEM波吸收边界条件，并在实际编程计算中得以应用。计算结果为六腔渡越管振荡器的机理研究提供了依据。     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.     

Dynamic response of permalloy/Cu/Co magnetoresistive sandwiches

The dynamic response of trilayer magnetoresistive permalloy/Cu/Co films was studied by high-frequency permeability spectra measurements. The resonance frequency is shown to depend on the interlayer copper thickness. This dependence is related to exchange coupling between permalloy and cobalt and the interaction field is estimated using the Landau–Lifschitz–Gilbert model.     

Vibrational Dynamics Studies by Nuclear Resonant Inelastic X-Ray Scattering

Nuclear resonant inelastic X-ray scattering of synchrotron radiation is being applied to ever widening areas ranging from geophysics to biophysics and materials science. Since its first demonstration in 1995 using the ⁵⁷Fe resonance, the technique has now been applied to materials containing ⁸³Kr, ¹⁵¹Eu, ¹¹⁹Sn, and ¹⁶¹Dy isotopes. The energy resolution has been reduced to under a millielectronvolt. This, in turn, has enabled new types of measurements like Debye velocity of sound, as well as the study of origins of non-Debye behavior in presence of other low-energy excitations. The effect of atomic disorder on phonon density of states has been studied in detail. The flux increase due to the improved X-ray sources, crystal monochromators, and time-resolved detectors has been exploited for reducing sample sizes to nano-gram levels, or using samples with dilute resonant nuclei like myoglobin, or even monolayers. Incorporation of micro-focusing optics to the existing experimental setup enables experiments under high pressure using diamond-anvil cells. In this article, we will review these developments. This revised version was published online in August 2006 with corrections to the Cover Date.     

高精度的光纤衰减系数测试系统的设计

利用常规仪器设备，设计了一套集光、机、电为一体的光纤衰减测量,实现了数字化监测显示，并可与微机接口；采用双光路法，消除了由于光源光强不稳定产生的误差。     

Approximating schedules for dynamic process graphs efficiently

A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.

In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.

In this paper we study a subclass of dynamic process graphs called -output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is -complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a -complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion.     

A brief semi-quantitative discussion on electrical conductance through resonant states in metallic electrochemical nanowires

Some aspects of electrical conduction through resonant states in metallic electrochemical nanowires are briefly discussed in a semi-quantitative way by means of concepts associated with electron gas, conductance quantization, and Fermi energy level. Aspects related to some experimental data are also discussed.