条件概率关系数据库模型

现实世界中大量存在着的不确定性信息，关系数据库模型仅视它们为空值，有必要增强其处理这类信息的能力，文章在总结前人工作的基础上推广关系数据库模型，创建有效处理随机型不确定性信息的条件概念关系数据库模型，该模型通过在关系模式中增加一个条件概率测度属性，为每条记录指定适当的条件概率的途径，来表示不确定性信息。文中以对象码为基本工具，创建了条件概率关系结构；以特征函数为基本工具，定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛，灵活，因而该模型能有效克服概率关系模型的许多不足。     

城市形象的建筑环境美学设计问题

城市形象是创造富于个性化城市的关键,而建筑环境美学设计水准则是体现城市形象的要素之一。据此,作者从分析中国城市形象的美学误区出发,研究了不同城市建筑品位的形成特点,进而提出塑造好宜人城市美学空间的科学思考。     

基于地理信息系统的天津房地产管理数据库

从地理信息系统CIS的组成开始．提出该类系统的组织与管理方法，同时重点介绍了在现阶段开发该类系统时所使用的高端技术，最后对GIS系统的发展趋势作出分析与顶测。     

神经网络在缺陷识别中的应用

为了准确、快速地进行缺陷识别，介绍了一种新型的前馈神经网络模型，即径向基概率神经网络。与以往的算法相比，该方法具有分类识别精度高且速度快的优点。仿真获得了很好的结果。     

Forced Vertical Vibration of Circular Plate in Multilayered Poroelastic Medium

This paper considers the vertical vibrations of an elastic circular plate in a multilayered poroelastic half space. The plate is subjected to axisymmetric time–harmonic vertical loading and its response is governed by the classical thin-plate theory. The contact surface between the plate and the multilayered half space is assumed to be smooth and either fully permeable or impermeable. The half space under consideration consists of a number of layers with different thicknesses and material properties and is governed by Biot’s poroelastodynamic theory. The vertical displacement of the plate is represented by an admissible function containing a set of generalized coordinates. Contact stress and pore pressure jump are established in terms of generalized coordinates through the solution of flexibility equations based on the influence functions corresponding to vertical and pore pressure loading. Solutions for generalized coordinates are obtained by establishing the equation of motion of the plate through the application of Lagrange’s equations of motion. Selected numerical results are presented to portray the influence of various parameters on dynamic interaction between an elastic plate and a multilayered poroelastic half space.     

Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem

Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search.     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.     

Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method

State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard, the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP to be analysed for larger parameter values. Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree University of Technology. Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927).     

盐井水平对接钻井技术

钻一口通过主采盐层的水平井与已完成的直井对接，形成连通井(形如“U”字)，一口井注水溶解盐／芒硝矿，另一口井采出卤水，这是盐化工业对钻井提出的要求。针对水平对接盐井井身轨迹设计、着陆段、水平段的轨迹控制和连通技术，介绍了水平段侧钻时的钻井液技术。     

Markov analysis of qualitative dynamics1

Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient.