Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

Efficient simplex computation for fixture layout design

Fixture, to hold an object by making multiple contacts, is a fundamental tool in manufacturing. A fixture layout is an arrangement of contacts on an object’s surface. Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball centered at the origin. We present three different algorithms to compute such a simplex: a simple randomized algorithm, an interchange algorithm, and a branch-and-bound algorithm. We also present methods to combine different algorithms to improve the performance and highlight their performance on complex 3D models consisting of thousands of triangles. Our randomized algorithm computes a feasible fixture layout in linear time and is well-suited for real-time applications. The interchange algorithm computes an optimal simplex in linear time such that no single vertex can be changed to enlarge the simplex, and it provides a practical method for complex 3D objects. The branch-and-bound algorithm computes the largest simplex by using lower and upper bounds on the radius of the inscribed ball, by which the computation time is reduced by a factor of five in comparison with the brute-force search.     

合成氨工艺参数优化技术开发及应用

以氨净值为响应值,影响响应值的17个过程参数为变量,经逐步回归选入触媒温度左3,触媒温度左4,循环CH_4%,H/N,NH_3%(进口)5个过程参数建立预测方程,并根据该方程对响应值的拟合结果和误差分布对样本进行分类。在此基础上,采取图形显示技术和统计分析的方法对分类样本集的过程参数进行比对分析,由此获取优类信息制订优化的工艺参数方案,经仿真验证后用于指导合成氨装置的生产试验。试验结果与试验前的对照期比较,氨净值均值由13.86提高到14.54,吨氨气耗减少15.9887m~3,吨氨电耗减少15.8kWh,节能效益十分明显     

一种中文文档的非受限无词典抽词方法

本文提出了一种非受限无词典抽词模型,该模型通过自增长算法获取中文文档中的汉字结合模式,并引入支持度、置信度等概念来筛选词条。实验表明:在无需词典支持和利用语料库学习的前提下,该算法能够快速、准确地抽取中文文档中的中、高频词条。适于对词条频度敏感,而又对计算速度要求很高的中文信息处理应用,例如实时文档自动分类系统。     

Re-engineering of the design process for concurrent engineering

According to the requirements of concurrent engineering, three interdependency relationships (uncoupled relationship, coupled relationship and decoupled relationship) between design activities are presented in this paper. And the coupled relationship plays an important role in concurrent product design process. To represent the precedence relationships among design activities, a directed graph is used to describe the design process. And the interdependency relationship between activities is illustrated by a Design Structure Matrix which is the transpose of the accessibility matrix of the corresponding graph. Using the DSM, an algorithm of recognizing the coupled activities during the design process is presented. Moreover, an algorithm to figure out the order levels of activities during the design process is proposed. And both algorithms are illustrated with a die design example.     

用VB开发Duffing方程混沌动力学系统仿真软件

基于Lisual Basic6.0编制了杜芬（Duffing)方程混沌特性分析的仿真软件,利用该软件不仅可方便地显示该系统在相空间上的轨迹线图,而且可绘制时程曲线图、幅频图和庞加菜（Poincare)截面图等。软件操作简便,运行可靠。     

Locality-preserved maximum information projection.

Dimensionality reduction is usually involved in the domains of artificial intelligence and machine learning. Linear projection of features is of particular interest for dimensionality reduction since it is simple to calculate and analytically analyze. In this paper, we propose an essentially linear projection technique, called locality-preserved maximum information projection (LPMIP), to identify the underlying manifold structure of a data set. LPMIP considers both the within-locality and the between-locality in the processing of manifold learning. Equivalently, the goal of LPMIP is to preserve the local structure while maximize the out-of-locality (global) information of the samples simultaneously. Different from principal component analysis (PCA) that aims to preserve the global information and locality-preserving projections (LPPs) that is in favor of preserving the local structure of the data set, LPMIP seeks a tradeoff between the global and local structures, which is adjusted by a parameter alpha, so as to find a subspace that detects the intrinsic manifold structure for classification tasks. Computationally, by constructing the adjacency matrix, LPMIP is formulated as an eigenvalue problem. LPMIP yields orthogonal basis functions, and completely avoids the singularity problem as it exists in LPP. Further, we develop an efficient and stable LPMIP/QR algorithm for implementing LPMIP, especially, on high-dimensional data set. Theoretical analysis shows that conventional linear projection methods such as (weighted) PCA, maximum margin criterion (MMC), linear discriminant analysis (LDA), and LPP could be derived from the LPMIP framework by setting different graph models and constraints. Extensive experiments on face, digit, and facial expression recognition show the effectiveness of the proposed LPMIP method.     

H∞ ALMOST DISTURBANCE DECOUPLING FOR MIMO BILINEAR SYSTEMS

The H_∞ almost disturbance decoupling problem is considered. In this paper, a nonlinear design is proposed to find a state feedback controller for bilinear systems. The closed‐loop system is internally stable and achieves disturbance attenuation in nonlinear H_∞ sense. We defined a special form of Lyapunov function, which is constructed in terms of one or a set of positive definite constant matrices. If, except of the origin of system, the corresponding polynomial of the positive definite matrix (or several polynomials relevant to the positive definite constant matrices) has (have) no zero on a given subset of state space, then we can construct a controller to solve our problem. It is found that the controller structure could be complicated, but is feasible in computation and may require optimization technique to search the solution. We consider both SIMO and MIMO cases with illustrated examples.     

高纯四溴双酚A双(2,3-二溴丙基)醚合成新工艺

研究了合成阻燃剂四溴双酚A双(2，3-二溴丙基)醚的新工艺，特点是通过加入表面活性剂TABS、催化剂SB和表面活性剂A的方法，提高产品纯度和降低游离酸的含量，成品的炭化温度为295℃，纯度大于95％。     

溶胶—凝胶法制备有机改性硅酸盐的研究进展

综述了有机改性硅酸盐的溶胶－凝胶合成路线，并简要介绍它们的结构、性能及应用