基于SPA的双枝模糊决策分析

将集对理论(SPA)与双枝模糊决策理论相结合,用集对分析的方法研究进行双枝模糊决策的方法,分别对双枝模糊决策因素域和双枝模糊决策的上枝、下枝和双枝进行了集对分析,给出了用SPA进行双枝模糊决策的性质,同时讨论了双枝模糊决策的动态分析方法,以及双枝模糊决策度强弱态势预测的方法,从而为双枝模糊决策理论的研究提供了新的视角和方法,为双枝模糊决策的应用提供了更方便的工具和更强的理论支持。     

关于微分熵的一类强偏差定理

利用关于乘积分布密度的相对熵和相对熵率的概念,建立了相依连续型随机变量序列关于参考微分熵的一类强偏差定理,证明中给出了将Laplace变换应用于微分熵强偏差定理的研究的一种途径．     

BLOW-UP RESULTS AND ASYMPTOTIC BEHAVIOR OF THE EMDEN-FOWLER EQUATION u＂ = ｜u｜^p

In this article the author works with the ordinary differential equation u＂ = ｜u｜^p for some p 〉 0 and obtains some interesting phenomena concerning blow-up, blow-up rate, life-span, stability, instability, zeros and critical points of solutions to this equation.     

Existence of two solutions of m-point boundary value problem for second order dynamic equations on time scales

In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered.     

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.     

Surface profile measurement of low-frequency vibrating objects using temporal analysis of fringe pattern

A simple and accurate algorithm (phase scanning method) is proposed for 3D surface contouring and dynamic response determination of a vibrating object. A sinusoidal fringe pattern is projected onto a low-frequency vibrating object by a programmable liquid crystal display projector. The fringe patterns are captured by a high-speed CCD camera with a telecentric gauging lens. Phase values are evaluated point by point using phase scanning method. From the phase values of each point on the object, the contour of the specimen at different instants of vibration can be retrieved. In this paper, a small vibrating coin is used to demonstrate the validity of the method and the experimental results are compared with test results on a stationary coin using four-step phase shifting and fast Fourier transform methods. The technique is especially useful in applications where the vibrating object has a complicated shape.     

热丝加热电流对CH薄膜沉积速率和表面形貌的影响

 热丝辅助裂解法是结合气相沉积制备聚对二甲苯薄膜和热丝化学气相沉积而形成的一种制-CH薄膜的新方法。热丝辅助裂解法的最大特点就是在保持低衬底温度情况下可以获得高沉积速率，而热丝加热电流对薄膜沉积速率和薄膜表面形貌具有重要影响。研究表明，热丝加热电流越大，薄膜沉积速率越高，在加热电流9A时，薄膜沉积速率可达0.002mm/min，同时薄膜表面粗糙度随之增加，薄膜表面也开始出现其它元素污染，因此，一般热丝加热电流选择为7A附近。     

On the Second Law of Thermodynamics and the Piston Problem

The piston problem is investigated in the case where the length of the cylinder is infinite (on both sides) and the ratio m/M is a very small parameter, where m is the mass of one particle of the gaz and M is the mass of the piston. Introducing initial conditions such that the stochastic motion of the piston remains in the average at the origin (no drift), it is shown that the time evolution of the fluids, analytically derived from Liouville equation in a previous work, agrees with the Second Law of thermodynamics. We thus have a non equilibrium microscopical model whose evolution can be explicitly shown to obey the two laws of thermodynamics.     

非线性不适定问题一种双循环的牛顿型迭代格式

本文研究非线性算子方程F(x)=y的解,结合最速下降法,Newton-Landweber迭代格式及正则化思想,在F满足适当的条件下,构造出新的双循环迭代格式。本文对格式的收敛性进行了严格论证,并估计出迭代格式的收敛精度。