毫米波三维异质异构集成技术的进展与应用

三维异质异构集成技术是实现电子信息系统向着微型化、高效能、高整合、低功耗及低成本方向发展的最重要方法,也是决定信息化平台中微电子和微纳系统领域未来发展的一项核心高技术。文章详细介绍了毫米波频段三维异质异构集成技术的优势、近年来的发展趋势以及面临的挑战。利用硅基MEMS 光敏复合薄膜多层布线工艺可实现异质芯片的低损耗互连,同时三维集成高性能封装滤波器、高辐射效率封装天线等无源元件,还能很好地处理布线间的电磁兼容和芯片间的屏蔽问题。最后介绍了一款新型毫米波三维异质异构集成雷达及其在远距离生命体征探测方面的应用。     

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.     

积层板的制造方法

概述了积层板的开发背景、制造工艺和最近的开发动向。     

BaxSr（1—x）TiO3多层膜椭偏光谱研究

用溶胶－凝胶技术在Bi(100）衬底上制备了单层和渐变型多层的BaxSr(1-X)TiO3薄膜，其膜层组分分别为：Ba0.7Sr0.3TiO3,Ba0.8Sr0.2TiO,Ba0.9Sr0.1TiO3,BaTiO3，对生长制备出的多层BaxSr(1-X)TiO3薄膜进行了变角度椭偏光谱测量，通过椭偏光谱解谱分析研究，首次得到了BaxSr(1-X)TiO3多层膜结构不同膜层的膜厚和光学常数，其结果显示：椭偏光谱分析得到的不同膜层的膜厚与卢瑟福背向散射测量得到的结果基本相符；渐变型多层膜中BaTiO3薄膜的折射率比单层BaTiO3薄膜折射率大许多，与体BaTiO3的折射率相接近，这说明渐变型多层膜中BaTiO3薄膜的光学性质与体材料的光学性质接近。     

Structural and thermodynamic properties of AlB2 compound

We employ a first-principles plane wave method with the relativistic analytic pseudopotential of Hartwigsen, Goedecker and Hutter (HGH) scheme in the frame of DFT to calculate the equilibrium lattice parameters and the thermodynamic properties of AlB₂ compound with hcp structure. The obtained lattice parameters are in good agreement with the available experimental data and those calculated by others. Through the quasi-harmonic Debye model, obtained successfully are the dependences of the normalized lattice parameters a/a₀ and c/c₀ on pressure P, the normalized primitive cell volume V/V₀ on pressure P, the variation of the thermal expansion α with pressure P and temperature T, as well as the Debye temperature \Theta_D and the heat capacity C_V on pressure P and temperature T.     

A rational approximation and its applications to nonlinear partial differential equations on the whole line

An orthogonal system of rational functions is discussed. Some inverse inequalities, imbedding inequalities and approximation results are obtained. Two model problems are considered. The stabilities and convergences of proposed rational spectral schemes and rational pseudospectral schemes are proved. The techniques used in this paper are also applicable to other problems on the whole line. Numerical results show the efficiency of this approach.     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.