血压指标的聚类分析

利用353人的血压数据,运用2种不同的聚类分析方法对15个血压指标分类并挑选典型指标:一是利用SAS软件包中提供的变量聚类过程(VARCLUS过程)对指标进行裂类聚类分析;一是利用SAS中提供的样品聚类过程(CLUSTER过程)对指标进行系统聚类分析.2种方法得到了相同的结果:15个指标分成了4类,得到4个典型指标:BPR(收缩压与舒张压比值),BPP(收缩压与舒张压乘积),MAPPr(平均动脉压与脉率乘积),BPRPr(BPR与脉率乘积).     

安全性和正确性折中的软件系统开发方法

主要分析和研究如何在软件当前的现实下寻求功能正确性和安全性的折中策略，来解决商业软件长期以来带有“bug”和安全性问题．对功能正确性和安全性的折中方案，亦有详细的分析，最后还提出将软件开发的折中技术融入软件工程以取得实际的效果．     

一类新的非线性混合拟变分包含的灵敏性分析

研究了一类新的非线性混合拟变分包含的灵敏性问题，通过使用预解算子及不动点技巧，证明了这类含参数的变分包含的解的存在唯一性及连续性，推广了近期有关文献的一些结果。     

Cold compaction of ceramic powder: Computational analysis of the effect of pressing method and die shape

This paper deals with a computational analysis of the influence of the pressing method and part geometry on the final density distribution in the cold compaction process of ceramic alumina powders. The analysis is based on the explicit finite-element model proposed and validated in a previous study. The mechanical behavior of the processing material is described using a multisurface elastoplastic model, the modified Drucker-Prager/Cap model Published in Prikladnaya Mekhanika, Vol. 43, No. 10, pp. 129–134, October 2007.     

Decentralized iterative learning control for a class of large scale interconnected dynamical systems

The problem of decentralized iterative learning control for a class of large scale interconnected dynamical systems is considered. In this paper, it is assumed that the considered large scale dynamical systems are linear time-varying, and the interconnections between each subsystem are unknown. For such a class of uncertain large scale interconnected dynamical systems, a method is presented whereby a class of decentralized local iterative learning control schemes is constructed. It is also shown that under some given conditions, the constructed decentralized local iterative learning controllers can guarantee the asymptotic convergence of the local output error between the given desired local output and the actual local output of each subsystem through the iterative learning process. Finally, as a numerical example, the system coupled by two inverted pendulums is given to illustrate the application of the proposed decentralized iterative learning control schemes.     

Possible spectroscopic manifestation of the angular group induced bond alteration (AGIBA) effect in toluene

The most obvious consequence of the concept of aromaticity is the common confidence that in aromatic compounds, bond lengths do not alternate and are between typical to the single and double ones. However, in 1994, performing crystal structure investigations of substituted pyridines and their salts, Krygowski and co‐workers have discovered a very surprising angular group induced bond alteration (AGIBA) effect: It appears that some angular substituents, like methoxy or nitrozo groups, can induce bond alternation in aromatic rings. Crystal studies do not allow one to operate with liquids that are more common in organic chemistry. This paper presents the first possible evidence of spectroscopic manifestations of the AGIBA effect. Raman spectra of the liquid toluene are analyzed. It is found that instead of being single, the line corresponding to the ring breathing vibrations is clearly split by 1.0–1.4 cm^?1, thus indicating the presence of two (cis‐ and trans‐) AGIBA isomers. The energy difference between these isomers estimated in temperature dependent Raman studies is found equal to 6.68 kJ mol^?1. The low‐wavenumber line therefore corresponds to the cis‐AGIBA isomer and the high‐wavenumber line to the trans‐AGIBA isomer stabilized by the AGIBA effect. Copyright © 2007 John Wiley & Sons, Ltd.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

化学分析在火灾原因技术鉴定中的应用

采用化学分析方法对火灾现场中的微量油品、特殊物质和混凝土等痕迹物证的化学分析鉴定,对火灾原因和火灾责任的认定起关键作用.     

开关型磁阻电动机的振动分析

针对SR电动机存在的振动和噪声问题,分别应用实验模态分析法和计算模态分析法研究了SR电动机的动力特性,得到了SR电动机定子的固有频率和主振型,计算值与实验测量值吻合较好,所得数据可为制定抑制SR电动机的振动和噪声方案提供参考.