On the Application of the Auxiliary Problem Principle

The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems.     

M/G/1非空竭服务休假排队系统随机分解的简化算法

本文根据M／G／1非空竭服务休假排队系统稳态队长随机分解的结构特征提出一种统一算法，该方法简洁高效，避免了再生循环方法繁杂的运算。运用该方法得出的结果与已知的用再生循环方法得出的结论一致。并且修正了Levy(1989)关于Bernoulli闸门服务休假排队系统随机分解的一个错误。     

多重休假的带启动--关闭期的Geom/G/1排队

本研究多重休假的带启动——关闭期的Geom／G／1离散时间排队，给出稳态队长，等待时间分布的母函数及其随机分解结果，推导出忙期的全假期的母函数，给出该模型的几个特例。     

CNx纳米管的制备、结构观察及低场致电子发射性能研究

采用高温热解法，以乙二胺为前驱液，在沉积有铁催化剂的p型硅（111）基底上制备出了定向生长的CNx纳米管.利用扫描电子显微镜、高分辨率透射电子显微镜和拉曼光谱对CNx纳米管进行了形貌观察和表征.CNx纳米管的高度在20?μm左右，直径在50—100nm之间，具有明显的“竹节状”结构，结晶有序度较差.对CNx纳米管薄膜进行低场致发射性能测试：外加电场为1.4V/μm，观察到20?μA /cm2发射电流，外电场升至2.54V/μm时发射电流达到1.280mA/cm2，在较高外电场下，没有发现电流“饱和”.这比 关键词： CNx纳米管 高温热解 “竹节状”结构 场致发射     

There are infinitely many limit points of the fractional parts of powers

Suppose that α > 1 is an algebraic number and ξ > 0 is a real number. We prove that the sequence of fractional partsξα ⁿ , n = 1, 2, 3, …, has infinitely many limit points except when α is a PV-number and ξ ∈ ℚ(α). For ξ = 1 and α being a rational non-integer number, this result was proved by Vijayaraghavan.     

Light Diffraction of Aligned Polymer Fibers Periodically Dispersed by Phase Separation of Liquid Crystal and Polymer

We have confirmed light diffraction of aligned polymer fibers obtained by a phase separation of an anisotropic-phase solution of liquid crystal and polymer. He—Ne laser light passing through the polymer fibers was scattered in the axis vertical to the fibers, and had two peaks of light intensity symmetrical to the center of the transmitting laser spot. The two peaks were found to be caused by light diffraction due to the periodic polymer-fiber dispersion because the peaks corresponded to values calculated by intervals between the fibers. The periodical fiber networks are considered to be formed by anisotropic spinodal decomposition. This effect can be used to measure the dispersion order of the polymer fibers. © 2004 The Optical Society of Japan     

Pseudorandom properties of prime factors

In this paper we study some pseudo-random properties related to the prime factors of integers. We prove some results concerning the well distribution of the greatest prime factor modulo 4, and give some computational insight on the correlations, which seem to be beyond reach of proof.     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].     

Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.