Apollonian packings as physical fractals

The Apollonian packings (APs) of spheres are fractals that result from a space-filling procedure. We discuss the finite size effects for finite intervals s?∈?[s _min,?s _max] between the largest and the smallest sizes of the filling spheres. We derive a simple analytical generalization of the scale-free laws, which allows a quantitative study of such physical fractals. To test our result, a new efficient space-filling algorithm has been developed which generates random APs of spheres with a finite range of diameters: the correct asymptotic limit s _min/s _max?→?0 and the known APs' fractal dimensions are recovered and an excellent agreement with the generalized analytic laws is proved within the overall range of sizes.     

A segmentation method for noisy photoelectric image

In order to improve the ability of noisy photoelectric image segmentation and satisfy the requirement of human visual apperception, a noisy photoelectric image segmentation method is proposed in this paper. Firstly, the basic principle of FCM algorithm is analyzed in detail. Secondly, on the basis of PCM algorithm, only such pixels affected by noise lesser that centralized in the diagonal area of two-dimensional histogram is actualized image processing, and the probability of the pixel that lie in such area is obtained. Thirdly, objective function, membership matrix and cluster centers are renovated on the basis of PCM algorithm. Finally, experiment contrast between our method and other methods is executed, the results of experiment indicate that our method has relatively better segmentation quality and faster segmentation speed.     

A novel construction algorithm of the LDPC code for high-speed long-haul optical transmission systems

According to the transmission characteristics of high-speed long-haul optical transmission system, the main construction method of Low-Density Parity-Check (LDPC) code for optical transmission system is presented and a novel construction algorithm of LDPC code is proposed, the theoretical analysis shows that the parity check matrix of the LDPC code constructed by the proposed construction algorithm has no four-girth phenomenon, this is also theoretically proved out. Both the novel LDPC(3969,3720) code with 6.69% redundancy and the novel LDPC(8281,7920) code with 4.56% redundancy for optical transmission systems are constructed by using the presented construction method and proposed construction algorithm. The simulation results show that the net coding gain (NCG) of the two novel LDPC codes at the eighteenth iteration for the BER of 10^?12 are respectively 1.63 dB and 1.49 dB more than that of the RS(255,239) code in ITU-T G.975. Moreover, the decoding of the LDPC code in the hardware can parallel be implemented, so the decoding speed of the two novel LDPC codes are very rapid, the complexities of implementing the two novel LDPC codes, compared with the concatenated codes in ITU-T G.975.1, are relatively lower, furthermore, the hardware overhead and storage space can relatively be saved and the computation complexity can be reduced in implementing the hardware in the future. As a result, the two novel LDPC codes can better be suitable for high-speed long-haul optical transmission systems.     

潘宁源放电的全三维电磁粒子模拟/蒙特卡罗碰撞数值算法研究

深入研究潘宁放电的物理机制, 研制了全三维高品质算法粒子模拟软件(PIC), 设计并添加了相应物理情景的蒙特卡罗碰撞模块(MCC), 并对电子、氢分子离子(H₂⁺)、氢正离子(H⁺)、氢三正离子(H₃⁺)同时进行了跟踪, 成功研制了全三维电磁PIC/MCC数值算法. 结合国内研究较热的潘宁放电模型, 对该算法进行模拟验证. 模拟结果显示: 采用有效的滤波算法能抑制电磁数值噪声, 电子能量呈麦克斯韦分布, 由于电子的径向漂移和加速导致离子源顶端H₂⁺产量较大. 关键词： 潘宁离子源 高品质算法 粒子模拟/蒙特卡罗     

一种基于角谱理论的改进型相位恢复迭代算法

进行星间激光通信的光学发射天线光束整形器设计时, 首要解决的问题是根据输入光场及理想的输出光场, 确定整形器的相位分布, 其核心就是相位恢复. 基于角谱传播理论, 在传统 Gerchberg-Saxton (G-S)迭代算法的基础上, 提出了一种幅度梯度加成迭代算法, 给出了算法的详细流程与分析. 与G-S相比, 新算法利用迭代过程, 构建光场幅度反馈回路, 利用梯度搜索最佳迭代路径, 两者的联合作用加速其迭代收敛进程. 数值仿真表明, 新算法的单位迭代次数所引起迭代误差下降的速度是G-S算法的1.7倍, 其收敛速度明显优于G-S算法; 对不同的随机初始相位, 新算法都能进行有效迭代, 表现出适应性强, 且收敛一致性好的优点. 幅度梯度加成迭代算法为复杂光场的高效相位恢复提供了一种新思路, 为设计各种衍射光学元件提供了技术支持. 关键词： 相位恢复 迭代算法 角谱理论 光通信     

基于压缩表示的离子刻蚀仿真三维表面演化方法

为了研究表面演化过程的机理, 提出了一种基于压缩表示的三维表面演化方法来模拟等离子体刻蚀工艺,并着重探讨了对离子刻蚀的仿真. 为了解决三维元胞自动机内存需求量大的问题, 该方法将二维数组和动态存储方式相结合, 既实现元胞信息的无损压缩存储, 又保持三维元胞间的空间相关性. 实验结果也表明该方法不仅节省了大量内存, 而且在高分辨率条件下查找离子初始碰撞的表面元胞效率较高, 满足高分辨率仿真的要求. 将该方法应用于实现刻蚀工艺三维表面仿真中, 模拟结果与实验结果对比验证了该方法的有效性. 关键词： 等离子体刻蚀 元胞自动机 表面演化方法 高分辨率仿真     

A hybrid genetic algorithm–neural network strategy for simulation optimization

Simulation optimization aims at determining the best values of input parameters, while the analytical objective function and constraints are not explicitly known in terms of design variables and their values only can be estimated by complicated analysis or time-consuming simulation. In this paper, a hybrid genetic algorithm–neural network strategy (GA–NN) is proposed for such kind of optimization problems. The good approximation performance of neural network (NN) and the effective and robust evolutionary searching ability of genetic algorithm (GA) are applied in hybrid sense, where NNs are employed in predicting the objective value, and GA is adopted in searching optimal designs based on the predicted fitness values. Numerical simulation results and comparisons based on a well-known pressure vessel design problem demonstrate the feasibility and effectiveness of the framework, and much better results are achieved than some existed literature results.     

基于DEMON线谱的轴频提取方法研究

目标的螺旋桨不同则轴频不相同。轴频是目标的特征之一,可以应用于目标识别当中。本文提出一种改进的高频噪声解调分析(DEMON)方法,能够得到具有明显线谱的DEMON谱;提出最大公约数算法,并给出提取轴频的具体步骤。海试数据实验结果验证了本文所提方法及算法的有效性和可行性。     

Dense coding scheme using superpositions of Bell-states and its NMR implementation

Dense coding using superpositions of Bell-states is proposed. The generalized Grover's algorithm is used to prepare the initial entangled states, and the reverse process of the quantum algorithm is used to determine the entangled state in the decoding measurement. Compared with the previous schemes, the superpositions of two Bell-states are exploited. Our scheme is demonstrated using a nuclear magnetic resonance (NMR) quantum computer. The corresponding manipulations are obtained. Experimental results show a good agreement between theory and experiment. We also generalize the scheme to transmit eight messages by introducing an additional two-state system.     

Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences

In the paper a single machine time-dependent scheduling problem is considered. The processing time p_j of each job is described by a function of the starting time t of the job, p_j=1+α_jt, where the job deterioration rate α_j?0 for j=0,1,…,n and t?0. Jobs are nonpreemptable and independent, there are no ready times and no deadlines. The criterion of optimality of a schedule is the total completion time.First, the notion of a signature for a given sequence of job deterioration rates is introduced, two types of the signature are defined and their properties are shown. Next, on the basis of these properties a greedy polynomial-time approximation algorithm for the problem is formulated. This algorithm, starting from an initial sequence, iteratively constructs a new sequence concatenating the previous sequence with new elements, according to the sign of one of the signatures of this sequence.Finally, these results are applied to the problem with job deterioration rates which are consecutive natural numbers, α_j=j for j=0,1,…,n. Arguments supporting the conjecture that in this case the greedy algorithm is optimal are presented.