Search results for "train"
showing 10 items of 4562 documents
Constraint Management in Engineering of Complex Information Systems
2009
We propose to build an engineering environment for information systems by using metamodels, OCL and symbolic model checkers to manage constraints. Our proposal is based on a definition of constraints as 3D spaces with dimensions corresponding to UML diagrams, constructs, and abstraction levels. We show how such environments can help with engineering quality complex systems by allowing to lift up a part of constraint verifications.
An optimality test for semi-infinite linear programming
1992
In this paper we present a test to characterize the optimal solutions for the continuous semi-infinite linear programming problem. This optimality characterization is a condition of Kuhn–Tucker type. The resolution of a linear program permits to check the optimality of a feasible point,to detect the unboundedness of the problem and to find descent directions. We give some illustrative examples. We show that the local Mangasarian–Fromovitz constraint qualification is almost equivalent to Slater qualification for this problem. Furthermore, it follows from our study that this optimality condition is always necessary for a wide class of semi-infinite linear programming problems
Exact and Approximate Algorithms for Two–Criteria Topological Design Problem of WAN with Budget and Delay Constraints
2004
This paper studies the problem of designing wide area networks (WAN). In the paper the two-criteria topology assignment problem with two constraints is considered. The goal is select flow routes, channel capacities and network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to the budget constraint and delay constraint. The problem is NP-complete. Then, the branch and bound method is used to construct the exact algorithm. Also the approximate algorithm is presented. Some computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results
2003
The problem is concerned with designing of wide area networks (WAN). The problem consists in selection of flow routes, channel capacities and wide area network topology in order to minimize the total average delay per packet and the leasing cost of channels subject to delay constraint. The problem is NP complete. Then, the branch and bound method is used to construct the exact algorithm. Lower bound of the criterion function is proposed. Computational results are reported. Based on computational experiments, several properties of the considered problem are formulated.
New Geometric Constraint Solving Formulation: Application to the 3D Pentahedron
2014
Geometric Constraint Solving Problems (GCSP) are nowadays routinely investigated in geometric modeling. The 3D Pentahedron problem is a GCSP defined by the lengths of its edges and the planarity of its quadrilateral faces, yielding to an under-constrained system of twelve equations in eighteen unknowns. In this work, we focus on solving the 3D Pentahedron problem in a more robust and efficient way, through a new formulation that reduces the underlying algebraic formulation to a well-constrained system of three equations in three unknowns, and avoids at the same time the use of placement rules that resolve the under-constrained original formulation. We show that geometric constraints can be …
Solution isolation strategies for the Bernstein polytopes-based solver
2013
The Bernstein polytopes-based solver is a new method developed to solve systems of nonlinear equations, which often occur in Geometric Constraint Solving Problems. The principle of this solver is to linearize nonlinear monomials and then to solve the resulting linear programming problems, through linear programming. However, without any strategy for the isolation of the many solutions of multiple-solution systems, this solver is slow in practice. To overcome this problem, we propose in this work, a study of several strategies for solution isolation, through the split of solution boxes into several subboxes, according to three main steps answering the questions: when, where, and how to perfo…
Unitarity constraint for threshold coherent pion photoproduction on the deuteron
1997
The contribution of the two-step process {gamma}d{r_arrow}pn{r_arrow}{pi}{sup 0}d to the imaginary part of the amplitude for coherent pion production on the deuteron is calculated at threshold exploiting unitarity constraints. The result shows that this absorptive process is not negligible and has to be considered in an extraction of the elementary neutron production amplitude from the {gamma}d{r_arrow}{pi}{sup 0}d cross section at threshold. {copyright} {ital 1997} {ital The American Physical Society}
An Operator Splitting Method for Pricing American Options
2008
Pricing American options using partial (integro-)differential equation based methods leads to linear complementarity problems (LCPs). The numerical solution of these problems resulting from the Black-Scholes model, Kou’s jump-diffusion model, and Heston’s stochastic volatility model are considered. The finite difference discretization is described. The solutions of the discrete LCPs are approximated using an operator splitting method which separates the linear problem and the early exercise constraint to two fractional steps. The numerical experiments demonstrate that the prices of options can be computed in a few milliseconds on a PC.
Models and Phenomena: Bas van Fraassen’s Empiricist Structuralism
2013
Bas van Fraassen’s recent endorsement of empiricist structuralism is based on a particular approach to representation. He sharply distinguishes between what makes a scientific model M a successful representation of its target T from what makes M a representation of T and not of some other different target T’. van Fraassen maintains that embedment (i.e.: a particular sort of isomorphism which relates structures) gives the answer to the first question while the user’s decision to employ model M to represent T accounts for the representational link. After discussing the rationale for this approach, I defend that indexical constraints like those favoured by van Fraassen cannot be the last word …
High Precision Astrometry Over Large Angular Scales with Closure Constraints: The Triplet 1803+784/1928+738/2007+777
1996
The technique of differential astrometry using the phase-delay VLBI observable promises fractional precisions of ~2 × 10−9 in the determination of the separation of sources 5° or 6° apart on the sky (Guirado et al. 1995a; Lara et al. 1996). In our present research we seek further improvement in this technique through using triplets of radio sources, which provide a closure constraint in the determination of relative angular positions. This constraint not only eases the resolution of the phase-cycle ambiguities (a major problem in the least-squares approach to astrometry with phase delays), but it also strongly constrains the space of allowable parameter values.