Obtaining shorter regular expressions from finite-state automata

We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping.     

乌江渡水电站扩建工程开挖爆破对原水电站建筑物震动影响的控制研究

为确保原有的乌江渡水电站水工建筑物和发电设备以及扩建工程建筑物的施工安全,加快扩建工程施工进度,本扩建工程施工中对关键部位开挖所产生的爆破震动影响实施全面而有效的实时爆破监控,并根据监控成果的研究指导开挖爆破作业,以确定符合实际的安全爆破震动参数。     

Structured document storage and refined declarative and navigational access mechanisms in HyperStorM

The combination of SGML and database technology allows to refine both declarative and navigational access mechanisms for structured document collection: with regard to declarative access, the user can formulate complex information needs without knowing a query language, the respective document type definition (DTD) or the underlying modelling. Navigational access is eased by hyperlink-rendition mechanisms going beyond plain link-integrity checking. With our approach, the database-internal representation of documents is configurable. It allows for an efficient implementation of operations, because DTD knowledge is not needed for document structure recognition. We show how the number of method invocations and the cost of parsing can be significantly reduced. Edited by Y.C. Tay. Received April 22, 1996 / Accepted March 16, 1997     

Stress testing of compilers for modula-2

During standardization discussions on Modula-2 the question was raised whether the future standard should need a clause stating a set of minimal requirements for conforming implementations regarding the ‘structuredness’ of lexical, syntactical and run-time constructs in programs written in this language. It was decided to test a number of compilers to find their actual limits on the structuredness of some of these constructs. The test results do not only show these limits, but the inability of some compilers to handle large and complex inputs is shown as well.     

Review of Language in the Americas.

Reviews the book, Language in the Americas by Joseph H. Greenberg (1987). Greenberg's work on universals of language has crossed disciplinary boundaries to become known to many psychologists interested in language. His equally important work in language classification, of which Language in the Americas is one part, remains unfamiliar to psychologists. This book is a pioneering work in that it is the first genetic classification of the indigenous languages of both North and South America. Greenberg maintains that all of the languages of the Americas belong to three families: Eskimo-Aleut, Na-Dene, and a family that he has named Amerind. This assertion is both important and controversial; the controversy lies in the grouping of most of the languages including all of those of South and Central America into the Amerind family. Most of Language in the Americas consists of the Amerind etymological dictionary, arranged so that the reader can assess lexical similarities within and between subgroups. Greenberg's discussion is informed, articulate, profound, and to the point. He draws on relevant sources and examples from diverse fields of knowledge. The depth and breadth of his scholarship and the clarity of his presentation create a work that is an intellectual pleasure to read. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

热处理工艺对冲击曲线的影响

通过ＳＡ５１５Ｇｒ．７０钢的不同温度正火和１３ＭｎＮｉＭｏＮｂＲ钢正火不同温度回火试样的示波冲击试验，研究了不同热处理工艺对冲击曲线的影响。     

MetateM: An introduction

In this paper a methodology for the use of temporal logic as an executable imperative language is introduced. The approach, which provides a concrete framework, calledMetateM, for executing temporal formulae, is motivated and illustrated through examples. In addition, this introduction provides references to further, more detailed, work relating to theMetateM approach to executable logics.     

A translator system for the MATLAB language

A whole‐program MATLAB to C translation system is presented. The paper outlines the motivation for the problem, discusses the system's architecture, its features and limitations. The translator's operation is explained using an example input program. Details are given on how the system implements and specializes some of the language's built‐in primitives. Finally, the paper reports measurements evaluating the execution time and memory usage of the translated sources, and the compilation time required for the translations. Copyright © 2006 John Wiley & Sons, Ltd.     

空间环型区域上的关联函数

本文利用锥函数方法，给出空间环型区域上关联函数的一种计算方法。