A characterization of adding machine maps

Let f :X→X be a continuous map of a compact metric space to itself. We prove that f is topologically conjugate to an adding machine map if and only if X is an infinite minimal set for f and each point of X is regularly recurrent. Moreover, if X is an infinite minimal set for f and one point of X is regularly recurrent, then f is semiconjugate to an adding machine map.     

剖析博彩弹子机的赢钱原理

介绍了博彩弹子机 ,运用数学建模法剖析了它的赢钱原理 ,强调了一般博彩业主永远是赢家的道理     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.     

计算机辅助电子线路实验的思考与探索

本文介绍了EltctronicWorkbench软件和计算机虚拟仪器系统，采用计算机模拟仿真技术对电子线路实验加以辅助设计和探索。     

Minimizing makespan on a single machine subject to random breakdowns

We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan.     

A virtual instrumentation based protocol for the automated implementation of the inner field compensation method

One influential parameter which mediates interactions between many types of molecules and biological membranes stems from the lumped contributions of the transmembrane potential, dipole potential and the difference in the surface potentials on both sides of a membrane. With relevance to cell physiology, such electrical features of a biomembrane are prone to undergoing changes as a result of interactions with the aqueous surrounding. Among the most useful tools devoted to exploring changes of electrical parameters of a lipid membrane induced by certain extracellular ions, lipid composition, and embedded membrane peptides and proteins, are spectroscopic imaging and the inner field compensation (IFC) method. In this work we layout the principles of a fully computerized version of the IFC method, which makes it more readily available to users. As a direct application, we deployed this improved version of the IFC method to time-resolve changes induced by alamethicin monomers upon membrane dipole potential, following their aggregation within an artificial lipid membrane. Intriguingly, even prior crossing the membrane core, the membrane-bound alamethicin monomers are shown to significantly increase the dipole potential of the monolayer they reside in. Such data further emphasize the yet less-explored interplay between membrane-based protein and peptides, and the membrane dipole potential.     

BEPCⅡ束流相关本底的蒙特卡罗模拟研究(Ⅱ)—束流-气体相互作用

介绍了用蒙特卡罗方法研究正常对撞模式下束流本底中的束流-气体相互作用的原理与效果.使用通用的模拟工具,研究了BEPCⅡ的束流-气体本底对设计中的BESⅢ的影响.结果显示,在储存环上设置挡板后,探测器的本底在允许的范围之内.模拟结果对BEPCⅡ-BESⅢ的设计建造具有指导意义.     

串联系统可靠性虚拟系统法置信下限的小样本性质

本文讨论了具有r个成败型元件串联系统可靠性的置信下限问题。研究了虚拟系统法置信下限的小样本性质,证明了,在通常情况下虚拟系统法置信下限要大于常见的L-M法置信下限.更一般地,本文证明了在成败型试验中,当成功数与试验数之比保持不变时,试验次数的增加将直接缩小成功率置信区间的长度。     

Optimisation of fault-tolerant fabric-cutting schedules using genetic algorithms and fuzzy set theory

In apparel industry, manufacturers developed standard allowed minutes (SAMs) databases on various manufacturing operations in order to facilitate better scheduling, while effective production schedules ensure smoothness of downstream operations. As apparel manufacturing environment is fuzzy and dynamic, rigid production schedules based on SAMs become futile in the presence of any uncertainty. In this paper, a fuzzification scheme is proposed to fuzzify the static standard time so as to incorporate some uncertainties, in terms of both job-specific and human related factors, into the fabric-cutting scheduling problem. A genetic optimisation procedure is also proposed to search for fault-tolerant schedules using genetic algorithms, such that makespan and scheduling uncertainties are minimised. Two sets of real production data were collected to validate the proposed method. Experimental results indicate that the genetically optimised fault-tolerant schedules not only improve the operation performance but also minimise the scheduling risks.