Vector addition systems and regular languages

Necessary and sufficient conditions are established for Vector Addition Systems to define regular languages. An algorithm is designed to decide whether these conditions are satisfied. The reachability problem for such Vector Addition Systems is shown to be decidable.     

Systems implementation languages and IRONMAN

The U.S. Department of Defense has recently issued a set of requirements, which it called IRONMAN, for the design of a programming language that it will use for embedded computer applications. To date four competing languages have been designed and, after considerable debate and scrutiny, these have been reduced to two. It is expected that the winning language will be selected during 1979. This report compares the IRONMAN requirements against the state-of-the-art in systems implementation language design in an attempt to see the extent to which IRONMAN can be met from existing technology. Particular emphasis is given to the areas of large-scale program structuring, parallel programming, exception handling and hardware interaction. Finally, Dijkstra's criticism of IRONMAN and the competing languages will be examined. It will be argued that he may be justified in doubting the viability of a language with such diverse features.     

给定切失混合有理插值曲线

在曲线的设计中,尤其是反向设计,通常所取的数据点都是关键点,譬如:逗留点(曲线上的一阶导失与二阶导失叉积为零矢量的点)。因此,设计的曲线希望在该数据点也是逗留点。利用三角函数对三次Bernstein基函数改进为混合基函数,该基函数具有规范性,对称性等类似Bernstein基函数的性质和特点。给定一组确定切方向的数据点,用此基函数,可以构造一种带形状因子的有理插值曲线。生成的有理插值曲线具有G2-连续和曲率连续,插值点均是逗留点等特点。若通过加强形状因子的条件限制可达到C2-连续,并可以通过修改形状因子来调节曲线的形状,并且这种影响是局部的。最后还给出了实例,并与三次Hermite插值曲线进行了比较。     

Resetting Vector Clocks in Distributed Systems

This paper establishes the necessary and sufficient condition for a correct clock resetting such that the functionality of vector clocks can be preserved. A clock reset protocol is presented with its applicability and limitation discussed. Our result indicates that for some applications, the potential of clock overflow can be completely prevented by carefully choosing the condition for initiating the clock reset protocol.     

Factorization of Rational Matrices in Sampled-Data Systems Design

Special features of factorization procedures for two types of rational matrices encountered in H ₂ and H optimization problems for sampled-data systems are considered. A rigorous estimate of the characteristic polynomial of the H ₂-optimal closed-loop system is given.     

Rule-Based Learning Systems for Support Vector Machines

In this article, we propose some methods for deriving symbolic interpretation of data in the form of rule based learning systems by using Support Vector Machines (SVM). First, Radial Basis Function Neural Networks (RBFNN) learning techniques are explored, as is usual in the literature, since the local nature of this paradigm makes it a suitable platform for performing rule extraction. By using support vectors from a learned SVM it is possible in our approach to use any standard Radial Basis Function (RBF) learning technique for the rule extraction, whilst avoiding the overlapping between classes problem. We will show that merging node centers and support vectors explanation rules can be obtained in the form of ellipsoids and hyper-rectangles. Next, in a dual form, following the framework developed for RBFNN, we construct an algorithm for SVM. Taking SVM as the main paradigm, geometry in the input space is defined from a combination of support vectors and prototype vectors obtained from any clustering algorithm. Finally, randomness associated with clustering algorithms or RBF learning is avoided by using only a learned SVM to define the geometry of the studied region. The results obtained from a certain number of experiments on benchmarks in different domains are also given, leading to a conclusion on the viability of our proposal.     

用二元向量有理插值实现彩色图像缩放的方法

以二元向量有理插值为基础,提出了一种图像缩放方法．首先将图像的每一个像素看作是平面域的关于RGB三原色的一个向量,利用二元Newton—Thiele型向量连分式建立关于像素值的有理插值函数,即有理插值曲面;然后对此有理插值曲面进行重新采样,以实现图像的缩放．通过实验证明,该方法能有效地用于图像的缩放处理,并且算法简单,易于实现．     

一种支持高效并行处理的矢量数据索引方法

分析了HBase的存储模型和Spark的并行处理机制,提出一种矢量空间数据的分布式存储、索引和并行区域查询方法。设计了基于空间对象中心点的行键存储方案,将中心点的Hilbert编码与经纬度小数位结合实现行键的唯一性,保证地理位置接近的要素在表中存储在相邻的行。实现了基于Spark的空间索引并行构建和区域查询方法,借助空间对象中心点的Hilbert编码快速构建索引,通过多边形区域的最小外接矩形过滤查询结果。实验结果表明,索引并行构建可靠性好速度快,区域查询并行处理算法可行且效率高。     

Thiele-Thiele型二元向量有理插值实现彩色图像的缩放

提出了一种基于Thiele-Thiele型有理向量插值的彩色图像插值方法。将数字图像的每一个像素点看成是一个平面域的关于RGB三原色的一个向量,在矩形网格上利用Samelson逆与倒差商技巧,根据图像的像素特征构造Thiele-Thiele型二元向量连分式有理插值函数,然后对插值曲面进行采样以实现缩放。采用该算法可以得到更加清晰的放大图像。实验结果表明,该方法是一种有效的图像缩放方法。     

基于支持向量机的非线性系统辨识

本文针对未知非线性系统,提出了基于支持向量机(SVM)的系统辨识方法,并且通过仿真分析比较了基于SVM与基于RBF神经网络系统辨识及预测结果,仿真结果表明SVM方法比RBF神经网络方法具有更高的预测精度和更好的泛化能力。     

应用型本科院校增设信息系统工程监理专业

随着信息系统工程规模和复杂性的增加,必须对信息系统工程进行监理。该文从信息系统工程监理概况、信息系统工程监理专业增设的必要性以及如何组织该专业的教学等几个方面,对应用型本科院校增设信息系统工程监理专业进行了论证,其目的是为信息化建设培养急需的监理人才。     

EOL languages are not codings of FPOL languages

One of the useful results concerning EOL languages states that a language is an EOL language if and only if it is a cording of OL language. In this paper we retine this result by demonstrating that there exist EOL languages that are not codings of languages that are generated by propagating OL systems with finite axiom sets. This solves Problem 10 from the L Systems Problem Book '75.     

Relations of flow languages to Petri net languages

A.C. Shaw has introduced the concept of the flow expression which is an extended regular expression and state several results with some conjectures. His conjecture that the flow expressions define context-sensitive languages has been answered negatively by two of the present authors, that is, the flow languages are recursively enumerable.In this paper, it is shown that flow languages for some restricted class of flow expressions are equivalent to Petri net languages. Some related decision problems for flow expressions are also discussed.     

支持向量机在混沌系统预测中的应用

提出用支持向量机回归方法解决混沌系统预测问题。阐述了支持向量机回归算法,对四阶混沌时间序列进行预测,在此基础上结合城市交通的混沌性,对珠海市迎宾大道的交通流量进行预测。仿真实验表明,支持向量机泛化能力好、学习速度快,对混沌时间序列具有很好的预测效果,对城市交通流量预测也是切实可行的。     

基于伴随向量方法的多延时系统最优扰动抑制

研究包含有状态、控制和测量延时连续系统的最优扰动抑制问题.首先分析并提出了系统转换的方法,将原系统转化为无延时项的连续系统.然后将该系统与扰动系统联立为增广系统,并将最优扰动抑制问题转化为最优状态调节器问题.运用Pontryagin极小值原理证明最优控制的必要性,运用动态规划法证明其充分性;通过定义伴随向量解决了扰动向量和最优性能指标物理不可实现的问题.最后运用数据仿真将几种不同控制律作用下的系统响应作比较,验证所设计控制律的有效性及简易性.     

On the intersection of regex languages with regular languages

In this paper we revisit the semantics of extended regular expressions (regex), defined succinctly in the 90s [A.V. Aho, Algorithms for finding patterns in strings, in: Jan van Leeuwen (Ed.), Handbook of Theoretical Computer Science, in: Algorithms and Complexity, vol. A, Elsevier and MIT Press, 1990, pp. 255–300] and rigorously in 2003 by Câmpeanu, Salomaa and Yu [C. Câmpeanu, K. Salomaa, S. Yu, A formal study of practical regular expressions, IJFCS 14 (6) (2003) 1007–1018], when the authors reported an open problem, namely whether regex languages are closed under the intersection with regular languages. We give a positive answer; and for doing so, we propose a new class of machines — regex automata systems (RAS) — which are equivalent to regex. Among others, these machines provide a consistent and convenient method of implementing regex in practice. We also prove, as a consequence of this closure property, that several languages, such as the mirror language, the language of palindromes, and the language of balanced words are not regex languages.     

富士通VPP300/500向量并行巨型机系统

本文主要讨论了富士通公司推出的ＶＰＰ３００／５００向量并行ＭＰＰ超级计算机的系统结构、硬件特性和软件配置情况。同时，本文也介绍了ＶＰＰ３００／５００系统中所采用的一些关键性技术及实现方法，并对ＭＰＰ未来的发展趋势作出了预测     

On nonstochastic languages and homomorphic images of stochastic languages

Using a simple method we find some nonstochastic and stochastic languages related to the Dyck sets and to the languages $\text{{wcw¦w in {a, b}}{}^1\text{}}$ and $\text{{wcw}{}^{\mathrm{R}}\text{¦w in {a, b}}{}^1\text{}}$. Using the theory of uniformly distributed sequences, we present a sufficient condition for a one-letter language to be nonstochastic. Among the applications is the result that {a^p¦p is a prime} is nonstochastic. We also study the images of stochastic and rational stochastic languages under nonerasing and arbitrary homomorphisms as well as their relations to some well-known families. Finally, we introduce a large class of bounded languages and show that it is contained in /of_∩ (DUP) = the smallest intersection-closed AFL containing $\text{DUP}\text{= {a}{}^{\mathrm{n}}\text{b}{}^{\mathrm{n}}\text{¦n in N}}$, which is a subfamily of /oK(/oL_Q = the image of the family of rational stochastic languages under nonerasing homomorphisms.     

The equality of EOL languages and codings of ol languages

It is proved that a language is a coding (a letter-to-letter homomorphism) of a OL language, if, and only if, it is an EOL language.