The normal of a fractal surface

  We have discovered a class of fractal functions that are differentiable. Fractal interpolation functions have been used for over a decade to generate rough functions passing through a set of given points. The integral of a fractal interpolation function remains a fractal interpolation function, and this new fractal interpolation function is differentiable. Tensor products of pairs of these fractal functions form fractal surfaces with a well-defined tangent plane. We use this surface normal to shade fractal surfaces, and demonstrate its use with renderings of fractal mirrors.     

不确定离散时滞系统的保性能控制

针对一类具有范数有界不确定性和状态滞后的离散时间线性系统,结合一个二次型 性能指标,采用线性矩阵不等式方法,提出了无记忆状态反馈保性能控制律的存在条件,并利 用一个线性矩阵不等式的解给出了保性能控制律的一个参数化表示.     

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     

A knowledge-based approach for handling exceptions in business processes

This paper describes a novel knowledge-based methodology and toolset for helping business process designers and participants better manage exceptions (unexpected deviations from an ideal sequence of events caused by design errors, resource failures, requirement changes, etc.) that can occur during the enactment of a process. This approach is based on an on-line repository exploiting a generic and reusable body of knowledge, which describes what kinds of exceptions can occur in collaborative work processes, how these exceptions can be detected, and how they can be resolved. This work builds upon previous efforts from the MIT Process Handbook project and from research on conflict management in collaborative design. This revised version was published online in July 2006 with corrections to the Cover Date.     

Early design stage exploration of fixed-length block structured architectures

An important challenge concerning the design of future microprocessors is that current design methodologies are becoming impractical due to long simulation runs and due to the fact that chip layout considerations are not incorporated in early design stages. In this paper, we show that statistical modeling can be used to speed up the architectural simulations and is thus viable for early design stage explorations of new microarchitectures. In addition, we argue that processor layouts should be considered in early design stages in order to tackle the growing importance of interconnects in future technologies. In order to show the applicability of our methodology which combines statistical modeling and processor layout considerations in an early design stage, we have applied our method on a novel architectural paradigm, namely a fixed-length block structured architecture. A fixed-length block structured architecture is an answer to the scalability problem of current architectures. Two important factors prevent contemporary out-of-order architectures from being scalable to higher levels of parallelism in future deep-submicron technologies: the increased complexity and the growing domination of interconnect delays. In this paper, we show by using statistical modeling and processor layout considerations, that a fixed-length block structured architecture is a viable architectural paradigm for future microprocessors in future technologies thanks to the introduction of decentralization and a reduced register file pressure.     

Weighted modeling of the probability of monotone failure of a system with substantially different reliability characteristics of its elements

The probability of monotone system failure on a fixed time interval is studied. The failure and repair distribution functions are assumed to be of a general form. A new accelerated simulation method is proposed, which makes it possible to investigate systems consisting of components with essentially different reliability characteristics. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 45–54, March–April, 2000.     

Modeling and analysis of wormhole formation in reactive dissolution of carbonate rocks

A two-scale continuum model is used to simulate reactive dissolution of carbonate rocks in radial flow. The three main types of patterns observed in linear and radial flow experiments, namely, compact, wormhole and uniform patterns are numerically simulated. The fractal nature of wormholes observed in laboratory experiments is established and confirmed through simulations and the fractal dimension is quantitatively matched. The dependence of wormhole fractal dimension, optimum injection rate and minimum pore volumes required to breakthrough the medium on heterogeneity magnitude and aspect ratio is investigated. A new criterion to predict the optimum injection rate for wormhole formation in radial flow is derived and validated. It is observed that the wormhole penetration depth increases with injection time as t^b, where the exponent b is found to be approximately 0.66, as observed in the experiments. A critical level of heterogeneity magnitude seems to exist below which the minimum pore volumes required to breakthrough are much higher.     

基于流域系统的三维地形建模

三维地形建模是虚拟现实技术的基础.对于流域内具有海量数据特征的地形,如何构建既能提供良好视觉效果,又有较高渲染效率的三维地形是建模的关键.现以“数字珠江三维系统”的构建为例,通过多比例尺地形嵌套建模的方法,有效解决了海量地形数据实时显示问题,同时阐述了无缝嵌套方法生成具有高度真实感的三维地形的步骤,为流域三维地形生成提供了解决方案.     

素描大师艺术的差异性表现与传承

契斯恰科夫与安格尔都是19世纪美术史上出现过的学院派素描大师,他们的素描作品影响着古今中外众多艺术学子．他们都强调素描的重要性,也师出同源,而他们后来的画风却融入了自己对素描艺术的理解,形成了彼此不同的差异表现．文中通过结合两人的艺术言论,对照两人素描作品中对绘画角度选择、表现手法、造型方式以及对形体塑造的理解和表达来探析一脉相承下的学院派素描大师的艺术差异性表现的原因和特色,旨在理清素描表现体系的差异．     

斑马鱼A型γ-氨基丁酸受体同源模建及分子对接

为了研究杀虫剂氟虫腈对斑马鱼的毒性机理,以秀丽隐杆线虫谷氨酸受体[在蛋白质数据库（ProteinDataBank,PDB）登记号为3RHW]作为模板,通过蛋白质同源模建的方法构建了斑马鱼A型γ-氨基丁酸受体跨膜段,利用分子动力学和拉氏图验证了模型的合理性．将构建的模型与氟虫腈及其衍生物进行分子对接．氟虫腈及其衍生物与跨膜蛋白对接结果在分子水平上解释了氟虫腈对斑马鱼的毒性机理：10个不同构象的氟虫睛与跨膜蛋白对接各个打分和结合自由能都比较稳定,氟虫腈垂直地定位于跨膜段的胞质端,跨膜蛋白上28位天冬酰胺和38位精氨酸与氟虫腈分子产生氢键;苯环上的取代基CF3,CI,CI和吡唑环上取代基SOCF2或SO2CF3是产生毒性作用的重要基团;基于氟虫腈结构虚拟筛选的化合物与跨膜蛋白的对接结果也进一步验证了,上述结论．