Stochastic system transformation using generalized orthonormal basis functions with applications to continuous-time system identification

This paper studies the system transformation using generalized orthonormal basis functions that include the Laguerre basis as a special case. The transformation of the deterministic systems is studied in the literature, which is called the Hambo transform. The aim of the paper is to develop a transformation theory for stochastic systems. The paper establishes the equivalence of continuous and transformed-discrete-time stochastic systems in terms of solutions. The method is applied to the continuous-time system identification problem. It is shown that using the transformed signals the PO-MOESP subspace identification algorithm yields consistent estimates for system matrices. An example is included to illustrate the efficacy of the proposed identification method, and to make a comparison with the method using the Laguerre filter.     

Fuzzy functions with LSE

“Fuzzy Functions” are proposed to be determined by the least squares estimation (LSE) technique for the development of fuzzy system models. These functions, “Fuzzy Functions with LSE” are proposed as alternate representation and reasoning schemas to the fuzzy rule base approaches. These “Fuzzy Functions” can be more easily obtained and implemented by those who are not familiar with an in-depth knowledge of fuzzy theory. Working knowledge of a fuzzy clustering algorithm such as FCM or its variations would be sufficient to obtain membership values of input vectors. The membership values together with scalar input variables are then used by the LSE technique to determine “Fuzzy Functions” for each cluster identified by FCM. These functions are different from “Fuzzy Rule Base” approaches as well as “Fuzzy Regression” approaches. Various transformations of the membership values are included as new variables in addition to original selected scalar input variables; and at times, a logistic transformation of non-scalar original selected input variables may also be included as a new variable. A comparison of “Fuzzy Functions-LSE” with Ordinary Least Squares Estimation (OLSE)” approach show that “Fuzzy Function-LSE” provide better results in the order of 10% or better with respect to RMSE measure for both training and test cases of data sets.     

An Efficient Solution for Model Checking Graph Transformation Systems

This paper presents an efficient solution for modeling checking graph transformation systems. The approach transforms AGG specifications into Bogor models and supports both attributed typed graphs and layered transformations. Resulting models are amenable to check interesting properties expressed as combinations of LTL (Linear Temporal Logic) and graph transformation rules. The first experimental results are encouraging and show that in most cases our proposal improves existing approaches, both in terms of performance and expressiveness.     

Hierarchical grid conversion

Hierarchical grids appear in various applications in computer graphics such as subdivision and multiresolution surfaces, and terrain models. Since the different grid types perform better at different tasks, it is desired to switch between regular grids to take advantages of these grids. Based on a 2D domain obtained from the connectivity information of a mesh, we can define simple conversions to switch between regular grids. In this paper, we introduce a general framework that can be used to convert a given grid to another and we discuss the properties of these refinements such as their transformations. This framework is hierarchical meaning that it provides conversions between meshes at different level of refinement. To describe the use of this framework, we define new regular and near-regular refinements with good properties such as small factors. We also describe how grid conversion enables us to use patch-based data structures for hexagonal cells and near-regular refinements. To do so, meshes are converted to a set of quadrilateral patches that can be stored in simple structures. Near-regular refinements are also supported by defining two sets of neighborhood vectors that connect a vertex to its neighbors and are useful to address connectivity queries.     

Making XML document markup international

In name and in practice, the World‐Wide Web (hereafter Web) is used around the World beyond English‐speaking areas. This creates a tremendous need to internationalize standard terminology used in the technologies that make the Web possible. Existing efforts on XML internationalization (i18n) and localization (i10n) have focused on the content of XML documents instead of the terms used in markup (annotations) such as elements and attributes. The SGML standard ISO 8879 supports the use of Unicode (ISO 10646) throughout a document, including markups. However, most elements and attributes of XML documents are still defined in English, thereby limiting their use among non‐English speakers. This paper presents an XSLT‐based method that can completely localize the markup of XML documents into different natural languages. We also describe how the proposed technique can be applied to translation problems in programming (e.g. C and Java) or documentation (e.g. LAT_EX or other formatting languages) so that a program or a document can be converted to and from an XML format. Copyright © 2004 John Wiley & Sons, Ltd.     

An Invasive Composition System for Local-to-Global Transformations

Transformation systems are particularly well suited to implement modular rules, transforming one language feature of the source language into a single or a composition of language features of the target language. However, in practice, transformation rules must be written which take one language feature and transform them into several language features belonging to various locations in the output program. The implementation of these so-called local-to-global transformations with rewrite rules is very complex and tightly coupled which imposes severe constraints on maintenance and evolvability. The four main coupling problems of the current-day implementations are presented and we indicate how these can be eliminated and reduced by our extension of the rewrite rule system. Furthermore we show how complex invasive compositions can be solved by abstract, reusable algorithms and mechanisms, rendering the implementation of local-to-global transformations into a semi-automatic process.     

天蚕丝的热分析与分子结构

本文应用热分析(DTA,TG和TMA)、红外光谱和氨基酸分析等测试手段,对天蚕丝的热性能和分子结构进行了研究,综合分析讨论了天蚕丝热反应的三个阶段、相变和结构特征。     

动视点的等视角变换

文章探讨了一种为二次变换的动视点的等视角变换,该变换能把直线或二次曲线变换成二次曲线或直线。文中对变换的基本性质、直线与二次曲线以及二次曲线与二次曲线的对应关系作了较详细地论述。     

Unsaturated Soil Seepage Analysis Using a Rational Transformation Method with Under-Relaxation

The finite-element method provides a convenient and effective means for solving problems of seepage in unsaturated soils. However, convergence difficulties exist in numerical simulations of unsaturated flow analyses because of the high nonlinearity of the soil hydraulic properties. This technical note presents a combination approach consisting of a rational function transformation method and a common under-relaxation technique to solve the h-based form of Richards equation. Numerical studies show that this combined method can use a larger time step and corresponding oscillation-free mesh size to produce acceptable results and also converge to a stable solution quickly in each time step.     

A note on the justification of landsat data transformations

This paper discusses the mathematical justification for Landsat data transformations. The results are based upon an atmospheric radiation transfer equation given by Turner (5). Several proposed data transformations are discussed and evaluated in light of these justifications.