Profile-Driven Component Placement for Cluster-Based Online Services

The growth of the Internet and of various intranets has spawned a wealth of online services, most of which are implemented on local-area clusters using remote invocation (for example, remote procedure call/remote method invocation) among manually placed application components. Component placement can be a significant challenge for large-scale services, particularly when application resource needs are workload dependent. Automatic component placement has the potential to maximize overall system throughput. The key idea is to construct (offline) a mapping between input workload and individual-component resource consumption. Such mappings, called component profiles, then support high-performance placement. Preliminary results on an online auction benchmark based on J2EE (Java 2 Platform, Enterprise Edition) suggest that profile-driven tools can identify placements that achieve near-optimal overall throughput.     

Monte Carlo simulation of gas phase polymerization of 1,3‐butadiene. Part II: Kinetics optimization and confirmation

Studies on the deactivations and initiations of gas phase polymerizations of 1,3‐butadiene have been achieved by Monte Carlo simulation. Initiation and deactivation control the reaction before and after the peak of the polymerization rate, respectively. The influence of polymerization temperature has been studied. Monte Carlo modeling of polymerization kinetics and mechanism was confirmed by the agreement of experimental data and simulation results of polymerizations run with a temporary evacuation of monomer. The balance of catalysts and active chains is established by both initiation and chain transfer reactions with cocatalyst, which causes a ‘pseudo‐stability’ stage. © 2003 Society of Chemical Industry     

Mining constrained gradients in large databases

Many data analysis tasks can be viewed as search or mining in a multidimensional space (MDS). In such MDSs, dimensions capture potentially important factors for given applications, and cells represent combinations of values for the factors. To systematically analyze data in MDS, an interesting notion, called "cubegrade" was recently introduced by Imielinski et al. [2002], which focuses on the notable changes in measures in MDS by comparing a cell (which we refer to as probe cell) with its gradient cells, namely, its ancestors, descendants, and siblings. We call such queries gradient analysis queries (GQs). Since an MDS can contain billions of cells, it is important to answer GQs efficiently. We focus on developing efficient methods for mining GQs constrained by certain (weakly) antimonotone constraints. Instead of conducting an independent gradient-cell search once per probe cell, which is inefficient due to much repeated work, we propose an efficient algorithm, LiveSet-Driven. This algorithm finds all good gradient-probe cell pairs in one search pass. It utilizes measure-value analysis and dimension-match analysis in a set-oriented manner, to achieve bidirectional pruning between the sets of hopeful probe cells and of hopeful gradient cells. Moreover, it adopts a hypertree structure and an H-cubing method to compress data and to maximize sharing of computation. Our performance study shows that this algorithm is efficient and scalable. In addition to data cubes, we extend our study to another important scenario: mining constrained gradients in transactional databases where each item is associated with some measures such as price. Such transactional databases can be viewed as sparse MDSs where items represent dimensions, although they have significantly different characteristics than data cubes. We outline efficient mining methods for this problem.     

Characteristics of low-leakage deep-trench diode for ESD protection design in 0.18-/spl mu/m SiGe BiCMOS process

This paper proposes a novel low-leakage BiCMOS deep-trench (DT) diode in a 0.18-/spl mu/m silicon germanium (SiGe) BiCMOS process. By means of the DT and an n/sup +/ buried layer in the SiGe BiCMOS process, a parasitic vertical p-n-p bipolar transistor with an open-base configuration is formed in the BiCMOS DT diode. Based on the two-dimensional (2-D) simulation and measured results, the BiCMOS DT diode indeed has the lowest substrate leakage current as compared to the conventional p/sup +//n-well diode even at high temperature conditions, which mainly results from the existence of the parasitic open-base bipolar transistor. Considering the applications of the diode string in electrostatic discharge (ESD) protection circuit designs, the BiCMOS DT diode string also provides a good ESD performance. Owing to the characteristics of the low leakage current and high ESD robustness, it is very convenient for circuit designers to use the BiCMOS DT diode string in their IC designs.     

一种高性能的新结构IGBT

提出了一种低功率损耗的新结构IGBT.该新结构的创新点在于其复合耐压层结构,该耐压层包括深扩散形成的n型缓冲层和硼注入形成的透明背发射区两部分.虽然在正常工作条件下,该新结构IGBT工作于穿通状态,但器件仍具有非穿通IGBT(NPT-IGBT)的优良特性.该新结构IGBT具有比NPT-IGBT更薄的芯片厚度,从而可以获得更好的通态压降和关断功耗之间的折衷.实验结果表明:与NPT-IGBT相比较,新结构IGBT的功率损耗降低了40%.     

以3D软件应用为中心的设计管理模式——PDS在配管设计中的应用

由PDS的特点入手,结合工程实践的应用情况,阐明了3D软件可以更广泛的应用于配管的设计中,强调了以3D模型为中心开展设计和管理的新模式.     

三相全控桥式整流电路实验装置的研制

介绍了开发三相全控桥式整流电路实验装置的背景;叙述了TC787芯片的内部结构、工作原理、特点及芯片的各个管脚的功能;详细介绍了该实验装置的触发电路的设计思路、设计结果和工作原理;介绍了该实验装置的主电路部分的结构和特点。该实验装置性能可靠,符合本科生实验要求。     

GMSK无线接收终端设计

设计了GMSK(Gauss Minimum Shift Keying，高斯最小频移键控)无线接收终端的硬件与软件系统。硬件的射频电路对空中信号进行接收与滤波，再由以MX589构成的解调模块解调，输出数字信号；数字硬件以单片机GMS97L5为核心。软件系统设计了对IC卡AT88SCl608加密卡的认证以及对串行数据的接收与处理的中断程序。终端系统接收数据快、性能稳定。     

软印刷技术

软印刷技术是基于弹性体印章/模具来转移图形结构的微纳加工技术。详细介绍了软印刷技术中转移图形结构的多种方式,并探讨软印刷技术在微纳电子学、光学、传感器、生物等领域的广泛应用。对软印刷技术的弹性体印章/模具制备、聚二甲基硅氧烷的属性、理论研究等进行了探讨。     

Joint scheduling and power control supporting multicasting in wireless ad hoc networks

This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem.