Browse ORBi by ORBi project

- Background
- Content
- Benefits and challenges
- Legal aspects
- Functions and services
- Team
- Help and tutorials

Computing accurately the induced land subsidence affecting the main sinking cities located at major river mouths Dassargues, Alain in Advances in Hydro-Science and Engineering - Volume 1 -ICHE Washington (1993) Detailed reference viewed: 18 (5 ULg)COMPUTING ANTICIPATORY SYSTEMS, CASYS'09 - Ninth International Conference, Liège, Belgium, 3-8 August 2009 Dubois, Daniel Book published by American Institute of Physics (2010) Detailed reference viewed: 45 (2 ULg)Computing bounds for kernel-based policy evaluation in reinforcement learning Fonteneau, Raphaël ; ; Wehenkel, Louis et al Report (2010) This technical report proposes an approach for computing bounds on the finite-time return of a policy using kernel-based approximators from a sample of trajectories in a continuous state space and ... [more ▼] This technical report proposes an approach for computing bounds on the finite-time return of a policy using kernel-based approximators from a sample of trajectories in a continuous state space and deterministic framework. [less ▲] Detailed reference viewed: 18 (3 ULg)Computing bounds on the geometrical quality of 2D curvilinear finite elements Johnen, Amaury ; ; et al Conference (2013, April 25) The development of high-order computational methods for solving partial differen- tial equations on unstructured grids has been underway for many years. Such meth- ods critically depend on the ... [more ▼] The development of high-order computational methods for solving partial differen- tial equations on unstructured grids has been underway for many years. Such meth- ods critically depend on the availability of high-quality curvilinear meshes, as one badly-shaped element can degrade the solution in the whole domain (J. Shewchuk, “What Is a Good Linear Finite Element? Interpolation, Conditioning, Anisotropy, and Quality Measures”, Preprint, 2002). The usual way of generating curved meshes is to first generate a straight sided mesh and to curve mesh entities that are classified on the boundaries of the domain. The latter operation introduces a “shape-distortion” that should be controlled if we suppose that the straight sided mesh is composed of well-shaped elements. Quality measures allow to quantify to which point an element is well-shaped. They also provide tools to improve the quality of meshes through optimization opera- tions. Many quality measures has been proposed for quadratic triangular finite element. Recently, X. Roca et al. (“Defining Quality Measures for High-Order Planar Triangles and Curved Mesh Generation”, Proceedings of the 20th Interna- tional Meshing Roundtable, 2011) proposed a technique that allows extending any Jacobian based quality measure for linear elements to high-order iso-parametric planar triangles of any interpolation degree. In this work we propose an efficient method to provide accurate bounds on the mag- nitude of the shape distortion of any triangular and quadrangular curved element. The shape distortion is measured with respect to an ideal element, which can e.g. be an equilateral triangle or the element from the original straight-sided mesh. The key feature of the method is that we can adaptively expand functions based on the Jacobian matrix and its determinant in terms of Be ́zier functions. Be ́zier functions have both properties of boundedness and positivity, which allow sharp computation of minimum or maximum of the interpolated functions. [less ▲] Detailed reference viewed: 81 (20 ULg)Computing Convex Hulls by Automata Iteration Cantin, François ; ; Wolper, Pierre in International Journal of Foundations of Computer Science (2009), 20(4), 647-667 This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors ... [more ▼] This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The convex hull can then be directly computed from this limit in the form of an automaton-based representation of the corresponding set of real vectors. The technique is quite general and has been implemented. [less ▲] Detailed reference viewed: 80 (23 ULg)Computing Convex Hulls by Automata Iteration Cantin, François ; ; Wolper, Pierre in Lecture Notes in Computer Science (2008, July), 5148 This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors ... [more ▼] This paper considers the problem of computing the real convex hull of a finite set of n-dimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The convex hull can then be directly computed from this limit in the form of an automatonbased representation of the corresponding set of real vectors. The technique is quite general and has been implemented. Also, our result fits in a wider scheme whose objective is to improve the techniques for converting automata-based representation of constraints to formulas. [less ▲] Detailed reference viewed: 97 (37 ULg)Computing k-binomial equivalence and avoiding binomial repetitions Rigo, Michel Conference (2015, October 28) In this talk, I will first recall basic results on binomial coefficients of words, then review the connections and differences with Parikh matrices. As a generalization of abelian equivalence, two words u ... [more ▼] In this talk, I will first recall basic results on binomial coefficients of words, then review the connections and differences with Parikh matrices. As a generalization of abelian equivalence, two words u and v are k-binomially equivalent if every word of length at most k appears as a subword of u exactly as many times as it appears as a subword of v. So a k-binomial square is a word uv where u and v are k-binomially equivalent. We will discuss avoidance of squares and cubes in infinite words (this is a joint word with M. Rao). Finally, I will consider the question of deciding whether or not two finite words are k-binomially equivalent. This problem has recently been shown to be decidable in polynomial time by Freydenberger, Gawrychowski et al. [less ▲] Detailed reference viewed: 48 (8 ULg)Computing near-optimal policies from trajectories by solving a sequence of standard supervised learning problems Ernst, Damien Speech/Talk (2006) Detailed reference viewed: 12 (3 ULg)Computing system signatures through reliability functions ; Mathonet, Pierre in Statistics & Probability Letters (2013), 83(3), 710-717 It is known that the Barlow-Proschan index of a system with i.i.d. component lifetimes coincides with the Shapley value, a concept introduced earlier in cooperative game theory. Due to a result by Owen ... [more ▼] It is known that the Barlow-Proschan index of a system with i.i.d. component lifetimes coincides with the Shapley value, a concept introduced earlier in cooperative game theory. Due to a result by Owen, this index can be computed efficiently by integrating the first derivatives of the reliability function of the system along the main diagonal of the unit hypercube. The Samaniego signature of such a system is another important index that can be computed for instance by Boland's formula, which requires the knowledge of every value of the associated structure function. We show how the signature can be computed more efficiently from the diagonal section of the reliability function via derivatives. We then apply our method to the computation of signatures for systems partitioned into disjoint modules with known signatures. [less ▲] Detailed reference viewed: 31 (2 ULg)Computing the derivatives of the mean and amplitude of physiological variables with respect to the parameters of a mathematical model Pironet, Antoine ; Dauby, Pierre ; et al Conference (2013, September 06) Detailed reference viewed: 32 (6 ULg)Computing the Field of nth Order Accelerations in Rigid Motion by Direct Measurements ; Martinusi, Vladimir in Bulletin of the Polytechnic Institute of Jasi. Section Mathematics, Theoretical Mechanics, Physics = Buletinul Institutului Politehnic din Iaşi. Secţia Matematica, Mecanica Teoretica, Fizica (2006), LII (LVI)(6), Detailed reference viewed: 14 (1 ULg)Computing the land subsidence of Shanghai by finite element method Dassargues, Alain ; in Proceedings of the Fourth International Symposium on Land Subsidence (1991) Detailed reference viewed: 34 (11 ULg)Computing the Logarithm of Homogenous Matrices in SE(3) ; Martinusi, Vladimir in The 1st International Conference "Computational Mechanics and Virtual Engineering", Brasov, Romania (2005) Detailed reference viewed: 21 (2 ULg)COMT Val158Met polymorphism, verbalizing of emotion and activation of affective brain systems ; ; Laroi, Frank et al in NeuroImage (2011), 55 Detailed reference viewed: 25 (3 ULg)Le comte Immon Kurth, Godefroid in Bulletin de la Classe des Lettres et des Sciences Morales et Politiques (1898), XXXV, 3(3e série), Detailed reference viewed: 26 (0 ULg)Comte-rendu de l'ouvrage de G. Hayes et S. Ollitrault, La désobéissance civile Lejeune, Aude in Droit et Société (2013), 84 Detailed reference viewed: 41 (5 ULg)Comte-rendu du 16e symposium international sur la SLA WANG, François-Charles ; in Correspondances en Nerf & Muscle (2006) Detailed reference viewed: 13 (0 ULg)Les comtes d'Auvergne au VIe siècle Kurth, Godefroid in Bulletin de la Classe des Lettres et des Sciences Morales et Politiques (1899), 11 Detailed reference viewed: 18 (1 ULg)Les comtes et ducs de Tours au VIe siècle Kurth, Godefroid in Bulletin de la Classe des Lettres et des Sciences Morales et Politiques (1900), 12 Detailed reference viewed: 18 (0 ULg)Le comunità italiane in Belgio tra assimilazione e transnazionalismo Martiniello, Marco Scientific conference (2014, September 25) Detailed reference viewed: 19 (0 ULg) |
||