Simple chain grammars and languages

A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k>0, this new class of grammars is very closely related to the LL(1) and simple LL(1) grammars. In fact it can be shown that every simple chain grammar has an equivalent simple LL(1) grammar.Cover properties for simple chain grammars are investigated and a deterministic pushdown transducer which acts as a right parser for simple chain grammars is presented.     

Settling the bound on the rectilinear link radius of a simple rectilinear polygon

We improve the best known bound on the rectilinear link radius of a simple rectilinear polygon with respect to its rectilinear link diameter. The new bound is tight and is compatible with the known bound on the (regular) link radius of a (regular) simple polygon with respect to its (regular) link diameter. The previous bound on the rectilinear link radius of a simple rectilinear polygon was proven by Nilsson and Schuierer in 1991.     

A simple and high-hiding capacity method for hiding digit-by-digit data in images based on modulus function

This study presents a simple method for high-hiding capacity. The basic concept uses a modulus operation. The proposed method has the following advantages: (1) the proposed method outperforms the simple LSB substitution method given the same range (0–m−1) of data digits in the embedded data; (2) the proposed method achieves good image vision quality without the need for post-processing; (3) the proposed method is almost as simple as the LSB method in both coding and decoding; (4) the smaller error advantage over the simple LSB substitution method can also be mathematically verified; (5) the error is smaller than (m−1)/2 for almost every pixel; (6) the proposed method has high-hiding capacity (for example, the proposed method can hide a 256×256 or 256×512 image in a 512×512 host image).     

On the simultaneous determination of zeros of analytic or sectionally analytic functions

It is shown how the total-step and single-step iterative methods, as well as their improvements, for the simultaneous determination of simple zeros of polynomials can be used (with one slight modification) for the determination of simple zeros of analytic functions (inside or outside a simple smooth closed contour in the complex plane) or sectionally analytic functions (outside their arcs of discontinuity). Numerical results, obtained by the single-step method, are also presented.     

Applying inexpensive AI techniques to computer games

Groo (Generic Robot, Object-Oriented) and tt14m (Trash-Talking 14-year-old Moron) are two systems that use simple and computationally inexpensive artificial intelligence mechanisms to produce engaging character behavior for computer games, while remaining within the performance constraints of modern game development. Groo engages in intelligent tactical behavior in a first-person-shooter death-match game using a fairly simple and static behavior network, while tt14m uses simple text processing to attempt engagement in the social aspects of the game "Counter-Strike".     

An end-user-oriented framework for the classification of multitemporal SAR images

In this article, we present an end-user-oriented framework for multitemporal synthetic aperture radar (SAR) data classification. It accepts as input the recently introduced Level-1α products, whose peculiarities are a high degree of interpretability and increased class separability with respect to single greyscale images. These properties make the Level-1α products very attractive in the application of simple supervised classification algorithms. Specifically, (1) the high degree of interpretability of the maps makes the training phase extremely simple; and (2) the good separation between classes gives excellent results using simple discrimination rules. The end product is a simple, fast, accurate, and repeatable framework.     

双环Petersen网络直径公式及最优路由算法

双环Petersen图互联网络DLCPG(k)是双环网络与Petersen图的笛卡尔积,它具有良好的可扩展性、较短的网络直径和简单的拓扑结构等特性。通过研究其拓扑结构,得到了DLCPG(k)直径的显式公式,并给出了该网络的最优单播路由算法。     

Finding the convex hull of a simple polygon

We describe a new algorithm for finding the convex hull of any simple polygon specified by a sequence of m vertices.An earlier convex hull finder of ours is limited to polygons which remain simple (i.e., nonselfintersecting) when locally non-convex vertices are removed. In this paper we amend our earlier algorithm so that it finds with complexity O(m) the convex hull of any simple polygon, while retaining much of the simplicity of the earlier algorithm.     

Evaluation of neural network performance and generalisation using thresholding functions

The application of a simple thresholding technique to help assess the satisfactory performance of classification networks formed from Multi-Layer Perceptron (MLP) artificial neural networks (ANNs) is discussed. Both conventional Maximum Likelihood and Bayesian Evidence based training paradigms were implemented. Firstly a simulated data set drawn from a two-dimensional Gaussian distribution was investigated to illustrate the physical significance of the threshold plots compared to the classifier output probability contours. Secondly a real world application data set comprising of low-frequency vibration measurements on an aircraft wing (a GNAT trainer) is considered. It is demonstrated that simple threshold based plots applied to classifier network outputs may provide a simple yet powerful technique to aid in the rejection of poorly regularised network structures.     

Geometric substitution: a tutorial

A collection of rewrite rules that transform simple polyhedral models (and polyhedral control meshes) into richer, more visually expressive models is presented. All are based on simple transformations that can be easily implemented and extended. The focus is mostly on techniques of cell replacement, where a unit of the structure (typically a polygon or polyhedron) is replaced by one or more variant units. Such replacements are encoded in rewrite rules. The approach presented helps a modeler who, having created a simple low-detail model, wants to amplify that shape's complexity. Features of the substrate model (such as symmetry relationships and prominent surface features) are generally conserved and often echoed and enhanced in the amplified shape     

Determining connected components in linear time by a linear number of processors

This paper describes a rather simple algorithm for determining the connected components of a simple undirected graph with n nodes using O(n) time and n processors. It requires a shared memory SIMD model permitting simultaneous reading from the same memory location by different processors (read conflicts).     

One-way simple multihead finite automata

The first half of this paper investigates the accepting powers of various types of simple one-way multihead finite automata. It is shown that(1)for each k?1, simple one-way (k+1)-head finite automata are more powerful than simple one-way k-head finite automata.(2)for each k?2, nondeterministic simple one-way k-head finite automata are more powerful than deterministic ones, and(3)for each k?2, sensing simple one-way k-head finite automata are more powerful than non-sensing ones.In the latter half, closure properties for various types of simple one-way multihead finite automata are investigated.Finally, we demonstrate that languages accepted by nondeterministic sensing simple one-way 2-head finite automata are related to some open problem concerning deterministic and nondeterministic tape-bounded Turing computations.     

Simple primitive recognition via hierarchical face clustering

Computational Visual Media - We present a simple yet efficient algorithm for recognizing simple quadric primitives (plane, sphere, cylinder, cone) from triangular meshes. Our approach is an...     

Applications of a two-dimensional hidden-line algorithm to other geometric problems

Recently ElGindy and Avis (EA) presented anO(n) algorithm for solving the two-dimensional hidden-line problem in ann-sided simple polygon. In this paper we show that their algorithm can be used to solve other geometric problems. In particular, triangulating anL-convex polygon and finding the convex hull of a simple polygon can be accomplished inO(n) time, whereas testing a simple polygon forL-convexity can be done inO(n ²) time.     

系统决策的价值分析、价值寻求和价值综合集成的比较研究

基于元决策价值概念模型．对简单小系统、大系统、巨系统和复杂系统决策的价值问题进行研究。讨论了价值分析（VA）、价值寻求分析（VSA）、价值综合集成（VMS）3个层次的内涵;进而讨论了不同决策系统中决策与价值分析、价值寻求分析的关系．在此基础上基于复杂系统方法论,提出面向复杂系统问题决策的价值综合集成的思维框架。     

Uncovering network traffic anomalies based on their sparse distributions

Characterizing network traffic with higher-dimensional features results in increased complexity of most detectors and classifiers for identifying traffic anomalies. Several key observations from existing studies confirm that network anomalies are typically distributed in a sparse way,with each anomaly essentially characterized by its lower-dimensional features. Based on this important finding,we exploit sparsity in designing a novel detection method for anomalies that ignores redundancies that are dynamically filtered from the feature sets and accurately classifies anomalies. Comparison of our method with three well known techniques shows a10% improvement in accuracy with an O（n） complexity of the classifier.     

Analysis for a class of winner-take-all model

Tam et al. (1996) proposed a simple circuit of winner-take-all (WTA) neural network. Assuming no external input, they derived an analytic equation for its network response time. In this paper, we further analyze the network response time for a class of winner-take-all circuits involving self-decay and show that the network response time of such a class of WTA is the same as that of the simple WTA model.     

Small universal simple spiking neural P systems with weights

Spiking neural P systems with weights（WSN P systems,for short） are a new variant of spiking neural P systems,where the rules of a neuron are enabled when the potential of that neuron equals a given value.It is known that WSN P systems are universal by simulating register machines. However,in these universal systems,no bound is considered on the number of neurons and rules. In this work,a restricted variant of WSN P systems is considered,called simple WSN P systems,where each neuron has only one rule. The complexity parameter,the number of neurons,to construct a universal simple WSN P system is investigated. It is proved that there is a universal simple WSN P system with 48 neurons for computing functions; as generator of sets of numbers,there is an almost simple（that is,each neuron has only one rule except that one neuron has two rules） and universal WSN P system with 45 neurons.     

WebDAV及其应用

WebDAV(Web-based Distributed Authoring and Versioning)是一种基于HTTP 1.1协议的通信协议,本文主要阐述了WebDAV的优点,并且对WebDAV的最新消息做了简单的介绍,最后通过Java的一个开源项目Slide与Tomcat的绑定,实现WebDAV的简单应用.     

动态链接库与PowerBuilder应用程序的通信研究

本文提出的消息驱动方法是一种扩展PBA(PowerBuilder应用程序)的新方法,该方法实现了DLL(动态链接库)与PBA之间的双向通信,将DLL与PBA有机地结合起来。所开发出的DLL不仅简单,而且功能强大;呈现给PBA的调用接口也非常简单,扩充后的PBA能够很好地满足用户的特殊需要。