33 resultados para constraint solving
em Chinese Academy of Sciences Institutional Repositories Grid Portal
Resumo:
Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.
Resumo:
以一阶谓词逻辑为基础,讨论约束满足问题.着重研究一阶逻辑公式可满足性的局部搜索法,并与命题逻辑中的可满足性过程加以比较.以皇后问题和哈密顿回路问题为例,说明基于一阶逻辑的方法能处理较大的问题实例.
Resumo:
With the advancement in network bandwidth and computing power, multimedia systems have become a popular means for information delivery. However, general principles of system testing cannot be directly applied to testing of multimedia systems on account of their stringent temporal and synchronization requirements. In particular, few studies have been made on the stress testing of multimedia systems with respect to their temporal requirements under resource saturation. Stress testing is important because erroneous behavior is most likely to occur under resource saturation. This paper presents an automatable method of test case generation for the stress testing of multimedia systems. It adapts constraint solving techniques to generate test cases that lead to potential resource saturation in a multimedia system. Coverage of the test cases is defined upon the reachability graph of a multimedia system. The proposed stress testing technique is supported by tools and has been successfully applied to a real-life commercial multimedia system. Although our technique focuses on the stress testing of multimedia systems, the underlying issues and concepts are applicable to other types of real-time systems.
Resumo:
针对参数化CAD在约束求解中的应用,提出了基于智能连杆的算法,该算法在扩充几何作图范围、改善算法复杂度方面都有明显的优势.将其同LIM0算法、几何变换方法、C-Tree算法、数值求解方法等方法相互融合,能够组成一套非常完备的几何约束求解框架,来完成对平面和空间几何约束问题的自动求解与图像生成.将该算法应用于智能动态几何软件的设计中,实验显示可以取得令人满意的结果.
Resumo:
A procedure for designing the optimal bounded control of strongly non-linear oscillators under combined harmonic and white-noise excitations for minimizing their first-passage failure is proposed. First, a stochastic averaging method for strongly non-linear oscillators under combined harmonic and white-noise excitations using generalized harmonic functions is introduced. Then, the dynamical programming equations and their boundary and final time conditions for the control problems of maximizing reliability and of maximizing mean first-passage time are formulated from the averaged Ito equations by using the dynamical programming principle. The optimal control law is derived from the dynamical programming equations and control constraint. Finally, the conditional reliability function, the conditional probability density and mean of the first-passage time of the optimally controlled system are obtained from solving the backward Kolmogorov equation and Pontryagin equation. An example is given to illustrate the proposed procedure and the results obtained are verified by using those from digital simulation. (C) 2003 Elsevier Ltd. All rights reserved.
Resumo:
Improving the resolution of the shock is one of the most important subjects in computational aerodynamics. In this paper the behaviour of the solutions near the shock is discussed and the reason of the oscillation production is investigated heuristically. According to the differential approximation of the difference scheme the so-called diffusion analogy equation and the diffusion analogy coefficient are defined. Four methods for improving the resolution of the shock are presented using the concept of diffusion analogy.
Resumo:
The convective--diffusion equation is of primary importance in such fields as fluid dynamics and heat transfer hi the numerical methods solving the convective-diffusion equation, the finite volume method can use conveniently diversified grids (structured and unstructured grids) and is suitable for very complex geometry The disadvantage of FV methods compared to the finite difference method is that FV-methods of order higher than second are more difficult to develop in three-dimensional cases. The second-order central scheme (2cs) offers a good compromise among accuracy, simplicity and efficiency, however, it will produce oscillatory solutions when the grid Reynolds numbers are large and then very fine grids are required to obtain accurate solution. The simplest first-order upwind (IUW) scheme satisfies the convective boundedness criteria, however. Its numerical diffusion is large. The power-law scheme, QMCK and second-order upwind (2UW) schemes are also often used in some commercial codes. Their numerical accurate are roughly consistent with that of ZCS. Therefore, it is meaningful to offer higher-accurate three point FV scheme. In this paper, the numerical-value perturbational method suggested by Zhi Gao is used to develop an upwind and mixed FV scheme using any higher-order interpolation and second-order integration approximations, which is called perturbational finite volume (PFV) scheme. The PFV scheme uses the least nodes similar to the standard three-point schemes, namely, the number of the nodes needed equals to unity plus the face-number of the control volume. For instanc6, in the two-dimensional (2-D) case, only four nodes for the triangle grids and five nodes for the Cartesian grids are utilized, respectively. The PFV scheme is applied on a number of 1-D problems, 2~Dand 3-D flow model equations. Comparing with other standard three-point schemes, The PFV scheme has much smaller numerical diffusion than the first-order upwind (IUW) scheme, its numerical accuracy are also higher than the second-order central scheme (2CS), the power-law scheme (PLS), the QUICK scheme and the second-order upwind(ZUW) scheme.
Resumo:
Neurotrypsin is one of the extra-cellular serine proteases that are predominantly expressed in the brain and involved in neuronal development and function. Mutations in humans are associated with autosomal recessive non-syndromic mental retardation (MR). We studied the molecular evolution of neurotrypsin by sequencing the coding region of neurotrypsin in 11 representative non-human primate species covering great apes, lesser apes, Old World monkeys and New World monkeys. Our results demonstrated a strong functional constraint of neurotrypsin that was caused by strong purifying selection during primate evolution, an implication of an essential functional role of neurotrypsin in primate cognition. Further analysis indicated that the purifying selection was in fact acting on the SRCR domains of neurotrypsin, which mediate the binding activity of neurotrypsin to cell surface or extracellular proteins. In addition, by comparing primates with three other mammalian orders, we demonstrated that the absence of the first copy of the SRCR domain (exon 2 and 3) in mouse and rat was due to the deletion of this segment in the murine lineage. Copyright (C) 2005 S. Karger AG, Basel.