Thermal Bending Analysis of Doubly Curved Composite Laminated Shell Panels with General Boundary Conditions and Laminations

Thermal bending analysis of doubly curved laminated shell panels with general boundary conditions and laminations is presented. The equations of equilibrium are derived in the form of two coupled sets of ordinary differential equations based on a general shell theory and solved through the state-space approach in a repeated manner. It is depicted that the results of the present method are in great agreement with analytical solutions. Cylindrical shell panels with general boundary conditions and laminations, where no analytical solution is available, are solved. It is found that the present method exhibits a high convergence rate as well as presenting accurate results in all cases.     

以IBAC为核心处理洗浴废水的试验研究

根据洗浴废水的水质特征,采用原水→混凝沉淀-过滤→固定化生物活性炭(Immobilized Biological Activated Carbon,IBAC)→微滤膜(MF)→UV消毒→出水的工艺流程.混凝沉淀-过滤物化预处理单元可以有效地减少洗浴废水中的各类污染物.IBAC生化处理单元,实现有机污染物、LAS、浴臭等有效去除,是保证出水合格的根本措施.微滤膜发挥物理截留作用、UV消毒杀死细菌和总大肠菌群.出水水质达到＜城市供水水质标准＞(CJ/T 206-2005).     

基于服务器端会话追踪的Web查询服务的研究

在探讨了Web查询服务的典型模型后,论文阐述了服务器端会话追踪机制的实现方式,设计了基于服务器端会话追踪的Web查询服务的典型解决方案。该设计方案可以较为安全地保存和维护客户的上下文信息,可靠地跟踪用户查询所处的状态,有效地实现有状态的Web查询服务。     

A survey of parallel execution strategies for transitive closure and logic programs

An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods. Recommended by: Patrick Valduriez     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

Qualitative representation of spatial knowledge in two-dimensional space

Various relation-based systems, concerned with the qualitative representation and processing of spatial knowledge, have been developed in numerous application domains. In this article, we identify the common concepts underlying qualitative spatial knowledge representation, we compare the representational properties of the different systems, and we outline the computational tasks involved in relation-based spatial information processing. We also describesymbolic spatial indexes, relation-based structures that combine several ideas in spatial knowledge representation. A symbolic spatial index is an array that preserves only a set of spatial relations among distinct objects in an image, called the modeling space; the index array discards information, such as shape and size of objects, and irrelevant spatial relations. The construction of a symbolic spatial index from an input image can be thought of as a transformation that keeps only a set of representative points needed to define the relations of the modeling space. By keeping the relative arrangements of the representative points in symbolic spatial indexes and discarding all other points, we maintain enough information to answer queries regarding the spatial relations of the modeling space without the need to access the initial image or an object database. Symbolic spatial indexes can be used to solve problems involving route planning, composition of spatial relations, and update operations.     

A semantic modeling approach for image retrieval by content

We introduce a semantic data model to capture the hierarchical, spatial, temporal, and evolutionary semantics of images in pictorial databases. This model mimics the user's conceptual view of the image content, providing the framework and guidelines for preprocessing to extract image features. Based on the model constructs, a spatial evolutionary query language (SEQL), which provides direct image object manipulation capabilities, is presented. With semantic information captured in the model, spatial evolutionary queries are answered efficiently. Using an object-oriented platform, a prototype medical-image management system was implemented at UCLA to demonstrate the feasibility of the proposed approach.     

Building a user model implicitly from a cooperative advisory dialog

This paper reviews existing methods for building user models to support adaptive, interactive systems, identifies sigificant problems with these approaches, and describes a new method for implicitly acquiring user models from an ongoing user-system dialog. Existing explicit user model acquisition methods, such as user edited models or model building dialogs put additional burden on the user and introduce artificial model acquisition dialogs. Hand coding stereotypes, another explicit acquisition method, is a tedious and error-prone process. On the other hand, implicit acquisition techniques such as computing presuppositions or entailments either draw too few inferences to be generally useful, or too many to be trusted.In contrast, this paper describes GUMAC, a General User Model Acquisition Component that uses heuristic rules to make default inferences about users' beliefs from their interaction with an advisory expert system. These rules are based on features of human action and conversation that constrain people's behavior and establish expectations about their knowledge. The application of these rules is illustrated with two examples of extended dialogs between users and an investment advisory system. During the course of these conversations, GUMAC is able to acquire an extensive model of the users' beliefs about the aspects of the domain considered in the dialog. These models, in turn, provide the sort of information needed by an explanation generator to tailor explanations the advisory system gives to its users.     

A comparison of backpropagation and general regression neural networks in quantative trace metal analysis using anodic stripping voltammetry and cybernetic instrumentation

A comparison is made between backpropagation and general regression neural networks for the prediction of parts per billion lead concentration when used to process data obtained from digested curry powder by the electrochemical analysis method of differential pulse, anodic stripping at a thin film mercury electrode (TFME). Two data sets are used, one requiring the net to classify an unknown analytical data vector into one of a number of previously learnt concentrations, and one requiring the net to predict the probable concentration of an unknown sample by interpolation of the already learnt concentrations. For both of these data sets the general regression neural network is shown to train faster and to provide results superior to those obtained by backpropagation.     

DB2数据库查询优化策略

数据库的查询优化是改善应用程序性能的重要手段。通过分析IBM DB2数据库系统的最优化处理器的工作原理,对查询性能影响较大的统计信息更新、索引建立、SQL查询语句构造3个方面提出具体优化建议。建立了一套完整的测试方案,对每一条优化建议都使用具体SQL语句进行严格的验证。开发者要注意分析查询语句的时间开销和空间开销,才能写出较优的查询语句。