Search results for "Computer Science::Programming Languages"
showing 10 items of 69 documents
Update of the Binoth Les Houches Accord for a standard interface between Monte Carlo tools and one-loop programs
2014
We present an update of the Binoth Les Houches Accord (BLHA) to standardise the interface between Monte Carlo programs and codes providing one-loop matrix elements.
Resolution of singularities for multi-loop integrals
2007
We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to terminate. The program can be used to compute numerically the Laurent expansion of divergent multi-loop integrals regulated by dimensional regularisation. The symbolic and the numerical steps of the algorithm are combined into one program.
Validation of frictional studies by double-cup extrusion tests in cold-forming
1996
Abstract Studies on frictional conditions in cold-forming have shown that, for a given lubricant, friction factor values are strongly affected by the test method. In the present paper, different cold-forging processes of an aluminium alloy, are modelled by a FEM numerical code using the m values obtained by both the double cup extrusion and ring compression tests. It appears that the m values given by the ring tests can be effectively used in the simulation of upsetting processes, while the m values derived by the double cup extrusion tests are more appropriate for predictions in extrusion and closed-die forging operations.
Optimality conditions for nondifferentiable convex semi-infinite programming
1983
This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.
Optimization under Uncertainty and Linear Semi-Infinite Programming: A Survey
2001
This paper deals with the relationship between semi-infinite linear programming and decision making under uncertainty in imprecise environments. Actually, we have reviewed several set-inclusive constrained models and some fuzzy programming problems in order to see if they can be solved by means of a linear semi-infinite program. Finally, we present some numerical examples obtained by using a primal semi-infinite programming method.
Feasibility of finite and infinite paths in data dependent programs
2005
This paper considers the feasibility of finite and infinite paths in programs in two simple programming languages. The language LBASE allows to express the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is decidable. The possibilities to characterise the sets of all feasible finite and infinite paths in LBASE and LTIM programs are also discussed. The infinite feasible path existence problem is proven decidable also for the language LTIBA which has both…
Star-free trace languages
1992
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
A description based on languages of the final non-deterministic automaton
2014
The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…
Complexity of operations on cofinite languages
2010
International audience; We study the worst case complexity of regular operation on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the resulting minimal automata.
Space-Time, Phenomenology, and the Picture Theory of Language
2010
To estimate Minkowski’s introduction of space-time in relativity, the case is made for the view that abstract language and mathematics carries meaning not only by its connections with observation but as pictures of facts. This view is contrasted to the more traditional intuitionism of Hume, Mach, and Husserl. Einstein’s attempt at a conceptual reconstruction of space and time as well as Husserl’s analysis of the loss of meaning in science through increasing abstraction is analysed. Wittgenstein’s picture theory of language is used to explain how meaning is conveyed by abstract expressions, with the Minkowski space as a case.