Efficient Flexible M-Tree Bulk Loading Using FastMap and Space-Filling Curves

Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations and disk accesses using FastMap and a space-filling curve, thereby significantly improving the index construction and search performance. Our second algorithm is an extension of the first, and it incorporates a partitioning clustering technique and flexible node architecture to further improve the search performance. Through the use of various synthetic and real-world datasets, the experimental results demonstrated that our algorithms improved the index construction performance by up to three orders of magnitude and the search performance by up to 20.3 times over the previous algorithm.     

Output feedback controller for polytopic systems exploiting the direct searching of the design space

This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches.     

基于分层加权的多边形图形匹配

提出了一种适用凸凹多边形匹配的分层加权测度方法，在此方法中，对凹多边形、首先进行基于提取凸多边形的模式分解，对凹多边形添加辅助线，形成新的外接凸多边形、通过依次抽取外接凸多边形，将凹多边形表达为仅由凸多边形组成的多层拓扑结构，然后，利用预先定义的互为模板的相似度量准则和分层加权测度模型，计算得到多边形的相似度系数，从而实现凹多边形的匹配和检索。     

Least-squares integration of one-dimensional codistributions with application to approximate feedback linearization

We study the problem of approximating one-dimensional nonintegrable codistributions by integrable ones and apply the resulting approximations to approximate feedback linearization of single-input systems. The approach derived in this paper allows a linearizable nonlinear system to be found that is close to the given system in a least-squares (L ₂) sense. A linearly controllable single-input affine nonlinear system is feedback linearizable if and only if its characteristic distribution is involutive (hence integrable) or, equivalently, any characteristic one-form (a one-form that annihilates the characteristic distribution) is integrable. We study the problem of finding (least-squares approximate) integrating factors that make a fixed characteristic one-form close to being exact in anL ₂ sense. A given one-form can be decomposed into exact and inexact parts using the Hodge decomposition. We derive an upper bound on the size of the inexact part of a scaled characteristic one-form and show that a least-squares integrating factor provides the minimum value for this upper bound. We also consider higher-order approximate integrating factors that scale a nonintegrable one-form in a way that the scaled form is closer to being integrable inL ₂ together with some derivatives and derive similar bounds for the inexact part. This allows a linearizable nonlinear system that is close to the given system in a least-squares (L ₂) sense together with some derivatives to be found. The Sobolev embedding techniques allow us to obtain an upper bound on the uniform (L _∞) distance between the nonlinear system and its linearizable approximation. This research was supported in part by NSF under Grant PYI ECS-9396296, by AFOSR under Grant AFOSR F49620-94-1-0183, and by a grant from the Hughes Aircraft Company.     

Daily impact of climate on the pattern of urban family life : Indigenous courtyard houses of Baghdad regions of the hot-dry climates Part I: Daily shifts or daily movements in summer

During the day, there are considerable variations in the climatic factors prevailing in these regions. This is especially so during the 24-hour daily cycle of the long, hot and dry summer (mid-May to midOctober). Such climatic conditions have had a considerable impact on the daily living pattern of family life in the same season, particularly in the urban areas. During the same 24-hour cycle, they have compelled the inhabitants to shift their living activities both vertically in section and horizontally in plan; they do this in pursuit of more acceptable, if not, desirable internal thermal environmental ambience.     

Putting it all together – Formal verification of the VAMP

In the verified architecture microprocessor (VAMP) project we have designed, functionally verified, and synthesized a processor with full DLX instruction set, delayed branch, Tomasulo scheduler, maskable nested precise interrupts, pipelined fully IEEE compatible dual precision floating point unit with variable latency, and separate instruction and data caches. The verification has been carried out in the theorem proving system PVS. The processor has been implemented on a Xilinx FPGA. A shorter version of this article with the title “Instantiating uninterpreted functional units and memory system: functional verification of the VAMP” appeared in [8]. The work reported here was done while all the authors were with Saarland University.     

采用基本门单元完全测试矢量的测试生成算法

文章介绍了一种采用基本逻辑门单元的安全测试矢量集生成测试矢量的方法，该方法可以将搜索空间限制在2(n 1）种组合内。它采用故障支配和故障等效的故障传播、回退等技术，建立了一套从局部到全局的测试生成新方法。同时，利用基本门单元安全测试矢量的规律性，可以实现最小的内存容量要求。在一些基准电路的应用实例中，得到了满意的结果。     

Improved Soft-Output RAKE Receiver for CDMA Mobile Terminals with High Data Rates

In this paper we propose a soft-output RAKE receiver for CDMA mobile terminals using low spreading factor and/or high-order modulation constellations for high data rates. Based on the outputs of theRAKE correlator fingers, the receiver produces symbol or bit metrics for soft decision decoding. The formulation of these metrics is derived analytically taking into account the multipath propagation, interfering users and channel estimation errors. Simulations show thata performance gain is achieved when low spreading factors or high-order modulation constellations are used.     

随机度量理论的最近进展及其应用

本文综述了随机度量理论在近十年来的重要进展及其具有代表性的某些应用。