XXX XXX XX XXX. In this paper we propose a novel approach for safety analysis based on system interface models, which are shared for both system and safety engineering. By extending interaction models on the system interface level with failure modes as well as relevant portions of the physical system to be controlled, automated support can be provided for much of the failure analysis. We partic...

We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n3) time. More surprisingly, the representation is extended naturally to non-projective parsing using Chu-Liu-Edmonds (Chu and Liu, 1965; Edmonds, 1967) MST algorit...

To overcome the problem of premature convergence on Particle Swarm Optimization (PSO), this paper proposes both the improved particle swarm optimization methods (IPSO) based on self-adaptive regulation strategy and the Chaos Theory. Given the effective balance of particles’ searching and development ability, the self-adaptive regulation strategy is employed to optimize the inertia weight. To im...

Searching of similar pictures was in the past based mainly on searching of similar picture names. We try to find an effective method how to search pictures by searching of similar information in the picture (histograms, shapes, blocks,). There already are some methods but still not effective enough. In this paper we describe a method where we combine vector quantization (VQ) and fuzzy S-trees. ...

As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural s...

For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...

This paper introduces an imaging algorithm with application of fractional Fourier transform (FrFT) for ground moving train imaging by Ku-band ground-based radar. In view of the fact that the train speed is varying when acrossing the radar beam, the multiple Doppler parameters are estimated corresponding to different range positions, i.e., they are estimated from different sections of data in Fr...

It is highly possible that future wireless communication systems will adopt ultra-dense deployment to cope with the increasing demand on spectrum efficiency and energy efficiency. The pivotal issue to achieve the potential benefits of the ultra-dense network is to deal with the complex inter-site interference. In this paper, in order to maximize the spectrum efficiency of the system, we first m...

In this paper, we present a new and fast encoding algorithm (FEA) for vector quantization. The magnitude (sum of the components of a vector) feature of the vectors is used in this algorithm to improve the efficiency of searching. Sorting of the magnitude values enhances the searching. As the values are sorted, the searching can be terminated in advance to reduce the time needed to locate the re...

We present a novel method for efficiently searching top-k neighbors for documents represented in high dimensional space of terms based on the cosine similarity. Mostly, documents are stored as bagof-words tf-idf representation. One of the most used ways of computing similarity between a pair of documents is cosine similarity between the vector representations, but cosine similarity is not a met...