On the synthesis of adaptive tests for nondeterministic finite state machines

The paper suggests a method for synthesis of adaptive tests with guaranteed coverage for checking functioning of discrete systems whose behavior is described by nondeterministic finite state machines. In contrast to other known methods, we do not represent the complete test as a tree but list test cases one by one and check functioning of the finite state machine on each test case. The complete test detects all defective systems that are r-distinguishable from the reference system. Besides, the test detects other defective systems containing traces that are not present in the specification; but detection of all such systems that are r-compatible with the specification is not guaranteed.     

On the complexity of existence of homing sequences for nondeterministic finite state machines

The paper discusses complexity of the problem of checking existence of a homing sequence for an observable complete finite state machines (FSMs). The minimum length of such a sequence for FSMs of certain class is known to be exponential in the number of the FSM states. It is shown that the problem of checking the existence of such a sequence belongs to class PSPACE.     

An algorithm for evaluating the state of input-and output-open systems modeled by finite automata in the course of testing complex objects

The problem of evaluating the state of systems that are open with respect to input and output for the purpose of creating a system for evaluating states when testing complex objects is considered. Solving the problem will make it possible to eliminate ambiguity in cases of insufficiency of the output parameters and where uncontrolled parameters exert an influence. It will also reduce the problem to that of successive evaluation of the states of output-open system and, subsequently, of the states of input-open systems. The search for a solution is conducted by means of an analysis of the set of states of a finite-automaton model in the set of output variables. An example illustrating practical implementation of the proposed approach is presented.     

Estimation of vector miss distance for complex objects based on scattering center model

Dear editor, This study presents a method to estimate vector miss distance (VMD) for complex objects based on scattering center (SC) models.In the method, the d...     

On the synthetic dataset generation for IPTV services based on user behavior

Multimedia Tools and Applications - The adoption of the paradigm shift from push-based media broadcasting to pull-based media streaming has seen a significant growth in the recent decade. IPTV is...     

Robust control design for uncertain objects with time delay on the state

This paper is devoted to developing methodology for designing robust control systems with large gain coefficients. The problem of robust control of uncertain objects with time-delayed states is solved based on the Lyapunov method. An unlimited increase in the gain coefficient of a controller allows the general components of an uncertain model to be suppressed to the maximum extent possible without a loss of stability. Within the limits, the system is described by a hyperplane equation. The quality parameters are determined by tuning the hyperplane coefficients. This equivalent-to-robust control enables one to track a reference signal with the desired accuracy for a wide class of uncertainties. The simulation results illustrate the effectiveness and efficiency of the proposed technique.     

New lower bounds based on column generation and constraint programming for the pattern minimization problem

The pattern minimization problem is a cutting and packing problem that consists in finding a cutting plan with the minimum number of different patterns. This objective may be relevant when changing from one pattern to another involves a cost for setting up the cutting machine. When the minimization of the number of different patterns is done by assuming that no more than the minimum number of rolls can be used, the problem is also referred to as the cutting stock problem with setup costs.     

A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines

Suppose that a finite state machine α produces a periodic sequence (whose fundamental period is A) of nonnegative integer outputs which are used to drive another finite state machine β through a subsequence of its sequence of internal states in the following way. At the jth clock tick of α's clock its integer output a(j) tells β's clock to tick a(j) times (quickly) to drive β numerous steps down its sequence of internal states to the next internal state in this subsequence of its internal states. Suppose that the sequence of outputs of β is periodic with fundamental period B. Suppose that the sum (over any list of A successive entries of the output sequence of α) of α's outputs is S. Then the subsequence of outputs of the cascade machine β ← α consisting of β, driven by α's outputs as described above, is periodic. The fundamental period of the sequence of outputs of the cascade machine β ←a consisting of β driven by α's outputs is no larger than AB. If every output of α is smaller than B, and if S is relatively prime to B, then the fundamental period of the output sequence of this cascade machine is exactly AB. Moreover, every internal state of B occurs exactly A times in each block of AB successive internal states of the cascade machine β ← α. If, on the other hand, S is not relatively prime to B, then the fundamental period of the output sequence of β ← α is less than AB.     

Indices of the effectiveness of information protection in an information interaction system for controlling complex distributed organizational objects

In this paper, we present some indices for evaluating the effectiveness of information protection in an information interaction system when controlling complex distributed organizational objects and proposing a technique for determining these indices. The technique is based on a stochastic representation of the flow of destructive actions that affect the information interactions among controllers of the elements of a distributed organizational object.     

Method of reduced tables for generation of automata with a large number of input variables based on genetic programming

Known methods of automatic generation of finite automata based on genetic programming are inefficient in the case of a large number of input variables of the automaton. A method free from this disadvantage is proposed. The preference of this method for a large number of input variables is theoretically substantiated and experimentally proved. The method was used for automation of development of an aircraft control system on a high level of abstraction.     

基于C#的数据库表结构报表系统的设计与实现

为便于团队交流与系统维护,在对表的设计结构修改后,应及时更新项目技术文档。为克服现有方法存在的不足,在VisualStudio2010环境下,基于C#编程语言,开发了一个针对SQLServer数据库表结构的报表生成系统。该系统支持单表导出和批量导出两种工作模式,支持将表结构导出到Word和Excel两种应用接口,具有操作简单、使用灵活和功能完善的优点,对提高团队开发效率和技术文档的规范性具有一定的应用价值。     

On the use of evolutionary feature selection for improving fuzzy rough set based prototype selection

The k-nearest neighbors classifier is a widely used classification method that has proven to be very effective in supervised learning tasks. In this paper, a fuzzy rough set method for prototype selection, focused on optimizing the behavior of this classifier, is presented. The hybridization with an evolutionary feature selection method is considered to further improve its performance, obtaining a competent data reduction algorithm for the 1-nearest neighbors classifier. This hybridization is performed in the training phase, by using the solution of each preprocessing technique as the starting condition of the other one, within a cycle. The results of the experimental study, which have been contrasted through nonparametric statistical tests, show that the new hybrid approach obtains very promising results with respect to classification accuracy and reduction of the size of the training set.     

Speeding up the testing and training time for the support vector machines with minimal effect on the performance

The Journal of Supercomputing - Support vector machine faces some problems associated with training time in the presence of large data sets due to the need for high memory and high computational...     

An unfitted hp-adaptive finite element method based on hierarchical B-splines for interface problems of complex geometry

Generating finite element discretizations with direct interface parameterizations constitutes a considerable computational expense in case of complex interface geometries. The paper at hand introduces a B-spline finite element method, which circumvents parameterization of interfaces and offers fast and easy meshing irrespective of the geometric complexity involved. Its core idea is the adaptive approximation of discontinuities by hierarchical grid refinement, which adds several levels of local basis functions in the close vicinity of interfaces, but unfitted to their exact location, so that a simple regular grid of knot span elements can be maintained. Numerical experiments show that an hp-refinement strategy, which simultaneously increases the polynomial degree of the B-spline basis and the levels of refinement around interfaces, achieves exponential rates of convergence despite the presence of discontinuities. It is also demonstrated that the hierarchical B-spline FEM can be used to transfer the recently introduced Finite Cell concept to geometrically nonlinear problems. Its computational performance, imposition of unfitted boundary conditions and fast hierarchical grid generation are illustrated for a set of benchmark problems in one, two and three dimensions, and the advantages of the regular grid approach for complex geometries are demonstrated by the geometrically nonlinear simulation of a voxel based foam composite.     

The use of 2D enriched elements with bubble functions for finite element analysis

In this paper, the concept that adds the interior nodes of the Lagrange elements to the serendipity elements is described and a family of enriched elements is presented to improve the accuracy of finite element analysis. By the use of the static condensation technique at the element level, the extra computation time in using these elements can be ignored. Plane stress problems are used as examples in this paper. The numerical results show that these enriched elements are more accurate than the traditional serendipity elements. The convergence rate of the proposed elements is the same as the traditional serendipity elements. The error norm of the second and third order proposed elements can be reduced from 40% to 60% when compared with the use of the traditional serendipity elements. In the numerical examples, the use of the second and third order proposed elements not only give an improvement in element accuracy but also save computation time, when the precondition conjugate gradient method is used to solve the system of equations. The saving of computation time is due to the decrease of iteration number in iteration method.     

The effect of materials testing modes on finite element simulation of hard machining via the use of internal state variable plasticity model coupled with experimental study

To understand the true nature of hard turning mechanics, a numerical model that incorporates an internal state variable plasticity model via a material user subroutine has been developed with the material constants obtained from the compression and tension tests. A global material failure/damage evolution model was implemented to simulate chip formation that solely depends on the material deformation state. Orthogonal hard turning experiments were performed to validate the numerical model. The purpose of this work was to determine the material property differences under the different stress states by using numerical simulations. The numerical and experimental results illustrated that the material constants from the compression tests captured the true nature of a hard machining process as compression dominates the of material deformation process in hard machining.     

Mixed finite elements based upon marguerre theory for the study of geometrically nonlinear behavior of thin shells

Simple triangular and quadrangular finite elements based on Marguerre's theory are proposed and are shown to greatly improve the solution over plane shell elements for a small additional computation cost.Several features of the developments are worth noting, namely: The presentation of a dual approach for the derivation of Marguerre's theory of shallow shells with moderate rotations, based on Fraeijs de Veubeke's variational principle, with a precise statement of hypotheses and applicability; the choice of hybrid connectors for solving the compatibility problem generated by Kirchhoff's hypothesis; a treatment of pressure loading, body forces and inextensional bending modes which employs a ‘static approach’ for the membrane; and discussion about the performance of some algorithms used to solve elastic stability problems. Numerical studies indicate that accurate results may be obtained by the approach advocated.