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

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

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.     

薄膜偏振分光镜的研究

概述薄膜偏振分光镜的研究现状及其主要特点，重点分析薄膜偏振分光镜的设计原理,并利用等效折射率的方法计算中心波长的反射率．     

Dreamweaver UltraDev环境下实现数据库的动态链接

简要论述了如何在Dreamweaver UltraDev环境下实现对已有的Access或Excel数据库的动态链接的操作。在Dreamweaver UltraDev环境下，实现对企业、事业单位原有Access或Excel数据库的动态链接，可以在很短的时间内开发出符合单位实际情况的信息管理系统，并且可以使这类已经创建好的数据信息，不加任何修改地与外部进行交流，实现资源共享。将此系统以主页的形式链入Internet，可以实现开放式管理体系。     

Study of the pulsed laser vapor doping of Si(1 0 0) with KrF excimer laser and BCl3 gas

The properties of pulsed laser vapor doping on p-Si(1 0 0) with a KrF (248 nm) excimer pulsed laser (248 nm) and BCl₃ gas are reported in this paper. The doped samples are characterized by the resistance measured using a four-probe method, since the sheet resistance changes with the carrier concentration of the sample. The doping effects with the variation of laser energy density, pulse number, and the pressure of BCl₃ were investigated in terms of the sheet resistance. In this way, the optimized parameters were obtained and used for the positive heavy doping on p-Si(1 0 0) and p-Si(1 1 1). Then, using a square mesh under the above conditions, an image doping was completed. Finally, the metal–semiconductor Ohmic contacts were realized by plating Ag and Cu films on the doped surface.     

Asymptotic Methods Applied to Contact Problems

Asymptotic methods for contact problems are expounded. Some typical integral equations are considered     

Optimal stopping problems by two or more decision makers: a survey

A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers, the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe some dynamic approaches. Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn.     

A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems

Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing costs. Numerical example is given to demonstrate the validity of the present algorithm. The project supported by the Machinary and Electronics Ministry of China