Browsing
     by title


0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

or enter first few letters:   
OK
See detailCOMPUTING ANTICIPATORY SYSTEMS, CASYS'09 - Ninth International Conference, Liège, Belgium, 3-8 August 2009
Dubois, Daniel ULg

Book published by American Institute of Physics (2010)

Detailed reference viewed: 45 (2 ULg)
Full Text
See detailComputing bounds for kernel-based policy evaluation in reinforcement learning
Fonteneau, Raphaël ULg; Murphy, Susan A.; Wehenkel, Louis ULg 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)
Peer Reviewed
See detailComputing bounds on the geometrical quality of 2D curvilinear finite elements
Johnen, Amaury ULg; Remacle, J.-F.; Toulorge, T. 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)
Full Text
Peer Reviewed
See detailComputing Convex Hulls by Automata Iteration
Cantin, François ULg; Legay, Axel; Wolper, Pierre ULg

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: 78 (23 ULg)
Full Text
Peer Reviewed
See detailComputing Convex Hulls by Automata Iteration
Cantin, François ULg; Legay, Axel; Wolper, Pierre ULg

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: 96 (37 ULg)
Full Text
See detailComputing k-binomial equivalence and avoiding binomial repetitions
Rigo, Michel ULg

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)
Full Text
Peer Reviewed
See detailComputing system signatures through reliability functions
Marichal, Jean-Luc; Mathonet, Pierre ULg

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: 30 (2 ULg)
Full Text
See detailComputing the Field of nth Order Accelerations in Rigid Motion by Direct Measurements
Condurache, D.; Martinusi, Vladimir ULg

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)
Full Text
See detailComputing the land subsidence of Shanghai by finite element method
Dassargues, Alain ULg; Li, Xiang Lin

in Proceedings of the Fourth International Symposium on Land Subsidence (1991)

Detailed reference viewed: 34 (11 ULg)
Full Text
See detailComputing the Logarithm of Homogenous Matrices in SE(3)
Condurache, D.; Martinusi, Vladimir ULg

in The 1st International Conference "Computational Mechanics and Virtual Engineering", Brasov, Romania (2005)

Detailed reference viewed: 21 (2 ULg)
Full Text
Peer Reviewed
See detailCOMT Val158Met polymorphism, verbalizing of emotion and activation of affective brain systems
Swart, M.; Bruggeman, R.; Laroi, Frank ULg et al

in NeuroImage (2011), 55

Detailed reference viewed: 25 (3 ULg)
Full Text
See detailLe comte Immon
Kurth, Godefroid ULg

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)
Full Text
See detaille Comté R dans sa relation avec le Parlement et certains acteurs de l'exécutif : Cohérence ou incohérence?
Stans, David ULg

Book published by Maklu (2016)

Les services de renseignement qui agissent dans un cadre par nature secret peuvent induire une certaine méfiance chez le citoyen. Dans cette période troublée que nous traversons, le grand public se doit ... [more ▼]

Les services de renseignement qui agissent dans un cadre par nature secret peuvent induire une certaine méfiance chez le citoyen. Dans cette période troublée que nous traversons, le grand public se doit d’être informé sur le fonctionnement des services de renseignement belges et le contrôle de ces derniers. Pierre angulaire du système de contrôle, cet ouvrage cherche à apporter une analyse objective du travail réalisé par Comité R dans sa relation avec les acteurs politiques avant la sixième réforme de l’Etat. Ce livre cherche ainsi, sans prétention, à contribuer au développement de la culture du renseignement en Belgique ou, dans une certaine mesure, à lever le voile sur certains préjugés. [less ▲]

Detailed reference viewed: 12 (3 ULg)
Full Text
Peer Reviewed
See detailComte-rendu de l'ouvrage de G. Hayes et S. Ollitrault, La désobéissance civile
Lejeune, Aude ULg

in Droit et Société (2013), 84

Detailed reference viewed: 41 (5 ULg)
Full Text
Peer Reviewed
See detailComte-rendu du 16e symposium international sur la SLA
WANG, François-Charles ULg; Salachas, François-Charles

in Correspondances en Nerf & Muscle (2006)

Detailed reference viewed: 13 (0 ULg)
Full Text
See detailLes comtes d'Auvergne au VIe siècle
Kurth, Godefroid ULg

in Bulletin de la Classe des Lettres et des Sciences Morales et Politiques (1899), 11

Detailed reference viewed: 18 (1 ULg)
Full Text
See detailLes comtes et ducs de Tours au VIe siècle
Kurth, Godefroid ULg

in Bulletin de la Classe des Lettres et des Sciences Morales et Politiques (1900), 12

Detailed reference viewed: 18 (0 ULg)
See detailLe comunità italiane in Belgio tra assimilazione e transnazionalismo
Martiniello, Marco ULg

Scientific conference (2014, September 25)

Detailed reference viewed: 19 (0 ULg)