运用社会主义市场经济规律加快水利基础产业的发展

水利作为基础产业,一个基本要求就是要自我维持,自我发展,这就要求人们树立强烈的紧迫感、危机感和赶超意识,按照社会主义市场经济要求,建立水利良性发展机制,调整水利产业结构,大力兴办经济实体,发展壮大水利经济实力,形成水利为社会,社会办水利的新格局。     

Manufacturing and structural safety evaluation of a composite train carbody

This paper explains the manufacturing process of a composite train carbody with a sandwich composite structure for bodyshell and a stainless steel structure for the under frame. In addition, the structural behavior and safety of the composite carbody of the Korean tilting train was investigated by the static load tests. From the test results, the stiffness of the composite carbody met the specified design. In the aspect of strength, the maximum stress of the composite bodyshell was of 12.2% of strength of CF1263 carbon/epoxy.     

OPC技术在过程控制中的应用

在简要介绍OPC技术原理的基础上,对OPC技术在罗克韦尔PLC5系列PLC及其相关软件与VB程序通信中的应用进行了研究,并通过实例说明了OPC服务器的配置方式及OPC客户端程序的实现方法。     

An efficient algorithm for mining frequent inter-transaction patterns

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude.     

电梯交通系统(Ⅰ)──电梯交通配置现状及发展

本文对国内外电梯交通配置设计现状及发展趋势作了论述。指出了由统计特性描述进入到采用专家系统和模糊规则的动态特性描述这一总的发展趋势。     

浅论建设项目投资控制的重点

建设项目控制的重点应放在投资决策和设计阶段中,否则会造成巨大的损失。这不仅需要人们改革组织结构和管理体制,更需要从根本上转变思想观念。     

Modal logic as metalogic

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.     

Supporting inconsistent rules in database systems

When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS).     

Artificial intelligence for BIM content management and delivery: Case study of association rule mining for construction detailing

The proliferation of Building Information Modeling (BIM) applications, in tandem with the extensive variation of building products, pose new demands on design and engineering firms to efficiently manage and reuse BIM content (i.e., data-rich parametric model objects and assembly details). Tasks such as classifying BIM objects, indexing them with meta-data (e.g., category), and searching digital libraries to load objects into models still plague practice with inefficient manual workflows. This research aims to improve the productivity of BIM content management and retrieval by developing an AI-backed BIM content recommender system. Using data from a case-study firm, this research extracted content from over 30,000 technical BIM views (e.g., plans, sections, details) in historical projects to build an unsupervised machine-learning prototype with association rule mining. This prototype explicated the strength of relationships among co-occurring BIM objects. Using this prototype as the backbone AI-engine in live BIM sessions, this research developed a context-aware recommender system that dynamically provides BIM users with a set of objects associable with their modeling context (e.g., type of view, existing objects in the model) and human–computer interactions (e.g., objects selected by the user). By mining association data from hundreds of historical projects, this development marks a departure from the existing prototypes that rely on explicit coding, recurring user input, or subjective ratings to recommend BIM content to users. The simulation and experimental implementation of this recommender system yielded high efficacy in predicting content needs and achieved significant savings in the time spent on conventional BIM workflows.