Management of multidimensional discrete data

Spatial database management involves two main categories of data: vector and raster data. The former has received a lot of in-depth investigation; the latter still lacks a sound framework. Current DBMSs either regard raster data as pure byte sequences where the DBMS has no knowledge about the underlying semantics, or they do not complement array structures with storage mechanisms suitable for huge arrays, or they are designed as specialized systems with sophisticated imaging functionality, but no general database capabilities (e.g., a query language). Many types of array data will require database support in the future, notably 2-D images, audio data and general signal-time series (1-D), animations (3-D), static or time-variant voxel fields (3-D and 4-D), and the ISO/IEC PIKS (Programmer's Imaging Kernel System) BasicImage type (5-D). In this article, we propose a comprehensive support ofmultidimensional discrete data (MDD) in databases, including operations on arrays of arbitrary size over arbitrary data types. A set of requirements is developed, a small set of language constructs is proposed (based on a formal algebraic semantics), and a novel MDD architecture is outlined to provide the basis for efficient MDD query evaluation.     

How disorder can diminish avalanche risks: effect of size distribution

We study the behavior of disk assemblies with a variable disorder distribution. The packing is first consolidated and then continuously tilted very slowly. The amount of displaced disks for each tilted angle is recorded. Large displacements of the disks can occur due to some local or global mechanical instabilities. The definition of neighboring disks is based on radical (extension of Voronoï) tessellation rules to decompose, in a unique and perfectly defined manner, the two-dimensional space for polydisperse disks. In this way, by comparing the characteristics of stability for one disk to the neighboring ones for local ordered cluster, we can predict the global amount of displaced disks. Some tilting cycles have been performed to check the correlation between the instability of the packing structure (collective displacements) with micro and macro order parameters.     

Fault tolerance in cellular automata at high fault rates

A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the case we treat in this paper. We are concerned with the degree (the number of neighboring cells on which the state transition function depends) needed to achieve fault tolerance when the fault rate is high (nearly 1/2). We consider both the traditional transient fault model (where faults occur independently in time and space) and a recently introduced combined fault model which also includes manufacturing faults (which occur independently in space, but which affect cells for all time). We also consider both a purely probabilistic fault model (in which the states of cells are perturbed at exactly the fault rate) and an adversarial model (in which the occurrence of a fault gives control of the state to an omniscient adversary). We show that there are cellular automata that can tolerate a fault rate 1/2−ξ (with ξ>0) with degree O((1/ξ²)log(1/ξ)), even with adversarial combined faults. The simplest such automata are based on infinite regular trees, but our results also apply to other structures (such as hyperbolic tessellations) that contain infinite regular trees. We also obtain a lower bound of Ω(1/ξ²), even with only purely probabilistic transient faults.     

模拟退火遗传算法的轮廓线拼接研究

基于断层数据的三维重构是三维数据场可视化技术的主要研究内容,重构物体的三维模型也是分析、仿真的前提.应用模拟退火遗传算法设计和实现了三维物体表面重建算法.通过在遗传算法中融人退火处理操作,提高了种群的多样性,避免了遗传算法中存在的早熟收敛问题,有效地增强了算法的全局寻优能力.此外,提出了一种基于边的最小交叉多边形算法,提高了交叉操作效率.根据轮廓线拼接问题的特点,设计了针对性强的交叉、变异操作.实验结果表明,算法有效地提高了传统的全局法轮廓线拼接算法的效率.     

微孔结构对PMI泡沫准静态压缩性能的影响

基于BBC点集建立了聚甲基丙烯酰亚胺(PMI)闭孔泡沫的Kelvin十四面体模型和Laguerre模型,并采用有限元方法研究了其在准静态载荷作用下的压缩性能。分析了孔径大小、泡孔体积离散系数对压缩弹性模量、初始峰值应力和能量吸收能力的影响。结果表明:Kelvin十四面体模型可以较好地预测PMI泡沫的压缩弹性模量和峰值应力;在相同相对密度条件下,小孔径泡沫的初始峰值应力和能量吸收能力均高于大孔径泡沫,而压缩弹性模量则低于大孔径泡沫;随着泡孔体积离散系数的增大,闭孔PMI泡沫压缩弹性模量、初始峰值应力和能量吸收能力均减小。     

影响RNA芯片探针杂交效率的因素分析

RNA芯片作为研究ncRNA的主要技术之一,已受到广泛关注。然而因RNA芯片中靶序列的单链特征,使得RNA芯片的探针设计比DNA复杂。本研究对加强型绿色荧光蛋白（EGFP）RNA序列进行覆瓦式探针设计,制作了RNA原位合成芯片,研究探针／靶序列杂交双链△G和Tm、靶序列二级结构以及探针的末端碱基对RNA芯片杂交信号强度的影响。结果表明,探针／靶序列杂交双链△G和Tm相同的探针间的杂交信号存在较大差异,探针／靶序列杂交双链△G和,Tm与RNA芯片杂交信号之间未发现明显的规律性;靶序列二级结构的探针PT-sc参数与芯片杂交信号强度间呈较好的线性关系;探针5’末端碱基组成对芯片杂交信号强度也有影响,5’末端碱基为6／C的探针杂交信号总体上高于其邻近的5’末端碱基为A／T的探针的杂交信号,为RNA芯片的探针筛选提供一定的理论基础。     

Flocking based distributed self-deployment algorithms in mobile sensor networks

In this paper, we address a novel deployment problem in isotropic mobile sensor networks. Sensors are to be relocated uniformly in a region of interest (ROI) centered at a target of interest (TOI) which could be stationary or mobile. With the assumption that relative direction of a sensor to the TOI can be recognized or inferred by devices equipped in the sensor, distributed control algorithms based on first-order and second-order dynamic models are proposed for both stationary and mobile TOI situations. The Lyapunov stabilities and coverage guarantee are provided. To further improve the deployment such as coverage holes inside the network and uniformity of the deployment, four assisted rules are also proposed. Then algorithms proposed for the situation of a stationary TOI are extended to anisotropic sensor networks. Simulations demonstrate the effective performances of the proposed algorithms.     

Decidability and undecidability in cellular automata

We survey results on decidability questions concerning cellular automata. Properties discussed include reversibility and surjectivity and their variants, time-symmetry and conservation laws, nilpotency and other properties of the limit set and the trace, properties chaoticity related such as sensitivity to initial conditions and mixing of the space, and dynamics from finite initial configurations. We also discuss briefly the tiling problem and its variants, and consider the influence of the dimension of the space on the decidability status of the questions.     

基于质心Voronoi结构的自由曲面布点策略

借鉴已有质心Voronoi结构网格规划的技巧,将自由曲线曲面的曲率函数作为生成质心Voronoi结构中的密度函数,并以成本函数收敛性作为算法结束的准则,提出了一种新的基于质心Voronoi结构的采样方法。采用本文方法实现了采样点的自适应分布,并通过仿真实验与传统采样方法进行了对比验证,结果表明,本文方法相对于一般自由曲面来讲是稳定的、高效的。     

Efficient surface reconstruction from contours based on two‐dimensional Delaunay triangulation

This paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the two‐dimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general framework. Natural distance interpolations are performed in order to complete the mapping of the added intermediate points. Surface smoothing and remeshing are conducted to optimize the initial surface triangulations. Several examples are presented to demonstrate the effectiveness and efficiency of the proposed approach. Copyright © 2005 John Wiley & Sons, Ltd.