Resultats globals: 12 registres trobats en 0.02 segons.
Articles, 10 registres trobats
Documents de recerca, 2 registres trobats
Articles 10 registres trobats  
1.
24 p, 432.6 KB Evidence functions : a compositional approach to information / Egozcue, Juan-José (Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental) ; Pawlowsky-Glahn, Vera (Universitat de Girona. Departament d'Informàtica i Matemàtica Aplicada)
The discrete case of Bayes' formula is considered the paradigm of information acquisition. Prior and posterior probability functions, as well as likelihood functions, called evidence functions, are compositions following the Aitchison geometry of the simplex, and have thus vector character. [...]
2018 - 10.2436/20.8080.02.71
SORT : statistics and operations research transactions, Vol. 42 Núm. 2 (July-December 2018) , p. 101-124 (Invited articles)  
2.
26 p, 2.4 MB Log-ratio methods in mixture models for compositional data sets / Comas-Cufí, Marc (Universitat de Girona. Departament d'Informàtica, Matemàtica Aplicada i Estadística) ; Martín-Fernández, Josep-Antoni (Universitat de Girona. Departament d'Informàtica, Matemàtica Aplicada i Estadística) ; Mateu-Figueras, Glòria (Universitat de Girona. Departament d'Informàtica, Matemàtica Aplicada i Estadística)
When traditional methods are applied to compositional data misleading and incoherent results could be obtained. Finite mixtures of multivariate distributions are becoming increasingly important nowadays. [...]
2016
SORT : statistics and operations research transactions, Vol. 40 Núm. 2 (July-December 2016) , p. 349-374 (Articles)  
3.
22 p, 485.8 KB On the interpretation of differences between groups for compositional data / Martín-Fernández, Josep-Antoni (Universitat de Girona. Departament d'Informàtica i Matemàtica Aplicada) ; Daunis-i-Estadella, Josep (Universitat de Girona. Departament d'Informàtica i Matemàtica Aplicada) ; Mateu-Figueras, Glòria (Universitat de Girona. Departament d'Informàtica i Matemàtica Aplicada)
Social polices are designed using information collected in surveys; such as the Catalan TimeUse survey. Accurate comparisons of time use data among population groups are commonlyanalysed using statistical methods. [...]
2015
SORT : statistics and operations research transactions, Vol. 39 Núm. 2 (July-December 2015) , p. 231-252 (Articles)  
4.
28 p, 389.4 KB The normal distribution in some constrained sample spaces / Mateu-Figueras, Glòria (Universitat de Girona. Departament d'Informàtica i Matemàtica Aplicada) ; Pawlowsky-Glahn, Vera (Universitat de Girona. Departament d'Informàtica i Matemàtica Aplicada) ; Egozcue, Juan-José (Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III)
Phenomena with a constrained sample space appear frequently in practice. This is the case, for example, with strictly positive data, or with compositional data, such as percentages or proportions. If the natural measure of difference is not the absolute one, simple algebraic properties show that it is more convenient to work with a geometry different from the usual Euclidean geometry in real space, and with a measure different from the usual Lebesgue measure, leading to alternative models that better fit the phenomenon under study. [...]
2013
SORT : statistics and operations research transactions, Vol. 37, Núm. 1 (January-June 2013) , p. 29-56  
5.
17 p, 910.0 KB Linear programming, the simplex algorithm and simple polytopes / Kalai, Gil
In the first part of the paper we survey some far-reaching applications of the basic facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concerning the simplex algorithm. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 217-233  
 Accés restringit a la UAB
6.
23 p, 998.3 KB Flows on hypergraphs / Cambini, Riccardo ; Gallo, Giorgio ; Scutellà, Maria Grazia
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 195-217  
 Accés restringit a la UAB
7.
10 p, 543.6 KB On strongly polynomial dual simplex algorithms for the maximum flow problem / Goldfarb, Donald ; Wei, Chen
Several pivot rules for the dual network simplex algorithm that enable it to solve a maximum flow problem on an n-node, m-arc network in at most 2nm pivots and O(n^2m) time are presented. These rules are based on the concept of a preflow and depend upon the use of node labels which are either the lengths of a shortest pseudoaugmenting path from those nodes to the sink node or valid underestimates of those lengths. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 159-168  
 Accés restringit a la UAB
8.
10 p, 591.4 KB A new pivot selection rule for the network simplex algorithm / Sokkalingam, P.T. ; Sharma, Prabha ; Ahuja, Ravindra K.
We present a new network simplex pivot selection rule, which we call the minimum ratio pivot rule, and analyze the worst-case complexity of the resulting network simplex algorithm. We consider networks with n nodes, m arcs, integral arc capacities and integral supplies/demands of nodes. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 149-158  
 Accés restringit a la UAB
9.
18 p, 973.6 KB A new strongly polynomial dual network simplex algorithm / Armstrong, Ronald D. ; Jin, Zhiying
This paper presents a new dual network simplex algorithm for the minimum cost network flow problem. The algorithm works directly on the original capacitated network and runs in O(mn(m + n log n) log n) time for the network with n nodes and m arcs. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 131-148  
 Accés restringit a la UAB
10.
21 p, 1.1 MB A polynomial time primal network simplex algorithm for minimum cost flows / Orlin, James B.
Developing a polynomial time primal network simplex algorithm for the minimum cost flow problem has been a long standing open problem. In this paper, we develop one such algorithm that runs in O(min(n^2m log nC, n^2m^2 log n)) time, where n is the number of nodes in the network, m is the number of arcs, and C denotes the maximum absolute arc costs if arc costs are integer and (infin) otherwise. [...]
1997
Mathematical Programming, vol. 78 n. 2 (1997) p. 109-129  
 Accés restringit a la UAB

Documents de recerca 2 registres trobats  
1.
1 p, 608.8 KB Establishment, maintenance and reactivation from latency of the herpes simplex virus type 1 (HSV-1) / Sáez Fernández, Alba ; Luquín Fernández, M., (Marina) dir. (Universitat Autònoma de Barcelona. Departament de Genètica i Microbiologia) ; Universitat Autònoma de Barcelona. Facultat de Biociències
2015
Microbiologia [816]  
2.
1 p, 1.2 MB Alzheimer's disease and microorganisms : is there any common mechanism in the progression of the disease? / Mayorgas Guillamet, Aida ; Luquín Fernández, M., (Marina), dir. (Universitat Autònoma de Barcelona. Departament de Genètica i Microbiologia) ; Universitat Autònoma de Barcelona. Facultat de Biociències
2014
Microbiologia [816]  

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.