基于多变量希尔伯特频域模型的癫痫发作预测

癫痫发作具有突发性和反复性,对患者生命安全构成巨大威胁.为了对癫痫发作进行有效地预测,提出了多变量希尔伯特频域模型的癫痫发作预测方法.将希尔伯特边际谱、希尔伯特边际谱的变化方向和希尔伯特加权频率组成一个三维特征向量作为多变量希尔伯特频域模型,输入到支持相量机中,实现癫痫的发作预测,最后采用癫痫发作预测特征方法对预测结果进行评估.实验结果表明:采用多变量希尔伯特频域模型分析方法预测δ波和θ波的癫痫发作,癫痫预测范围在30~45 min,患者有足够的时间采取措施应对;癫痫发作周期在5~10 min,缩短患者等待时间,降低焦虑程度;与多种相关方法进行比较,该方法具有较低的错误预报率和较高的预测敏感度.     

An M/G/1 Retrial Queueing System with Two-Phase Service and Preemptive Resume

An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established.     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

     

弱(L_1,L_2)-BLD映射的正则性

本文首先将文［１］中的ＢＬＤ映射推广为弱（Ｌ１，Ｌ２）－ＢＬＤ映射，并证明了如下正则性结果：存在两个可积指数 Ｐ１＝Ｐ１（ｎ，Ｌ１，Ｌ２）＜ｎ＜ｑ１＝ｑ１（ｎ，Ｌ１，Ｌ２），使得对任意弱（Ｌ１，Ｌ２）－ＢＬＤ映射ｆ∈（Ω，Ｒｎ），都有ｆ∈（Ω，Ｒｎ），即ｆ为（Ｌ１，Ｌ２）－ＢＬＤ映射．     

Generalized Complex Spectral Decomposition for a Quantum Decay Process

By extending the notion of mixed states to functionals acting on the space of observables with diagonal singularity we obtain a well-defined complex spectral decomposition of the time evolution for a quantum decaying system. In this formalism, generalized Gamow states are obtained with well-defined physical properties.     

Spectral decomposition of an elementary 3-fermion 2-body operator

The eigenvalues and eigenfunctions of an elementary 3-fermion 2-body operator 3P²_g∧I¹A³∑_{1≤i≤j≤3}P²_g(i, j)A³ acting on a 3-particle antisymmetric finite-dimensional Hilbert space have been found. Here P_g² denotes the projection operator onto a 2-particle antisymmetric function g², while A³ denotes the 3-particle antisymmetrizing operator.     

Dynamics of the periodic type-K competitive Kolmogorov systems

For time-periodic dissipative and irreducible type-K competitive Kolmogorov systems, it is proved that there is a canonically defined countable family F of unordered, disjoint invariant sets with the property that, for every persistent trajectory whose ω-limit set is not a cycle, there exists a unique trajectory in some element of F such that these two trajectories are asymptotic and the corresponding points in these two trajectories are K-related.     

Light Diffraction of Aligned Polymer Fibers Periodically Dispersed by Phase Separation of Liquid Crystal and Polymer

We have confirmed light diffraction of aligned polymer fibers obtained by a phase separation of an anisotropic-phase solution of liquid crystal and polymer. He—Ne laser light passing through the polymer fibers was scattered in the axis vertical to the fibers, and had two peaks of light intensity symmetrical to the center of the transmitting laser spot. The two peaks were found to be caused by light diffraction due to the periodic polymer-fiber dispersion because the peaks corresponded to values calculated by intervals between the fibers. The periodical fiber networks are considered to be formed by anisotropic spinodal decomposition. This effect can be used to measure the dispersion order of the polymer fibers. © 2004 The Optical Society of Japan     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

On the spectra of finite-dimensional quadratic Bose operators

A complete study of the spectrum of a finite-dimensional Bose operator is carried out in the paper. The cases in which the spectrum is discrete or continuous are studied. Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 835–854, June, 1997. Translated by A. M. Chebotarev