Assembling hydrodynamic cloaks to conceal complex objects from drag

Transformation hydrodynamics and the corresponding metamaterials have been proposed as a means to exclude the drag force acting on an object. Here, we report a strategy to deploy the hydrodynamic cloaks in a more practical manner by assembling different-shaped cloaking parts. Our strategy is to first model a square-shaped cloak and a carpet cloak and then combine them to conceal a more complex-shaped space in the three-dimensional hydrodynamic flow. With the derivation of transformation hydrodynamics, the coordinate transformations for each hydrodynamic cloaking are demonstrated with the calculated viscosity tensors. The pressure and velocity fields of the square, triangular (carpet), and exemplary three-dimensional house-shaped cloaks are numerically simulated, thus showing a cloaking effect and reduced drag. This study suggests an efficient way of cloaking complex architectures from fluid-dynamic forces.     

Fused vs. spiro: Kinetic,not thermodynamic preference may direct the reaction of α-carbonyl oxonium ylides

Rh(II)-catalyzed decomposition of certain cyclic α-diazocarbonyl compounds in the presence of cyclic ethers has been shown to give bicyclic ring expansion products. These are thought to arise from a [1,4]-alkyl shift toward the carbonyl oxygen atom and are in contrast with the recently observed spirocyclic products of a Stevens-type [1,2]-alkyl shift within the postulated oxonium ylide intermediate. Quantum chemical calculations performed at the B3LYP/6-31G* level of theory showed that the former reaction pathway (toward fused bicycles) is kinetically preferred.     

低插损窄带型10.7MHz压电陶瓷滤波器的研制

介绍了低插损窄带型10.7 MHz压电陶瓷滤波器的一种设计制作方法。结合压电陶瓷能陷模理论,通过对滤波器分割电极设计和制造工艺控制技术的研究,强调了工艺控制的重要性。产品达到日本村田同类产品水平,对国产化窄带型10.7 MHz压电陶瓷滤波器的研发和生产具有十分重要的意义。认为选用高Qm值压电陶瓷材料、分割电极和耦合电容的设计、焊接和点蜡工艺的控制等是研制低插损窄带型10.7 MHz压电陶瓷滤波器的重点。     

Unidirectional Quantum Remote Control:Teleportation of Control-State

We investigate the problem of teleportation of unitary operations by unidirectional control-state telepor-tation and propose a scheme called unidirectional quantum remote control. The scheme is based on the isomorphismbetween operation and state. It allows us to store a unitary operation in a control state, thereby teleportation of theunitary operation can be implemented by unidirectional teleportation of the control-state. We find that the probabilityof success for implementing an arbitrary unitary operation on arbitrary M-qubit state by unidirectional control-stateteleportation is 4-M, and 2M ebits and 4M cbits are consumed in each teleportation.     

Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

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.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.     

质量控制图系统的实现及在SMT中的应用

本文将控制图理论与计算机技术相结合,开发了质量控制图系统.介绍了该系统的设计方案和关键技术问题,并以电子产品制造中监控SMT机的焊膏厚度为例说明了系统的应用.