两指标双F统计过程控制图

当产品质量指标服从二元正态分时,可用T2控制图与Λ控制图联合判断产品生产的过程是否处于受控状态。本文利用T2统计量与F统计量、Λ统计量与F统计量之间的关系,得到了两指标情形下两类基于F分布统计量的统计过程控制图,简称双F统计过程控制图,并给出了控制图应用实例。     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

Optical properties of polarization-dependent geometric phase elements with partially polarized light

The behavior of geometric phase elements illuminated with partially polarized monochromatic beams is investigated both theoretically and experimentally. The element discussed in this paper is composed of wave plates with π-retardation and a space-variant orientation angle. We found that a beam emerging from such an element comprises two polarization orders; right-and left-handed circularly polarized states with conjugate geometric phase modification. This phase equals twice the orientation angle of the space-variant wave plate comprising the element. Apart from the two polarization orders, the emerging beam coherence polarization matrix includes a “vectorial interference matrix” which contains information concerning the correlation between the two orthogonal, circularly polarized portions of the incident beam. In this paper we measure this correlation by a simple interference experiment. In addition, we found that the equivalent mutual intensity of the emerging beam is modulated according to the geometric phase induced by the element. Other interesting phenomena concerning propagation will be discussed theoretically and demonstrated experimentally. The experiment made use of a spherical geometric phase element that was realized by use of a space-variant subwavelength grating illuminated with CO₂ laser radiation of 10.6 μm wavelength.     

Detecting and Diagnostic Checking Multivariate Conditional Heteroscedastic Time Series Models

Two tests for multivariate conditional heteroscedastic models are proposed. One is based on the cross-correlations of standardized squared residuals and the other is a score (Lagrange multiplier) test. The cross-correlations test can be used to detect the presence of multivariate conditional heteroscedasticity whereas the other test can be used for diagnostic checking. Simulation studies on the size and power of the test statistics are reported. The application of the tests is illustrated by an example using the S & P 500 and Sydney All Ordinary Indexes.     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

阴极还原处理对多孔硅发光性能的影响

对经过阴极还原处理后的多孔硅样片进行了光致发光测试和稳定性测试.实验结果表明这种处理能明显改善多孔硅的发光稳定性,使其表面结构更加稳定.利用原子力显微镜对不同还原时间的多孔硅微结构及形貌进行了比较,在一定范围内随着还原时间的增长多孔硅表面粗糙度增大,PL谱增强.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

Time Consistent Dynamic Risk Measures

We introduce the time-consistency concept that is inspired by the so-called “principle of optimality” of dynamic programming and demonstrate – via an example – that the conditional value-at-risk (CVaR) need not be time-consistent in a multi-stage case. Then, we give the formulation of the target-percentile risk measure which is time-consistent and hence more suitable in the multi-stage investment context. Finally, we also generalize the value-at-risk and CVaR to multi-stage risk measures based on the theory and structure of the target-percentile risk measure.     

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.