Windows API的VB编程控制应用程序行为

本文探讨用VB控制外部应用程序行为的WindowsAPI编程方法 ,介绍了有关API函数的使用技巧并提供了示例程序。     

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.     

基于禁忌搜索算法的可扩展有限状态机模型测试数据自动生成

可扩展有限状态机(EFSM)模型的测试用例生成包括测试路径生成和测试数据生成两部分。然而,目前针对EFSM模型的测试研究大多集中于测试路径生成。为探索路径上测试数据的自动生成,提出一种面向EFSM路径的测试数据生成方法,利用禁忌搜索(TS)策略实现了EFSM测试数据的自动生成;分析了影响EFSM测试数据生成的关键因素,并与遗传算法(GA)的生成效率进行了比较。实验结果表明：基于TS算法的EFSM模型测试数据自动生成是确实可行的,其测试生成效率相对于GA有很大提高。     

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.     

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.     

Novel integrated optimization algorithm for trajectory planning of robot manipulators based on integrated evolutionary programming

Optimal trajectory plarmmg for robot manipulators plays an important role in implementing the high productivity for robots. The performance indexes used in optimal trajectory planning are classified into two roam categories:optimum traveling time and optimum mechanical energy of the actuators. The current trajectory planning algorithms are designed based on one of the above two performance indexes. So far, there have been few planning algorithms designed to satisfy two performance indexes simultaneously. On the other hand, some deficiencies arise in the existing integrated optimization algorithms of trajectory planning.In order to overcome those deficiencies, the integrated optimization algorithms of trajectory planning are presented based on the complete analysis for trajectory planning of robot manipulators. In the algorithm, two object functiom are designed based on the specific weight coefficient method and “ideal point” strategy. Moreover, based on the features of optimization problem, the intensified evolutionary programming is proposed to solve the corresponding optimization model. Especially, for the Stanford Robot, the high-quality solutions are found at a lower cost.     

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...     

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.     

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...     

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.     

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...     

基于有限元模型修正技术的复杂索拱体系施工稳定性

为准确分析复杂索拱体系结构的施工稳定性,以山东淄博潭溪山桥为例,提出一种基于有限元模型修正技术的分析方法。建立包括细部构造的精细化有限元模型,以节点位移构造目标函数对简化的梁系模型进行静力修正,修正后的梁系模型位移结果得到小幅改进,索力和结构应力得到明显改进。分别计算施工过程各阶段修正模型与未修正模型的线性稳定安全因数与非线性稳性定安全因数,对比分析结果认为：修正模型能够体现实际细部构造的加强作用,可使分析更为精确。将修正模型的稳定性分析结果与规范对比,认为结构施工稳定性满足要求。