Quadrupole interactions at 57Fe and 119Sn in 3d-metal antimonides

3d-metal antimonides: Fe_1+x Sb, N_+x Sb, Co_+x Sb and the (Ni_1?y Fe _y )Sb solid solution have been studied by the Mössbauer effect method at ⁵⁷Fe and ¹¹⁹Sn. It was found that the quadrupole interactions at the Fe and Sn nucleus in 3d-metal antimonides are very sensitive to the filling of different crystallographic sites with metal atoms. The metal atoms in trigonal-bipyramidal sites have a strong effect on the quadrupole splitting of ¹¹⁹Sn. They are nearest to anions (Sb or Sn) with the typical axial ratio of c/a = 1.25. The QS(x) dependence of ¹¹⁹ Sn in 3d-metal antimonides in the 0 ≤ x ≤ 0.1 concentration range can be used to determine x – the concentration of transition metal excess relative to the stoichiometric composition.     

多段构件组成的压杆平面内稳定

分析由若干段等截面或者变截面构件组成的压杆平面内稳定问题．从由三段等截面构件组成的压杆平面内稳定问题出发，对两端为变截面、中间为等截面构件组成的压杆的平面内稳定问题进行了分析，得出和两端为等截面构件情况类似的屈曲荷载计算公式．并对两端固接的情况进行了研究分析．     

基于二分法迭代的频谱感知节能优化策略

针对认知无线电(CR)系统中频谱感知技术能量效率低的问题,提出了一种基于二分法迭代寻优的联合优化算法。该算法通过联合传输功率与感知时隙进行优化,最大化地提高了CR系统的能量效率,并且在针对优化参数ξ的寻优过程中,使用了二分法与迭代算法结合的寻优方法。通过理论分析,与其他类似算法相比,该算法的寻优速度更快,算法复杂度更低,函数收敛速度更快,实际应用的可扩展性更强。数值仿真分析结果表明,在保证检测性能的前提下,提出的算法能够很好地解决能效的最优化问题,在恒定检测概率Pd=0.9和Pd=0.7条件下,所提出算法的能耗开销均低于其他算法,在系统吞吐量中所提出算法均优于其他算法,为CR系统的发展提供了理论支撑,更加符合未来CR系统的节能发展方向。     

调控体育课运动负荷的探讨

运动负荷是身体练习给人体带来的生理负担．体育课运动负荷的调控即通过各种有效手段，对一节体育课生理负荷的调节与控制过程．体育课运动负荷的调控应通过练习与讲解、练习与示范、练习与纠正错误、练习与变换练习等四种互动途径进行．     

某库岸滑坡稳定分析及治理措施研究

从地质条件出发,详细分析了滑坡的成因,以大型的岩土工程数值分析软件(ADINA)为研究手段,建立有限元计算模型,用强度折减的方法分析了滑坡体在初始工况、蓄水工况、暴雨工况、水位骤降工况和地震工况下的稳定情况,根据滑坡的失稳情况,在综合考虑的基础上,提出了削坡减载和地表排水相结合的治理措施,计算结果表明,治理措施是可行的,研究结果对设计和施工具有较大的参考价值.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

Algebra with Quadratic Commutation Relations for an Axially Perturbed Coulomb–Dirac Field

The motion of a particle in the field of an electromagnetic monopole (in the Coulomb–Dirac field) perturbed by an axially symmetric potential after quantum averaging is described by an integrable system. Its Hamiltonian can be written in terms of the generators of an algebra with quadratic commutation relations. We construct the irreducible representations of this algebra in terms of second-order differential operators; we also construct its hypergeometric coherent states. We use these states in the first-order approximation with respect to the perturbing field to obtain the integral representation of the eigenfunctions of the original problem in terms of solutions of the model Heun-type second-order ordinary differential equation and present the asymptotic approximation of the corresponding eigenvalues.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

Intermolecular Interactions in 8-Aza-D-Homogonane Crystals and their Manifestation in the IR Spectra

Crystalline modifications of 8-aza-D-homogon-1,3,5(10),13-tetraen-12,17a-dione have been investigated by IR spectroscopy and x-ray structural analysis. It is shown that this compound crystallizes from solutions of chloroform with hexane in the form of a solvate comprised of chelate hydrogen bonds between the hydrogen atom of the chloroform molecule and the oxygen atoms of the carbonyl groups of the 8-azasteroid molecule. A relation between the changes in the characteristic absorption bands of the CH₂-, C=O-, and I=C groups and the structure of the crystalline modifications has been established.     

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