非均匀抽样网格简化

提出了一种考虑视点空间中某些重要视点的非均匀抽样网格简化的新方法,是在借鉴了Garland-Heckbert方法的基础上提出的,是一种考虑外观相似性的简化算法。给出并证明了两个判定边界的定理,为抽样提供了理论依据。在简化过程中,该算法通过采用视点空间中某些重要视点对模型进行抽样,使抽中的顶点对（轮廓附近的顶点对）得到适当保护。该算法除具有Garland-Heckbert方法的长处外,还可以在三角面片数较少的情况下（50多个三角面片）,尽可能保持模型的重要外观特征,给出了计算0－1图像的外观相似性误差的公式,通过该公式对简化结果进行比较,证明提出的简化算法对保持模型的外观特征是行之有效的。最后对该算法的时间和空间复杂性进行了分析。     

Logical Representation of a Conceptual Model for Spatial Data Warehouses

The MultiDimER model is a conceptual model used for representing a multidimensional view of data for Data Warehouse (DW) and On-Line Analytical Processing (OLAP) applications. This model includes a spatial extension allowing spatiality in levels, hierarchies, fact relationships, and measures. In this way decision-making users can represent in an abstract manner their analysis needs without considering complex implementation issues and spatial OLAP tools developers can have a common vision for representing spatial data in a multidimensional model. In this paper we propose the transformation of a conceptual schema based on the MultiDimER constructs to an object-relational schema. We based our mapping on the SQL:2003 and SQL/MM standards giving examples of commercial implementation using Oracle 10g with its spatial extension. Further we use spatial integrity constraints to ensure the semantic equivalence of the conceptual and logical schemas. We also show some examples of Oracle spatial functions, including aggregation functions required for the manipulation of spatial data. The described mappings to the object-relational model along with the examples using a commercial system show the feasibility of implementing spatial DWs in current commercial DBMSs. Further, using integrated architectures, where spatial and thematic data is defined within the same DBMS, facilitates the system management simplifying data definition and manipulation.

Direct manipulation of FFD: efficient explicit solutions and decomposible multiple point constraints

Published online: 25 July 2001     

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999     

Robust joint modeling of mean and dispersion through trimming

The Maximum Likelihood Estimator (MLE) and Extended Quasi-Likelihood (EQL) estimator have commonly been used to estimate the unknown parameters within the joint modeling of mean and dispersion framework. However, these estimators can be very sensitive to outliers in the data. In order to overcome this disadvantage, the usage of the maximum Trimmed Likelihood Estimator (TLE) and the maximum Extended Trimmed Quasi-Likelihood (ETQL) estimator is recommended to estimate the unknown parameters in a robust way. The superiority of these approaches in comparison with the MLE and EQL estimator is illustrated by an example and a simulation study. As a prominent measure of robustness, the finite sample Breakdown Point (BDP) of these estimators is characterized in this setting.     

水煤浆管道输送模型

本文介绍了描述加压气化用水煤浆管道流动性能的数学模型－Ｍｅｔｚｎｅｒ－Ｒｅｅｄ通用计算法。在试验范围内（Ｒｅ＇＝１６．８￣１７６０），用该模型处理２８５个实验数据的平均相对误差为６．９６％，管道输送试验可评价各种水煤浆的管道流动性能并提供管道输送参数。     

无刷双馈电机及其调速系统的发展

通过回顾无刷双馈电机的原理、数学模型和闭环控制策略的发展情况，介绍了无刷双馈电机本体及其调速系统在国内外的发展及现状，分析了研究意义，并展望了其发展前景。     

乘客等待条件下的电梯优化调度模型

对多部电梯进行综合调控管理具有广泛的现实意义,本文提出了在乘客等待条件下的电梯调度问题,以作为上班高峰期电梯优化调度的一种近似。并利用概率论的方法得到了电梯往返运行一次的平均时间,建立了电梯优化调度的数学模型,且采用动态规划的方法求得了乘客在等待条件下的最优调度方案,并对实例进行了计算。     

基于语义激活的智能图形处理系统

全面分析了目前知识处理系统所存在的弊病,提出了下一代语义激活系统,探讨了新一代知识系统所应提供的服务;并将之运用于图形处理系统,阐明了图形数据从统一表示到有效存储、建模、再现和检索等一系列智能处理过程;进而提出了图形信息的语义表示和智能推理模型.