Synthesis of Rice Processing Plants. I. Development of Simplified Models

This article, the first of three articles on the synthesis of rice processing plants, focuses on the development of simplified mathematical models necessary for use in optimizing rice processing plants. The second concentrates on the optimal synthesis of a rice plant and the third on the sensitivity of the optimization to uncertainty in model parameters. Existing models for rice processing unit operations are not suitable for flowsheet optimization and new models need to be developed to overcome numerical difficulties that occur in optimization applications, specifically in mixed integer nonlinear programming (MINLP) applications. Simplified models of the drying, cooling, and tempering units are developed. In addition head rice yield models, used as a quality indicator, energy consumption, and economic models were also developed. Naturally, the new models exhibit some mismatch with respect to the existing models from which they were developed. However, a sensitivity analysis, presented in Part III, has shown that the optimal flowsheet structure was not sensitive to a lack of fit between the simplified and complex models. The simplified models were found adequate to be appropriate for use at the synthesis stage.     

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 Symbolic Pole/Zero Extraction Methodology Based on Analysis of Circuit Time-Constants

This paper introduces a methodology for symbolic pole/zero extraction based on the formulation of the time-constant matrix of the circuits. This methodology incorporates approximation techniques specifically devoted to achieve an optimum trade-off between accuracy and complexity of the symbolic root expressions. The capability to efficiently handle even large circuits will be demonstrated through several practical circuits.     

开流形的曲率与拓扑

应用比较几何的方法研究了完备非紧且具有特定曲率条件的黎曼流形，证明了在一定Pinching条件限制下，流形具有有限拓扑型或者微分同胚于R^n。     

Automating the identification and analysis of protein {beta}-barrels

ßBarrels are widespread and well-studied featuresof a great many protein structures. In this paper an unsuper-visedmethod for the detection of P-barrels is developed based ontechniques from graph theory. The hydrogen bonded connectivityof ß-sheets is derived using standard pattern recognitiontechniques and expressed as a graph. Barrels correspond to topologicalrings in these connectivity graphs and can thus be identifiedusing ring perception algorithms. Following from this, the characteristictopological structure of a barrel can be expressed using a novelform of reduced nomenclature that counts sequence separationsbetween successive members of the ring set These techniquesare tested by applying them to the detection of barrels in anon-redundant subset of the Brookhaven database. Results indicatethat topological rings do seem to correspond uniquely to ß-barrelsand that the technique, as implemented, finds the majority ofbarrels present in the dataset.     

A Novel Topological Index F and Its Correlation With Standard Formaton Enthalpies of AB_n(g) Molecules

The topological index F* is defined and obtained by the method of a non-dimensional unit calculation in which three matrices multiply with each other. These matrices represent the connective cases of atoms in a molecule, the structural features of atoms on top and the bonded cases of the adjacent atoms respectively. The standard formation enthalpies of ABn(g) molecules were correlated with F'* (A = C, Al, Si, Ti, Zr, B = F, Cl, Br, I, H, n=1 -4) and these correlation coefficients are all more than 0.96. Some molecules (e.g CH4, SiH4,etc. )can be preferably handled by F* but can not be dealt with by other topological indices. By contrast to traditional hydrogen suppressed graph, the contribution of hydrogen atoms to structures and properties of molecules is considered.     

模拟电路的模块级故障诊断

本文以多端口元件或子网络为基本单元，提出了一种模块级故障诊断方案，这种方案的故障模型更符合电路的实际情况，因而具有更广泛的实际意义，文中首先推导了模块故障诊断议程，并对模块故障可测性问题进行了一般性讨论。然后，给出了模块故障可测的几个拓扑条件，并通过定义广义独立通路使这些拓扑条件适用于一般的非互易网络。     

光学全交叉网络与SW榕树（F＝S＝2）网络拓扑等价的多样性

本文对有关互连网络拓扑等价的分析方法作了简单评述。并采用互连网络拓扑等价的图分析法分析了自由空间光学互连全交叉网络与ＳＷ榕树网络的拓扑等价及其多样性，拓展了全交叉网络在数字光计算、光子交换及多处理机系统的潜在应用。     

Mesh Simplification Based on Super-Face and Genetic Algorithm in Reverse Engineering

Mesh simplification is one of the most important links in the context of reverse engineering. It is also an important consideration in computer graphics. This paper presents a novel and original method of triangular mesh reduction. A new concept of super-face is defined. In order to construct a super-face, a way to calculate the scattered point curvature is discussed. The growth of a seed point and the combination of different regions are also necessary for the construction of a super-face. When the hole left by the deletion of super-face is retriangulated a genetic algorithm is used that has been modified for our specific problem. Then the different weights to balance the optimisation of the new triangular mesh can be adjusted.     

Image segmentation towards new image representation methods

Very low bit-rate video coding has recently become one of the most important areas of image communication and a large variety of applications have already been identified. Since conventional approaches are reaching a saturation point, in terms of coding efficiency, a new generation of video coding techniques, aiming at a deeper “understanding” of the image, is being studied. In this context, image analysis, particularly the identification of objects or regions in images (segmentation), is a very important step. This paper describes a segmentation algorithm based on split and merge. Images are first simplified using mathematical morphology operators, which eliminate perceptually less relevant details. The simplified image is then split according to a quad tree structure and the resulting regions are finally merged in three steps: merge, elimination of small regions and control of the number of regions.