电路电磁兼容建模与仿真

提出了对暴露在任意外场中的传输线进行时频分析的新方法，这种方法非常稳定，它能够与任意的传输线模型和电路仿真方法兼容，并且使用这种方法得到的仿真值和实际值之间的差别小于1％。     

HEGF中CO井筒流动及扩散规律研究

目前,高能气体压裂广泛的应用于低渗透油气田,可以有效清除近井地带由于钻井、射孔和各种措施造成的污染和堵塞,达到油气井增产、注水井增注的目的。但最近一些低渗透油气田却出现了频繁的CO气体中毒事件,给油田及员工带来巨大的损失。针对这一现象,运用现场数据以及物理模拟和数学模拟方法首次通过对CO气体流动、扩散等的综合研究,建立了CO井筒流动及大气扩散模型。同时,也考察了井筒压力、气油比、风速、气体泄放速率、大气稳定度等主要因素对CO气体扩散的影响。通过现场实例计算,证实模型具有较高的准确性。此项工作的完成为建立监控系统提供基础技术依据,同时对合理、有效的开发油气田以及煤层气的开发将具有重要的实际意义。     

Oligo(ethylene oxide) side‐chain steric screening effects on conductimetric properties of grafted poly(4‐vinylpyridinium) salts in aqueous solutions

A set of poly[N‐oligo(ethylene oxide)yl 4‐vinylpyridinium tosylate] (P4VOEOOTs) has been prepared by spontaneous polymerization of 4‐vinylpyridine. This method gives a grafted polyelectrolyte having a positive charge on every backbone pyridinic moiety. The P4VP15Ts, P4VP164Ts, P4VP350Ts and P4VP750Ts aqueous solution conductivities were determined in the concentration range from 6 × 10^?4 to 10^?2 M at 25 °C. The variation of the conductivity versus concentration of the investigated system exhibits typical polyelectrolyte behaviour. The polyelectrolyte mobility was found to be dependent on the oligo(ethylene oxide) (OEO) side‐chain length. Manning's rod‐like model fails to describe these results. A simple steric effect is proposed to explain the influence of the OEO length. Copyright © 2003 Society of Chemical Industry     

我国上市公司股票评级研究——财务结构模型分析法在股票市场中的应用

目前,我国股票市场上的股票评级尚处于探索阶段,评级时多采用专家法或历史法,而对于影响股票评级的各因素的确定以及因素间的相互作用缺乏定量分析。研究将结构模型应用到我国股票市场的股票评级中,建立关于我国股票评级的财务结构模型;分析各个因素对股票评级的影响;建立股票评级经验模式值。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

浅谈DC/DC变换器控制新方法

文中针对DC/DC变换器的特点,在现有控制和建模方法的基础之上,对DC/DC变换器的现代控制方法进行了归纳和总结,简要讨论了其控制原理,并比较了各种现代控制方法的优缺点,最后对DC/DC变换器控制方法的发展作了一定的展望。     

A multigrid accelerated hybrid unstructured mesh method for 3D compressible turbulent flow

 A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation. The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest. Sponsored by The Research Council of Norway, project number 125676/410 Dedicated to the memory of Prof. Mike Crisfield, a respected colleague     

电信企业信息化统一模型构建策略

电信企业信息化的实质就是赋予电信企业精细化的企业资源整合能力，本以此认识为出发点，通过定义基本的信息化业务元素，需求参数和基本信息处理机制，构建出带有行业共性的电信企业信息化统一模型，该模型针对目前电信企业信息化中常见的和潜在的问题提供了有效的解决措施。     

高性能调度技术中应用程序调度模型设计--地理空间信息网格调度技术的研究

地理空间信息网格调度技术，要比传统的高性能计算中的调度技术复杂，原因是如果将全部网格资源作为一个应用程序的调度和执行目标，必将导致通信延迟、成本昂贵、执行低效等。为此，综合考虑应用程序特性、机器特性等，研究设计了地理空间信息网格高性能调度技术中的应用程序调度模型，包括地理空间信息网格应用程序分析；资源特性分析；应用程序分解；性能预测；资源调度；机器选择；任务映射；任务调度；任务调度器和调度器管理模块。以实现为不同的应用程序匹配不同的计算资源，提高计算资源的利用率和应用程序的执行效率。