WorldWideScience

Sample records for geometric picard rank

  1. Stability of Picard Bundle Over Moduli Space of Stable Vector ...

    Indian Academy of Sciences (India)

    Abstract. Answering a question of [BV] it is proved that the Picard bundle on the moduli space of stable vector bundles of rank two, on a Riemann surface of genus at least three, with fixed determinant of odd degree is stable.

  2. Deformations of the generalised Picard bundle

    International Nuclear Information System (INIS)

    Biswas, I.; Brambila-Paz, L.; Newstead, P.E.

    2004-08-01

    Let X be a nonsingular algebraic curve of genus g ≥ 3, and let Mξ denote the moduli space of stable vector bundles of rank n ≥ 2 and degree d with fixed determinant ξ over X such that n and d are coprime. We assume that if g = 3 then n ≥ 4 and if g = 4 then n ≥ 3, and suppose further that n 0 , d 0 are integers such that n 0 ≥ 1 and nd 0 + n 0 d > nn 0 (2g - 2). Let E be a semistable vector bundle over X of rank n 0 and degree d 0 . The generalised Picard bundle W ξ (E) is by definition the vector bundle over M ξ defined by the direct image p M ξ *(U ξ x p X * E) where U ξ is a universal vector bundle over X x M ξ . We obtain an inversion formula allowing us to recover E from W ξ (E) and show that the space of infinitesimal deformations of W ξ (E) is isomorphic to H 1 (X, End(E)). This construction gives a locally complete family of vector bundles over M ξ parametrised by the moduli space M(n 0 ,d 0 ) of stable bundles of rank n 0 and degree d 0 over X. If (n 0 ,d 0 ) = 1 and W ξ (E) is stable for all E is an element of M(n 0 ,d 0 ), the construction determines an isomorphism from M(n 0 ,d 0 ) to a connected component M 0 of a moduli space of stable sheaves over M ξ . This applies in particular when n 0 = 1, in which case M 0 is isomorphic to the Jacobian J of X as a polarised variety. The paper as a whole is a generalisation of results of Kempf and Mukai on Picard bundles over J, and is also related to a paper of Tyurin on the geometry of moduli of vector bundles. (author)

  3. Picard-Fuchs equations of dimensionally regulated Feynman integrals

    Energy Technology Data Exchange (ETDEWEB)

    Zayadeh, Raphael

    2013-12-15

    the two-loop sunrise integral with arbitrary fixed masses and varying momentum. It was previously known not to evaluate to multiple polylogarithms, but an analytic answer could not be obtained. Its geometric and number theoretic content is governed by a family of elliptic curves. We provide an inhomogeneous Picard-Fuchs equation which in the meantime lead to an analytic answer of the two-loop sunrise integral. We give a three-loop example where we find a family of K3-surfaces.

  4. Picard-Fuchs equations of dimensionally regulated Feynman integrals

    International Nuclear Information System (INIS)

    Zayadeh, Raphael

    2013-12-01

    -loop sunrise integral with arbitrary fixed masses and varying momentum. It was previously known not to evaluate to multiple polylogarithms, but an analytic answer could not be obtained. Its geometric and number theoretic content is governed by a family of elliptic curves. We provide an inhomogeneous Picard-Fuchs equation which in the meantime lead to an analytic answer of the two-loop sunrise integral. We give a three-loop example where we find a family of K3-surfaces.

  5. Picard-Fuchs uniformization and modularity of the mirror map

    International Nuclear Information System (INIS)

    Doran, C.F.

    2000-01-01

    Arithmetic properties of mirror symmetry (type IIA-IIB string duality) are studied. We give criteria for the mirror map q-series of certain families of Calabi-Yau manifolds to be automorphic functions. For families of elliptic curves and lattice polarized K3 surfaces with surjective period mappings, global Torelli theorems allow one to present these criteria in terms of the ramification behavior of natural algebraic invariants - the functional and generalized functional invariants respectively. In particular, when applied to one parameter families of rank 19 lattice polarized K3 surfaces, our criterion demystifies the mirror-Moonshine phenomenon of Lian and Yau and highlights its non-monstrous nature. The lack of global Torelli theorems and presence of instanton corrections makes Calabi-Yau threefold families more complicated. Via the constraints of special geometry, the Picard-Fuchs equations for one parameter families of Calabi-Yau threefolds imply a differential equation criterion for automorphicity of the mirror map in terms of the Yukawa coupling. In the absence of instanton corrections, the projective periods map to a twisted cubic space curve. A hierarchy of ''algebraic'' instanton corrections correlated with the differential Galois group of the Picard-Fuchs equation is proposed. (orig.)

  6. Solving Differential Equations Using Modified Picard Iteration

    Science.gov (United States)

    Robin, W. A.

    2010-01-01

    Many classes of differential equations are shown to be open to solution through a method involving a combination of a direct integration approach with suitably modified Picard iterative procedures. The classes of differential equations considered include typical initial value, boundary value and eigenvalue problems arising in physics and…

  7. Picard iterations for nonlinear Lipschitz strong pseudo-contractions in uniformly smooth Banach spaces

    International Nuclear Information System (INIS)

    Chidume, C.E.

    1995-06-01

    Suppose E is a real uniformly smooth Banach space and K is a nonempty closed convex and bounded subset of E, T:K → K is a Lipschitz pseudo-contraction. It is proved that the Picard iterates of a suitably defined operator converges strongly to the unique fixed point of T. Furthermore, this result also holds for the slightly larger class of Lipschitz strong hemi-contractions. Related results deal with strong convergence of the Picard iterates to the unique solution of operator equations involving Lipschitz strongly accretive maps. Apart from establishing strong convergence, our theorems give existence, uniqueness and convergence-rate which is at least as fast as a geometric progression. (author). 51 refs

  8. New space value of the solar oblateness obtained with PICARD

    Energy Technology Data Exchange (ETDEWEB)

    Irbah, Abdanour; Meftah, Mustapha; Hauchecorne, Alain; Bocquier, Maxime; Cisse, E. Momar [Laboratoire Atmosphères, Milieux, Observations Spatiales (LATMOS), CNRS: UMR 8190-Université Paris VI-Pierre et Marie Curie-Université de Versailles Saint-Quentin-en-Yvelines-INSU, F-78280, Guyancourt (France); Djafer, Djelloul [Unité de Recherche Appliquée en Energies Renouvelables, URAER, Centre de Développement des Energies Renouvelables, CDER, 47133, Ghardaïa (Algeria); Corbard, Thierry, E-mail: Abdenour.Irbah@latmos.ipsl.fr [Laboratoire Lagrange, UMR7293, Université de Nice Sophia-Antipolis, CNRS, Observatoire de la Côte d' Azur, Bd. de l' Observatoire, F-06304 Nice (France)

    2014-04-20

    The PICARD spacecraft was launched on 2010 June 15 with the scientific objective of studying the geometry of the Sun. It is difficult to measure solar oblateness because images are affected by optical distortion. Rolling the satellite, as done in previous space missions, determines the contribution of the telescope by assuming that the geometry of the Sun is constant during the observations. The optical response of the telescope is considered to be time-invariant during the roll operations. This is not the case for PICARD because an orbital signature is clearly observed in the solar radius computed from its images. We take this effect into account and provide the new space value of solar oblateness from PICARD images recorded in the solar continuum at 535.7 nm on 2011 July 4-5. The equator-pole radius difference is 8.4 ± 0.5 mas, which corresponds to an absolute radius difference of 6.1 km. This coincides with the mean value of all solar oblateness measurements obtained during the last two decades from the ground, balloons, and space. It is also consistent with values determined from models using helioseismology data.

  9. The space instrument SOVAP of the PICARD mission

    Science.gov (United States)

    Conscience, C.; Meftah, M.; Chevalier, A.; Dewitte, S.; Crommelynck, D.,

    2011-09-01

    PICARD is a Satellite dedicated to the simultaneous measurement of the absolute total and spectral solar irradiance, the diameter and solar shape and the Sun's interior probed by helioseismology method. Its objectives are the study of the origin of the solar variability and the study of the relations between the Sun and the Earth's climate. PICARD was launched on June 15, 2010. The Satellite was placed into the heliosynchronous orbit of 735 km with inclination of 98.28 degrees. The payload consists in two absolute radiometers measuring the TSI (Total Solar Irradiance) and an imaging telescope to determine the solar diameter, the limb shape and asphericity. SOVAP (SOlar VAriability Picard) is an experiment developed by the Belgian STCE (Solar Terrestrial Center of Excellence) with a contribution of the CNRS (Centre National de la Recherche Scientifique) composed of an absolute radiometer provided by the RMIB (Royal Meteorological Institute of Belgium) to measure the TSI and a bolometer provided by the ROB (Royal Observatory of Belgium). The continuous observation of the solar irradiance at the highest possible precision and accuracy is an important objective of the Earth climate change. This requires: high quality metrology in the space environment. In this article, we describe the SOVAP instrument, its performances and uncertainties on the measurements of the TSI.

  10. Jean Picard og Ole Rømer på Hven

    DEFF Research Database (Denmark)

    Pedersen, Kurt Møller

    2011-01-01

    Jean Picards rejse til Hven og København i 1671/72 for at bestemme længdeforskellen mellem Tycho Brahes observatorier og observatoriet i Paris.......Jean Picards rejse til Hven og København i 1671/72 for at bestemme længdeforskellen mellem Tycho Brahes observatorier og observatoriet i Paris....

  11. Rigid Calabi-Yau threefolds, Picard Eisenstein series and instantons

    International Nuclear Information System (INIS)

    Bao, L; Kleinschmidt, A; Nilsson, B E W; Persson, D; Pioline, B

    2013-01-01

    Type IIA string theory compactified on a rigid Calabi-Yau threefold gives rise to a classical moduli space that carries an isometric action of U(2, 1). Various quantum corrections break this continuous isometry to a discrete subgroup. Focussing on the case where the intermediate Jacobian of the Calabi-Yau admits complex multiplication by the ring of quadratic imaginary integers O_d, we argue that the remaining quantum duality group is an arithmetic Picard modular group PU(2, 1; O_d). Based on this proposal we construct an Eisenstein series invariant under this duality group and study its non-Abelian Fourier expansion. This allows the prediction of non-perturbative effects, notably the contribution of D2- and NS5-brane instantons. The present work extends our previous analysis in 0909.4299 which was restricted to the special case of the Gaussian integers O_1 = Z[i].

  12. Rigid Calabi-Yau threefolds, Picard Eisenstein series and instantons

    Science.gov (United States)

    Bao, L.; Kleinschmidt, A.; Nilsson, B. E. W.; Persson, D.; Pioline, B.

    2013-12-01

    Type IIA string theory compactified on a rigid Calabi-Yau threefold gives rise to a classical moduli space that carries an isometric action of U(2, 1). Various quantum corrections break this continuous isometry to a discrete subgroup. Focussing on the case where the intermediate Jacobian of the Calabi-Yau admits complex multiplication by the ring of quadratic imaginary integers d, we argue that the remaining quantum duality group is an arithmetic Picard modular group PU(2, 1; d). Based on this proposal we construct an Eisenstein series invariant under this duality group and study its non-Abelian Fourier expansion. This allows the prediction of non-perturbative effects, notably the contribution of D2- and NS5-brane instantons. The present work extends our previous analysis in 0909.4299 which was restricted to the special case of the Gaussian integers 1 = Bbb Z[i].

  13. Super Picard-Fuchs equation and monodromies for supermanifolds

    International Nuclear Information System (INIS)

    Kaura, Payal; Misra, Aalok; Shukla, Pramod

    2007-01-01

    Following, Aganagic and Vafa (e-print hep-th/0403192) and Hori and Vafa (e-print hep-th/0002222), we discuss the Picard-Fuchs equation for the super Landau-Ginsburg mirror to the super Calabi-Yau in WCP (3vertical bar2) [1,1,1,3 vertical bar 1,5] (using techniques of Greene and Lazaroiu [Nucl. Phys. B 604, 181 (2001), e-print hep-th/0001025] and Misra [Fortschr. Phys. 52, 831 (2004), e-print hep-th/0311186]), Meijer basis of solutions, and monodromies (at 0,1 and ∞) in the large and small complex structure limits, as well as obtain the mirror hypersurface, which in the large Kaehler limit turns out to be either a bidegree-(6,6) hypersurface in WCP (3|1) [1,1,1,2]xWCP (1vertical bar1) [1,1 vertical bar 6] or a (Z 2 singular) bidegree-(6,12) hypersurface in WCP (3vertical bar1) [1,1,2,6 vertical bar 6]xWCP (1vertical bar1) [1,1 vertical bar 6

  14. The Picard group of the moduli space of r-Spin Riemann surfaces

    DEFF Research Database (Denmark)

    Randal-Williams, Oscar

    2012-01-01

    An r-Spin Riemann surface is a Riemann surface equipped with a choice of rth root of the (co)tangent bundle. We give a careful construction of the moduli space (orbifold) of r-Spin Riemann surfaces, and explain how to establish a Madsen–Weiss theorem for it. This allows us to prove the “Mumford...... conjecture” for these moduli spaces, but more interestingly allows us to compute their algebraic Picard groups (for g≥10, or g≥9 in the 2-Spin case). We give a complete description of these Picard groups, in terms of explicitly constructed line bundles....

  15. Une mission astronomique de Jean Picard: Le voyage d'Uraniborg

    DEFF Research Database (Denmark)

    Pedersen, Kurt Møller

    1987-01-01

    In order to determine the difference in longitude between Tycho Brahe's observatory on the island of Hven and the new observatory in Paris, the French astronomer Jean Picard travelled to Copenhagen with the most accurate equipment to measure that difference. The mission was a success, he determin...... the difference that was only 10 minutes wrong compared to a modern value and he brought with him back to Paris Ole Roemer. In this paper I analyze Picard scientific achiements and methods while on Hven and at the Round Tower in Copenhagen....

  16. Variation Patterns in Across-Word Regressive Assimilation in Picard: An Optimality Theoretic Account.

    Science.gov (United States)

    Cardoso, Walcir

    2001-01-01

    Offers an optimality theoretic account for the phonological process of across-word regressive assimilation (AWRA) in Picard, a Gallo-Romance dialect spoken in the Picardie region in Northern France and Southern Belgium. Focuses on the varieties spoken in the Vimeu region of France. Examines one particular topic in the analysis of AWRA: the…

  17. Bifurcation analysis of incompressible flow in a driven cavity by the Newton–Picard method

    NARCIS (Netherlands)

    Tiesinga, G; Wubs, FW; Veldman, AEP

    2002-01-01

    Knowledge of the transition point of steady to periodic flow is becoming increasingly important in the study of laminar–turbulent flow transition or fluid–structure interaction. Such knowledge becomes available through the Newton–Picard method, a method related to the recursive projection method.

  18. Weak point property and sections of Picard bundles on a ...

    Indian Academy of Sciences (India)

    Introduction. Debarre had proved that the Jacobian J0(X0) of a smooth curve X0 satisfies the diagonal property (Corollary 2.2 of [6]) i.e., there is a vector bundle of rank equal to the dimension of J0(X0) over J0(X0) × J0(X0), having a section whose zero scheme is the diagonal of J0(X0) × J0(X0). In this note, we generalize ...

  19. Q-factorial Gorenstein toric Fano varieties with large Picard number

    DEFF Research Database (Denmark)

    Nill, Benjamin; Øbro, Mikkel

    2010-01-01

    In dimension $d$, ${\\boldsymbol Q}$-factorial Gorenstein toric Fano varieties with Picard number $\\rho_X$ correspond to simplicial reflexive polytopes with $\\rho_X + d$ vertices. Casagrande showed that any $d$-dimensional simplicial reflexive polytope has at most $3 d$ and $3d-1$ vertices if $d......$ is even and odd, respectively. Moreover, for $d$ even there is up to unimodular equivalence only one such polytope with $3 d$ vertices, corresponding to the product of $d/2$ copies of a del Pezzo surface of degree six. In this paper we completely classify all $d$-dimensional simplicial reflexive polytopes...... having $3d-1$ vertices, corresponding to $d$-dimensional ${\\boldsymbol Q}$-factorial Gorenstein toric Fano varieties with Picard number $2d-1$. For $d$ even, there exist three such varieties, with two being singular, while for $d > 1$ odd there exist precisely two, both being nonsingular toric fiber...

  20. Picard-Fuchs equations and the moduli space of superconformal field theories

    International Nuclear Information System (INIS)

    Cadavid, A.C.; Ferrara, S.

    1991-01-01

    We derive simple techniques which allow us to relate Picard-Fuchs differential equations for the periods of holomorphic p-forms on certain complex manifolds, to their moduli space and its modular group (target space duality). For Calabi-Yau manifolds the special geometry of moduli space gives the Zamolodchikov metric and the Yukawa couplings in terms of the periods. For general N=2 superconformal theories these equations exactly determine perturbed correlation functions of the chiral rings of primary fields. (orig.)

  1. Rank Dynamics

    Science.gov (United States)

    Gershenson, Carlos

    Studies of rank distributions have been popular for decades, especially since the work of Zipf. For example, if we rank words of a given language by use frequency (most used word in English is 'the', rank 1; second most common word is 'of', rank 2), the distribution can be approximated roughly with a power law. The same applies for cities (most populated city in a country ranks first), earthquakes, metabolism, the Internet, and dozens of other phenomena. We recently proposed ``rank diversity'' to measure how ranks change in time, using the Google Books Ngram dataset. Studying six languages between 1800 and 2009, we found that the rank diversity curves of languages are universal, adjusted with a sigmoid on log-normal scale. We are studying several other datasets (sports, economies, social systems, urban systems, earthquakes, artificial life). Rank diversity seems to be universal, independently of the shape of the rank distribution. I will present our work in progress towards a general description of the features of rank change in time, along with simple models which reproduce it

  2. An Efficient Algorithm for Perturbed Orbit Integration Combining Analytical Continuation and Modified Chebyshev Picard Iteration

    Science.gov (United States)

    Elgohary, T.; Kim, D.; Turner, J.; Junkins, J.

    2014-09-01

    Several methods exist for integrating the motion in high order gravity fields. Some recent methods use an approximate starting orbit, and an efficient method is needed for generating warm starts that account for specific low order gravity approximations. By introducing two scalar Lagrange-like invariants and employing Leibniz product rule, the perturbed motion is integrated by a novel recursive formulation. The Lagrange-like invariants allow exact arbitrary order time derivatives. Restricting attention to the perturbations due to the zonal harmonics J2 through J6, we illustrate an idea. The recursively generated vector-valued time derivatives for the trajectory are used to develop a continuation series-based solution for propagating position and velocity. Numerical comparisons indicate performance improvements of ~ 70X over existing explicit Runge-Kutta methods while maintaining mm accuracy for the orbit predictions. The Modified Chebyshev Picard Iteration (MCPI) is an iterative path approximation method to solve nonlinear ordinary differential equations. The MCPI utilizes Picard iteration with orthogonal Chebyshev polynomial basis functions to recursively update the states. The key advantages of the MCPI are as follows: 1) Large segments of a trajectory can be approximated by evaluating the forcing function at multiple nodes along the current approximation during each iteration. 2) It can readily handle general gravity perturbations as well as non-conservative forces. 3) Parallel applications are possible. The Picard sequence converges to the solution over large time intervals when the forces are continuous and differentiable. According to the accuracy of the starting solutions, however, the MCPI may require significant number of iterations and function evaluations compared to other integrators. In this work, we provide an efficient methodology to establish good starting solutions from the continuation series method; this warm start improves the performance of the

  3. Solution for the multigroup neutron space kinetics equations by the modified Picard algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Tavares, Matheus G.; Petersen, Claudio Z., E-mail: matheus.gulartetavares@gmail.com [Universidade Federal de Pelotas (UFPEL), Capao do Leao, RS (Brazil). Departamento de Matematica e Estatistica; Schramm, Marcelo, E-mail: schrammmarcelo@gmail.com [Universidade Federal de Pelotas (UFPEL), RS (Brazil). Centro de Engenharias; Zanette, Rodrigo, E-mail: rodrigozanette@hotmail.com [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Instituto de Matematica e Estatistica

    2017-07-01

    In this work, we used a modified Picards method to solve the Multigroup Neutron Space Kinetics Equations (MNSKE) in Cartesian geometry. The method consists in assuming an initial guess for the neutron flux and using it to calculate a fictitious source term in the MNSKE. A new source term is calculated applying its solution, and so on, iteratively, until a stop criterion is satisfied. For the solution of the fast and thermal neutron fluxes equations, the Laplace Transform technique is used in time variable resulting in a rst order linear differential matrix equation, which are solved by classical methods in the literature. After each iteration, the scalar neutron flux and the delayed neutron precursors are reconstructed by polynomial interpolation. We obtain the fluxes and precursors through Numerical Inverse Laplace Transform using the Stehfest method. We present numerical simulations and comparisons with available results in literature. (author)

  4. Solution for the multigroup neutron space kinetics equations by the modified Picard algorithm

    International Nuclear Information System (INIS)

    Tavares, Matheus G.; Petersen, Claudio Z.; Schramm, Marcelo; Zanette, Rodrigo

    2017-01-01

    In this work, we used a modified Picards method to solve the Multigroup Neutron Space Kinetics Equations (MNSKE) in Cartesian geometry. The method consists in assuming an initial guess for the neutron flux and using it to calculate a fictitious source term in the MNSKE. A new source term is calculated applying its solution, and so on, iteratively, until a stop criterion is satisfied. For the solution of the fast and thermal neutron fluxes equations, the Laplace Transform technique is used in time variable resulting in a rst order linear differential matrix equation, which are solved by classical methods in the literature. After each iteration, the scalar neutron flux and the delayed neutron precursors are reconstructed by polynomial interpolation. We obtain the fluxes and precursors through Numerical Inverse Laplace Transform using the Stehfest method. We present numerical simulations and comparisons with available results in literature. (author)

  5. Geometric regularizations and dual conifold transitions

    International Nuclear Information System (INIS)

    Landsteiner, Karl; Lazaroiu, Calin I.

    2003-01-01

    We consider a geometric regularization for the class of conifold transitions relating D-brane systems on noncompact Calabi-Yau spaces to certain flux backgrounds. This regularization respects the SL(2,Z) invariance of the flux superpotential, and allows for computation of the relevant periods through the method of Picard-Fuchs equations. The regularized geometry is a noncompact Calabi-Yau which can be viewed as a monodromic fibration, with the nontrivial monodromy being induced by the regulator. It reduces to the original, non-monodromic background when the regulator is removed. Using this regularization, we discuss the simple case of the local conifold, and show how the relevant field-theoretic information can be extracted in this approach. (author)

  6. The differential-geometric aspects of integrable dynamical systems

    International Nuclear Information System (INIS)

    Prykarpatsky, Y.A.; Samoilenko, A.M.; Prykarpatsky, A.K.; Bogolubov, N.N. Jr.; Blackmore, D.L.

    2007-05-01

    The canonical reduction method on canonically symplectic manifolds is analyzed in detail, and the relationships with the geometric properties of associated principal fiber bundles endowed with connection structures are described. Some results devoted to studying geometrical properties of nonabelian Yang-Mills type gauge field equations are presented. A symplectic theory approach is developed for partially solving the problem of algebraic-analytical construction of integral submanifold embeddings for integrable (via the abelian and nonabelian Liouville-Arnold theorems) Hamiltonian systems on canonically symplectic phase spaces. The fundamental role of the so-called Picard-Fuchs type equations is revealed, and their differential-geometric and algebraic properties are studied in detail. Some interesting examples of integrable Hamiltonian systems are are studied in detail in order to demonstrate the ease of implementation and effectiveness of the procedure for investigating the integral submanifold embedding mapping. (author)

  7. Geometric theory of information

    CERN Document Server

    2014-01-01

    This book brings together geometric tools and their applications for Information analysis. It collects current and many uses of in the interdisciplinary fields of Information Geometry Manifolds in Advanced Signal, Image & Video Processing, Complex Data Modeling and Analysis, Information Ranking and Retrieval, Coding, Cognitive Systems, Optimal Control, Statistics on Manifolds, Machine Learning, Speech/sound recognition, and natural language treatment which are also substantially relevant for the industry.

  8. A new Weyl-like tensor of geometric origin

    Science.gov (United States)

    Vishwakarma, Ram Gopal

    2018-04-01

    A set of new tensors of purely geometric origin have been investigated, which form a hierarchy. A tensor of a lower rank plays the role of the potential for the tensor of one rank higher. The tensors have interesting mathematical and physical properties. The highest rank tensor of the hierarchy possesses all the geometrical properties of the Weyl tensor.

  9. University Rankings: The Web Ranking

    Science.gov (United States)

    Aguillo, Isidro F.

    2012-01-01

    The publication in 2003 of the Ranking of Universities by Jiao Tong University of Shanghai has revolutionized not only academic studies on Higher Education, but has also had an important impact on the national policies and the individual strategies of the sector. The work gathers the main characteristics of this and other global university…

  10. Multiple Revolution Solutions for the Perturbed Lambert Problem using the Method of Particular Solutions and Picard Iteration

    Science.gov (United States)

    Woollands, Robyn M.; Read, Julie L.; Probe, Austin B.; Junkins, John L.

    2017-12-01

    We present a new method for solving the multiple revolution perturbed Lambert problem using the method of particular solutions and modified Chebyshev-Picard iteration. The method of particular solutions differs from the well-known Newton-shooting method in that integration of the state transition matrix (36 additional differential equations) is not required, and instead it makes use of a reference trajectory and a set of n particular solutions. Any numerical integrator can be used for solving two-point boundary problems with the method of particular solutions, however we show that using modified Chebyshev-Picard iteration affords an avenue for increased efficiency that is not available with other step-by-step integrators. We take advantage of the path approximation nature of modified Chebyshev-Picard iteration (nodes iteratively converge to fixed points in space) and utilize a variable fidelity force model for propagating the reference trajectory. Remarkably, we demonstrate that computing the particular solutions with only low fidelity function evaluations greatly increases the efficiency of the algorithm while maintaining machine precision accuracy. Our study reveals that solving the perturbed Lambert's problem using the method of particular solutions with modified Chebyshev-Picard iteration is about an order of magnitude faster compared with the classical shooting method and a tenth-twelfth order Runge-Kutta integrator. It is well known that the solution to Lambert's problem over multiple revolutions is not unique and to ensure that all possible solutions are considered we make use of a reliable preexisting Keplerian Lambert solver to warm start our perturbed algorithm.

  11. Geometrical parton

    Energy Technology Data Exchange (ETDEWEB)

    Ebata, T [Tohoku Univ., Sendai (Japan). Coll. of General Education

    1976-06-01

    The geometrical distribution inferred from the inelastic cross section is assumed to be proportional to the partial waves. The precocious scaling and the Q/sup 2/-dependence of various quantities are treated from the geometrical point of view. It is shown that the approximate conservation of the orbital angular momentum may be a very practical rule to understand the helicity structure of various hadronic and electromagnetic reactions. The rule can be applied to inclusive reactions as well. The model is also applied to large angle processes. Through the discussion, it is suggested that many peculiar properties of the quark-parton can be ascribed to the geometrical effects.

  12. Total solar irradiance as measured by the SOVAP radiometer onboard PICARD

    Directory of Open Access Journals (Sweden)

    Meftah Mustapha

    2016-01-01

    Full Text Available From the SOlar VAriability PICARD (SOVAP space-based radiometer, we obtained a new time series of the total solar irradiance (TSI during Solar Cycle 24. Based on SOVAP data, we obtained that the TSI input at the top of the Earth’s atmosphere at a distance of one astronomical unit from the Sun is 1361.8 ± 2.4 W m−2 (1σ representative of the 2008 solar minimum period. From 2010 to 2014, the amplitude of the changes has been of the order of ± 0.1%, corresponding to a range of about 2.7 W m−2. To determine the TSI from SOVAP, we present here an improved instrument equation. A parameter was integrated from a theoretical analysis that highlighted the thermo-electrical non-equivalence of the radiometric cavity. From this approach, we obtained values that are lower than those previously provided with the same type of instrument. The results in this paper supersede the previous SOVAP analysis and provide the best SOVAP-based TSI-value estimate and its temporal variation.

  13. Bounding the number of limit cycles of discontinuous differential systems by using Picard-Fuchs equations

    Science.gov (United States)

    Yang, Jihua; Zhao, Liqin

    2018-05-01

    In this paper, by using Picard-Fuchs equations and Chebyshev criterion, we study the upper bounds of the number of limit cycles given by the first order Melnikov function for discontinuous differential systems, which can bifurcate from the periodic orbits of quadratic reversible centers of genus one (r19): x ˙ = y - 12x2 + 16y2, y ˙ = - x - 16 xy, and (r20): x ˙ = y + 4x2, y ˙ = - x + 16 xy, and the periodic orbits of the quadratic isochronous centers (S1) : x ˙ = - y +x2 -y2, y ˙ = x + 2 xy, and (S2) : x ˙ = - y +x2, y ˙ = x + xy. The systems (r19) and (r20) are perturbed inside the class of polynomial differential systems of degree n and the system (S1) and (S2) are perturbed inside the class of quadratic polynomial differential systems. The discontinuity is the line y = 0. It is proved that the upper bounds of the number of limit cycles for systems (r19) and (r20) are respectively 4 n - 3 (n ≥ 4) and 4 n + 3 (n ≥ 3) counting the multiplicity, and the maximum numbers of limit cycles bifurcating from the period annuluses of the isochronous centers (S1) and (S2) are exactly 5 and 6 (counting the multiplicity) on each period annulus respectively.

  14. Geometric analysis

    CERN Document Server

    Bray, Hubert L; Mazzeo, Rafe; Sesum, Natasa

    2015-01-01

    This volume includes expanded versions of the lectures delivered in the Graduate Minicourse portion of the 2013 Park City Mathematics Institute session on Geometric Analysis. The papers give excellent high-level introductions, suitable for graduate students wishing to enter the field and experienced researchers alike, to a range of the most important areas of geometric analysis. These include: the general issue of geometric evolution, with more detailed lectures on Ricci flow and Kähler-Ricci flow, new progress on the analytic aspects of the Willmore equation as well as an introduction to the recent proof of the Willmore conjecture and new directions in min-max theory for geometric variational problems, the current state of the art regarding minimal surfaces in R^3, the role of critical metrics in Riemannian geometry, and the modern perspective on the study of eigenfunctions and eigenvalues for Laplace-Beltrami operators.

  15. Transmuted Complementary Weibull Geometric Distribution

    Directory of Open Access Journals (Sweden)

    Ahmed Z. A…fify

    2014-12-01

    Full Text Available This paper provides a new generalization of the complementary Weibull geometric distribution that introduced by Tojeiro et al. (2014, using the quadratic rank transmutation map studied by Shaw and Buckley (2007. The new distribution is referred to as transmuted complementary Weibull geometric distribution (TCWGD. The TCWG distribution includes as special cases the complementary Weibull geometric distribution (CWGD, complementary exponential geometric distribution(CEGD,Weibull distribution (WD and exponential distribution (ED. Various structural properties of the new distribution including moments, quantiles, moment generating function and RØnyi entropy of the subject distribution are derived. We proposed the method of maximum likelihood for estimating the model parameters and obtain the observed information matrix. A real data set are used to compare the ‡exibility of the transmuted version versus the complementary Weibull geometric distribution.

  16. Geometric metamorphosis.

    Science.gov (United States)

    Niethammer, Marc; Hart, Gabriel L; Pace, Danielle F; Vespa, Paul M; Irimia, Andrei; Van Horn, John D; Aylward, Stephen R

    2011-01-01

    Standard image registration methods do not account for changes in image appearance. Hence, metamorphosis approaches have been developed which jointly estimate a space deformation and a change in image appearance to construct a spatio-temporal trajectory smoothly transforming a source to a target image. For standard metamorphosis, geometric changes are not explicitly modeled. We propose a geometric metamorphosis formulation, which explains changes in image appearance by a global deformation, a deformation of a geometric model, and an image composition model. This work is motivated by the clinical challenge of predicting the long-term effects of traumatic brain injuries based on time-series images. This work is also applicable to the quantification of tumor progression (e.g., estimating its infiltrating and displacing components) and predicting chronic blood perfusion changes after stroke. We demonstrate the utility of the method using simulated data as well as scans from a clinical traumatic brain injury patient.

  17. Concordance négative optionnelle : contrastes forts et faibles entre picard et québécois

    Directory of Open Access Journals (Sweden)

    Dagnac Anne

    2016-01-01

    Full Text Available Cet article, basédeux études decorpus,comparele phénomène de la concordance négative(CNenpicard et enfrançais montréalais. Après avoir défini les phénomènes étudiés, il présenterapidement lefonctionnement de la négation et de la concordance négative en picard, et leurressemblances avec le système montréalais.La concordance entre marqueur négatifet mot-N y est à la fois possible et optionnelle: j’n’in sais (mie rien ‘je n’en sais rien’ (picard, j’ai (pasrien contre la loi cent un ‘je n’ai rien contre la loi cent un’ (québécois. Les contrastes en termes de contextes syntaxiques permettant ou non la CNoptionnelle, conduisent à poser ces deux dialectes commetypologiquement distinctssur des points considérés comme théoriquement cruciaux, comme la possibilité de la CNentre un marqueur denégation et un mot-N préverbalou dans des énoncés fragmentaires. Néanmoins, onmontre qu’une prise en compte plus fine des propriétéslexicalesdes items en jeuet de leurs fréquences d’emploi relativesmodifiece schéma typologique:elle montred’étonnantes convergences entre les deux systèmes, qui invitent à repenser la manière d’aborder la microvariation syntaxique. L’article défend enfin l’hypothèse que les différences entre les deux dialectes reposent sur l’existence d’un marqueur secondaire en picard, occupant une position syntaxique distinctedu marqueur pas ou point.

  18. Sparse structure regularized ranking

    KAUST Repository

    Wang, Jim Jing-Yan; Sun, Yijun; Gao, Xin

    2014-01-01

    Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse

  19. Geometric recursion

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas

    We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... as Poisson structures on the moduli space of flat connections. The theory has a wider scope than that and one expects that many functorial objects in low-dimensional geometry and topology should have a GR construction. The geometric recursion has various projections to topological recursion (TR) and we...... in particular show it retrieves all previous variants and applications of TR. We also show that, for any initial data for topological recursion, one can construct initial data for GR with values in Frobenius algebra-valued continuous functions on Teichmueller space, such that the ωg,n of TR are obtained...

  20. Efficient Rank Reduction of Correlation Matrices

    NARCIS (Netherlands)

    I. Grubisic (Igor); R. Pietersz (Raoul)

    2005-01-01

    textabstractGeometric optimisation algorithms are developed that efficiently find the nearest low-rank correlation matrix. We show, in numerical tests, that our methods compare favourably to the existing methods in the literature. The connection with the Lagrange multiplier method is established,

  1. Reduced Rank Regression

    DEFF Research Database (Denmark)

    Johansen, Søren

    2008-01-01

    The reduced rank regression model is a multivariate regression model with a coefficient matrix with reduced rank. The reduced rank regression algorithm is an estimation procedure, which estimates the reduced rank regression model. It is related to canonical correlations and involves calculating...

  2. Ranking Operations Management conferences

    NARCIS (Netherlands)

    Steenhuis, H.J.; de Bruijn, E.J.; Gupta, Sushil; Laptaned, U

    2007-01-01

    Several publications have appeared in the field of Operations Management which rank Operations Management related journals. Several ranking systems exist for journals based on , for example, perceived relevance and quality, citation, and author affiliation. Many academics also publish at conferences

  3. Sparse structure regularized ranking

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-04-17

    Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

  4. A tilting approach to ranking influence

    KAUST Repository

    Genton, Marc G.

    2014-12-01

    We suggest a new approach, which is applicable for general statistics computed from random samples of univariate or vector-valued or functional data, to assessing the influence that individual data have on the value of a statistic, and to ranking the data in terms of that influence. Our method is based on, first, perturbing the value of the statistic by ‘tilting’, or reweighting, each data value, where the total amount of tilt is constrained to be the least possible, subject to achieving a given small perturbation of the statistic, and, then, taking the ranking of the influence of data values to be that which corresponds to ranking the changes in data weights. It is shown, both theoretically and numerically, that this ranking does not depend on the size of the perturbation, provided that the perturbation is sufficiently small. That simple result leads directly to an elegant geometric interpretation of the ranks; they are the ranks of the lengths of projections of the weights onto a ‘line’ determined by the first empirical principal component function in a generalized measure of covariance. To illustrate the generality of the method we introduce and explore it in the case of functional data, where (for example) it leads to generalized boxplots. The method has the advantage of providing an interpretable ranking that depends on the statistic under consideration. For example, the ranking of data, in terms of their influence on the value of a statistic, is different for a measure of location and for a measure of scale. This is as it should be; a ranking of data in terms of their influence should depend on the manner in which the data are used. Additionally, the ranking recognizes, rather than ignores, sign, and in particular can identify left- and right-hand ‘tails’ of the distribution of a random function or vector.

  5. On bivariate geometric distribution

    Directory of Open Access Journals (Sweden)

    K. Jayakumar

    2013-05-01

    Full Text Available Characterizations of bivariate geometric distribution using univariate and bivariate geometric compounding are obtained. Autoregressive models with marginals as bivariate geometric distribution are developed. Various bivariate geometric distributions analogous to important bivariate exponential distributions like, Marshall-Olkin’s bivariate exponential, Downton’s bivariate exponential and Hawkes’ bivariate exponential are presented.

  6. Visualizing the Geometric Series.

    Science.gov (United States)

    Bennett, Albert B., Jr.

    1989-01-01

    Mathematical proofs often leave students unconvinced or without understanding of what has been proved, because they provide no visual-geometric representation. Presented are geometric models for the finite geometric series when r is a whole number, and the infinite geometric series when r is the reciprocal of a whole number. (MNS)

  7. How to Rank Journals.

    Science.gov (United States)

    Bradshaw, Corey J A; Brook, Barry W

    2016-01-01

    There are now many methods available to assess the relative citation performance of peer-reviewed journals. Regardless of their individual faults and advantages, citation-based metrics are used by researchers to maximize the citation potential of their articles, and by employers to rank academic track records. The absolute value of any particular index is arguably meaningless unless compared to other journals, and different metrics result in divergent rankings. To provide a simple yet more objective way to rank journals within and among disciplines, we developed a κ-resampled composite journal rank incorporating five popular citation indices: Impact Factor, Immediacy Index, Source-Normalized Impact Per Paper, SCImago Journal Rank and Google 5-year h-index; this approach provides an index of relative rank uncertainty. We applied the approach to six sample sets of scientific journals from Ecology (n = 100 journals), Medicine (n = 100), Multidisciplinary (n = 50); Ecology + Multidisciplinary (n = 25), Obstetrics & Gynaecology (n = 25) and Marine Biology & Fisheries (n = 25). We then cross-compared the κ-resampled ranking for the Ecology + Multidisciplinary journal set to the results of a survey of 188 publishing ecologists who were asked to rank the same journals, and found a 0.68-0.84 Spearman's ρ correlation between the two rankings datasets. Our composite index approach therefore approximates relative journal reputation, at least for that discipline. Agglomerative and divisive clustering and multi-dimensional scaling techniques applied to the Ecology + Multidisciplinary journal set identified specific clusters of similarly ranked journals, with only Nature & Science separating out from the others. When comparing a selection of journals within or among disciplines, we recommend collecting multiple citation-based metrics for a sample of relevant and realistic journals to calculate the composite rankings and their relative uncertainty windows.

  8. On Page Rank

    NARCIS (Netherlands)

    Hoede, C.

    In this paper the concept of page rank for the world wide web is discussed. The possibility of describing the distribution of page rank by an exponential law is considered. It is shown that the concept is essentially equal to that of status score, a centrality measure discussed already in 1953 by

  9. On Rank and Nullity

    Science.gov (United States)

    Dobbs, David E.

    2012-01-01

    This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

  10. Hitting the Rankings Jackpot

    Science.gov (United States)

    Chapman, David W.

    2008-01-01

    Recently, Samford University was ranked 27th in the nation in a report released by "Forbes" magazine. In this article, the author relates how the people working at Samford University were surprised at its ranking. Although Samford is the largest privately institution in Alabama, its distinguished academic achievements aren't even…

  11. Dissatisfaction of Compact Picard Condition (CPC) with GRACE satellite data and its treatment by Generalized Tikhonov in Sobolev subspace

    Science.gov (United States)

    AllahTavakoli, Y.; Bagheri, H.; Safari, A.; Sharifi, M.

    2012-04-01

    This paper is mainly aiming to prove that the stripy noises in the map of earth's surface mass-density changes derived from GRACE Satellites gravimetry, is due to a dissatisfaction of Compact Picard Condition (CPC) with the GRACE data in the inversion of the Newton Integral Equation over the thin layer of earth; and hence the paper proposes the regularization strategies as efficient tools to treat the Ill-posedness and consequently to de-strip the data. First of all, we preferred to slightly modify the mathematical model of earth's surface mass-density changes developed creatively first by J. Wahr and et.al (1998), according to the all their previous assumptions plus taking into consideration the effect of the earth topography. By the modification we expect that some uncertainties in the prior model have been reduced to some extent. Then we analyzed the CPC on the model and we demonstrated how to perform Generalized Tikhonov regularization in Sobolev subspace for overcoming the instability of the problem. Then we applied the strategy in some simulations and case studies to validate our ideas. The simulations confirm that the stripy noises in the GRACE-derived map of the mass-density changes are due to the CPC dissatisfaction and furthermore the case studies show that Generalized Tikhonov regularization in Sobolev subspace is an influential filtering tool to de-strip the noisy data. Also, the case studies interestingly show that the effect of the topography is comparable to the effect of the load Love numbers on the Wahr's model; hence it may be taken into consideration when the load Love numbers have been taken into account.

  12. Geometric Design Laboratory

    Data.gov (United States)

    Federal Laboratory Consortium — Purpose: The mission of the Geometric Design Laboratory (GDL) is to support the Office of Safety Research and Development in research related to the geometric design...

  13. Recurrent fuzzy ranking methods

    Science.gov (United States)

    Hajjari, Tayebeh

    2012-11-01

    With the increasing development of fuzzy set theory in various scientific fields and the need to compare fuzzy numbers in different areas. Therefore, Ranking of fuzzy numbers plays a very important role in linguistic decision-making, engineering, business and some other fuzzy application systems. Several strategies have been proposed for ranking of fuzzy numbers. Each of these techniques has been shown to produce non-intuitive results in certain case. In this paper, we reviewed some recent ranking methods, which will be useful for the researchers who are interested in this area.

  14. Assessing the beginning to end-of-mission sensitivity change of the PREcision MOnitor Sensor total solar irradiance radiometer (PREMOS/PICARD

    Directory of Open Access Journals (Sweden)

    Ball William T.

    2016-01-01

    Full Text Available The switching of the total solar irradiance (TSI backup radiometer (PREMOS-B to a primary role for 2 weeks at the end of the PICARD mission provides a unique opportunity to test the fundamental hypothesis of radiometer experiments in space, which is that the sensitivity change of instruments due to the space environment is identical for the same instrument type as a function of solar-exposure time of the instruments. We verify this hypothesis for the PREMOS TSI radiometers within the PREMOS experiment on the PICARD mission. We confirm that the sensitivity change of the backup instrument, PREMOS-B, is similar to that of the identically-constructed primary radiometer, PREMOS-A. The extended exposure of the backup instrument at the end of the mission allows for the assessment, with an uncertainty estimate, of the sensitivity change of the primary radiometer from the beginning of the PICARD mission compared to the end, and of the degradation of the backup over the mission. We correct six sets of PREMOS-B observations connecting October 2011 with February 2014, using six ratios from simultaneous PREMOS-A and PREMOS-B exposures during the first days of PREMOS-A operation in 2010. These ratios are then used, without indirect estimates or assumptions, to evaluate the stability of SORCE/TIM and SOHO/VIRGO TSI measurements, which have both operated for more than a decade and now show different trends over the time span of the PICARD mission, namely from 2010 to 2014. We find that by February 2014 relative to October 2011 PREMOS-B supports the SORCE/TIM TSI time evolution, which in May 2014 relative to October 2011 is ~0.11 W m−2, or ~84 ppm, higher than SOHO/VIRGO. Such a divergence between SORCE/TIM and SOHO/VIRGO over this period is a significant fraction of the estimated decline of 0.2 W m−2 between the solar minima of 1996 and 2008, and questions the reliability of that estimated trend. Extrapolating the uncertainty indicated by the

  15. Ranking as parameter estimation

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav; Guy, Tatiana Valentine

    2009-01-01

    Roč. 4, č. 2 (2009), s. 142-158 ISSN 1745-7645 R&D Projects: GA MŠk 2C06001; GA AV ČR 1ET100750401; GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : ranking * Bayesian estimation * negotiation * modelling Subject RIV: BB - Applied Statistics, Operational Research http://library.utia.cas.cz/separaty/2009/AS/karny- ranking as parameter estimation.pdf

  16. Hierarchical partial order ranking

    International Nuclear Information System (INIS)

    Carlsen, Lars

    2008-01-01

    Assessing the potential impact on environmental and human health from the production and use of chemicals or from polluted sites involves a multi-criteria evaluation scheme. A priori several parameters are to address, e.g., production tonnage, specific release scenarios, geographical and site-specific factors in addition to various substance dependent parameters. Further socio-economic factors may be taken into consideration. The number of parameters to be included may well appear to be prohibitive for developing a sensible model. The study introduces hierarchical partial order ranking (HPOR) that remedies this problem. By HPOR the original parameters are initially grouped based on their mutual connection and a set of meta-descriptors is derived representing the ranking corresponding to the single groups of descriptors, respectively. A second partial order ranking is carried out based on the meta-descriptors, the final ranking being disclosed though average ranks. An illustrative example on the prioritisation of polluted sites is given. - Hierarchical partial order ranking of polluted sites has been developed for prioritization based on a large number of parameters

  17. Multiplex PageRank.

    Science.gov (United States)

    Halu, Arda; Mondragón, Raúl J; Panzarasa, Pietro; Bianconi, Ginestra

    2013-01-01

    Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

  18. Multiplex PageRank.

    Directory of Open Access Journals (Sweden)

    Arda Halu

    Full Text Available Many complex systems can be described as multiplex networks in which the same nodes can interact with one another in different layers, thus forming a set of interacting and co-evolving networks. Examples of such multiplex systems are social networks where people are involved in different types of relationships and interact through various forms of communication media. The ranking of nodes in multiplex networks is one of the most pressing and challenging tasks that research on complex networks is currently facing. When pairs of nodes can be connected through multiple links and in multiple layers, the ranking of nodes should necessarily reflect the importance of nodes in one layer as well as their importance in other interdependent layers. In this paper, we draw on the idea of biased random walks to define the Multiplex PageRank centrality measure in which the effects of the interplay between networks on the centrality of nodes are directly taken into account. In particular, depending on the intensity of the interaction between layers, we define the Additive, Multiplicative, Combined, and Neutral versions of Multiplex PageRank, and show how each version reflects the extent to which the importance of a node in one layer affects the importance the node can gain in another layer. We discuss these measures and apply them to an online multiplex social network. Findings indicate that taking the multiplex nature of the network into account helps uncover the emergence of rankings of nodes that differ from the rankings obtained from one single layer. Results provide support in favor of the salience of multiplex centrality measures, like Multiplex PageRank, for assessing the prominence of nodes embedded in multiple interacting networks, and for shedding a new light on structural properties that would otherwise remain undetected if each of the interacting networks were analyzed in isolation.

  19. Groundwater contaminant plume ranking

    International Nuclear Information System (INIS)

    1988-08-01

    Containment plumes at Uranium Mill Tailings Remedial Action (UMTRA) Project sites were ranked to assist in Subpart B (i.e., restoration requirements of 40 CFR Part 192) compliance strategies for each site, to prioritize aquifer restoration, and to budget future requests and allocations. The rankings roughly estimate hazards to the environment and human health, and thus assist in determining for which sites cleanup, if appropriate, will provide the greatest benefits for funds available. The rankings are based on the scores that were obtained using the US Department of Energy's (DOE) Modified Hazard Ranking System (MHRS). The MHRS and HRS consider and score three hazard modes for a site: migration, fire and explosion, and direct contact. The migration hazard mode score reflects the potential for harm to humans or the environment from migration of a hazardous substance off a site by groundwater, surface water, and air; it is a composite of separate scores for each of these routes. For ranking the containment plumes at UMTRA Project sites, it was assumed that each site had been remediated in compliance with the EPA standards and that relict contaminant plumes were present. Therefore, only the groundwater route was scored, and the surface water and air routes were not considered. Section 2.0 of this document describes the assumptions and procedures used to score the groundwater route, and Section 3.0 provides the resulting scores for each site. 40 tabs

  20. Ranking economic history journals

    DEFF Research Database (Denmark)

    Di Vaio, Gianfranco; Weisdorf, Jacob Louis

    2010-01-01

    This study ranks-for the first time-12 international academic journals that have economic history as their main topic. The ranking is based on data collected for the year 2007. Journals are ranked using standard citation analysis where we adjust for age, size and self-citation of journals. We also...... compare the leading economic history journals with the leading journals in economics in order to measure the influence on economics of economic history, and vice versa. With a few exceptions, our results confirm the general idea about what economic history journals are the most influential for economic...... history, and that, although economic history is quite independent from economics as a whole, knowledge exchange between the two fields is indeed going on....

  1. Ranking Economic History Journals

    DEFF Research Database (Denmark)

    Di Vaio, Gianfranco; Weisdorf, Jacob Louis

    This study ranks - for the first time - 12 international academic journals that have economic history as their main topic. The ranking is based on data collected for the year 2007. Journals are ranked using standard citation analysis where we adjust for age, size and self-citation of journals. We...... also compare the leading economic history journals with the leading journals in economics in order to measure the influence on economics of economic history, and vice versa. With a few exceptions, our results confirm the general idea about what economic history journals are the most influential...... for economic history, and that, although economic history is quite independent from economics as a whole, knowledge exchange between the two fields is indeed going on....

  2. Dynamic Matrix Rank

    DEFF Research Database (Denmark)

    Frandsen, Gudmund Skovbjerg; Frandsen, Peter Frands

    2009-01-01

    We consider maintaining information about the rank of a matrix under changes of the entries. For n×n matrices, we show an upper bound of O(n1.575) arithmetic operations and a lower bound of Ω(n) arithmetic operations per element change. The upper bound is valid when changing up to O(n0.575) entries...... in a single column of the matrix. We also give an algorithm that maintains the rank using O(n2) arithmetic operations per rank one update. These bounds appear to be the first nontrivial bounds for the problem. The upper bounds are valid for arbitrary fields, whereas the lower bound is valid for algebraically...... closed fields. The upper bound for element updates uses fast rectangular matrix multiplication, and the lower bound involves further development of an earlier technique for proving lower bounds for dynamic computation of rational functions....

  3. Limits of Rank 4 Azumaya Algebras and Applications to ...

    Indian Academy of Sciences (India)

    It is shown that the schematic image of the scheme of Azumaya algebra structures on a vector bundle of rank 4 over any base scheme is separated, of finite type, smooth of relative dimension 13 and geometrically irreducible over that base and that this construction base-changes well. This fully generalizes Seshadri's ...

  4. Diversifying customer review rankings.

    Science.gov (United States)

    Krestel, Ralf; Dokoohaki, Nima

    2015-06-01

    E-commerce Web sites owe much of their popularity to consumer reviews accompanying product descriptions. On-line customers spend hours and hours going through heaps of textual reviews to decide which products to buy. At the same time, each popular product has thousands of user-generated reviews, making it impossible for a buyer to read everything. Current approaches to display reviews to users or recommend an individual review for a product are based on the recency or helpfulness of each review. In this paper, we present a framework to rank product reviews by optimizing the coverage of the ranking with respect to sentiment or aspects, or by summarizing all reviews with the top-K reviews in the ranking. To accomplish this, we make use of the assigned star rating for a product as an indicator for a review's sentiment polarity and compare bag-of-words (language model) with topic models (latent Dirichlet allocation) as a mean to represent aspects. Our evaluation on manually annotated review data from a commercial review Web site demonstrates the effectiveness of our approach, outperforming plain recency ranking by 30% and obtaining best results by combining language and topic model representations. Copyright © 2015 Elsevier Ltd. All rights reserved.

  5. College Rankings. ERIC Digest.

    Science.gov (United States)

    Holub, Tamara

    The popularity of college ranking surveys published by "U.S. News and World Report" and other magazines is indisputable, but the methodologies used to measure the quality of higher education institutions have come under fire by scholars and college officials. Criticisms have focused on methodological flaws, such as failure to consider…

  6. OutRank

    DEFF Research Database (Denmark)

    Müller, Emmanuel; Assent, Ira; Steinhausen, Uwe

    2008-01-01

    Outlier detection is an important data mining task for consistency checks, fraud detection, etc. Binary decision making on whether or not an object is an outlier is not appropriate in many applications and moreover hard to parametrize. Thus, recently, methods for outlier ranking have been proposed...

  7. Improving Ranking Using Quantum Probability

    OpenAIRE

    Melucci, Massimo

    2011-01-01

    The paper shows that ranking information units by quantum probability differs from ranking them by classical probability provided the same data used for parameter estimation. As probability of detection (also known as recall or power) and probability of false alarm (also known as fallout or size) measure the quality of ranking, we point out and show that ranking by quantum probability yields higher probability of detection than ranking by classical probability provided a given probability of ...

  8. 1991 Acceptance priority ranking

    International Nuclear Information System (INIS)

    1991-12-01

    The Standard Contract for Disposal of Spent Nuclear Fuel and/or High- Level Radioactive Waste (10 CFR Part 961) that the Department of Energy (DOE) has executed with the owners and generators of civilian spent nuclear fuel requires annual publication of the Acceptance Priority Ranking (APR). The 1991 APR details the order in which DOE will allocate Federal waste acceptance capacity. As required by the Standard Contract, the ranking is based on the age of permanently discharged spent nuclear fuel (SNF), with the owners of the oldest SNF, on an industry-wide basis, given the highest priority. the 1991 APR will be the basis for the annual allocation of waste acceptance capacity to the Purchasers in the 1991 Annual Capacity Report (ACR), to be issued later this year. This document is based on SNF discharges as of December 31, 1990, and reflects Purchaser comments and corrections, as appropriate, to the draft APR issued on May 15, 1991

  9. A versatile curve-fit model for linear to deeply concave rank abundance curves

    NARCIS (Netherlands)

    Neuteboom, J.H.; Struik, P.C.

    2005-01-01

    A new, flexible curve-fit model for linear to concave rank abundance curves was conceptualized and validated using observational data. The model links the geometric-series model and log-series model and can also fit deeply concave rank abundance curves. The model is based ¿ in an unconventional way

  10. Geometric group theory

    CERN Document Server

    Druţu, Cornelia

    2018-01-01

    The key idea in geometric group theory is to study infinite groups by endowing them with a metric and treating them as geometric spaces. This applies to many groups naturally appearing in topology, geometry, and algebra, such as fundamental groups of manifolds, groups of matrices with integer coefficients, etc. The primary focus of this book is to cover the foundations of geometric group theory, including coarse topology, ultralimits and asymptotic cones, hyperbolic groups, isoperimetric inequalities, growth of groups, amenability, Kazhdan's Property (T) and the Haagerup property, as well as their characterizations in terms of group actions on median spaces and spaces with walls. The book contains proofs of several fundamental results of geometric group theory, such as Gromov's theorem on groups of polynomial growth, Tits's alternative, Stallings's theorem on ends of groups, Dunwoody's accessibility theorem, the Mostow Rigidity Theorem, and quasiisometric rigidity theorems of Tukia and Schwartz. This is the f...

  11. Geometric and engineering drawing

    CERN Document Server

    Morling, K

    2010-01-01

    The new edition of this successful text describes all the geometric instructions and engineering drawing information that are likely to be needed by anyone preparing or interpreting drawings or designs with plenty of exercises to practice these principles.

  12. Differential geometric structures

    CERN Document Server

    Poor, Walter A

    2007-01-01

    This introductory text defines geometric structure by specifying parallel transport in an appropriate fiber bundle and focusing on simplest cases of linear parallel transport in a vector bundle. 1981 edition.

  13. Geometric ghosts and unitarity

    International Nuclear Information System (INIS)

    Ne'eman, Y.

    1980-09-01

    A review is given of the geometrical identification of the renormalization ghosts and the resulting derivation of Unitarity equations (BRST) for various gauges: Yang-Mills, Kalb-Ramond, and Soft-Group-Manifold

  14. Asymptotic and geometrical quantization

    International Nuclear Information System (INIS)

    Karasev, M.V.; Maslov, V.P.

    1984-01-01

    The main ideas of geometric-, deformation- and asymptotic quantizations are compared. It is shown that, on the one hand, the asymptotic approach is a direct generalization of exact geometric quantization, on the other hand, it generates deformation in multiplication of symbols and Poisson brackets. Besides investigating the general quantization diagram, its applications to the calculation of asymptotics of a series of eigenvalues of operators possessing symmetry groups are considered

  15. On geometrized gravitation theories

    International Nuclear Information System (INIS)

    Logunov, A.A.; Folomeshkin, V.N.

    1977-01-01

    General properties of the geometrized gravitation theories have been considered. Geometrization of the theory is realized only to the extent that by necessity follows from an experiment (geometrization of the density of the matter Lagrangian only). Aor a general case the gravitation field equations and the equations of motion for matter are formulated in the different Riemann spaces. A covariant formulation of the energy-momentum conservation laws is given in an arbitrary geometrized theory. The noncovariant notion of ''pseudotensor'' is not required in formulating the conservation laws. It is shown that in the general case (i.e., when there is an explicit dependence of the matter Lagrangian density on the covariant derivatives) a symmetric energy-momentum tensor of the matter is explicitly dependent on the curvature tensor. There are enlisted different geometrized theories that describe a known set of the experimental facts. The properties of one of the versions of the quasilinear geometrized theory that describes the experimental facts are considered. In such a theory the fundamental static spherically symmetrical solution has a singularity only in the coordinate origin. The theory permits to create a satisfactory model of the homogeneous nonstationary Universe

  16. Ranking Baltic States Researchers

    Directory of Open Access Journals (Sweden)

    Gyula Mester

    2017-10-01

    Full Text Available In this article, using the h-index and the total number of citations, the best 10 Lithuanian, Latvian and Estonian researchers from several disciplines are ranked. The list may be formed based on the h-index and the total number of citations, given in Web of Science, Scopus, Publish or Perish Program and Google Scholar database. Data for the first 10 researchers are presented. Google Scholar is the most complete. Therefore, to define a single indicator, h-index calculated by Google Scholar may be a good and simple one. The author chooses the Google Scholar database as it is the broadest one.

  17. Fourth-rank cosmology

    International Nuclear Information System (INIS)

    Marrakchi, A.E.L.; Tapia, V.

    1992-05-01

    Some cosmological implications of the recently proposed fourth-rank theory of gravitation are studied. The model exhibits the possibility of being free from the horizon and flatness problems at the price of introducing a negative pressure. The field equations we obtain are compatible with k obs =0 and Ω obs t clas approx. 10 20 t Planck approx. 10 -23 s. When interpreted at the light of General Relativity the treatment is shown to be almost equivalent to that of the standard model of cosmology combined with the inflationary scenario. Hence, an interpretation of the negative pressure hypothesis is provided. (author). 8 refs

  18. University Rankings and Social Science

    OpenAIRE

    Marginson, S.

    2014-01-01

    University rankings widely affect the behaviours of prospective students and their families, university executive leaders, academic faculty, governments and investors in higher education. Yet the social science foundations of global rankings receive little scrutiny. Rankings that simply recycle reputation without any necessary connection to real outputs are of no common value. It is necessary that rankings be soundly based in scientific terms if a virtuous relationship between performance and...

  19. University Rankings and Social Science

    Science.gov (United States)

    Marginson, Simon

    2014-01-01

    University rankings widely affect the behaviours of prospective students and their families, university executive leaders, academic faculty, governments and investors in higher education. Yet the social science foundations of global rankings receive little scrutiny. Rankings that simply recycle reputation without any necessary connection to real…

  20. Geometric approximation algorithms

    CERN Document Server

    Har-Peled, Sariel

    2011-01-01

    Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.

  1. Geometrical optical illusionists.

    Science.gov (United States)

    Wade, Nicholas J

    2014-01-01

    Geometrical optical illusions were given this title by Oppel in 1855. Variants on such small distortions of visual space were illustrated thereafter, many of which bear the names of those who first described them. Some original forms of the geometrical optical illusions are shown together with 'perceptual portraits' of those who described them. These include: Roget, Chevreul, Fick, Zöllner, Poggendorff, Hering, Kundt, Delboeuf Mach, Helmholtz, Hermann, von Bezold, Müller-Lyer, Lipps, Thiéry, Wundt, Münsterberg, Ebbinghaus, Titchener, Ponzo, Luckiesh, Sander, Ehrenstein, Gregory, Heard, White, Shepard, and. Lingelbach. The illusions are grouped under the headings of orientation, size, the combination of size and orientation, and contrast. Early theories of illusions, before geometrical optical illusions were so named, are mentioned briefly.

  2. Fractional cointegration rank estimation

    DEFF Research Database (Denmark)

    Lasak, Katarzyna; Velasco, Carlos

    the parameters of the model under the null hypothesis of the cointegration rank r = 1, 2, ..., p-1. This step provides consistent estimates of the cointegration degree, the cointegration vectors, the speed of adjustment to the equilibrium parameters and the common trends. In the second step we carry out a sup......-likelihood ratio test of no-cointegration on the estimated p - r common trends that are not cointegrated under the null. The cointegration degree is re-estimated in the second step to allow for new cointegration relationships with different memory. We augment the error correction model in the second step...... to control for stochastic trend estimation effects from the first step. The critical values of the tests proposed depend only on the number of common trends under the null, p - r, and on the interval of the cointegration degrees b allowed, but not on the true cointegration degree b0. Hence, no additional...

  3. The higher rank numerical range of matrix polynomials

    OpenAIRE

    Aretaki, Aikaterini; Maroulas, John

    2011-01-01

    The notion of the higher rank numerical range $\\Lambda_{k}(L(\\lambda))$ for matrix polynomials $L(\\lambda)=A_{m}\\lambda^{m}+...+A_{1}\\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further, the sharp points of $\\Lambda_{k}(L(\\lambda))$ are defined and their relation to the numerical range $w(L(\\lambda))$ is presented. A connection of $\\Lambda_{k}(L(\\lambda))$ with the vector-valued higher rank numerical range $\\Lambda_{k}(A_{0},..., A_{m})$ is a...

  4. Rankings, creatividad y urbanismo

    Directory of Open Access Journals (Sweden)

    JOAQUÍN SABATÉ

    2008-08-01

    Full Text Available La competencia entre ciudades constituye uno de los factores impulsores de procesos de renovación urbana y los rankings han devenido instrumentos de medida de la calidad de las ciudades. Nos detendremos en el caso de un antiguo barrio industrial hoy en vías de transformación en distrito "creativo" por medio de una intervención urbanística de gran escala. Su análisis nos descubre tres claves críticas. En primer lugar, nos obliga a plantearnos la definición de innovación urbana y cómo se integran el pasado, la identidad y la memoria en la construcción del futuro. Nos lleva a comprender que la innovación y el conocimiento no se "dan" casualmente, sino que son el fruto de una larga y compleja red en la que participan saberes, espacios, actores e instituciones diversas en naturaleza, escala y magnitud. Por último nos obliga a reflexionar sobre el valor que se le otorga a lo local en los procesos de renovación urbana.Competition among cities constitutes one ofthe main factors o furban renewal, and rankings have become instruments to indícate cities quality. Studying the transformation of an old industrial quarter into a "creative district" by the means ofa large scale urban project we highlight three main conclusions. First, itasks us to reconsider the notion ofurban innovation and hoto past, identity and memory should intégrate the future development. Second, it shows that innovation and knowledge doesn't yield per chance, but are the result ofa large and complex grid of diverse knowledges, spaces, agents and institutions. Finally itforces us to reflect about the valué attributed to the "local" in urban renewalprocesses.

  5. Ranking nodes in growing networks: When PageRank fails.

    Science.gov (United States)

    Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

    2015-11-10

    PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm's efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank's performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

  6. Neophilia Ranking of Scientific Journals.

    Science.gov (United States)

    Packalen, Mikko; Bhattacharya, Jay

    2017-01-01

    The ranking of scientific journals is important because of the signal it sends to scientists about what is considered most vital for scientific progress. Existing ranking systems focus on measuring the influence of a scientific paper (citations)-these rankings do not reward journals for publishing innovative work that builds on new ideas. We propose an alternative ranking based on the proclivity of journals to publish papers that build on new ideas, and we implement this ranking via a text-based analysis of all published biomedical papers dating back to 1946. In addition, we compare our neophilia ranking to citation-based (impact factor) rankings; this comparison shows that the two ranking approaches are distinct. Prior theoretical work suggests an active role for our neophilia index in science policy. Absent an explicit incentive to pursue novel science, scientists underinvest in innovative work because of a coordination problem: for work on a new idea to flourish, many scientists must decide to adopt it in their work. Rankings that are based purely on influence thus do not provide sufficient incentives for publishing innovative work. By contrast, adoption of the neophilia index as part of journal-ranking procedures by funding agencies and university administrators would provide an explicit incentive for journals to publish innovative work and thus help solve the coordination problem by increasing scientists' incentives to pursue innovative work.

  7. Selection of suitable e-learning approach using TOPSIS technique with best ranked criteria weights

    Science.gov (United States)

    Mohammed, Husam Jasim; Kasim, Maznah Mat; Shaharanee, Izwan Nizal Mohd

    2017-11-01

    This paper compares the performances of four rank-based weighting assessment techniques, Rank Sum (RS), Rank Reciprocal (RR), Rank Exponent (RE), and Rank Order Centroid (ROC) on five identified e-learning criteria to select the best weights method. A total of 35 experts in a public university in Malaysia were asked to rank the criteria and to evaluate five e-learning approaches which include blended learning, flipped classroom, ICT supported face to face learning, synchronous learning, and asynchronous learning. The best ranked criteria weights are defined as weights that have the least total absolute differences with the geometric mean of all weights, were then used to select the most suitable e-learning approach by using TOPSIS method. The results show that RR weights are the best, while flipped classroom approach implementation is the most suitable approach. This paper has developed a decision framework to aid decision makers (DMs) in choosing the most suitable weighting method for solving MCDM problems.

  8. Geometric Liouville gravity

    International Nuclear Information System (INIS)

    La, H.

    1992-01-01

    A new geometric formulation of Liouville gravity based on the area preserving diffeo-morphism is given and a possible alternative to reinterpret Liouville gravity is suggested, namely, a scalar field coupled to two-dimensional gravity with a curvature constraint

  9. A Geometric Dissection Problem

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 7; Issue 7. A Geometric Dissection Problem. M N Deshpande. Think It Over Volume 7 Issue 7 July 2002 pp 91-91. Fulltext. Click here to view fulltext PDF. Permanent link: https://www.ias.ac.in/article/fulltext/reso/007/07/0091-0091. Author Affiliations.

  10. Geometric statistical inference

    International Nuclear Information System (INIS)

    Periwal, Vipul

    1999-01-01

    A reparametrization-covariant formulation of the inverse problem of probability is explicitly solved for finite sample sizes. The inferred distribution is explicitly continuous for finite sample size. A geometric solution of the statistical inference problem in higher dimensions is outlined

  11. Geometric Series via Probability

    Science.gov (United States)

    Tesman, Barry

    2012-01-01

    Infinite series is a challenging topic in the undergraduate mathematics curriculum for many students. In fact, there is a vast literature in mathematics education research on convergence issues. One of the most important types of infinite series is the geometric series. Their beauty lies in the fact that they can be evaluated explicitly and that…

  12. Pragmatic geometric model evaluation

    Science.gov (United States)

    Pamer, Robert

    2015-04-01

    Quantification of subsurface model reliability is mathematically and technically demanding as there are many different sources of uncertainty and some of the factors can be assessed merely in a subjective way. For many practical applications in industry or risk assessment (e. g. geothermal drilling) a quantitative estimation of possible geometric variations in depth unit is preferred over relative numbers because of cost calculations for different scenarios. The talk gives an overview of several factors that affect the geometry of structural subsurface models that are based upon typical geological survey organization (GSO) data like geological maps, borehole data and conceptually driven construction of subsurface elements (e. g. fault network). Within the context of the trans-European project "GeoMol" uncertainty analysis has to be very pragmatic also because of different data rights, data policies and modelling software between the project partners. In a case study a two-step evaluation methodology for geometric subsurface model uncertainty is being developed. In a first step several models of the same volume of interest have been calculated by omitting successively more and more input data types (seismic constraints, fault network, outcrop data). The positions of the various horizon surfaces are then compared. The procedure is equivalent to comparing data of various levels of detail and therefore structural complexity. This gives a measure of the structural significance of each data set in space and as a consequence areas of geometric complexity are identified. These areas are usually very data sensitive hence geometric variability in between individual data points in these areas is higher than in areas of low structural complexity. Instead of calculating a multitude of different models by varying some input data or parameters as it is done by Monte-Carlo-simulations, the aim of the second step of the evaluation procedure (which is part of the ongoing work) is to

  13. Low-rank coal research

    Energy Technology Data Exchange (ETDEWEB)

    Weber, G. F.; Laudal, D. L.

    1989-01-01

    This work is a compilation of reports on ongoing research at the University of North Dakota. Topics include: Control Technology and Coal Preparation Research (SO{sub x}/NO{sub x} control, waste management), Advanced Research and Technology Development (turbine combustion phenomena, combustion inorganic transformation, coal/char reactivity, liquefaction reactivity of low-rank coals, gasification ash and slag characterization, fine particulate emissions), Combustion Research (fluidized bed combustion, beneficiation of low-rank coals, combustion characterization of low-rank coal fuels, diesel utilization of low-rank coals), Liquefaction Research (low-rank coal direct liquefaction), and Gasification Research (hydrogen production from low-rank coals, advanced wastewater treatment, mild gasification, color and residual COD removal from Synfuel wastewaters, Great Plains Gasification Plant, gasifier optimization).

  14. Ranking Specific Sets of Objects.

    Science.gov (United States)

    Maly, Jan; Woltran, Stefan

    2017-01-01

    Ranking sets of objects based on an order between the single elements has been thoroughly studied in the literature. In particular, it has been shown that it is in general impossible to find a total ranking - jointly satisfying properties as dominance and independence - on the whole power set of objects. However, in many applications certain elements from the entire power set might not be required and can be neglected in the ranking process. For instance, certain sets might be ruled out due to hard constraints or are not satisfying some background theory. In this paper, we treat the computational problem whether an order on a given subset of the power set of elements satisfying different variants of dominance and independence can be found, given a ranking on the elements. We show that this problem is tractable for partial rankings and NP-complete for total rankings.

  15. Wikipedia ranking of world universities

    Science.gov (United States)

    Lages, José; Patt, Antoine; Shepelyansky, Dima L.

    2016-03-01

    We use the directed networks between articles of 24 Wikipedia language editions for producing the wikipedia ranking of world Universities (WRWU) using PageRank, 2DRank and CheiRank algorithms. This approach allows to incorporate various cultural views on world universities using the mathematical statistical analysis independent of cultural preferences. The Wikipedia ranking of top 100 universities provides about 60% overlap with the Shanghai university ranking demonstrating the reliable features of this approach. At the same time WRWU incorporates all knowledge accumulated at 24 Wikipedia editions giving stronger highlights for historically important universities leading to a different estimation of efficiency of world countries in university education. The historical development of university ranking is analyzed during ten centuries of their history.

  16. Statistical methods for ranking data

    CERN Document Server

    Alvo, Mayer

    2014-01-01

    This book introduces advanced undergraduate, graduate students and practitioners to statistical methods for ranking data. An important aspect of nonparametric statistics is oriented towards the use of ranking data. Rank correlation is defined through the notion of distance functions and the notion of compatibility is introduced to deal with incomplete data. Ranking data are also modeled using a variety of modern tools such as CART, MCMC, EM algorithm and factor analysis. This book deals with statistical methods used for analyzing such data and provides a novel and unifying approach for hypotheses testing. The techniques described in the book are illustrated with examples and the statistical software is provided on the authors’ website.

  17. Ranking nodes in growing networks: When PageRank fails

    Science.gov (United States)

    Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng

    2015-11-01

    PageRank is arguably the most popular ranking algorithm which is being applied in real systems ranging from information to biological and infrastructure networks. Despite its outstanding popularity and broad use in different areas of science, the relation between the algorithm’s efficacy and properties of the network on which it acts has not yet been fully understood. We study here PageRank’s performance on a network model supported by real data, and show that realistic temporal effects make PageRank fail in individuating the most valuable nodes for a broad range of model parameters. Results on real data are in qualitative agreement with our model-based findings. This failure of PageRank reveals that the static approach to information filtering is inappropriate for a broad class of growing systems, and suggest that time-dependent algorithms that are based on the temporal linking patterns of these systems are needed to better rank the nodes.

  18. Solar Radius Determination from Sodism/Picard and HMI/SDO Observations of the Decrease of the Spectral Solar Radiance during the 2012 June Venus Transit

    Science.gov (United States)

    Hauchecorne, A.; Meftah, M.; Irbah, A.; Couvidat, S.; Bush, R.; Hochedez, J.-F.

    2014-03-01

    On 2012 June 5-6, the transit of Venus provided a rare opportunity to determine the radius of the Sun using solar imagers observing a well-defined object, namely, the planet and its atmosphere, partially occulting the Sun. A new method has been developed to estimate the solar radius during a planetary transit. It is based on the estimation of the spectral solar radiance decrease in a region around the contact between the planet and the Sun at the beginning of the ingress and at the end of the egress. The extrapolation to zero of the radiance decrease versus the Sun-to-Venus apparent angular distance allows estimation of the solar radius at the time of first and fourth contacts. This method presents the advantage of being almost independent on the plate scale, the distortion, the refraction by the planetary atmosphere, and on the point-spread function of the imager. It has been applied to two space solar visible imagers, SODISM/PICARD and HMI/SDO. The found results are mutually consistent, despite their different error budgets: 959.''85 ± 0.''19 (1σ) for SODISM at 607.1 nm and 959.''90 ± 0.''06 (1σ) for HMI at 617.3 nm.

  19. Solar radius determination from SODISM/PICARD and HMI/SDO observations of the decrease of the spectral solar radiance during the 2012 June Venus transit

    International Nuclear Information System (INIS)

    Hauchecorne, A.; Meftah, M.; Irbah, A.; Hochedez, J.-F.; Couvidat, S.; Bush, R.

    2014-01-01

    On 2012 June 5-6, the transit of Venus provided a rare opportunity to determine the radius of the Sun using solar imagers observing a well-defined object, namely, the planet and its atmosphere, partially occulting the Sun. A new method has been developed to estimate the solar radius during a planetary transit. It is based on the estimation of the spectral solar radiance decrease in a region around the contact between the planet and the Sun at the beginning of the ingress and at the end of the egress. The extrapolation to zero of the radiance decrease versus the Sun-to-Venus apparent angular distance allows estimation of the solar radius at the time of first and fourth contacts. This method presents the advantage of being almost independent on the plate scale, the distortion, the refraction by the planetary atmosphere, and on the point-spread function of the imager. It has been applied to two space solar visible imagers, SODISM/PICARD and HMI/SDO. The found results are mutually consistent, despite their different error budgets: 959.''85 ± 0.''19 (1σ) for SODISM at 607.1 nm and 959.''90 ± 0.''06 (1σ) for HMI at 617.3 nm.

  20. Dynamics in geometrical confinement

    CERN Document Server

    Kremer, Friedrich

    2014-01-01

    This book describes the dynamics of low molecular weight and polymeric molecules when they are constrained under conditions of geometrical confinement. It covers geometrical confinement in different dimensionalities: (i) in nanometer thin layers or self supporting films (1-dimensional confinement) (ii) in pores or tubes with nanometric diameters (2-dimensional confinement) (iii) as micelles embedded in matrices (3-dimensional) or as nanodroplets.The dynamics under such conditions have been a much discussed and central topic in the focus of intense worldwide research activities within the last two decades. The present book discusses how the resulting molecular mobility is influenced by the subtle counterbalance between surface effects (typically slowing down molecular dynamics through attractive guest/host interactions) and confinement effects (typically increasing the mobility). It also explains how these influences can be modified and tuned, e.g. through appropriate surface coatings, film thicknesses or pore...

  1. Geometric group theory

    CERN Document Server

    Bestvina, Mladen; Vogtmann, Karen

    2014-01-01

    Geometric group theory refers to the study of discrete groups using tools from topology, geometry, dynamics and analysis. The field is evolving very rapidly and the present volume provides an introduction to and overview of various topics which have played critical roles in this evolution. The book contains lecture notes from courses given at the Park City Math Institute on Geometric Group Theory. The institute consists of a set of intensive short courses offered by leaders in the field, designed to introduce students to exciting, current research in mathematics. These lectures do not duplicate standard courses available elsewhere. The courses begin at an introductory level suitable for graduate students and lead up to currently active topics of research. The articles in this volume include introductions to CAT(0) cube complexes and groups, to modern small cancellation theory, to isometry groups of general CAT(0) spaces, and a discussion of nilpotent genus in the context of mapping class groups and CAT(0) gro...

  2. Lectures in geometric combinatorics

    CERN Document Server

    Thomas, Rekha R

    2006-01-01

    This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for an advanced undergraduate or beginning graduate student. The book starts with the basics of polytope theory. Schlegel and Gale diagrams are introduced as geometric tools to visualize polytopes in high dimension and to unearth bizarre phenomena in polytopes. The heart of the book is a treatment of the secondary polytope of a point configuration and its connections to the state polytope of the toric ideal defined by the configuration. These polytopes are relatively recent constructs with numerous connections to discrete geometry, classical algebraic geometry, symplectic geometry, and combinatorics. The connections rely on Gr�bner bases of toric ideals and other methods from commutative algebra. The book is self-contained and does not require any background beyond basic linear algebra. With numerous figures and exercises, it can be used as a textbook for courses on geometric, combinatorial, and computational as...

  3. Geometric information provider platform

    Directory of Open Access Journals (Sweden)

    Meisam Yousefzadeh

    2015-07-01

    Full Text Available Renovation of existing buildings is known as an essential stage in reduction of the energy loss. Considerable part of renovation process depends on geometric reconstruction of building based on semantic parameters. Following many research projects which were focused on parameterizing the energy usage, various energy modelling methods were developed during the last decade. On the other hand, by developing accurate measuring tools such as laser scanners, the interests of having accurate 3D building models are rapidly growing. But the automation of 3D building generation from laser point cloud or detection of specific objects in that is still a challenge.  The goal is designing a platform through which required geometric information can be efficiently produced to support energy simulation software. Developing a reliable procedure which extracts required information from measured data and delivers them to a standard energy modelling system is the main purpose of the project.

  4. Gravity, a geometrical course

    CERN Document Server

    Frè, Pietro Giuseppe

    2013-01-01

    ‘Gravity, a Geometrical Course’ presents general relativity (GR) in a systematic and exhaustive way, covering three aspects that are homogenized into a single texture: i) the mathematical, geometrical foundations, exposed in a self consistent contemporary formalism, ii) the main physical, astrophysical and cosmological applications,  updated to the issues of contemporary research and observations, with glimpses on supergravity and superstring theory, iii) the historical development of scientific ideas underlying both the birth of general relativity and its subsequent evolution. The book is divided in two volumes.   Volume One is dedicated to the development of the theory and basic physical applications. It guides the reader from the foundation of special relativity to Einstein field equations, illustrating some basic applications in astrophysics. A detailed  account  of the historical and conceptual development of the theory is combined with the presentation of its mathematical foundations.  Differe...

  5. Geometric homology revisited

    OpenAIRE

    Ruffino, Fabio Ferrari

    2013-01-01

    Given a cohomology theory, there is a well-known abstract way to define the dual homology theory using the theory of spectra. In [4] the author provides a more geometric construction of the homology theory, using a generalization of the bordism groups. Such a generalization involves in its definition the vector bundle modification, which is a particular case of the Gysin map. In this paper we provide a more natural variant of that construction, which replaces the vector bundle modification wi...

  6. Geometric measure theory

    CERN Document Server

    Waerden, B

    1996-01-01

    From the reviews: "... Federer's timely and beautiful book indeed fills the need for a comprehensive treatise on geometric measure theory, and his detailed exposition leads from the foundations of the theory to the most recent discoveries. ... The author writes with a distinctive style which is both natural and powerfully economical in treating a complicated subject. This book is a major treatise in mathematics and is essential in the working library of the modern analyst." Bulletin of the London Mathematical Society.

  7. Developing geometrical reasoning

    OpenAIRE

    Brown, Margaret; Jones, Keith; Taylor, Ron; Hirst, Ann

    2004-01-01

    This paper summarises a report (Brown, Jones & Taylor, 2003) to the UK Qualifications and Curriculum Authority of the work of one geometry group. The group was charged with developing and reporting on teaching ideas that focus on the development of geometrical reasoning at the secondary school level. The group was encouraged to explore what is possible both within and beyond the current requirements of the UK National Curriculum and the Key Stage 3 strategy, and to consider the whole atta...

  8. Geometrically Consistent Mesh Modification

    KAUST Repository

    Bonito, A.

    2010-01-01

    A new paradigm of adaptivity is to execute refinement, coarsening, and smoothing of meshes on manifolds with incomplete information about their geometry and yet preserve position and curvature accuracy. We refer to this collectively as geometrically consistent (GC) mesh modification. We discuss the concept of discrete GC, show the failure of naive approaches, and propose and analyze a simple algorithm that is GC and accuracy preserving. © 2010 Society for Industrial and Applied Mathematics.

  9. Geometric leaf placement strategies

    International Nuclear Information System (INIS)

    Fenwick, J D; Temple, S W P; Clements, R W; Lawrence, G P; Mayles, H M O; Mayles, W P M

    2004-01-01

    Geometric leaf placement strategies for multileaf collimators (MLCs) typically involve the expansion of the beam's-eye-view contour of a target by a uniform MLC margin, followed by movement of the leaves until some point on each leaf end touches the expanded contour. Film-based dose-distribution measurements have been made to determine appropriate MLC margins-characterized through an index d 90 -for multileaves set using one particular strategy to straight lines lying at various angles to the direction of leaf travel. Simple trigonometric relationships exist between different geometric leaf placement strategies and are used to generalize the results of the film work into d 90 values for several different strategies. Measured d 90 values vary both with angle and leaf placement strategy. A model has been derived that explains and describes quite well the observed variations of d 90 with angle. The d 90 angular variations of the strategies studied differ substantially, and geometric and dosimetric reasoning suggests that the best strategy is the one with the least angular variation. Using this criterion, the best straightforwardly implementable strategy studied is a 'touch circle' approach for which semicircles are imagined to be inscribed within leaf ends, the leaves being moved until the semicircles just touch the expanded target outline

  10. Studies in geometric quantization

    International Nuclear Information System (INIS)

    Tuynman, G.M.

    1988-01-01

    This thesis contains five chapters, of which the first, entitled 'What is prequantization, and what is geometric quantization?', is meant as an introduction to geometric quantization for the non-specialist. The second chapter, entitled 'Central extensions and physics' deals with the notion of central extensions of manifolds and elaborates and proves the statements made in the first chapter. Central extensions of manifolds occur in physics as the freedom of a phase factor in the quantum mechanical state vector, as the phase factor in the prequantization process of classical mechanics and it appears in mathematics when studying central extension of Lie groups. In this chapter the connection between these central extensions is investigated and a remarkable similarity between classical and quantum mechanics is shown. In chapter three a classical model is given for the hydrogen atom including spin-orbit and spin-spin interaction. The method of geometric quantization is applied to this model and the results are discussed. In the final chapters (4 and 5) an explicit method to calculate the operators corresponding to classical observables is given when the phase space is a Kaehler manifold. The obtained formula are then used to quantise symplectic manifolds which are irreducible hermitian symmetric spaces and the results are compared with other quantization procedures applied to these manifolds (in particular to Berezin's quantization). 91 refs.; 3 tabs

  11. PageRank tracker: from ranking to tracking.

    Science.gov (United States)

    Gong, Chen; Fu, Keren; Loza, Artur; Wu, Qiang; Liu, Jia; Yang, Jie

    2014-06-01

    Video object tracking is widely used in many real-world applications, and it has been extensively studied for over two decades. However, tracking robustness is still an issue in most existing methods, due to the difficulties with adaptation to environmental or target changes. In order to improve adaptability, this paper formulates the tracking process as a ranking problem, and the PageRank algorithm, which is a well-known webpage ranking algorithm used by Google, is applied. Labeled and unlabeled samples in tracking application are analogous to query webpages and the webpages to be ranked, respectively. Therefore, determining the target is equivalent to finding the unlabeled sample that is the most associated with existing labeled set. We modify the conventional PageRank algorithm in three aspects for tracking application, including graph construction, PageRank vector acquisition and target filtering. Our simulations with the use of various challenging public-domain video sequences reveal that the proposed PageRank tracker outperforms mean-shift tracker, co-tracker, semiboosting and beyond semiboosting trackers in terms of accuracy, robustness and stability.

  12. Geometrical model of multiple production

    International Nuclear Information System (INIS)

    Chikovani, Z.E.; Jenkovszky, L.L.; Kvaratshelia, T.M.; Struminskij, B.V.

    1988-01-01

    The relation between geometrical and KNO-scaling and their violation is studied in a geometrical model of multiple production of hadrons. Predictions concerning the behaviour of correlation coefficients at future accelerators are given

  13. Geometric Computing for Freeform Architecture

    KAUST Repository

    Wallner, J.; Pottmann, Helmut

    2011-01-01

    Geometric computing has recently found a new field of applications, namely the various geometric problems which lie at the heart of rationalization and construction-aware design processes of freeform architecture. We report on our work in this area

  14. Geometric Constructions with the Computer.

    Science.gov (United States)

    Chuan, Jen-chung

    The computer can be used as a tool to represent and communicate geometric knowledge. With the appropriate software, a geometric diagram can be manipulated through a series of animation that offers more than one particular snapshot as shown in a traditional mathematical text. Geometric constructions with the computer enable the learner to see and…

  15. Universal scaling in sports ranking

    International Nuclear Information System (INIS)

    Deng Weibing; Li Wei; Cai Xu; Bulou, Alain; Wang Qiuping A

    2012-01-01

    Ranking is a ubiquitous phenomenon in human society. On the web pages of Forbes, one may find all kinds of rankings, such as the world's most powerful people, the world's richest people, the highest-earning tennis players, and so on and so forth. Herewith, we study a specific kind—sports ranking systems in which players' scores and/or prize money are accrued based on their performances in different matches. By investigating 40 data samples which span 12 different sports, we find that the distributions of scores and/or prize money follow universal power laws, with exponents nearly identical for most sports. In order to understand the origin of this universal scaling we focus on the tennis ranking systems. By checking the data we find that, for any pair of players, the probability that the higher-ranked player tops the lower-ranked opponent is proportional to the rank difference between the pair. Such a dependence can be well fitted to a sigmoidal function. By using this feature, we propose a simple toy model which can simulate the competition of players in different matches. The simulations yield results consistent with the empirical findings. Extensive simulation studies indicate that the model is quite robust with respect to the modifications of some parameters. (paper)

  16. Geometric Algebra Computing

    CERN Document Server

    Corrochano, Eduardo Bayro

    2010-01-01

    This book presents contributions from a global selection of experts in the field. This useful text offers new insights and solutions for the development of theorems, algorithms and advanced methods for real-time applications across a range of disciplines. Written in an accessible style, the discussion of all applications is enhanced by the inclusion of numerous examples, figures and experimental analysis. Features: provides a thorough discussion of several tasks for image processing, pattern recognition, computer vision, robotics and computer graphics using the geometric algebra framework; int

  17. Geometric multipartite entanglement measures

    International Nuclear Information System (INIS)

    Paz-Silva, Gerardo A.; Reina, John H.

    2007-01-01

    Within the framework of constructions for quantifying entanglement, we build a natural scenario for the assembly of multipartite entanglement measures based on Hopf bundle-like mappings obtained through Clifford algebra representations. Then, given the non-factorizability of an arbitrary two-qubit density matrix, we give an alternate quantity that allows the construction of two types of entanglement measures based on their arithmetical and geometrical averages over all pairs of qubits in a register of size N, and thus fully characterize its degree and type of entanglement. We find that such an arithmetical average is both additive and strongly super additive

  18. Geometric correlations and multifractals

    International Nuclear Information System (INIS)

    Amritkar, R.E.

    1991-07-01

    There are many situations where the usual statistical methods are not adequate to characterize correlations in the system. To characterize such situations we introduce mutual correlation dimensions which describe geometric correlations in the system. These dimensions allow us to distinguish between variables which are perfectly correlated with or without a phase lag, variables which are uncorrelated and variables which are partially correlated. We demonstrate the utility of our formalism by considering two examples from dynamical systems. The first example is about the loss of memory in chaotic signals and describes auto-correlations while the second example is about synchronization of chaotic signals and describes cross-correlations. (author). 19 refs, 6 figs

  19. Schematic limits of rank 4 Azumaya bundles are the locally-Witt algebras

    International Nuclear Information System (INIS)

    Venkata Balaji, T.E.

    2002-07-01

    It is shown that the schematic image of the scheme of Azumaya algebra structures on a vector bundle of rank 4 over any base scheme is separated, of finite type, smooth of relative dimension 13 and geometrically irreducible over that base and that this construction base-changes well. This generalises the main theorem of Part I of an earlier work and clarifies it by showing that the algebraic operation of forming the even Clifford algebra (=Witt algebra) of a rank 3 quadratic module essentially translates to performing the geometric operation of taking the schematic image of the scheme of Azumaya algebra structures. (author)

  20. PageRank of integers

    International Nuclear Information System (INIS)

    Frahm, K M; Shepelyansky, D L; Chepelianskii, A D

    2012-01-01

    We up a directed network tracing links from a given integer to its divisors and analyze the properties of the Google matrix of this network. The PageRank vector of this matrix is computed numerically and it is shown that its probability is approximately inversely proportional to the PageRank index thus being similar to the Zipf law and the dependence established for the World Wide Web. The spectrum of the Google matrix of integers is characterized by a large gap and a relatively small number of nonzero eigenvalues. A simple semi-analytical expression for the PageRank of integers is derived that allows us to find this vector for matrices of billion size. This network provides a new PageRank order of integers. (paper)

  1. Comparison of 37 months global net radiation flux derived from PICARD-BOS over the same period observations of CERES and ARGO

    Science.gov (United States)

    Zhu, Ping; Wild, Martin

    2016-04-01

    The absolute level of the global net radiation flux (NRF) is fixed at the level of [0.5-1.0] Wm-2 based on the ocean heat content measurements [1]. The space derived global NRF is at the same order of magnitude than the ocean [2]. Considering the atmosphere has a negligible effects on the global NRF determination, the surface global NRF is consistent with the values determined from space [3]. Instead of studying the absolute level of the global NRF, we focus on the interannual variation of global net radiation flux, which were derived from the PICARD-BOS experiment and its comparison with values over the same period but obtained from the NASA-CERES system and inferred from the ocean heat content survey by ARGO network. [1] Allan, Richard P., Chunlei Liu, Norman G. Loeb, Matthew D. Palmer, Malcolm Roberts, Doug Smith, and Pier-Luigi Vidale (2014), Changes in global net radiative imbalance 1985-2012, Geophysical Research Letters, 41 (no.15), 5588-5597. [2] Loeb, Norman G., John M. Lyman, Gregory C. Johnson, Richard P. Allan, David R. Doelling, Takmeng Wong, Brian J. Soden, and Graeme L. Stephens (2012), Observed changes in top-of-the-atmosphere radiation and upper-ocean heating consistent within uncertainty, Nature Geoscience, 5 (no.2), 110-113. [3] Wild, Martin, Doris Folini, Maria Z. Hakuba, Christoph Schar, Sonia I. Seneviratne, Seiji Kato, David Rutan, Christof Ammann, Eric F. Wood, and Gert Konig-Langlo (2015), the energy balance over land and oceans: an assessment based on direct observations and CMIP5 climate models, Climate Dynamics, 44 (no.11-12), 3393-3429.

  2. Expanding the landscape of N=2 rank 1 SCFTs

    International Nuclear Information System (INIS)

    Argyres, Philip C.; Lotito, Matteo; Lü, Yongchao; Martone, Mario

    2016-01-01

    We refine our previous proposal http://arxiv.org/abs/1505.04814http://arxiv.org/abs/1601.00011P. Argyres, M. Lotito, Y. Lü and M. Martone, Geometric constraints on the space of N=2 SCFTs III: enhanced Coulomb branches and central charges, to appear. for systematically classifying 4d rank-1 N=2 SCFTs by constructing their possible Coulomb branch geometries. Four new recently discussed rank-1 theories http://dx.doi.org/10.1007/JHEP03(2016)083http://arxiv.org/abs/1601.02077, including novel N=3 SCFTs, sit beautifully in our refined classification framework. By arguing for the consistency of their RG flows we can make a strong case for the existence of at least four additional rank-1 SCFTs, nearly doubling the number of known rank-1 SCFTs. The refinement consists of relaxing the assumption that the flavor symmetries of the SCFTs have no discrete factors. This results in an enlarged (but finite) set of possible rank-1 SCFTs. Their existence can be further constrained using consistency of their central charges and RG flows.

  3. Freudenthal ranks: GHZ versus W

    International Nuclear Information System (INIS)

    Borsten, L

    2013-01-01

    The Hilbert space of three-qubit pure states may be identified with a Freudenthal triple system. Every state has an unique Freudenthal rank ranging from 1 to 4, which is determined by a set of automorphism group covariants. It is shown here that the optimal success rates for winning a three-player non-local game, varying over all local strategies, are strictly ordered by the Freudenthal rank of the shared three-qubit resource. (paper)

  4. Ranking Queries on Uncertain Data

    CERN Document Server

    Hua, Ming

    2011-01-01

    Uncertain data is inherent in many important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of those applications and rapidly increasing amounts of uncertain data collected and accumulated, analyzing large collections of uncertain data has become an important task. Ranking queries (also known as top-k queries) are often natural and useful in analyzing uncertain data. Ranking Queries on Uncertain Data discusses the motivations/applications, challenging problems, the fundamental principles, and the evaluation algorith

  5. Ranking in evolving complex networks

    Science.gov (United States)

    Liao, Hao; Mariani, Manuel Sebastian; Medo, Matúš; Zhang, Yi-Cheng; Zhou, Ming-Yang

    2017-05-01

    Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world problems because it affects how we access online information and products, how success and talent are evaluated in human activities, and how scarce resources are allocated by companies and policymakers, among others. This calls for a deep understanding of how existing ranking algorithms perform, and which are their possible biases that may impair their effectiveness. Many popular ranking algorithms (such as Google's PageRank) are static in nature and, as a consequence, they exhibit important shortcomings when applied to real networks that rapidly evolve in time. At the same time, recent advances in the understanding and modeling of evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account. The aim of this review is to survey the existing ranking algorithms, both static and time-aware, and their applications to evolving networks. We emphasize both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of network traffic, prediction of future links, and identification of significant nodes.

  6. Transmuted Lindley-Geometric Distribution and its applications

    OpenAIRE

    Merovci, Faton; Elbatal, Ibrahim

    2013-01-01

    A functional composition of the cumulative distribution function of one probability distribution with the inverse cumulative distribution function of another is called the transmutation map. In this article, we will use the quadratic rank transmutation map (QRTM) in order to generate a flexible family of probability distributions taking Lindley geometric distribution as the base value distribution by introducing a new parameter that would offer more distributional flexibility. It will be show...

  7. RANK and RANK ligand expression in primary human osteosarcoma

    Directory of Open Access Journals (Sweden)

    Daniel Branstetter

    2015-09-01

    Our results demonstrate RANKL expression was observed in the tumor element in 68% of human OS using IHC. However, the staining intensity was relatively low and only 37% (29/79 of samples exhibited≥10% RANKL positive tumor cells. RANK expression was not observed in OS tumor cells. In contrast, RANK expression was clearly observed in other cells within OS samples, including the myeloid osteoclast precursor compartment, osteoclasts and in giant osteoclast cells. The intensity and frequency of RANKL and RANK staining in OS samples were substantially less than that observed in GCTB samples. The observation that RANKL is expressed in OS cells themselves suggests that these tumors may mediate an osteoclastic response, and anti-RANKL therapy may potentially be protective against bone pathologies in OS. However, the absence of RANK expression in primary human OS cells suggests that any autocrine RANKL/RANK signaling in human OS tumor cells is not operative, and anti-RANKL therapy would not directly affect the tumor.

  8. Ranking structures and rank-rank correlations of countries: The FIFA and UEFA cases

    Science.gov (United States)

    Ausloos, Marcel; Cloots, Rudi; Gadomski, Adam; Vitanov, Nikolay K.

    2014-04-01

    Ranking of agents competing with each other in complex systems may lead to paradoxes according to the pre-chosen different measures. A discussion is presented on such rank-rank, similar or not, correlations based on the case of European countries ranked by UEFA and FIFA from different soccer competitions. The first question to be answered is whether an empirical and simple law is obtained for such (self-) organizations of complex sociological systems with such different measuring schemes. It is found that the power law form is not the best description contrary to many modern expectations. The stretched exponential is much more adequate. Moreover, it is found that the measuring rules lead to some inner structures in both cases.

  9. Fast geometric algorithms

    International Nuclear Information System (INIS)

    Noga, M.T.

    1984-01-01

    This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L 1 hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L 1 diameter of a set of points, the metric traveling salesman problem, and finding the superrange of star-shaped and monotype polygons. The main theme of all the work was to develop a set of very fast state-of-the-art algorithms that supersede any rivals in terms of speed and ease of implementation. In some cases existing algorithms were refined; for others new techniques were developed that add to the present database of fast adaptive geometric algorithms. What emerges is a collection of techniques that is successful at merging modern tools developed in analysis of algorithms with those of classical geometry

  10. Geometrization of quantum physics

    International Nuclear Information System (INIS)

    Ol'khov, O.A.

    2009-01-01

    It is shown that the Dirac equation for a free particle can be considered as a description of specific distortion of the space Euclidean geometry (space topological defect). This approach is based on the possibility of interpretation of the wave function as vector realizing representation of the fundamental group of the closed topological space-time 4-manifold. Mass and spin appear to be topological invariants. Such a concept explains all so-called 'strange' properties of quantum formalism: probabilities, wave-particle duality, nonlocal instantaneous correlation between noninteracting particles (EPR-paradox) and so on. Acceptance of the suggested geometrical concept means rejection of atomistic concept where all matter is considered as consisting of more and more small elementary particles. There are no any particles a priory, before measurement: the notions of particles appear as a result of classical interpretation of the contact of the region of the curved space with a device

  11. Geometrization of quantum physics

    Science.gov (United States)

    Ol'Khov, O. A.

    2009-12-01

    It is shown that the Dirac equation for free particle can be considered as a description of specific distortion of the space euclidean geometry (space topological defect). This approach is based on possibility of interpretation of the wave function as vector realizing representation of the fundamental group of the closed topological space-time 4-manifold. Mass and spin appear to be topological invariants. Such concept explains all so called “strange” properties of quantum formalism: probabilities, wave-particle duality, nonlocal instantaneous correlation between noninteracting particles (EPR-paradox) and so on. Acceptance of suggested geometrical concept means rejection of atomistic concept where all matter is considered as consisting of more and more small elementary particles. There is no any particles a priori, before measurement: the notions of particles appear as a result of classical interpretation of the contact of the region of the curved space with a device.

  12. Geometrical Image Transforms

    OpenAIRE

    Havelka, Jan

    2008-01-01

    Tato diplomová práce se zabývá akcelerací geometrických transformací obrazu s využitím GPU a architektury NVIDIA (R) CUDA TM. Časově kritické části kódu jsou přesunuty na GPU a vykonány paralelně. Jedním z výsledků je demonstrační aplikace pro porovnání výkonnosti obou architektur: CPU, a GPU v kombinaci s CPU. Pro referenční implementaci jsou použity vysoce optimalizované algoritmy z knihovny OpenCV, od firmy Intel. This master's thesis deals with acceleration of geometrical image transfo...

  13. Ranking species in mutualistic networks

    Science.gov (United States)

    Domínguez-García, Virginia; Muñoz, Miguel A.

    2015-02-01

    Understanding the architectural subtleties of ecological networks, believed to confer them enhanced stability and robustness, is a subject of outmost relevance. Mutualistic interactions have been profusely studied and their corresponding bipartite networks, such as plant-pollinator networks, have been reported to exhibit a characteristic ``nested'' structure. Assessing the importance of any given species in mutualistic networks is a key task when evaluating extinction risks and possible cascade effects. Inspired in a recently introduced algorithm -similar in spirit to Google's PageRank but with a built-in non-linearity- here we propose a method which -by exploiting their nested architecture- allows us to derive a sound ranking of species importance in mutualistic networks. This method clearly outperforms other existing ranking schemes and can become very useful for ecosystem management and biodiversity preservation, where decisions on what aspects of ecosystems to explicitly protect need to be made.

  14. Ranking Theory and Conditional Reasoning.

    Science.gov (United States)

    Skovgaard-Olsen, Niels

    2016-05-01

    Ranking theory is a formal epistemology that has been developed in over 600 pages in Spohn's recent book The Laws of Belief, which aims to provide a normative account of the dynamics of beliefs that presents an alternative to current probabilistic approaches. It has long been received in the AI community, but it has not yet found application in experimental psychology. The purpose of this paper is to derive clear, quantitative predictions by exploiting a parallel between ranking theory and a statistical model called logistic regression. This approach is illustrated by the development of a model for the conditional inference task using Spohn's (2013) ranking theoretic approach to conditionals. Copyright © 2015 Cognitive Science Society, Inc.

  15. University rankings in computer science

    DEFF Research Database (Denmark)

    Ehret, Philip; Zuccala, Alesia Ann; Gipp, Bela

    2017-01-01

    This is a research-in-progress paper concerning two types of institutional rankings, the Leiden and QS World ranking, and their relationship to a list of universities’ ‘geo-based’ impact scores, and Computing Research and Education Conference (CORE) participation scores in the field of computer...... science. A ‘geo-based’ impact measure examines the geographical distribution of incoming citations to a particular university’s journal articles for a specific period of time. It takes into account both the number of citations and the geographical variability in these citations. The CORE participation...... score is calculated on the basis of the number of weighted proceedings papers that a university has contributed to either an A*, A, B, or C conference as ranked by the Computing Research and Education Association of Australasia. In addition to calculating the correlations between the distinct university...

  16. Subtracting a best rank-1 approximation may increase tensor rank

    NARCIS (Netherlands)

    Stegeman, Alwin; Comon, Pierre

    2010-01-01

    It has been shown that a best rank-R approximation of an order-k tensor may not exist when R >= 2 and k >= 3. This poses a serious problem to data analysts using tensor decompositions it has been observed numerically that, generally, this issue cannot be solved by consecutively computing and

  17. Consistent ranking of volatility models

    DEFF Research Database (Denmark)

    Hansen, Peter Reinhard; Lunde, Asger

    2006-01-01

    We show that the empirical ranking of volatility models can be inconsistent for the true ranking if the evaluation is based on a proxy for the population measure of volatility. For example, the substitution of a squared return for the conditional variance in the evaluation of ARCH-type models can...... variance in out-of-sample evaluations rather than the squared return. We derive the theoretical results in a general framework that is not specific to the comparison of volatility models. Similar problems can arise in comparisons of forecasting models whenever the predicted variable is a latent variable....

  18. Harmonic and geometric analysis

    CERN Document Server

    Citti, Giovanna; Pérez, Carlos; Sarti, Alessandro; Zhong, Xiao

    2015-01-01

    This book presents an expanded version of four series of lectures delivered by the authors at the CRM. Harmonic analysis, understood in a broad sense, has a very wide interplay with partial differential equations and in particular with the theory of quasiconformal mappings and its applications. Some areas in which real analysis has been extremely influential are PDE's and geometric analysis. Their foundations and subsequent developments made extensive use of the Calderón–Zygmund theory, especially the Lp inequalities for Calderón–Zygmund operators (Beurling transform and Riesz transform, among others) and the theory of Muckenhoupt weights.  The first chapter is an application of harmonic analysis and the Heisenberg group to understanding human vision, while the second and third chapters cover some of the main topics on linear and multilinear harmonic analysis. The last serves as a comprehensive introduction to a deep result from De Giorgi, Moser and Nash on the regularity of elliptic partial differen...

  19. Regular Polygons and Geometric Series.

    Science.gov (United States)

    Jarrett, Joscelyn A.

    1982-01-01

    Examples of some geometric illustrations of limits are presented. It is believed the limit concept is among the most important topics in mathematics, yet many students do not have good intuitive feelings for the concept, since it is often taught very abstractly. Geometric examples are suggested as meaningful tools. (MP)

  20. Geometric Invariants and Object Recognition.

    Science.gov (United States)

    1992-08-01

    University of Chicago Press. Maybank , S.J. [1992], "The Projection of Two Non-coplanar Conics", in Geometric Invariance in Machine Vision, eds. J.L...J.L. Mundy and A. Zisserman, MIT Press, Cambridge, MA. Mundy, J.L., Kapur, .. , Maybank , S.J., and Quan, L. [1992a] "Geometric Inter- pretation of

  1. Limits of rank 4 Azumaya algebras and applications to desingularisation

    International Nuclear Information System (INIS)

    Venkata Balaji, T.E.

    2001-07-01

    A smooth scheme structure on the space of limits of Azumaya algebra structures on a free rank 4 module over any noetherian commutative ring is shown to exist, generalizing Seshadri's theorem in that the variety of specialisations of (2x2)-matrix algebras is smooth in characteristic ≠2. As an application, a construction of Seshadri is shown in a characteristic-free way to desingularise the moduli space of rank two even degree semistable vector bundles on a complete curve. As another application, a construction of Nori over Z is extended to the case of a normal domain which is finitely generate algebra over a universally Japanese (Nagata) ring and is shown to desingularise the Artin moduli space of invariants of several matrices in rank 2. This desingularisation is shown to have a good specialisation property if the Artin moduli space has geometrically reduced fibers, for example, this happens over Z. Essential use is made of M. Kneser's concept of 'semiregular quadratic module'. For any free quadratic module of odd rank, a formula linking the half-discriminant and the values of the quadratic form on its radical is derived. (author)

  2. Let Us Rank Journalism Programs

    Science.gov (United States)

    Weber, Joseph

    2014-01-01

    Unlike law, business, and medical schools, as well as universities in general, journalism schools and journalism programs have rarely been ranked. Publishers such as "U.S. News & World Report," "Forbes," "Bloomberg Businessweek," and "Washington Monthly" do not pay them much mind. What is the best…

  3. On Rank Driven Dynamical Systems

    Science.gov (United States)

    Veerman, J. J. P.; Prieto, F. J.

    2014-08-01

    We investigate a class of models related to the Bak-Sneppen (BS) model, initially proposed to study evolution. The BS model is extremely simple and yet captures some forms of "complex behavior" such as self-organized criticality that is often observed in physical and biological systems. In this model, random fitnesses in are associated to agents located at the vertices of a graph . Their fitnesses are ranked from worst (0) to best (1). At every time-step the agent with the worst fitness and some others with a priori given rank probabilities are replaced by new agents with random fitnesses. We consider two cases: The exogenous case where the new fitnesses are taken from an a priori fixed distribution, and the endogenous case where the new fitnesses are taken from the current distribution as it evolves. We approximate the dynamics by making a simplifying independence assumption. We use Order Statistics and Dynamical Systems to define a rank-driven dynamical system that approximates the evolution of the distribution of the fitnesses in these rank-driven models, as well as in the BS model. For this simplified model we can find the limiting marginal distribution as a function of the initial conditions. Agreement with experimental results of the BS model is excellent.

  4. PageRank (II): Mathematics

    African Journals Online (AJOL)

    maths/stats

    ... GAUSS SEIDEL'S. NUMERICAL ALGORITHMS IN PAGE RANK ANALYSIS. ... The convergence is guaranteed, if the absolute value of the largest eigen ... improved Gauss-Seidel iteration algorithm, based on the decomposition. U. L. D. M. +. +. = ..... This corresponds to determine the eigen vector of T with eigen value 1.

  5. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan

    2012-11-19

    Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

  6. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2012-01-01

    Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.

  7. 14 CFR 1214.1105 - Final ranking.

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 5 2010-01-01 2010-01-01 false Final ranking. 1214.1105 Section 1214.1105... Recruitment and Selection Program § 1214.1105 Final ranking. Final rankings will be based on a combination of... preference will be included in this final ranking in accordance with applicable regulations. ...

  8. Multiple graph regularized protein domain ranking.

    Science.gov (United States)

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2012-11-19

    Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

  9. Multiple graph regularized protein domain ranking

    Directory of Open Access Journals (Sweden)

    Wang Jim

    2012-11-01

    Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

  10. A Survey on PageRank Computing

    OpenAIRE

    Berkhin, Pavel

    2005-01-01

    This survey reviews the research related to PageRank computing. Components of a PageRank vector serve as authority weights for web pages independent of their textual content, solely based on the hyperlink structure of the web. PageRank is typically used as a web search ranking component. This defines the importance of the model and the data structures that underly PageRank processing. Computing even a single PageRank is a difficult computational task. Computing many PageRanks is a much mor...

  11. Time evolution of Wikipedia network ranking

    Science.gov (United States)

    Eom, Young-Ho; Frahm, Klaus M.; Benczúr, András; Shepelyansky, Dima L.

    2013-12-01

    We study the time evolution of ranking and spectral properties of the Google matrix of English Wikipedia hyperlink network during years 2003-2011. The statistical properties of ranking of Wikipedia articles via PageRank and CheiRank probabilities, as well as the matrix spectrum, are shown to be stabilized for 2007-2011. A special emphasis is done on ranking of Wikipedia personalities and universities. We show that PageRank selection is dominated by politicians while 2DRank, which combines PageRank and CheiRank, gives more accent on personalities of arts. The Wikipedia PageRank of universities recovers 80% of top universities of Shanghai ranking during the considered time period.

  12. Geometrical method of decoupling

    Directory of Open Access Journals (Sweden)

    C. Baumgarten

    2012-12-01

    Full Text Available The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries—like midplane symmetry—are present, then it is possible to treat the betatron motion in the horizontal, the vertical plane, and (under certain circumstances the longitudinal motion separately using the well-known Courant-Snyder theory, or to apply transformations that have been described previously as, for instance, the method of Teng and Edwards. In a preceding paper, it has been shown that this method requires a modification for the treatment of isochronous cyclotrons with non-negligible space charge forces. Unfortunately, the modification was numerically not as stable as desired and it was still unclear, if the extension would work for all conceivable cases. Hence, a systematic derivation of a more general treatment seemed advisable. In a second paper, the author suggested the use of real Dirac matrices as basic tools for coupled linear optics and gave a straightforward recipe to decouple positive definite Hamiltonians with imaginary eigenvalues. In this article this method is generalized and simplified in order to formulate a straightforward method to decouple Hamiltonian matrices with eigenvalues on the real and the imaginary axis. The decoupling of symplectic matrices which are exponentials of such Hamiltonian matrices can be deduced from this in a few steps. It is shown that this algebraic decoupling is closely related to a geometric “decoupling” by the orthogonalization of the vectors E[over →], B[over →], and P[over →], which were introduced with the so-called “electromechanical equivalence.” A mathematical analysis of the problem can be traced down to the task of finding a structure-preserving block diagonalization of symplectic or Hamiltonian matrices. Structure preservation means in this context that the (sequence of transformations must be symplectic and hence canonical. When

  13. Geometric inequalities for black holes

    International Nuclear Information System (INIS)

    Dain, Sergio

    2013-01-01

    Full text: A geometric inequality in General Relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities, which are valid in the dynamical and strong field regime, play an important role in the characterization of the gravitational collapse. They are closed related with the cosmic censorship conjecture. In this talk I will review recent results in this subject. (author)

  14. Geometric Computing for Freeform Architecture

    KAUST Repository

    Wallner, J.

    2011-06-03

    Geometric computing has recently found a new field of applications, namely the various geometric problems which lie at the heart of rationalization and construction-aware design processes of freeform architecture. We report on our work in this area, dealing with meshes with planar faces and meshes which allow multilayer constructions (which is related to discrete surfaces and their curvatures), triangles meshes with circle-packing properties (which is related to conformal uniformization), and with the paneling problem. We emphasize the combination of numerical optimization and geometric knowledge.

  15. Optical traps with geometric aberrations

    International Nuclear Information System (INIS)

    Roichman, Yael; Waldron, Alex; Gardel, Emily; Grier, David G.

    2006-01-01

    We assess the influence of geometric aberrations on the in-plane performance of optical traps by studying the dynamics of trapped colloidal spheres in deliberately distorted holographic optical tweezers. The lateral stiffness of the traps turns out to be insensitive to moderate amounts of coma, astigmatism, and spherical aberration. Moreover holographic aberration correction enables us to compensate inherent shortcomings in the optical train, thereby adaptively improving its performance. We also demonstrate the effects of geometric aberrations on the intensity profiles of optical vortices, whose readily measured deformations suggest a method for rapidly estimating and correcting geometric aberrations in holographic trapping systems

  16. Geometric inequalities for black holes

    Energy Technology Data Exchange (ETDEWEB)

    Dain, Sergio [Universidad Nacional de Cordoba (Argentina)

    2013-07-01

    Full text: A geometric inequality in General Relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities, which are valid in the dynamical and strong field regime, play an important role in the characterization of the gravitational collapse. They are closed related with the cosmic censorship conjecture. In this talk I will review recent results in this subject. (author)

  17. Validating rankings in soccer championships

    Directory of Open Access Journals (Sweden)

    Annibal Parracho Sant'Anna

    2012-08-01

    Full Text Available The final ranking of a championship is determined by quality attributes combined with other factors which should be filtered out of any decision on relegation or draft for upper level tournaments. Factors like referees' mistakes and difficulty of certain matches due to its accidental importance to the opponents should have their influence reduced. This work tests approaches to combine classification rules considering the imprecision of the number of points as a measure of quality and of the variables that provide reliable explanation for it. Two home-advantage variables are tested and shown to be apt to enter as explanatory variables. Independence between the criteria is checked against the hypothesis of maximal correlation. The importance of factors and of composition rules is evaluated on the basis of correlation between rank vectors, number of classes and number of clubs in tail classes. Data from five years of the Brazilian Soccer Championship are analyzed.

  18. Minkowski metrics in creating universal ranking algorithms

    Directory of Open Access Journals (Sweden)

    Andrzej Ameljańczyk

    2014-06-01

    Full Text Available The paper presents a general procedure for creating the rankings of a set of objects, while the relation of preference based on any ranking function. The analysis was possible to use the ranking functions began by showing the fundamental drawbacks of commonly used functions in the form of a weighted sum. As a special case of the ranking procedure in the space of a relation, the procedure based on the notion of an ideal element and generalized Minkowski distance from the element was proposed. This procedure, presented as universal ranking algorithm, eliminates most of the disadvantages of ranking functions in the form of a weighted sum.[b]Keywords[/b]: ranking functions, preference relation, ranking clusters, categories, ideal point, universal ranking algorithm

  19. Functional Multiplex PageRank

    Science.gov (United States)

    Iacovacci, Jacopo; Rahmede, Christoph; Arenas, Alex; Bianconi, Ginestra

    2016-10-01

    Recently it has been recognized that many complex social, technological and biological networks have a multilayer nature and can be described by multiplex networks. Multiplex networks are formed by a set of nodes connected by links having different connotations forming the different layers of the multiplex. Characterizing the centrality of the nodes in a multiplex network is a challenging task since the centrality of the node naturally depends on the importance associated to links of a certain type. Here we propose to assign to each node of a multiplex network a centrality called Functional Multiplex PageRank that is a function of the weights given to every different pattern of connections (multilinks) existent in the multiplex network between any two nodes. Since multilinks distinguish all the possible ways in which the links in different layers can overlap, the Functional Multiplex PageRank can describe important non-linear effects when large relevance or small relevance is assigned to multilinks with overlap. Here we apply the Functional Page Rank to the multiplex airport networks, to the neuronal network of the nematode C. elegans, and to social collaboration and citation networks between scientists. This analysis reveals important differences existing between the most central nodes of these networks, and the correlations between their so-called pattern to success.

  20. Low rank magnetic resonance fingerprinting.

    Science.gov (United States)

    Mazor, Gal; Weizman, Lior; Tal, Assaf; Eldar, Yonina C

    2016-08-01

    Magnetic Resonance Fingerprinting (MRF) is a relatively new approach that provides quantitative MRI using randomized acquisition. Extraction of physical quantitative tissue values is preformed off-line, based on acquisition with varying parameters and a dictionary generated according to the Bloch equations. MRF uses hundreds of radio frequency (RF) excitation pulses for acquisition, and therefore high under-sampling ratio in the sampling domain (k-space) is required. This under-sampling causes spatial artifacts that hamper the ability to accurately estimate the quantitative tissue values. In this work, we introduce a new approach for quantitative MRI using MRF, called Low Rank MRF. We exploit the low rank property of the temporal domain, on top of the well-known sparsity of the MRF signal in the generated dictionary domain. We present an iterative scheme that consists of a gradient step followed by a low rank projection using the singular value decomposition. Experiments on real MRI data demonstrate superior results compared to conventional implementation of compressed sensing for MRF at 15% sampling ratio.

  1. Ranking Support Vector Machine with Kernel Approximation

    Directory of Open Access Journals (Sweden)

    Kai Chen

    2017-01-01

    Full Text Available Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels can give higher accuracy than linear RankSVM (RankSVM with a linear kernel for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

  2. Ranking Support Vector Machine with Kernel Approximation.

    Science.gov (United States)

    Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

    2017-01-01

    Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

  3. Discrete geometric structures for architecture

    KAUST Repository

    Pottmann, Helmut

    2010-01-01

    . The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization

  4. Geometric Rationalization for Freeform Architecture

    KAUST Repository

    Jiang, Caigui

    2016-01-01

    The emergence of freeform architecture provides interesting geometric challenges with regards to the design and manufacturing of large-scale structures. To design these architectural structures, we have to consider two types of constraints. First

  5. Geometrical optics in general relativity

    OpenAIRE

    Loinger, A.

    2006-01-01

    General relativity includes geometrical optics. This basic fact has relevant consequences that concern the physical meaning of the discontinuity surfaces propagated in the gravitational field - as it was first emphasized by Levi-Civita.

  6. Mobile Watermarking against Geometrical Distortions

    Directory of Open Access Journals (Sweden)

    Jing Zhang

    2015-08-01

    Full Text Available Mobile watermarking robust to geometrical distortions is still a great challenge. In mobile watermarking, efficient computation is necessary because mobile devices have very limited resources due to power consumption. In this paper, we propose a low-complexity geometrically resilient watermarking approach based on the optimal tradeoff circular harmonic function (OTCHF correlation filter and the minimum average correlation energy Mellin radial harmonic (MACE-MRH correlation filter. By the rotation, translation and scale tolerance properties of the two kinds of filter, the proposed watermark detector can be robust to geometrical attacks. The embedded watermark is weighted by a perceptual mask which matches very well with the properties of the human visual system. Before correlation, a whitening process is utilized to improve watermark detection reliability. Experimental results demonstrate that the proposed watermarking approach is computationally efficient and robust to geometrical distortions.

  7. Geometric inequalities methods of proving

    CERN Document Server

    Sedrakyan, Hayk

    2017-01-01

    This unique collection of new and classical problems provides full coverage of geometric inequalities. Many of the 1,000 exercises are presented with detailed author-prepared-solutions, developing creativity and an arsenal of new approaches for solving mathematical problems. This book can serve teachers, high-school students, and mathematical competitors. It may also be used as supplemental reading, providing readers with new and classical methods for proving geometric inequalities. .

  8. SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking

    Science.gov (United States)

    Shams, Bita; Haratizadeh, Saman

    2016-09-01

    Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.

  9. Resolution of a Rank-Deficient Adjustment Model Via an Isomorphic Geometrical Setup with Tensor Structure.

    Science.gov (United States)

    1987-03-01

    holds an economical advantage. We now formulate 1. from (65) in conjunction with (57): IH]T T I TI (4 L [I R)T(I + RR ) (L*4) where the positive...sizes of the matrices to be inverted, an economical edge of the analytical formulation hecomes apparent as well. Chapter 3 contains one such matrix of...the relat ions Sthat can tie iibta i ned via the tensor vers ion of adjustment quant it ies. Alt Iihut t . ho’ ) mpu it iona I merits of the CholeskI

  10. Rank Two Affine Manifolds in Genus 3

    OpenAIRE

    Aulicino, David; Nguyen, Duc-Manh

    2016-01-01

    We complete the classification of rank two affine manifolds in the moduli space of translation surfaces in genus three. Combined with a recent result of Mirzakhani and Wright, this completes the classification of higher rank affine manifolds in genus three.

  11. Geometric Mixing, Peristalsis, and the Geometric Phase of the Stomach.

    Science.gov (United States)

    Arrieta, Jorge; Cartwright, Julyan H E; Gouillart, Emmanuelle; Piro, Nicolas; Piro, Oreste; Tuval, Idan

    2015-01-01

    Mixing fluid in a container at low Reynolds number--in an inertialess environment--is not a trivial task. Reciprocating motions merely lead to cycles of mixing and unmixing, so continuous rotation, as used in many technological applications, would appear to be necessary. However, there is another solution: movement of the walls in a cyclical fashion to introduce a geometric phase. We show using journal-bearing flow as a model that such geometric mixing is a general tool for using deformable boundaries that return to the same position to mix fluid at low Reynolds number. We then simulate a biological example: we show that mixing in the stomach functions because of the "belly phase," peristaltic movement of the walls in a cyclical fashion introduces a geometric phase that avoids unmixing.

  12. Geometric Mixing, Peristalsis, and the Geometric Phase of the Stomach.

    Directory of Open Access Journals (Sweden)

    Jorge Arrieta

    Full Text Available Mixing fluid in a container at low Reynolds number--in an inertialess environment--is not a trivial task. Reciprocating motions merely lead to cycles of mixing and unmixing, so continuous rotation, as used in many technological applications, would appear to be necessary. However, there is another solution: movement of the walls in a cyclical fashion to introduce a geometric phase. We show using journal-bearing flow as a model that such geometric mixing is a general tool for using deformable boundaries that return to the same position to mix fluid at low Reynolds number. We then simulate a biological example: we show that mixing in the stomach functions because of the "belly phase," peristaltic movement of the walls in a cyclical fashion introduces a geometric phase that avoids unmixing.

  13. Introduction to geometric nonlinear control; Linearization, observability, decoupling

    Energy Technology Data Exchange (ETDEWEB)

    Respondek, W [Laboratoire de Mathematiques, INSA de Rouen (France)

    2002-07-15

    These notes are devoted to the problems of linearization, observability, and decoupling of nonlinear control systems. Together with notes of Bronislaw Jakubczyk in the same volume, they form an introduction to geometric methods in nonlinear control theory. In the first part we discuss equivalence of control systems. We consider various aspects of the problem: state-space and feedback equivalence, local and global equivalence, equivalence to linear and partially linear systems. In the second part we present the notion of observability and give a geometric rank condition for local observability and an algebraic characterization of local observability. We discuss unm observability, decompositions of non-observable systems, and properties of generic observable systems. In the third part we introduce the notion of invariant distributions and discuss disturbance decoupling and input-output decoupling. Many concepts and results are illustrated with examples. (author)

  14. The Privilege of Ranking: Google Plays Ball.

    Science.gov (United States)

    Wiggins, Richard

    2003-01-01

    Discussion of ranking systems used in various settings, including college football and academic admissions, focuses on the Google search engine. Explains the PageRank mathematical formula that scores Web pages by connecting the number of links; limitations, including authenticity and accuracy of ranked Web pages; relevancy; adjusting algorithms;…

  15. A Comprehensive Analysis of Marketing Journal Rankings

    Science.gov (United States)

    Steward, Michelle D.; Lewis, Bruce R.

    2010-01-01

    The purpose of this study is to offer a comprehensive assessment of journal standings in Marketing from two perspectives. The discipline perspective of rankings is obtained from a collection of published journal ranking studies during the past 15 years. The studies in the published ranking stream are assessed for reliability by examining internal…

  16. A new geometrical gravitational theory

    International Nuclear Information System (INIS)

    Obata, T.; Chiba, J.; Oshima, H.

    1981-01-01

    A geometrical gravitational theory is developed. The field equations are uniquely determined apart from one unknown dimensionless parameter ω 2 . It is based on an extension of the Weyl geometry, and by the extension the gravitational coupling constant and the gravitational mass are made to be dynamical and geometrical. The fundamental geometrical objects in the theory are a metric gsub(μν) and two gauge scalars phi and psi. The theory satisfies the weak equivalence principle, but breaks the strong one generally. u(phi, psi) = phi is found out on the assumption that the strong one keeps holding good at least for bosons of low spins. Thus there is the simple correspondence between the geometrical objects and the gravitational objects. Since the theory satisfies the weak one, the inertial mass is also dynamical and geometrical in the same way as is the gravitational mass. Moreover, the cosmological term in the theory is a coscalar of power -4 algebraically made of psi and u(phi, psi), so it is dynamical, too. Finally spherically symmetric exact solutions are given. The permissible range of the unknown parameter ω 2 is experimentally determined by applying the solutions to the solar system. (author)

  17. Geometric group theory an introduction

    CERN Document Server

    Löh, Clara

    2017-01-01

    Inspired by classical geometry, geometric group theory has in turn provided a variety of applications to geometry, topology, group theory, number theory and graph theory. This carefully written textbook provides a rigorous introduction to this rapidly evolving field whose methods have proven to be powerful tools in neighbouring fields such as geometric topology. Geometric group theory is the study of finitely generated groups via the geometry of their associated Cayley graphs. It turns out that the essence of the geometry of such groups is captured in the key notion of quasi-isometry, a large-scale version of isometry whose invariants include growth types, curvature conditions, boundary constructions, and amenability. This book covers the foundations of quasi-geometry of groups at an advanced undergraduate level. The subject is illustrated by many elementary examples, outlooks on applications, as well as an extensive collection of exercises.

  18. Geometric procedures for civil engineers

    CERN Document Server

    Tonias, Elias C

    2016-01-01

    This book provides a multitude of geometric constructions usually encountered in civil engineering and surveying practice.  A detailed geometric solution is provided to each construction as well as a step-by-step set of programming instructions for incorporation into a computing system. The volume is comprised of 12 chapters and appendices that may be grouped in three major parts: the first is intended for those who love geometry for its own sake and its evolution through the ages, in general, and, more specifically, with the introduction of the computer. The second section addresses geometric features used in the book and provides support procedures used by the constructions presented. The remaining chapters and the appendices contain the various constructions. The volume is ideal for engineering practitioners in civil and construction engineering and allied areas.

  19. An introduction to geometrical physics

    CERN Document Server

    Aldrovandi, R

    1995-01-01

    This book stresses the unifying power of the geometrical framework in bringing together concepts from the different areas of physics. Common underpinnings of optics, elasticity, gravitation, relativistic fields, particle mechanics and other subjects are underlined. It attempts to extricate the notion of space currently in the physical literature from the metric connotation.The book's goal is to present mathematical ideas associated with geometrical physics in a rather introductory language. Included are many examples from elementary physics and also, for those wishing to reach a higher level o

  20. Geometric scaling as traveling waves

    International Nuclear Information System (INIS)

    Munier, S.; Peschanski, R.

    2003-01-01

    We show the relevance of the nonlinear Fisher and Kolmogorov-Petrovsky-Piscounov (KPP) equation to the problem of high energy evolution of the QCD amplitudes. We explain how the traveling wave solutions of this equation are related to geometric scaling, a phenomenon observed in deep-inelastic scattering experiments. Geometric scaling is for the first time shown to result from an exact solution of nonlinear QCD evolution equations. Using general results on the KPP equation, we compute the velocity of the wave front, which gives the full high energy dependence of the saturation scale

  1. Asymptotic geometric analysis, part I

    CERN Document Server

    Artstein-Avidan, Shiri

    2015-01-01

    The authors present the theory of asymptotic geometric analysis, a field which lies on the border between geometry and functional analysis. In this field, isometric problems that are typical for geometry in low dimensions are substituted by an "isomorphic" point of view, and an asymptotic approach (as dimension tends to infinity) is introduced. Geometry and analysis meet here in a non-trivial way. Basic examples of geometric inequalities in isomorphic form which are encountered in the book are the "isomorphic isoperimetric inequalities" which led to the discovery of the "concentration phenomen

  2. Geometric integration for particle accelerators

    International Nuclear Information System (INIS)

    Forest, Etienne

    2006-01-01

    This paper is a very personal view of the field of geometric integration in accelerator physics-a field where often work of the highest quality is buried in lost technical notes or even not published; one has only to think of Simon van der Meer Nobel prize work on stochastic cooling-unpublished in any refereed journal. So I reconstructed the relevant history of geometrical integration in accelerator physics as much as I could by talking to collaborators and using my own understanding of the field. The reader should not be too surprised if this account is somewhere between history, science and perhaps even fiction

  3. Geometrical spin symmetry and spin

    International Nuclear Information System (INIS)

    Pestov, I. B.

    2011-01-01

    Unification of General Theory of Relativity and Quantum Mechanics leads to General Quantum Mechanics which includes into itself spindynamics as a theory of spin phenomena. The key concepts of spindynamics are geometrical spin symmetry and the spin field (space of defining representation of spin symmetry). The essence of spin is the bipolar structure of geometrical spin symmetry induced by the gravitational potential. The bipolar structure provides a natural derivation of the equations of spindynamics. Spindynamics involves all phenomena connected with spin and provides new understanding of the strong interaction.

  4. Geometric integration for particle accelerators

    Science.gov (United States)

    Forest, Étienne

    2006-05-01

    This paper is a very personal view of the field of geometric integration in accelerator physics—a field where often work of the highest quality is buried in lost technical notes or even not published; one has only to think of Simon van der Meer Nobel prize work on stochastic cooling—unpublished in any refereed journal. So I reconstructed the relevant history of geometrical integration in accelerator physics as much as I could by talking to collaborators and using my own understanding of the field. The reader should not be too surprised if this account is somewhere between history, science and perhaps even fiction.

  5. Lattice degeneracies of geometric fermions

    International Nuclear Information System (INIS)

    Raszillier, H.

    1983-05-01

    We give the minimal numbers of degrees of freedom carried by geometric fermions on all lattices of maximal symmetries in d = 2, 3, and 4 dimensions. These numbers are lattice dependent, but in the (free) continuum limit, part of the degrees of freedom have to escape to infinity by a Wilson mechanism built in, and 2sup(d) survive for any lattice. On self-reciprocal lattices we compare the minimal numbers of degrees of freedom of geometric fermions with the minimal numbers of naive fermions on these lattices and argue that these numbers are equal. (orig.)

  6. A geometrical interpretation of renormalisation group flow

    International Nuclear Information System (INIS)

    Dolan, B.P.

    1993-05-01

    The renormalisation group (RG) equation in D-dimensional Euclidean space, R D , is analysed from a geometrical point of view. A general form of the RG equation is derived which is applicable to composite operators as well tensor operators (on R D ) which may depend on the Euclidean metric. It is argued that physical N-point amplitudes should be interpreted as rank N co-variant tensors on the space of couplings, G, and that the RG equation can be viewed as an equation for Lie transport on G with respect to the vector field generated by the β-functions of the theory. In one sense it is nothing more than the definition of a Lie derivative. The source of the anomalous dimensions can be interpreted as being due to the change of the basis vectors on G under Lie transport. The RG equation acts as a bridge between Euclidean space and coupling constant space in that the effect on amplitudes of a diffeomorphism of R D (that of dilations) is completely equivalent to a diffeomorphism of G generated by the β-functions of the theory. A form of the RG equation for operators is also given. These ideas are developed in detail for the example of massive λΦ 4 theory in 4 dimensions. (orig.)

  7. Two-dimensional ranking of Wikipedia articles

    Science.gov (United States)

    Zhirov, A. O.; Zhirov, O. V.; Shepelyansky, D. L.

    2010-10-01

    The Library of Babel, described by Jorge Luis Borges, stores an enormous amount of information. The Library exists ab aeterno. Wikipedia, a free online encyclopaedia, becomes a modern analogue of such a Library. Information retrieval and ranking of Wikipedia articles become the challenge of modern society. While PageRank highlights very well known nodes with many ingoing links, CheiRank highlights very communicative nodes with many outgoing links. In this way the ranking becomes two-dimensional. Using CheiRank and PageRank we analyze the properties of two-dimensional ranking of all Wikipedia English articles and show that it gives their reliable classification with rich and nontrivial features. Detailed studies are done for countries, universities, personalities, physicists, chess players, Dow-Jones companies and other categories.

  8. 24 CFR 599.401 - Ranking of applications.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 3 2010-04-01 2010-04-01 false Ranking of applications. 599.401... Communities § 599.401 Ranking of applications. (a) Ranking order. Rural and urban applications will be ranked... applications ranked first. (b) Separate ranking categories. After initial ranking, both rural and urban...

  9. Agro-tourism and ranking

    Science.gov (United States)

    Cioca, L. I.; Giurea, R.; Precazzini, I.; Ragazzi, M.; Achim, M. I.; Schiavon, M.; Rada, E. C.

    2018-05-01

    Nowadays the global tourism growth has caused a significant interest in research focused on the impact of the tourism on environment and community. The purpose of this study is to introduce a new ranking for the classification of tourist accommodation establishments with the functions of agro-tourism boarding house type by examining the sector of agro-tourism based on a research aimed to improve the economic, socio-cultural and environmental performance of agrotourism structures. This paper links the criteria for the classification of agro-tourism boarding houses (ABHs) to the impact of agro-tourism activities on the environment, enhancing an eco-friendly approach on agro-tourism activities by increasing the quality reputation of the agro-tourism products and services. Taking into account the impact on the environment, agrotourism can play an important role by protecting and conserving it.

  10. The singularity structure of scale-invariant rank-2 Coulomb branches

    Science.gov (United States)

    Argyres, Philip C.; Long, Cody; Martone, Mario

    2018-05-01

    We compute the spectrum of scaling dimensions of Coulomb branch operators in 4d rank-2 N=2 superconformal field theories. Only a finite rational set of scaling dimensions is allowed. It is determined by using information about the global topology of the locus of metric singularities on the Coulomb branch, the special Kähler geometry near those singularities, and electric-magnetic duality monodromies along orbits of the U(1) R symmetry. A set of novel topological and geometric results are developed which promise to be useful for the study and classification of Coulomb branch geometries at all ranks.

  11. Height and Tilt Geometric Texture

    DEFF Research Database (Denmark)

    Andersen, Vedrana; Desbrun, Mathieu; Bærentzen, Jakob Andreas

    2009-01-01

    compromise between functionality and simplicity: it can efficiently handle and process geometric texture too complex to be represented as a height field, without having recourse to full blown mesh editing algorithms. The height-and-tilt representation proposed here is fully intrinsic to the mesh, making...

  12. In Defence of Geometrical Algebra

    NARCIS (Netherlands)

    Blasjo, V.N.E.

    The geometrical algebra hypothesis was once the received interpretation of Greek mathematics. In recent decades, however, it has become anathema to many. I give a critical review of all arguments against it and offer a consistent rebuttal case against the modern consensus. Consequently, I find that

  13. Geometrical interpretation of extended supergravity

    International Nuclear Information System (INIS)

    Townsend, P.K.; Nieuwenhuizen, P.van

    1977-01-01

    SO 2 extended supergravity is shown to be a geometrical theory, whose underlying gauge group is OSp(4,2). The couplings which gauge the SO 2 symmetry as well as the accompanying cosmological and masslike terms are directly obtained, and the usual SO 2 model is obtained after a Wigner-Inoenue group contraction. (Auth.)

  14. Geometric scaling in exclusive processes

    International Nuclear Information System (INIS)

    Munier, S.; Wallon, S.

    2003-01-01

    We show that according to the present understanding of the energy evolution of the observables measured in deep-inelastic scattering, the photon-proton scattering amplitude has to exhibit geometric scaling at each impact parameter. We suggest a way to test this experimentally at HERA. A qualitative analysis based on published data is presented and discussed. (orig.)

  15. Geometric quantization and general relativity

    International Nuclear Information System (INIS)

    Souriau, J.-M.

    1977-01-01

    The purpose of geometric quantization is to give a rigorous mathematical content to the 'correspondence principle' between classical and quantum mechanics. The main tools are borrowed on one hand from differential geometry and topology (differential manifolds, differential forms, fiber bundles, homology and cohomology, homotopy), on the other hand from analysis (functions of positive type, infinite dimensional group representations, pseudo-differential operators). Some satisfactory results have been obtained in the study of dynamical systems, but some fundamental questions are still waiting for an answer. The 'geometric quantization of fields', where some further well known difficulties arise, is still in a preliminary stage. In particular, the geometric quantization on the gravitational field is still a mere project. The situation is even more uncertain due to the fact that there is no experimental evidence of any quantum gravitational effect which could give us a hint towards what we are supposed to look for. The first level of both Quantum Theory, and General Relativity describes passive matter: influence by the field without being a source of it (first quantization and equivalence principle respectively). In both cases this is only an approximation (matter is always a source). But this approximation turns out to be the least uncertain part of the description, because on one hand the first quantization avoids the problems of renormalization and on the other hand the equivalence principle does not imply any choice of field equations (it is known that one can modify Einstein equations at short distances without changing their geometrical properties). (Auth.)

  16. Geometric origin of central charges

    International Nuclear Information System (INIS)

    Lukierski, J.; Rytel, L.

    1981-05-01

    The complete set of N(N-1) central charge generators for D=4 N-extended super Poincare algebra is obtained by suitable contraction of OSp (2N; 4) superalgebra. The superspace realizations of the spinorial generators with central charges are derived. The conjugate set of N(N-1) additional bosonic superspace coordinates is introduced in an unique and geometric way. (author)

  17. Vergence, Vision, and Geometric Optics

    Science.gov (United States)

    Keating, Michael P.

    1975-01-01

    Provides a definition of vergence in terms of the curvature of the wave fronts, and gives examples to illustrate the advantages of this approach. The vergence treatment of geometrical optics provides both conceptual and algebraic advantages, particularly for the life science student, over the traditional object distance-image distance-focal length…

  18. Geometric phases and quantum computation

    International Nuclear Information System (INIS)

    Vedral, V.

    2005-01-01

    Full text: In my lectures I will talk about the notion of the geometric phase and explain its relevance for both fundamental quantum mechanics as well as quantum computation. The phase will be at first introduced via the idea of Pancharatnam which involves interference of three or more light beams. This notion will then be generalized to the evolving quantum systems. I will discuss both pure and mixed states as well as unitary and non-unitary evolutions. I will also show how the concept of the vacuum induced geometric phase arises in quantum optics. A simple measurement scheme involving a Mach Zehnder interferometer will be presented and will be used to illustrate all the concepts in the lecture. Finally, I will expose a simple generalization of the geometric phase to evolving degenerate states. This will be seen to lead to the possibility of universal quantum computation using geometric effects only. Moreover, this contains a promise of intrinsically fault tolerant quantum information processing, whose prospects will be outlined at the end of the lecture. (author)

  19. Cartan's geometrical structure of supergravity

    International Nuclear Information System (INIS)

    Baaklini, N.S.

    1977-06-01

    The geometrical partnership of the vierbein and the spin-3/2 field in the structure of the supergravity Lagrangian is emphasized. Both fields are introduced as component of the same matrix differential form. The only local symmetry of the theory is SL(2,C)

  20. Geometric Transformations in Engineering Geometry

    Directory of Open Access Journals (Sweden)

    I. F. Borovikov

    2015-01-01

    Full Text Available Recently, for business purposes, in view of current trends and world experience in training engineers, research and faculty staff there has been a need to transform traditional courses of descriptive geometry into the course of engineering geometry in which the geometrical transformations have to become its main section. On the basis of critical analysis the paper gives suggestions to improve a presentation technique of this section both in the classroom and in academic literature, extend an application scope of geometrical transformations to solve the position and metric tasks and simulation of surfaces, as well as to design complex engineering configurations, which meet a number of pre-specified conditions.The article offers to make a number of considerable amendments to the terms and definitions used in the existing courses of descriptive geometry. It draws some conclusions and makes the appropriate proposals on feasibility of coordination in teaching the movement transformation in the courses of analytical and descriptive geometry. This will provide interdisciplinary team teaching and allow students to be convinced that a combination of analytical and graphic ways to solve geometric tasks is useful and reasonable.The traditional sections of learning courses need to be added with a theory of projective and bi-rational transformations. In terms of application simplicity and convenience it is enough to consider the central transformations when solving the applied tasks. These transformations contain a beam of sub-invariant (low-invariant straight lines on which the invariant curve induces non-involution and involution projectivities. The expediency of nonlinear transformations application is shown in the article by a specific example of geometric modeling of the interfacing surface "spar-blade".Implementation of these suggestions will contribute to a real transformation of a traditional course of descriptive geometry to the engineering geometry

  1. Error analysis of stochastic gradient descent ranking.

    Science.gov (United States)

    Chen, Hong; Tang, Yi; Li, Luoqing; Yuan, Yuan; Li, Xuelong; Tang, Yuanyan

    2013-06-01

    Ranking is always an important task in machine learning and information retrieval, e.g., collaborative filtering, recommender systems, drug discovery, etc. A kernel-based stochastic gradient descent algorithm with the least squares loss is proposed for ranking in this paper. The implementation of this algorithm is simple, and an expression of the solution is derived via a sampling operator and an integral operator. An explicit convergence rate for leaning a ranking function is given in terms of the suitable choices of the step size and the regularization parameter. The analysis technique used here is capacity independent and is novel in error analysis of ranking learning. Experimental results on real-world data have shown the effectiveness of the proposed algorithm in ranking tasks, which verifies the theoretical analysis in ranking error.

  2. Methodology for ranking restoration options

    International Nuclear Information System (INIS)

    Hedemann Jensen, Per

    1999-04-01

    The work described in this report has been performed as a part of the RESTRAT Project FI4P-CT95-0021a (PL 950128) co-funded by the Nuclear Fission Safety Programme of the European Commission. The RESTRAT project has the overall objective of developing generic methodologies for ranking restoration techniques as a function of contamination and site characteristics. The project includes analyses of existing remediation methodologies and contaminated sites, and is structured in the following steps: characterisation of relevant contaminated sites; identification and characterisation of relevant restoration techniques; assessment of the radiological impact; development and application of a selection methodology for restoration options; formulation of generic conclusions and development of a manual. The project is intended to apply to situations in which sites with nuclear installations have been contaminated with radioactive materials as a result of the operation of these installations. The areas considered for remedial measures include contaminated land areas, rivers and sediments in rivers, lakes, and sea areas. Five contaminated European sites have been studied. Various remedial measures have been envisaged with respect to the optimisation of the protection of the populations being exposed to the radionuclides at the sites. Cost-benefit analysis and multi-attribute utility analysis have been applied for optimisation. Health, economic and social attributes have been included and weighting factors for the different attributes have been determined by the use of scaling constants. (au)

  3. Citation graph based ranking in Invenio

    CERN Document Server

    Marian, Ludmila; Rajman, Martin; Vesely, Martin

    2010-01-01

    Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that complement the simple approach based on citation counts: time-dependent citation counts, a relevancy ranking which extends the PageRank model, a time-dependent ranking which combines the freshness of citations with PageRank and a ranking that takes into consideration the external citations. We present our analysis and results obtained on two main data sets: Inspire and CERN Document Server. Our main contributions are: (i) a study of the currently available ranking methods based on the citation graph; (ii) the development of new ranking methods that correct some of the identified limitations of the current methods such as treating all citations of equal importance, not taking time into account or considering the citation graph complete; (iii) a detailed study of the key parameters for these ranking methods. (The original publication is ava...

  4. Communities in Large Networks: Identification and Ranking

    DEFF Research Database (Denmark)

    Olsen, Martin

    2008-01-01

    We study the problem of identifying and ranking the members of a community in a very large network with link analysis only, given a set of representatives of the community. We define the concept of a community justified by a formal analysis of a simple model of the evolution of a directed graph. ...... and its immediate surroundings. The members are ranked with a “local” variant of the PageRank algorithm. Results are reported from successful experiments on identifying and ranking Danish Computer Science sites and Danish Chess pages using only a few representatives....

  5. Ranking Entities in Networks via Lefschetz Duality

    DEFF Research Database (Denmark)

    Aabrandt, Andreas; Hansen, Vagn Lundsgaard; Poulsen, Bjarne

    2014-01-01

    then be ranked according to how essential their positions are in the network by considering the effect of their respective absences. Defining a ranking of a network which takes the individual position of each entity into account has the purpose of assigning different roles to the entities, e.g. agents......, in the network. In this paper it is shown that the topology of a given network induces a ranking of the entities in the network. Further, it is demonstrated how to calculate this ranking and thus how to identify weak sub-networks in any given network....

  6. On chromatic and geometrical calibration

    DEFF Research Database (Denmark)

    Folm-Hansen, Jørgen

    1999-01-01

    The main subject of the present thesis is different methods for the geometrical and chromatic calibration of cameras in various environments. For the monochromatic issues of the calibration we present the acquisition of monochrome images, the classic monochrome aberrations and the various sources...... the correct interpolation method is described. For the chromatic issues of calibration we present the acquisition of colour and multi-spectral images, the chromatic aberrations and the various lens/camera based non-uniformities of the illumination of the image plane. It is described how the monochromatic...... to design calibration targets for both geometrical and chromatic calibration are described. We present some possible systematical errors on the detection of the objects in the calibration targets, if viewed in a non orthogonal angle, if the intensities are uneven or if the image blurring is uneven. Finally...

  7. Geometrical approach to tumor growth.

    Science.gov (United States)

    Escudero, Carlos

    2006-08-01

    Tumor growth has a number of features in common with a physical process known as molecular beam epitaxy. Both growth processes are characterized by the constraint of growth development to the body border, and surface diffusion of cells and particles at the growing edge. However, tumor growth implies an approximate spherical symmetry that makes necessary a geometrical treatment of the growth equations. The basic model was introduced in a former paper [C. Escudero, Phys. Rev. E 73, 020902(R) (2006)], and in the present work we extend our analysis and try to shed light on the possible geometrical principles that drive tumor growth. We present two-dimensional models that reproduce the experimental observations, and analyze the unexplored three-dimensional case, for which interesting conclusions on tumor growth are derived.

  8. Geometrical interpretation of optical absorption

    Energy Technology Data Exchange (ETDEWEB)

    Monzon, J. J.; Barriuso, A. G.; Sanchez-Soto, L. L. [Departamento de Optica, Facultad de Fisica, Universidad Complutense, E-28040 Madrid (Spain); Montesinos-Amilibia, J. M. [Departamento de Geometria y Topologia, Facultad de Matematicas, Universidad Complutense, E-28040 Madrid (Spain)

    2011-08-15

    We reinterpret the transfer matrix for an absorbing system in very simple geometrical terms. In appropriate variables, the system appears as performing a Lorentz transformation in a (1 + 3)-dimensional space. Using homogeneous coordinates, we map that action on the unit sphere, which is at the realm of the Klein model of hyperbolic geometry. The effects of absorption appear then as a loxodromic transformation, that is, a rhumb line crossing all the meridians at the same angle.

  9. Parametric FEM for geometric biomembranes

    Science.gov (United States)

    Bonito, Andrea; Nochetto, Ricardo H.; Sebastian Pauletti, M.

    2010-05-01

    We consider geometric biomembranes governed by an L2-gradient flow for bending energy subject to area and volume constraints (Helfrich model). We give a concise derivation of a novel vector formulation, based on shape differential calculus, and corresponding discretization via parametric FEM using quadratic isoparametric elements and a semi-implicit Euler method. We document the performance of the new parametric FEM with a number of simulations leading to dumbbell, red blood cell and toroidal equilibrium shapes while exhibiting large deformations.

  10. Geometrical methods in learning theory

    International Nuclear Information System (INIS)

    Burdet, G.; Combe, Ph.; Nencka, H.

    2001-01-01

    The methods of information theory provide natural approaches to learning algorithms in the case of stochastic formal neural networks. Most of the classical techniques are based on some extremization principle. A geometrical interpretation of the associated algorithms provides a powerful tool for understanding the learning process and its stability and offers a framework for discussing possible new learning rules. An illustration is given using sequential and parallel learning in the Boltzmann machine

  11. Geometrical approach to tumor growth

    OpenAIRE

    Escudero, Carlos

    2006-01-01

    Tumor growth has a number of features in common with a physical process known as molecular beam epitaxy. Both growth processes are characterized by the constraint of growth development to the body border, and surface diffusion of cells/particles at the growing edge. However, tumor growth implies an approximate spherical symmetry that makes necessary a geometrical treatment of the growth equations. The basic model was introduced in a former article [C. Escudero, Phys. Rev. E 73, 020902(R) (200...

  12. Riemannian geometry and geometric analysis

    CERN Document Server

    Jost, Jürgen

    2017-01-01

    This established reference work continues to provide its readers with a gateway to some of the most interesting developments in contemporary geometry. It offers insight into a wide range of topics, including fundamental concepts of Riemannian geometry, such as geodesics, connections and curvature; the basic models and tools of geometric analysis, such as harmonic functions, forms, mappings, eigenvalues, the Dirac operator and the heat flow method; as well as the most important variational principles of theoretical physics, such as Yang-Mills, Ginzburg-Landau or the nonlinear sigma model of quantum field theory. The present volume connects all these topics in a systematic geometric framework. At the same time, it equips the reader with the working tools of the field and enables her or him to delve into geometric research.  The 7th edition has been systematically reorganized and updated. Almost no page has been left unchanged. It also includes new material, for instance on symplectic geometry, as well as the B...

  13. Geometric mean for subspace selection.

    Science.gov (United States)

    Tao, Dacheng; Li, Xuelong; Wu, Xindong; Maybank, Stephen J

    2009-02-01

    Subspace selection approaches are powerful tools in pattern classification and data visualization. One of the most important subspace approaches is the linear dimensionality reduction step in the Fisher's linear discriminant analysis (FLDA), which has been successfully employed in many fields such as biometrics, bioinformatics, and multimedia information management. However, the linear dimensionality reduction step in FLDA has a critical drawback: for a classification task with c classes, if the dimension of the projected subspace is strictly lower than c - 1, the projection to a subspace tends to merge those classes, which are close together in the original feature space. If separate classes are sampled from Gaussian distributions, all with identical covariance matrices, then the linear dimensionality reduction step in FLDA maximizes the mean value of the Kullback-Leibler (KL) divergences between different classes. Based on this viewpoint, the geometric mean for subspace selection is studied in this paper. Three criteria are analyzed: 1) maximization of the geometric mean of the KL divergences, 2) maximization of the geometric mean of the normalized KL divergences, and 3) the combination of 1 and 2. Preliminary experimental results based on synthetic data, UCI Machine Learning Repository, and handwriting digits show that the third criterion is a potential discriminative subspace selection method, which significantly reduces the class separation problem in comparing with the linear dimensionality reduction step in FLDA and its several representative extensions.

  14. Ranking scientific publications: the effect of nonlinearity

    Science.gov (United States)

    Yao, Liyang; Wei, Tian; Zeng, An; Fan, Ying; di, Zengru

    2014-10-01

    Ranking the significance of scientific publications is a long-standing challenge. The network-based analysis is a natural and common approach for evaluating the scientific credit of papers. Although the number of citations has been widely used as a metric to rank papers, recently some iterative processes such as the well-known PageRank algorithm have been applied to the citation networks to address this problem. In this paper, we introduce nonlinearity to the PageRank algorithm when aggregating resources from different nodes to further enhance the effect of important papers. The validation of our method is performed on the data of American Physical Society (APS) journals. The results indicate that the nonlinearity improves the performance of the PageRank algorithm in terms of ranking effectiveness, as well as robustness against malicious manipulations. Although the nonlinearity analysis is based on the PageRank algorithm, it can be easily extended to other iterative ranking algorithms and similar improvements are expected.

  15. Ranking scientific publications: the effect of nonlinearity.

    Science.gov (United States)

    Yao, Liyang; Wei, Tian; Zeng, An; Fan, Ying; Di, Zengru

    2014-10-17

    Ranking the significance of scientific publications is a long-standing challenge. The network-based analysis is a natural and common approach for evaluating the scientific credit of papers. Although the number of citations has been widely used as a metric to rank papers, recently some iterative processes such as the well-known PageRank algorithm have been applied to the citation networks to address this problem. In this paper, we introduce nonlinearity to the PageRank algorithm when aggregating resources from different nodes to further enhance the effect of important papers. The validation of our method is performed on the data of American Physical Society (APS) journals. The results indicate that the nonlinearity improves the performance of the PageRank algorithm in terms of ranking effectiveness, as well as robustness against malicious manipulations. Although the nonlinearity analysis is based on the PageRank algorithm, it can be easily extended to other iterative ranking algorithms and similar improvements are expected.

  16. Neural Ranking Models with Weak Supervision

    NARCIS (Netherlands)

    Dehghani, M.; Zamani, H.; Severyn, A.; Kamps, J.; Croft, W.B.

    2017-01-01

    Despite the impressive improvements achieved by unsupervised deep neural networks in computer vision and NLP tasks, such improvements have not yet been observed in ranking for information retrieval. The reason may be the complexity of the ranking problem, as it is not obvious how to learn from

  17. A Rational Method for Ranking Engineering Programs.

    Science.gov (United States)

    Glower, Donald D.

    1980-01-01

    Compares two methods for ranking academic programs, the opinion poll v examination of career successes of the program's alumni. For the latter, "Who's Who in Engineering" and levels of research funding provided data. Tables display resulting data and compare rankings by the two methods for chemical engineering and civil engineering. (CS)

  18. Lerot: An Online Learning to Rank Framework

    NARCIS (Netherlands)

    Schuth, A.; Hofmann, K.; Whiteson, S.; de Rijke, M.

    2013-01-01

    Online learning to rank methods for IR allow retrieval systems to optimize their own performance directly from interactions with users via click feedback. In the software package Lerot, presented in this paper, we have bundled all ingredients needed for experimenting with online learning to rank for

  19. Adaptive distributional extensions to DFR ranking

    DEFF Research Database (Denmark)

    Petersen, Casper; Simonsen, Jakob Grue; Järvelin, Kalervo

    2016-01-01

    -fitting distribution. We call this model Adaptive Distributional Ranking (ADR) because it adapts the ranking to the statistics of the specific dataset being processed each time. Experiments on TREC data show ADR to outperform DFR models (and their extensions) and be comparable in performance to a query likelihood...

  20. Contests with rank-order spillovers

    NARCIS (Netherlands)

    M.R. Baye (Michael); D. Kovenock (Dan); C.G. de Vries (Casper)

    2012-01-01

    textabstractThis paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine "spillover" effects that depend on the rank-order of her

  1. Classification of rank 2 cluster varieties

    DEFF Research Database (Denmark)

    Mandel, Travis

    We classify rank 2 cluster varieties (those whose corresponding skew-form has rank 2) according to the deformation type of a generic fiber U of their X-spaces, as defined by Fock and Goncharov. Our approach is based on the work of Gross, Hacking, and Keel for cluster varieties and log Calabi...

  2. Using centrality to rank web snippets

    NARCIS (Netherlands)

    Jijkoun, V.; de Rijke, M.; Peters, C.; Jijkoun, V.; Mandl, T.; Müller, H.; Oard, D.W.; Peñas, A.; Petras, V.; Santos, D.

    2008-01-01

    We describe our participation in the WebCLEF 2007 task, targeted at snippet retrieval from web data. Our system ranks snippets based on a simple similarity-based centrality, inspired by the web page ranking algorithms. We experimented with retrieval units (sentences and paragraphs) and with the

  3. Mining Feedback in Ranking and Recommendation Systems

    Science.gov (United States)

    Zhuang, Ziming

    2009-01-01

    The amount of online information has grown exponentially over the past few decades, and users become more and more dependent on ranking and recommendation systems to address their information seeking needs. The advance in information technologies has enabled users to provide feedback on the utilities of the underlying ranking and recommendation…

  4. Entity Ranking using Wikipedia as a Pivot

    NARCIS (Netherlands)

    R. Kaptein; P. Serdyukov; A.P. de Vries (Arjen); J. Kamps

    2010-01-01

    htmlabstractIn this paper we investigate the task of Entity Ranking on the Web. Searchers looking for entities are arguably better served by presenting a ranked list of entities directly, rather than a list of web pages with relevant but also potentially redundant information about

  5. Entity ranking using Wikipedia as a pivot

    NARCIS (Netherlands)

    Kaptein, R.; Serdyukov, P.; de Vries, A.; Kamps, J.; Huang, X.J.; Jones, G.; Koudas, N.; Wu, X.; Collins-Thompson, K.

    2010-01-01

    In this paper we investigate the task of Entity Ranking on the Web. Searchers looking for entities are arguably better served by presenting a ranked list of entities directly, rather than a list of web pages with relevant but also potentially redundant information about these entities. Since

  6. Rank 2 fusion rings are complete intersections

    DEFF Research Database (Denmark)

    Andersen, Troels Bak

    We give a non-constructive proof that fusion rings attached to a simple complex Lie algebra of rank 2 are complete intersections.......We give a non-constructive proof that fusion rings attached to a simple complex Lie algebra of rank 2 are complete intersections....

  7. A Ranking Method for Evaluating Constructed Responses

    Science.gov (United States)

    Attali, Yigal

    2014-01-01

    This article presents a comparative judgment approach for holistically scored constructed response tasks. In this approach, the grader rank orders (rather than rate) the quality of a small set of responses. A prior automated evaluation of responses guides both set formation and scaling of rankings. Sets are formed to have similar prior scores and…

  8. Ranking Music Data by Relevance and Importance

    DEFF Research Database (Denmark)

    Ruxanda, Maria Magdalena; Nanopoulos, Alexandros; Jensen, Christian Søndergaard

    2008-01-01

    Due to the rapidly increasing availability of audio files on the Web, it is relevant to augment search engines with advanced audio search functionality. In this context, the ranking of the retrieved music is an important issue. This paper proposes a music ranking method capable of flexibly fusing...

  9. Ranking of Unwarranted Variations in Healthcare Treatments

    NARCIS (Netherlands)

    Moes, Herry; Brekelmans, Ruud; Hamers, Herbert; Hasaart, F.

    2017-01-01

    In this paper, we introduce a framework designed to identify and rank possible unwarranted variation of treatments in healthcare. The innovative aspect of this framework is a ranking procedure that aims to identify healthcare institutions where unwarranted variation is most severe, and diagnosis

  10. The Rankings Game: Who's Playing Whom?

    Science.gov (United States)

    Burness, John F.

    2008-01-01

    This summer, Forbes magazine published its new rankings of "America's Best Colleges," implying that it had developed a methodology that would give the public the information that it needed to choose a college wisely. "U.S. News & World Report," which in 1983 published the first annual ranking, just announced its latest ratings last week--including…

  11. Dynamic collective entity representations for entity ranking

    NARCIS (Netherlands)

    Graus, D.; Tsagkias, M.; Weerkamp, W.; Meij, E.; de Rijke, M.

    2016-01-01

    Entity ranking, i.e., successfully positioning a relevant entity at the top of the ranking for a given query, is inherently difficult due to the potential mismatch between the entity's description in a knowledge base, and the way people refer to the entity when searching for it. To counter this

  12. INFLUENCE OF MUSICAL TONES, IN THE CLASSICAL CONDITIONING OF PREFERENCE OF GEOMETRICAL FIGURES

    Directory of Open Access Journals (Sweden)

    WILSON LÓPEZ

    2004-07-01

    Full Text Available This research intended to create preferences on geometric figures using a classical conditioning procedurewhere 2 specific variations of musical structure were used -mayor and dissonant tones- as unconditionedstimulus. 24 university students with an age average of 23 years were exposed to stimular conditionswhere 2 geometric figures (CS+, were matched with mayor tones (UCS+ and other 2 (CS- withdissonant (UCS-; subsequently the figures were rated on a scale (where +10 = very pleasant and -10 =very unpleasant. According with the formulated hypothesis and the previous discoveries in both basicand applied research, three of the four conditions tested showed significant values using the Wilcoxonsign ranks test.

  13. Exact Solutions for Einstein's Hyperbolic Geometric Flow

    International Nuclear Information System (INIS)

    He Chunlei

    2008-01-01

    In this paper we investigate the Einstein's hyperbolic geometric flow and obtain some interesting exact solutions for this kind of flow. Many interesting properties of these exact solutions have also been analyzed and we believe that these properties of Einstein's hyperbolic geometric flow are very helpful to understanding the Einstein equations and the hyperbolic geometric flow

  14. Comparing classical and quantum PageRanks

    Science.gov (United States)

    Loke, T.; Tang, J. W.; Rodriguez, J.; Small, M.; Wang, J. B.

    2017-01-01

    Following recent developments in quantum PageRanking, we present a comparative analysis of discrete-time and continuous-time quantum-walk-based PageRank algorithms. Relative to classical PageRank and to different extents, the quantum measures better highlight secondary hubs and resolve ranking degeneracy among peripheral nodes for all networks we studied in this paper. For the discrete-time case, we investigated the periodic nature of the walker's probability distribution for a wide range of networks and found that the dominant period does not grow with the size of these networks. Based on this observation, we introduce a new quantum measure using the maximum probabilities of the associated walker during the first couple of periods. This is particularly important, since it leads to a quantum PageRanking scheme that is scalable with respect to network size.

  15. Universal emergence of PageRank

    Energy Technology Data Exchange (ETDEWEB)

    Frahm, K M; Georgeot, B; Shepelyansky, D L, E-mail: frahm@irsamc.ups-tlse.fr, E-mail: georgeot@irsamc.ups-tlse.fr, E-mail: dima@irsamc.ups-tlse.fr [Laboratoire de Physique Theorique du CNRS, IRSAMC, Universite de Toulouse, UPS, 31062 Toulouse (France)

    2011-11-18

    The PageRank algorithm enables us to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter {alpha} Element-Of ]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of the PageRank vector at its emergence when {alpha} {yields} 1. The whole network can be divided into a core part and a group of invariant subspaces. For {alpha} {yields} 1, PageRank converges to a universal power-law distribution on the invariant subspaces whose size distribution also follows a universal power law. The convergence of PageRank at {alpha} {yields} 1 is controlled by eigenvalues of the core part of the Google matrix, which are extremely close to unity, leading to large relaxation times as, for example, in spin glasses. (paper)

  16. Universal emergence of PageRank

    International Nuclear Information System (INIS)

    Frahm, K M; Georgeot, B; Shepelyansky, D L

    2011-01-01

    The PageRank algorithm enables us to rank the nodes of a network through a specific eigenvector of the Google matrix, using a damping parameter α ∈ ]0, 1[. Using extensive numerical simulations of large web networks, with a special accent on British University networks, we determine numerically and analytically the universal features of the PageRank vector at its emergence when α → 1. The whole network can be divided into a core part and a group of invariant subspaces. For α → 1, PageRank converges to a universal power-law distribution on the invariant subspaces whose size distribution also follows a universal power law. The convergence of PageRank at α → 1 is controlled by eigenvalues of the core part of the Google matrix, which are extremely close to unity, leading to large relaxation times as, for example, in spin glasses. (paper)

  17. PageRank and rank-reversal dependence on the damping factor

    Science.gov (United States)

    Son, S.-W.; Christensen, C.; Grassberger, P.; Paczuski, M.

    2012-12-01

    PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d0=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d0.

  18. PageRank and rank-reversal dependence on the damping factor.

    Science.gov (United States)

    Son, S-W; Christensen, C; Grassberger, P; Paczuski, M

    2012-12-01

    PageRank (PR) is an algorithm originally developed by Google to evaluate the importance of web pages. Considering how deeply rooted Google's PR algorithm is to gathering relevant information or to the success of modern businesses, the question of rank stability and choice of the damping factor (a parameter in the algorithm) is clearly important. We investigate PR as a function of the damping factor d on a network obtained from a domain of the World Wide Web, finding that rank reversal happens frequently over a broad range of PR (and of d). We use three different correlation measures, Pearson, Spearman, and Kendall, to study rank reversal as d changes, and we show that the correlation of PR vectors drops rapidly as d changes from its frequently cited value, d_{0}=0.85. Rank reversal is also observed by measuring the Spearman and Kendall rank correlation, which evaluate relative ranks rather than absolute PR. Rank reversal happens not only in directed networks containing rank sinks but also in a single strongly connected component, which by definition does not contain any sinks. We relate rank reversals to rank pockets and bottlenecks in the directed network structure. For the network studied, the relative rank is more stable by our measures around d=0.65 than at d=d_{0}.

  19. A Ranking Approach to Genomic Selection.

    Science.gov (United States)

    Blondel, Mathieu; Onogi, Akio; Iwata, Hiroyoshi; Ueda, Naonori

    2015-01-01

    Genomic selection (GS) is a recent selective breeding method which uses predictive models based on whole-genome molecular markers. Until now, existing studies formulated GS as the problem of modeling an individual's breeding value for a particular trait of interest, i.e., as a regression problem. To assess predictive accuracy of the model, the Pearson correlation between observed and predicted trait values was used. In this paper, we propose to formulate GS as the problem of ranking individuals according to their breeding value. Our proposed framework allows us to employ machine learning methods for ranking which had previously not been considered in the GS literature. To assess ranking accuracy of a model, we introduce a new measure originating from the information retrieval literature called normalized discounted cumulative gain (NDCG). NDCG rewards more strongly models which assign a high rank to individuals with high breeding value. Therefore, NDCG reflects a prerequisite objective in selective breeding: accurate selection of individuals with high breeding value. We conducted a comparison of 10 existing regression methods and 3 new ranking methods on 6 datasets, consisting of 4 plant species and 25 traits. Our experimental results suggest that tree-based ensemble methods including McRank, Random Forests and Gradient Boosting Regression Trees achieve excellent ranking accuracy. RKHS regression and RankSVM also achieve good accuracy when used with an RBF kernel. Traditional regression methods such as Bayesian lasso, wBSR and BayesC were found less suitable for ranking. Pearson correlation was found to correlate poorly with NDCG. Our study suggests two important messages. First, ranking methods are a promising research direction in GS. Second, NDCG can be a useful evaluation measure for GS.

  20. Geometrically Induced Interactions and Bifurcations

    Science.gov (United States)

    Binder, Bernd

    2010-01-01

    In order to evaluate the proper boundary conditions in spin dynamics eventually leading to the emergence of natural and artificial solitons providing for strong interactions and potentials with monopole charges, the paper outlines a new concept referring to a curvature-invariant formalism, where superintegrability is given by a special isometric condition. Instead of referring to the spin operators and Casimir/Euler invariants as the generator of rotations, a curvature-invariant description is introduced utilizing a double Gudermann mapping function (generator of sine Gordon solitons and Mercator projection) cross-relating two angular variables, where geometric phases and rotations arise between surfaces of different curvature. Applying this stereographic projection to a superintegrable Hamiltonian can directly map linear oscillators to Kepler/Coulomb potentials and/or monopoles with Pöschl-Teller potentials and vice versa. In this sense a large scale Kepler/Coulomb (gravitational, electro-magnetic) wave dynamics with a hyperbolic metric could be mapped as a geodesic vertex flow to a local oscillator singularity (Dirac monopole) with spherical metrics and vice versa. Attracting fixed points and dynamic constraints are given by special isometries with magic precession angles. The nonlinear angular encoding directly provides for a Shannon mutual information entropy measure of the geodesic phase space flow. The emerging monopole patterns show relations to spiral Fresnel holography and Berry/Aharonov-Bohm geometric phases subject to bifurcation instabilities and singularities from phase ambiguities due to a local (entropy) overload. Neutral solitons and virtual patterns emerging and mediating in the overlap region between charged or twisted holographic patterns are visualized and directly assigned to the Berry geometric phase revealing the role of photons, neutrons, and neutrinos binding repulsive charges in Coulomb, strong and weak interaction.

  1. First rank symptoms for schizophrenia.

    Science.gov (United States)

    Soares-Weiser, Karla; Maayan, Nicola; Bergman, Hanna; Davenport, Clare; Kirkham, Amanda J; Grabowski, Sarah; Adams, Clive E

    2015-01-25

    Early and accurate diagnosis and treatment of schizophrenia may have long-term advantages for the patient; the longer psychosis goes untreated the more severe the repercussions for relapse and recovery. If the correct diagnosis is not schizophrenia, but another psychotic disorder with some symptoms similar to schizophrenia, appropriate treatment might be delayed, with possible severe repercussions for the person involved and their family. There is widespread uncertainty about the diagnostic accuracy of First Rank Symptoms (FRS); we examined whether they are a useful diagnostic tool to differentiate schizophrenia from other psychotic disorders. To determine the diagnostic accuracy of one or multiple FRS for diagnosing schizophrenia, verified by clinical history and examination by a qualified professional (e.g. psychiatrists, nurses, social workers), with or without the use of operational criteria and checklists, in people thought to have non-organic psychotic symptoms. We conducted searches in MEDLINE, EMBASE, and PsycInfo using OvidSP in April, June, July 2011 and December 2012. We also searched MEDION in December 2013. We selected studies that consecutively enrolled or randomly selected adults and adolescents with symptoms of psychosis, and assessed the diagnostic accuracy of FRS for schizophrenia compared to history and clinical examination performed by a qualified professional, which may or may not involve the use of symptom checklists or based on operational criteria such as ICD and DSM. Two review authors independently screened all references for inclusion. Risk of bias in included studies were assessed using the QUADAS-2 instrument. We recorded the number of true positives (TP), true negatives (TN), false positives (FP), and false negatives (FN) for constructing a 2 x 2 table for each study or derived 2 x 2 data from reported summary statistics such as sensitivity, specificity, and/or likelihood ratios. We included 21 studies with a total of 6253 participants

  2. Moving walls and geometric phases

    Energy Technology Data Exchange (ETDEWEB)

    Facchi, Paolo, E-mail: paolo.facchi@ba.infn.it [Dipartimento di Fisica and MECENAS, Università di Bari, I-70126 Bari (Italy); INFN, Sezione di Bari, I-70126 Bari (Italy); Garnero, Giancarlo, E-mail: giancarlo.garnero@uniba.it [Dipartimento di Fisica and MECENAS, Università di Bari, I-70126 Bari (Italy); INFN, Sezione di Bari, I-70126 Bari (Italy); Marmo, Giuseppe [Dipartimento di Scienze Fisiche and MECENAS, Università di Napoli “Federico II”, I-80126 Napoli (Italy); INFN, Sezione di Napoli, I-80126 Napoli (Italy); Samuel, Joseph [Raman Research Institute, 560080 Bangalore (India)

    2016-09-15

    We unveil the existence of a non-trivial Berry phase associated to the dynamics of a quantum particle in a one dimensional box with moving walls. It is shown that a suitable choice of boundary conditions has to be made in order to preserve unitarity. For these boundary conditions we compute explicitly the geometric phase two-form on the parameter space. The unboundedness of the Hamiltonian describing the system leads to a natural prescription of renormalization for divergent contributions arising from the boundary.

  3. Geometric Topology and Shape Theory

    CERN Document Server

    Segal, Jack

    1987-01-01

    The aim of this international conference the third of its type was to survey recent developments in Geometric Topology and Shape Theory with an emphasis on their interaction. The volume contains original research papers and carefully selected survey of currently active areas. The main topics and themes represented by the papers of this volume include decomposition theory, cell-like mappings and CE-equivalent compacta, covering dimension versus cohomological dimension, ANR's and LCn-compacta, homology manifolds, embeddings of continua into manifolds, complement theorems in shape theory, approximate fibrations and shape fibrations, fibered shape, exact homologies and strong shape theory.

  4. Geometric approach to soliton equations

    International Nuclear Information System (INIS)

    Sasaki, R.

    1979-09-01

    A class of nonlinear equations that can be solved in terms of nxn scattering problem is investigated. A systematic geometric method of exploiting conservation laws and related equations, the so-called prolongation structure, is worked out. The nxn problem is reduced to nsub(n-1)x(n-1) problems and finally to 2x2 problems, which have been comprehensively investigated recently by the author. A general method of deriving the infinite numbers of polynomial conservation laws for an nxn problem is presented. The cases of 3x3 and 2x2 problems are discussed explicitly. (Auth.)

  5. Geometric Rationalization for Freeform Architecture

    KAUST Repository

    Jiang, Caigui

    2016-06-20

    The emergence of freeform architecture provides interesting geometric challenges with regards to the design and manufacturing of large-scale structures. To design these architectural structures, we have to consider two types of constraints. First, aesthetic constraints are important because the buildings have to be visually impressive. Sec- ond, functional constraints are important for the performance of a building and its e cient construction. This thesis contributes to the area of architectural geometry. Specifically, we are interested in the geometric rationalization of freeform architec- ture with the goal of combining aesthetic and functional constraints and construction requirements. Aesthetic requirements typically come from designers and architects. To obtain visually pleasing structures, they favor smoothness of the building shape, but also smoothness of the visible patterns on the surface. Functional requirements typically come from the engineers involved in the construction process. For exam- ple, covering freeform structures using planar panels is much cheaper than using non-planar ones. Further, constructed buildings have to be stable and should not collapse. In this thesis, we explore the geometric rationalization of freeform archi- tecture using four specific example problems inspired by real life applications. We achieve our results by developing optimization algorithms and a theoretical study of the underlying geometrical structure of the problems. The four example problems are the following: (1) The design of shading and lighting systems which are torsion-free structures with planar beams based on quad meshes. They satisfy the functionality requirements of preventing light from going inside a building as shad- ing systems or reflecting light into a building as lighting systems. (2) The Design of freeform honeycomb structures that are constructed based on hex-dominant meshes with a planar beam mounted along each edge. The beams intersect without

  6. Field guide to geometrical optics

    CERN Document Server

    Greivenkamp, John E

    2004-01-01

    This Field Guide derives from the treatment of geometrical optics that has evolved from both the undergraduate and graduate programs at the Optical Sciences Center at the University of Arizona. The development is both rigorous and complete, and it features a consistent notation and sign convention. This volume covers Gaussian imagery, paraxial optics, first-order optical system design, system examples, illumination, chromatic effects, and an introduction to aberrations. The appendices provide supplemental material on radiometry and photometry, the human eye, and several other topics.

  7. Geometric phase from dielectric matrix

    International Nuclear Information System (INIS)

    Banerjee, D.

    2005-10-01

    The dielectric property of the anisotropic optical medium is found by considering the polarized photon as two component spinor of spherical harmonics. The Geometric Phase of a polarized photon has been evaluated in two ways: the phase two-form of the dielectric matrix through a twist and the Pancharatnam phase (GP) by changing the angular momentum of the incident polarized photon over a closed triangular path on the extended Poincare sphere. The helicity in connection with the spin angular momentum of the chiral photon plays the key role in developing these phase holonomies. (author)

  8. A history of geometrical methods

    CERN Document Server

    Coolidge, Julian Lowell

    2013-01-01

    Full and authoritative, this history of the techniques for dealing with geometric questions begins with synthetic geometry and its origins in Babylonian and Egyptian mathematics; reviews the contributions of China, Japan, India, and Greece; and discusses the non-Euclidean geometries. Subsequent sections cover algebraic geometry, starting with the precursors and advancing to the great awakening with Descartes; and differential geometry, from the early work of Huygens and Newton to projective and absolute differential geometry. The author's emphasis on proofs and notations, his comparisons betwe

  9. Geometrical optics and optimal transport.

    Science.gov (United States)

    Rubinstein, Jacob; Wolansky, Gershon

    2017-10-01

    The Fermat principle is generalized to a system of rays. It is shown that all the ray mappings that are compatible with two given intensities of a monochromatic wave, measured at two planes, are stationary points of a canonical functional, which is the weighted average of the actions of all the rays. It is further shown that there exist at least two stationary points for this functional, implying that in the geometrical optics regime the phase from intensity problem has inherently more than one solution. The caustic structures of all the possible ray mappings are analyzed. A number of simulations illustrate the theoretical considerations.

  10. Geometrical approach to elementary particles

    International Nuclear Information System (INIS)

    Elbaz, E.; Meyer, J.

    Starting with an isospin doublet R = (T/V) with spin 1/2 and hypercharge 1/3, the rishon considered as a vector in the color-space, we define the dirishon R* rank-one tensor product with spin 0 and hypercharge 2/3. Leptons and quarks of the first generation are then obtained as the scalar and dot product l = R*. R and f vector = R* Λ R'. The internal quantum numbers are then expressed with the rishon number. The lepton and quark generations are then defined and a quark mass formula proposed. Baryon magnetic moments are calculated and compared to experiment [fr

  11. Adiabatic quantum algorithm for search engine ranking.

    Science.gov (United States)

    Garnerone, Silvano; Zanardi, Paolo; Lidar, Daniel A

    2012-06-08

    We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web pages. We argue that the main topological feature of the underlying web graph allowing for such a scaling is the out-degree distribution. The top-ranked log(n) entries of the quantum PageRank state can then be estimated with a polynomial quantum speed-up. Moreover, the quantum PageRank state can be used in "q-sampling" protocols for testing properties of distributions, which require exponentially fewer measurements than all classical schemes designed for the same task. This can be used to decide whether to run a classical update of the PageRank.

  12. Ranking Adverse Drug Reactions With Crowdsourcing

    KAUST Repository

    Gottlieb, Assaf

    2015-03-23

    Background: There is no publicly available resource that provides the relative severity of adverse drug reactions (ADRs). Such a resource would be useful for several applications, including assessment of the risks and benefits of drugs and improvement of patient-centered care. It could also be used to triage predictions of drug adverse events. Objective: The intent of the study was to rank ADRs according to severity. Methods: We used Internet-based crowdsourcing to rank ADRs according to severity. We assigned 126,512 pairwise comparisons of ADRs to 2589 Amazon Mechanical Turk workers and used these comparisons to rank order 2929 ADRs. Results: There is good correlation (rho=.53) between the mortality rates associated with ADRs and their rank. Our ranking highlights severe drug-ADR predictions, such as cardiovascular ADRs for raloxifene and celecoxib. It also triages genes associated with severe ADRs such as epidermal growth-factor receptor (EGFR), associated with glioblastoma multiforme, and SCN1A, associated with epilepsy. Conclusions: ADR ranking lays a first stepping stone in personalized drug risk assessment. Ranking of ADRs using crowdsourcing may have useful clinical and financial implications, and should be further investigated in the context of health care decision making.

  13. Ranking adverse drug reactions with crowdsourcing.

    Science.gov (United States)

    Gottlieb, Assaf; Hoehndorf, Robert; Dumontier, Michel; Altman, Russ B

    2015-03-23

    There is no publicly available resource that provides the relative severity of adverse drug reactions (ADRs). Such a resource would be useful for several applications, including assessment of the risks and benefits of drugs and improvement of patient-centered care. It could also be used to triage predictions of drug adverse events. The intent of the study was to rank ADRs according to severity. We used Internet-based crowdsourcing to rank ADRs according to severity. We assigned 126,512 pairwise comparisons of ADRs to 2589 Amazon Mechanical Turk workers and used these comparisons to rank order 2929 ADRs. There is good correlation (rho=.53) between the mortality rates associated with ADRs and their rank. Our ranking highlights severe drug-ADR predictions, such as cardiovascular ADRs for raloxifene and celecoxib. It also triages genes associated with severe ADRs such as epidermal growth-factor receptor (EGFR), associated with glioblastoma multiforme, and SCN1A, associated with epilepsy. ADR ranking lays a first stepping stone in personalized drug risk assessment. Ranking of ADRs using crowdsourcing may have useful clinical and financial implications, and should be further investigated in the context of health care decision making.

  14. RankExplorer: Visualization of Ranking Changes in Large Time Series Data.

    Science.gov (United States)

    Shi, Conglei; Cui, Weiwei; Liu, Shixia; Xu, Panpan; Chen, Wei; Qu, Huamin

    2012-12-01

    For many applications involving time series data, people are often interested in the changes of item values over time as well as their ranking changes. For example, people search many words via search engines like Google and Bing every day. Analysts are interested in both the absolute searching number for each word as well as their relative rankings. Both sets of statistics may change over time. For very large time series data with thousands of items, how to visually present ranking changes is an interesting challenge. In this paper, we propose RankExplorer, a novel visualization method based on ThemeRiver to reveal the ranking changes. Our method consists of four major components: 1) a segmentation method which partitions a large set of time series curves into a manageable number of ranking categories; 2) an extended ThemeRiver view with embedded color bars and changing glyphs to show the evolution of aggregation values related to each ranking category over time as well as the content changes in each ranking category; 3) a trend curve to show the degree of ranking changes over time; 4) rich user interactions to support interactive exploration of ranking changes. We have applied our method to some real time series data and the case studies demonstrate that our method can reveal the underlying patterns related to ranking changes which might otherwise be obscured in traditional visualizations.

  15. Augmenting the Deliberative Method for Ranking Risks.

    Science.gov (United States)

    Susel, Irving; Lasley, Trace; Montezemolo, Mark; Piper, Joel

    2016-01-01

    The Department of Homeland Security (DHS) characterized and prioritized the physical cross-border threats and hazards to the nation stemming from terrorism, market-driven illicit flows of people and goods (illegal immigration, narcotics, funds, counterfeits, and weaponry), and other nonmarket concerns (movement of diseases, pests, and invasive species). These threats and hazards pose a wide diversity of consequences with very different combinations of magnitudes and likelihoods, making it very challenging to prioritize them. This article presents the approach that was used at DHS to arrive at a consensus regarding the threats and hazards that stand out from the rest based on the overall risk they pose. Due to time constraints for the decision analysis, it was not feasible to apply multiattribute methodologies like multiattribute utility theory or the analytic hierarchy process. Using a holistic approach was considered, such as the deliberative method for ranking risks first published in this journal. However, an ordinal ranking alone does not indicate relative or absolute magnitude differences among the risks. Therefore, the use of the deliberative method for ranking risks is not sufficient for deciding whether there is a material difference between the top-ranked and bottom-ranked risks, let alone deciding what the stand-out risks are. To address this limitation of ordinal rankings, the deliberative method for ranking risks was augmented by adding an additional step to transform the ordinal ranking into a ratio scale ranking. This additional step enabled the selection of stand-out risks to help prioritize further analysis. © 2015 Society for Risk Analysis.

  16. Image understanding using geometric context

    Science.gov (United States)

    Zhang, Xiaochun; Liu, Chuancai

    2017-07-01

    A Gibbs Sampler based topic model for image annotation, which takes into account the interaction between visual geometric context and related topic, is presented. Most of the existing topic models for scene annotation use segmentation-based algorithm. However, topic models using segmentation algorithm alone sometimes can produce erroneous results when used to annotate real-life scene pictures. Therefore, our algorithm makes use of peaks of image surface instead of segmentation regions. Existing approaches use SIFT algorithm and treat the peaks as round blob features. In this paper, the peaks are treated as anisotropic blob features, which models low level visual elements more precisely. In order to better utilize visual features, our model not only takes into consideration visual codeword, but also considers influence of visual properties to topic formation, such as orientation, width, length and color. The basic idea is based on the assumption that different topics will produce distinct visual appearance, and different visual appearance is helpful to distinguish topics. During the learning stage, each topic will be associated with a set of distributions of visual properties, which depicts appearance of the topic. This paper considers more geometric properties, which will reduce topic uncertainty and learn the images better. Tested with Corel5K, SAIAPR-TC12 and Espgame100k Datasets, our method performs moderately better than some state of the arts methods.

  17. Geometrical approach to fluid models

    International Nuclear Information System (INIS)

    Kuvshinov, B.N.; Schep, T.J.

    1997-01-01

    Differential geometry based upon the Cartan calculus of differential forms is applied to investigate invariant properties of equations that describe the motion of continuous media. The main feature of this approach is that physical quantities are treated as geometrical objects. The geometrical notion of invariance is introduced in terms of Lie derivatives and a general procedure for the construction of local and integral fluid invariants is presented. The solutions of the equations for invariant fields can be written in terms of Lagrange variables. A generalization of the Hamiltonian formalism for finite-dimensional systems to continuous media is proposed. Analogously to finite-dimensional systems, Hamiltonian fluids are introduced as systems that annihilate an exact two-form. It is shown that Euler and ideal, charged fluids satisfy this local definition of a Hamiltonian structure. A new class of scalar invariants of Hamiltonian fluids is constructed that generalizes the invariants that are related with gauge transformations and with symmetries (Noether). copyright 1997 American Institute of Physics

  18. Communities in Large Networks: Identification and Ranking

    DEFF Research Database (Denmark)

    Olsen, Martin

    2008-01-01

    show that the problem of deciding whether a non trivial community exists is NP complete. Nevertheless, experiments show that a very simple greedy approach can identify members of a community in the Danish part of the web graph with time complexity only dependent on the size of the found community...... and its immediate surroundings. The members are ranked with a “local” variant of the PageRank algorithm. Results are reported from successful experiments on identifying and ranking Danish Computer Science sites and Danish Chess pages using only a few representatives....

  19. A Universal Rank-Size Law

    Science.gov (United States)

    2016-01-01

    A mere hyperbolic law, like the Zipf’s law power function, is often inadequate to describe rank-size relationships. An alternative theoretical distribution is proposed based on theoretical physics arguments starting from the Yule-Simon distribution. A modeling is proposed leading to a universal form. A theoretical suggestion for the “best (or optimal) distribution”, is provided through an entropy argument. The ranking of areas through the number of cities in various countries and some sport competition ranking serves for the present illustrations. PMID:27812192

  20. Scalable Faceted Ranking in Tagging Systems

    Science.gov (United States)

    Orlicki, José I.; Alvarez-Hamelin, J. Ignacio; Fierens, Pablo I.

    Nowadays, web collaborative tagging systems which allow users to upload, comment on and recommend contents, are growing. Such systems can be represented as graphs where nodes correspond to users and tagged-links to recommendations. In this paper we analyze the problem of computing a ranking of users with respect to a facet described as a set of tags. A straightforward solution is to compute a PageRank-like algorithm on a facet-related graph, but it is not feasible for online computation. We propose an alternative: (i) a ranking for each tag is computed offline on the basis of tag-related subgraphs; (ii) a faceted order is generated online by merging rankings corresponding to all the tags in the facet. Based on the graph analysis of YouTube and Flickr, we show that step (i) is scalable. We also present efficient algorithms for step (ii), which are evaluated by comparing their results with two gold standards.

  1. Evaluation of treatment effects by ranking

    DEFF Research Database (Denmark)

    Halekoh, U; Kristensen, K

    2008-01-01

    In crop experiments measurements are often made by a judge evaluating the crops' conditions after treatment. In the present paper an analysis is proposed for experiments where plots of crops treated differently are mutually ranked. In the experimental layout the crops are treated on consecutive...... plots usually placed side by side in one or more rows. In the proposed method a judge ranks several neighbouring plots, say three, by ranking them from best to worst. For the next observation the judge moves on by no more than two plots, such that up to two plots will be re-evaluated again...... in a comparison with the new plot(s). Data from studies using this set-up were analysed by a Thurstonian random utility model, which assumed that the judge's rankings were obtained by comparing latent continuous utilities or treatment effects. For the latent utilities a variance component model was considered...

  2. Superfund Hazard Ranking System Training Course

    Science.gov (United States)

    The Hazard Ranking System (HRS) training course is a four and ½ day, intermediate-level course designed for personnel who are required to compile, draft, and review preliminary assessments (PAs), site inspections (SIs), and HRS documentation records/packag

  3. Who's bigger? where historical figures really rank

    CERN Document Server

    Skiena, Steven

    2014-01-01

    Is Hitler bigger than Napoleon? Washington bigger than Lincoln? Picasso bigger than Einstein? Quantitative analysts are rapidly finding homes in social and cultural domains, from finance to politics. What about history? In this fascinating book, Steve Skiena and Charles Ward bring quantitative analysis to bear on ranking and comparing historical reputations. They evaluate each person by aggregating the traces of millions of opinions, just as Google ranks webpages. The book includes a technical discussion for readers interested in the details of the methods, but no mathematical or computational background is necessary to understand the rankings or conclusions. Along the way, the authors present the rankings of more than one thousand of history's most significant people in science, politics, entertainment, and all areas of human endeavor. Anyone interested in history or biography can see where their favorite figures place in the grand scheme of things.

  4. Ranking Forestry Investments With Parametric Linear Programming

    Science.gov (United States)

    Paul A. Murphy

    1976-01-01

    Parametric linear programming is introduced as a technique for ranking forestry investments under multiple constraints; it combines the advantages of simple tanking and linear programming as capital budgeting tools.

  5. Block models and personalized PageRank.

    Science.gov (United States)

    Kloumann, Isabel M; Ugander, Johan; Kleinberg, Jon

    2017-01-03

    Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods through the "seed set expansion problem": given a subset [Formula: see text] of nodes from a community of interest in an underlying graph, can we reliably identify the rest of the community? We start from the observation that the most widely used techniques for this problem, personalized PageRank and heat kernel methods, operate in the space of "landing probabilities" of a random walk rooted at the seed set, ranking nodes according to weighted sums of landing probabilities of different length walks. Both schemes, however, lack an a priori relationship to the seed set objective. In this work, we develop a principled framework for evaluating ranking methods by studying seed set expansion applied to the stochastic block model. We derive the optimal gradient for separating the landing probabilities of two classes in a stochastic block model and find, surprisingly, that under reasonable assumptions the gradient is asymptotically equivalent to personalized PageRank for a specific choice of the PageRank parameter [Formula: see text] that depends on the block model parameters. This connection provides a formal motivation for the success of personalized PageRank in seed set expansion and node ranking generally. We use this connection to propose more advanced techniques incorporating higher moments of landing probabilities; our advanced methods exhibit greatly improved performance, despite being simple linear classification rules, and are even competitive with belief propagation.

  6. Block models and personalized PageRank

    OpenAIRE

    Kloumann, Isabel M.; Ugander, Johan; Kleinberg, Jon

    2016-01-01

    Methods for ranking the importance of nodes in a network have a rich history in machine learning and across domains that analyze structured data. Recent work has evaluated these methods though the seed set expansion problem: given a subset $S$ of nodes from a community of interest in an underlying graph, can we reliably identify the rest of the community? We start from the observation that the most widely used techniques for this problem, personalized PageRank and heat kernel methods, operate...

  7. Evaluation of the osteoclastogenic process associated with RANK / RANK-L / OPG in odontogenic myxomas

    Science.gov (United States)

    González-Galván, María del Carmen; Mosqueda-Taylor, Adalberto; Bologna-Molina, Ronell; Setien-Olarra, Amaia; Marichalar-Mendia, Xabier; Aguirre-Urizar, José-Manuel

    2018-01-01

    Background Odontogenic myxoma (OM) is a benign intraosseous neoplasm that exhibits local aggressiveness and high recurrence rates. Osteoclastogenesis is an important phenomenon in the tumor growth of maxillary neoplasms. RANK (Receptor Activator of Nuclear Factor κappa B) is the signaling receptor of RANK-L (Receptor activator of nuclear factor kappa-Β ligand) that activates the osteoclasts. OPG (osteoprotegerin) is a decoy receptor for RANK-L that inhibits pro-osteoclastogenesis. The RANK / RANKL / OPG system participates in the regulation of osteolytic activity under normal conditions, and its alteration has been associated with greater bone destruction, and also with tumor growth. Objectives To analyze the immunohistochemical expression of OPG, RANK and RANK-L proteins in odontogenic myxomas (OMs) and their relationship with the tumor size. Material and Methods Eighteen OMs, 4 small ( 3cm) and 18 dental follicles (DF) that were included as control were studied by means of standard immunohistochemical procedure with RANK, RANKL and OPG antibodies. For the evaluation, 5 fields (40x) of representative areas of OM and DF were selected where the expression of each antibody was determined. Descriptive and comparative statistical analyses were performed with the obtained data. Results There are significant differences in the expression of RANK in OM samples as compared to DF (p = 0.022) and among the OMSs and OMLs (p = 0.032). Also a strong association is recognized in the expression of RANK-L and OPG in OM samples. Conclusions Activation of the RANK / RANK-L / OPG triad seems to be involved in the mechanisms of bone balance and destruction, as well as associated with tumor growth in odontogenic myxomas. Key words:Odontogenic myxoma, dental follicle, RANK, RANK-L, OPG, osteoclastogenesis. PMID:29680857

  8. How Many Alternatives Can Be Ranked? A Comparison of the Paired Comparison and Ranking Methods.

    Science.gov (United States)

    Ock, Minsu; Yi, Nari; Ahn, Jeonghoon; Jo, Min-Woo

    2016-01-01

    To determine the feasibility of converting ranking data into paired comparison (PC) data and suggest the number of alternatives that can be ranked by comparing a PC and a ranking method. Using a total of 222 health states, a household survey was conducted in a sample of 300 individuals from the general population. Each respondent performed a PC 15 times and a ranking method 6 times (two attempts of ranking three, four, and five health states, respectively). The health states of the PC and the ranking method were constructed to overlap each other. We converted the ranked data into PC data and examined the consistency of the response rate. Applying probit regression, we obtained the predicted probability of each method. Pearson correlation coefficients were determined between the predicted probabilities of those methods. The mean absolute error was also assessed between the observed and the predicted values. The overall consistency of the response rate was 82.8%. The Pearson correlation coefficients were 0.789, 0.852, and 0.893 for ranking three, four, and five health states, respectively. The lowest mean absolute error was 0.082 (95% confidence interval [CI] 0.074-0.090) in ranking five health states, followed by 0.123 (95% CI 0.111-0.135) in ranking four health states and 0.126 (95% CI 0.113-0.138) in ranking three health states. After empirically examining the consistency of the response rate between a PC and a ranking method, we suggest that using five alternatives in the ranking method may be superior to using three or four alternatives. Copyright © 2016 International Society for Pharmacoeconomics and Outcomes Research (ISPOR). Published by Elsevier Inc. All rights reserved.

  9. Geometrical charged-particle optics

    CERN Document Server

    Rose, Harald

    2012-01-01

    This second edition is an extended version of the first edition of Geometrical Charged-Particle Optics. The updated reference monograph is intended as a guide for researchers and graduate students who are seeking a comprehensive treatment of the design of instruments and beam-guiding systems of charged particles and their propagation in electromagnetic fields. Wave aspects are included in this edition for explaining electron holography, the Aharanov-Bohm effect and the resolution of electron microscopes limited by diffraction. Several methods for calculating the electromagnetic field are presented and procedures are outlined for calculating the properties of systems with arbitrarily curved axis. Detailed methods are presented for designing and optimizing special components such as aberration correctors, spectrometers, energy filters monochromators, ion traps, electron mirrors and cathode lenses. In particular, the optics of rotationally symmetric lenses, quadrupoles, and systems composed of these elements are...

  10. Geometrical setting of solid mechanics

    International Nuclear Information System (INIS)

    Fiala, Zdenek

    2011-01-01

    Highlights: → Solid mechanics within the Riemannian symmetric manifold GL (3, R)/O (3, R). → Generalized logarithmic strain. → Consistent linearization. → Incremental principle of virtual power. → Time-discrete approximation. - Abstract: The starting point in the geometrical setting of solid mechanics is to represent deformation process of a solid body as a trajectory in a convenient space with Riemannian geometry, and then to use the corresponding tools for its analysis. Based on virtual power of internal stresses, we show that such a configuration space is the (globally) symmetric space of symmetric positive-definite real matrices. From this unifying point of view, we shall analyse the logarithmic strain, the stress rate, as well as linearization and intrinsic integration of corresponding evolution equation.

  11. Geometric Methods in Physics XXXV

    CERN Document Server

    Odzijewicz, Anatol; Previato, Emma

    2018-01-01

    This book features a selection of articles based on the XXXV Białowieża Workshop on Geometric Methods in Physics, 2016. The series of Białowieża workshops, attended by a community of experts at the crossroads of mathematics and physics, is a major annual event in the field. The works in this book, based on presentations given at the workshop, are previously unpublished, at the cutting edge of current research, typically grounded in geometry and analysis, and with applications to classical and quantum physics. In 2016 the special session "Integrability and Geometry" in particular attracted pioneers and leading specialists in the field. Traditionally, the Białowieża Workshop is followed by a School on Geometry and Physics, for advanced graduate students and early-career researchers, and the book also includes extended abstracts of the lecture series.

  12. Geometric Operators on Boolean Functions

    DEFF Research Database (Denmark)

    Frisvad, Jeppe Revall; Falster, Peter

    In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...

  13. Geometric considerations in magnetron sputtering

    International Nuclear Information System (INIS)

    Thornton, J.A.

    1982-01-01

    The recent development of high performance magnetron type discharge sources has greatly enhaced the range of coating applications where sputtering is a viable deposition process. Magnetron sources can provide high current densities and sputtering rates, even at low pressures. They have much reduced substrate heating rates and can be scaled to large sizes. Magnetron sputter coating apparatuses can have a variety of geometric and plasma configurations. The target geometry affects the emission directions of both the sputtered atoms and the energetic ions which are neutralized and reflected at the cathode. This fact, coupled with the long mean free particle paths which are prevalent at low pressures, can make the coating properties very dependent on the apparatus geometry. This paper reviews the physics of magnetron operation and discusses the influences of apparatus geometry on the use of magnetrons for rf sputtering and reactive sputtering, as well as on the microstructure and internal stresses in sputtered metallic coatings. (author) [pt

  14. Rank distributions: A panoramic macroscopic outlook

    Science.gov (United States)

    Eliazar, Iddo I.; Cohen, Morrel H.

    2014-01-01

    This paper presents a panoramic macroscopic outlook of rank distributions. We establish a general framework for the analysis of rank distributions, which classifies them into five macroscopic "socioeconomic" states: monarchy, oligarchy-feudalism, criticality, socialism-capitalism, and communism. Oligarchy-feudalism is shown to be characterized by discrete macroscopic rank distributions, and socialism-capitalism is shown to be characterized by continuous macroscopic size distributions. Criticality is a transition state between oligarchy-feudalism and socialism-capitalism, which can manifest allometric scaling with multifractal spectra. Monarchy and communism are extreme forms of oligarchy-feudalism and socialism-capitalism, respectively, in which the intrinsic randomness vanishes. The general framework is applied to three different models of rank distributions—top-down, bottom-up, and global—and unveils each model's macroscopic universality and versatility. The global model yields a macroscopic classification of the generalized Zipf law, an omnipresent form of rank distributions observed across the sciences. An amalgamation of the three models establishes a universal rank-distribution explanation for the macroscopic emergence of a prevalent class of continuous size distributions, ones governed by unimodal densities with both Pareto and inverse-Pareto power-law tails.

  15. Fair ranking of researchers and research teams.

    Science.gov (United States)

    Vavryčuk, Václav

    2018-01-01

    The main drawback of ranking of researchers by the number of papers, citations or by the Hirsch index is ignoring the problem of distributing authorship among authors in multi-author publications. So far, the single-author or multi-author publications contribute to the publication record of a researcher equally. This full counting scheme is apparently unfair and causes unjust disproportions, in particular, if ranked researchers have distinctly different collaboration profiles. These disproportions are removed by less common fractional or authorship-weighted counting schemes, which can distribute the authorship credit more properly and suppress a tendency to unjustified inflation of co-authors. The urgent need of widely adopting a fair ranking scheme in practise is exemplified by analysing citation profiles of several highly-cited astronomers and astrophysicists. While the full counting scheme often leads to completely incorrect and misleading ranking, the fractional or authorship-weighted schemes are more accurate and applicable to ranking of researchers as well as research teams. In addition, they suppress differences in ranking among scientific disciplines. These more appropriate schemes should urgently be adopted by scientific publication databases as the Web of Science (Thomson Reuters) or the Scopus (Elsevier).

  16. Geometric solitons of Hamiltonian flows on manifolds

    Energy Technology Data Exchange (ETDEWEB)

    Song, Chong, E-mail: songchong@xmu.edu.cn [School of Mathematical Sciences, Xiamen University, Xiamen 361005 (China); Sun, Xiaowei, E-mail: sunxw@cufe.edu.cn [School of Applied Mathematics, Central University of Finance and Economics, Beijing 100081 (China); Wang, Youde, E-mail: wyd@math.ac.cn [Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190 (China)

    2013-12-15

    It is well-known that the LIE (Locally Induction Equation) admit soliton-type solutions and same soliton solutions arise from different and apparently irrelevant physical models. By comparing the solitons of LIE and Killing magnetic geodesics, we observe that these solitons are essentially decided by two families of isometries of the domain and the target space, respectively. With this insight, we propose the new concept of geometric solitons of Hamiltonian flows on manifolds, such as geometric Schrödinger flows and KdV flows for maps. Moreover, we give several examples of geometric solitons of the Schrödinger flow and geometric KdV flow, including magnetic curves as geometric Schrödinger solitons and explicit geometric KdV solitons on surfaces of revolution.

  17. Operational geometric phase for mixed quantum states

    International Nuclear Information System (INIS)

    Andersson, O; Heydari, H

    2013-01-01

    The geometric phase has found a broad spectrum of applications in both classical and quantum physics, such as condensed matter and quantum computation. In this paper, we introduce an operational geometric phase for mixed quantum states, based on spectral weighted traces of holonomies, and we prove that it generalizes the standard definition of the geometric phase for mixed states, which is based on quantum interferometry. We also introduce higher order geometric phases, and prove that under a fairly weak, generically satisfied, requirement, there is always a well-defined geometric phase of some order. Our approach applies to general unitary evolutions of both non-degenerate and degenerate mixed states. Moreover, since we provide an explicit formula for the geometric phase that can be easily implemented, it is particularly well suited for computations in quantum physics. (paper)

  18. Geometrical factors in the perception of sacredness

    DEFF Research Database (Denmark)

    Costa, Marco; Bonetti, Leonardo

    2016-01-01

    Geometrical and environmental factors in the perception of sacredness, dominance, and attractiveness were assessed by 137 participants in five tests. In the first test, a two-alternative forced-choice paradigm was used to test the perception of sacredness, dominance, and attractiveness in geometr......Geometrical and environmental factors in the perception of sacredness, dominance, and attractiveness were assessed by 137 participants in five tests. In the first test, a two-alternative forced-choice paradigm was used to test the perception of sacredness, dominance, and attractiveness...... in geometrical figures differing in shape, verticality, size, and symmetry. Verticality, symmetry, and convexity were found to be important factors in the perception of sacredness. In the second test, participants had to mark the point inside geometrical surfaces that was perceived as most sacred, dominant....... Geometrical factors in the perception of sacredness, dominance, and attractiveness were largely overlapping....

  19. Guide to Geometric Algebra in Practice

    CERN Document Server

    Dorst, Leo

    2011-01-01

    This highly practical "Guide to Geometric Algebra in Practice" reviews algebraic techniques for geometrical problems in computer science and engineering, and the relationships between them. The topics covered range from powerful new theoretical developments, to successful applications, and the development of new software and hardware tools. This title: provides hands-on review exercises throughout the book, together with helpful chapter summaries; presents a concise introductory tutorial to conformal geometric algebra (CGA) in the appendices; examines the application of CGA for the d

  20. Geometrical and Graphical Solutions of Quadratic Equations.

    Science.gov (United States)

    Hornsby, E. John, Jr.

    1990-01-01

    Presented are several geometrical and graphical methods of solving quadratic equations. Discussed are Greek origins, Carlyle's method, von Staudt's method, fixed graph methods and imaginary solutions. (CW)

  1. PageRank as a method to rank biomedical literature by importance.

    Science.gov (United States)

    Yates, Elliot J; Dixon, Louise C

    2015-01-01

    Optimal ranking of literature importance is vital in overcoming article overload. Existing ranking methods are typically based on raw citation counts, giving a sum of 'inbound' links with no consideration of citation importance. PageRank, an algorithm originally developed for ranking webpages at the search engine, Google, could potentially be adapted to bibliometrics to quantify the relative importance weightings of a citation network. This article seeks to validate such an approach on the freely available, PubMed Central open access subset (PMC-OAS) of biomedical literature. On-demand cloud computing infrastructure was used to extract a citation network from over 600,000 full-text PMC-OAS articles. PageRanks and citation counts were calculated for each node in this network. PageRank is highly correlated with citation count (R = 0.905, P PageRank can be trivially computed on commodity cluster hardware and is linearly correlated with citation count. Given its putative benefits in quantifying relative importance, we suggest it may enrich the citation network, thereby overcoming the existing inadequacy of citation counts alone. We thus suggest PageRank as a feasible supplement to, or replacement of, existing bibliometric ranking methods.

  2. RANK/RANK-Ligand/OPG: Ein neuer Therapieansatz in der Osteoporosebehandlung

    Directory of Open Access Journals (Sweden)

    Preisinger E

    2007-01-01

    Full Text Available Die Erforschung der Kopplungsmechanismen zur Osteoklastogenese, Knochenresorption und Remodellierung eröffnete neue mögliche Therapieansätze in der Behandlung der Osteoporose. Eine Schlüsselrolle beim Knochenabbau spielt der RANK- ("receptor activator of nuclear factor (NF- κB"- Ligand (RANKL. Durch die Bindung von RANKL an den Rezeptor RANK wird die Knochenresorption eingeleitet. OPG (Osteoprotegerin sowie der für den klinischen Gebrauch entwickelte humane monoklonale Antikörper (IgG2 Denosumab blockieren die Bindung von RANK-Ligand an RANK und verhindern den Knochenabbau.

  3. Country-specific determinants of world university rankings

    OpenAIRE

    Pietrucha, Jacek

    2017-01-01

    This paper examines country-specific factors that affect the three most influential world university rankings (the Academic Ranking of World Universities, the QS World University Ranking, and the Times Higher Education World University Ranking). We run a cross sectional regression that covers 42–71 countries (depending on the ranking and data availability). We show that the position of universities from a country in the ranking is determined by the following country-specific variables: econom...

  4. Discrete geometric structures for architecture

    KAUST Repository

    Pottmann, Helmut

    2010-06-13

    The emergence of freeform structures in contemporary architecture raises numerous challenging research problems, most of which are related to the actual fabrication and are a rich source of research topics in geometry and geometric computing. The talk will provide an overview of recent progress in this field, with a particular focus on discrete geometric structures. Most of these result from practical requirements on segmenting a freeform shape into planar panels and on the physical realization of supporting beams and nodes. A study of quadrilateral meshes with planar faces reveals beautiful relations to discrete differential geometry. In particular, we discuss meshes which discretize the network of principal curvature lines. Conical meshes are among these meshes; they possess conical offset meshes at a constant face/face distance, which in turn leads to a supporting beam layout with so-called torsion free nodes. This work can be generalized to a variety of multilayer structures and laid the ground for an adapted curvature theory for these meshes. There are also efforts on segmenting surfaces into planar hexagonal panels. Though these are less constrained than planar quadrilateral panels, this problem is still waiting for an elegant solution. Inspired by freeform designs in architecture which involve circles and spheres, we present a new kind of triangle mesh whose faces\\' in-circles form a packing, i.e., the in-circles of two triangles with a common edge have the same contact point on that edge. These "circle packing (CP) meshes" exhibit an aesthetic balance of shape and size of their faces. They are closely tied to sphere packings on surfaces and to various remarkable structures and patterns which are of interest in art, architecture, and design. CP meshes constitute a new link between architectural freeform design and computational conformal geometry. Recently, certain timber structures motivated us to study discrete patterns of geodesics on surfaces. This

  5. Geometric asymmetry driven Janus micromotors

    Science.gov (United States)

    Zhao, Guanjia; Pumera, Martin

    2014-09-01

    The production and application of nano-/micromotors is of great importance. In order for the motors to work, asymmetry in their chemical composition or physical geometry must be present if no external asymmetric field is applied. In this paper, we present a ``coconut'' micromotor made of platinum through the partial or complete etching of the silica templates. It was shown that although both the inner and outer surfaces are made of the same material (Pt), motion of the structure can be observed as the convex surface is capable of generating oxygen bubbles. This finding shows that not only the chemical asymmetry of the micromotor, but also its geometric asymmetry can lead to fast propulsion of the motor. Moreover, a considerably higher velocity can be seen for partially etched coconut structures than the velocities of Janus or fully etched, shell-like motors. These findings will have great importance on the design of future micromotors.The production and application of nano-/micromotors is of great importance. In order for the motors to work, asymmetry in their chemical composition or physical geometry must be present if no external asymmetric field is applied. In this paper, we present a ``coconut'' micromotor made of platinum through the partial or complete etching of the silica templates. It was shown that although both the inner and outer surfaces are made of the same material (Pt), motion of the structure can be observed as the convex surface is capable of generating oxygen bubbles. This finding shows that not only the chemical asymmetry of the micromotor, but also its geometric asymmetry can lead to fast propulsion of the motor. Moreover, a considerably higher velocity can be seen for partially etched coconut structures than the velocities of Janus or fully etched, shell-like motors. These findings will have great importance on the design of future micromotors. Electronic supplementary information (ESI) available: Additional SEM images, data analysis, Videos S

  6. Global network centrality of university rankings

    Science.gov (United States)

    Guo, Weisi; Del Vecchio, Marco; Pogrebna, Ganna

    2017-10-01

    Universities and higher education institutions form an integral part of the national infrastructure and prestige. As academic research benefits increasingly from international exchange and cooperation, many universities have increased investment in improving and enabling their global connectivity. Yet, the relationship of university performance and its global physical connectedness has not been explored in detail. We conduct, to our knowledge, the first large-scale data-driven analysis into whether there is a correlation between university relative ranking performance and its global connectivity via the air transport network. The results show that local access to global hubs (as measured by air transport network betweenness) strongly and positively correlates with the ranking growth (statistical significance in different models ranges between 5% and 1% level). We also found that the local airport's aggregate flight paths (degree) and capacity (weighted degree) has no effect on university ranking, further showing that global connectivity distance is more important than the capacity of flight connections. We also examined the effect of local city economic development as a confounding variable and no effect was observed suggesting that access to global transportation hubs outweighs economic performance as a determinant of university ranking. The impact of this research is that we have determined the importance of the centrality of global connectivity and, hence, established initial evidence for further exploring potential connections between university ranking and regional investment policies on improving global connectivity.

  7. Diversity rankings among bacterial lineages in soil.

    Science.gov (United States)

    Youssef, Noha H; Elshahed, Mostafa S

    2009-03-01

    We used rarefaction curve analysis and diversity ordering-based approaches to rank the 11 most frequently encountered bacterial lineages in soil according to diversity in 5 previously reported 16S rRNA gene clone libraries derived from agricultural, undisturbed tall grass prairie and forest soils (n=26,140, 28 328, 31 818, 13 001 and 53 533). The Planctomycetes, Firmicutes and the delta-Proteobacteria were consistently ranked among the most diverse lineages in all data sets, whereas the Verrucomicrobia, Gemmatimonadetes and beta-Proteobacteria were consistently ranked among the least diverse. On the other hand, the rankings of alpha-Proteobacteria, Acidobacteria, Actinobacteria, Bacteroidetes and Chloroflexi varied widely in different soil clone libraries. In general, lineages exhibiting largest differences in diversity rankings also exhibited the largest difference in relative abundance in the data sets examined. Within these lineages, a positive correlation between relative abundance and diversity was observed within the Acidobacteria, Actinobacteria and Chloroflexi, and a negative diversity-abundance correlation was observed within the Bacteroidetes. The ecological and evolutionary implications of these results are discussed.

  8. Social class rank, essentialism, and punitive judgment.

    Science.gov (United States)

    Kraus, Michael W; Keltner, Dacher

    2013-08-01

    Recent evidence suggests that perceptions of social class rank influence a variety of social cognitive tendencies, from patterns of causal attribution to moral judgment. In the present studies we tested the hypotheses that upper-class rank individuals would be more likely to endorse essentialist lay theories of social class categories (i.e., that social class is founded in genetically based, biological differences) than would lower-class rank individuals and that these beliefs would decrease support for restorative justice--which seeks to rehabilitate offenders, rather than punish unlawful action. Across studies, higher social class rank was associated with increased essentialism of social class categories (Studies 1, 2, and 4) and decreased support for restorative justice (Study 4). Moreover, manipulated essentialist beliefs decreased preferences for restorative justice (Study 3), and the association between social class rank and class-based essentialist theories was explained by the tendency to endorse beliefs in a just world (Study 2). Implications for how class-based essentialist beliefs potentially constrain social opportunity and mobility are discussed.

  9. RANK und RANKL - Vom Knochen zum Mammakarzinom

    Directory of Open Access Journals (Sweden)

    Sigl V

    2012-01-01

    Full Text Available RANK („Receptor Activator of NF-κB“ und sein Ligand RANKL sind Schlüsselmoleküle im Knochenmetabolismus und spielen eine essenzielle Rolle in der Entstehung von pathologischen Knochenveränderungen. Die Deregulation des RANK/RANKL-Systems ist zum Beispiel ein Hauptgrund für das Auftreten von postmenopausaler Osteoporose bei Frauen. Eine weitere wesentliche Funktion von RANK und RANKL liegt in der Entwicklung von milchsekretierenden Drüsen während der Schwangerschaft. Dabei regulieren Sexualhormone, wie zum Beispiel Progesteron, die Expression von RANKL und induzieren dadurch die Proliferation von epithelialen Zellen der Brust. Seit Längerem war schon bekannt, dass RANK und RANKL in der Metastasenbildung von Brustkrebszellen im Knochengewebe beteiligt sind. Wir konnten nun das RANK/RANKLSystem auch als essenziellen Mechanismus in der Entstehung von hormonellem Brustkrebs identifizieren. In diesem Beitrag werden wir daher den neuesten Erkenntnissen besondere Aufmerksamkeit schenken und diese kritisch in Bezug auf Brustkrebsentwicklung betrachten.

  10. Information geometric methods for complexity

    Science.gov (United States)

    Felice, Domenico; Cafaro, Carlo; Mancini, Stefano

    2018-03-01

    Research on the use of information geometry (IG) in modern physics has witnessed significant advances recently. In this review article, we report on the utilization of IG methods to define measures of complexity in both classical and, whenever available, quantum physical settings. A paradigmatic example of a dramatic change in complexity is given by phase transitions (PTs). Hence, we review both global and local aspects of PTs described in terms of the scalar curvature of the parameter manifold and the components of the metric tensor, respectively. We also report on the behavior of geodesic paths on the parameter manifold used to gain insight into the dynamics of PTs. Going further, we survey measures of complexity arising in the geometric framework. In particular, we quantify complexity of networks in terms of the Riemannian volume of the parameter space of a statistical manifold associated with a given network. We are also concerned with complexity measures that account for the interactions of a given number of parts of a system that cannot be described in terms of a smaller number of parts of the system. Finally, we investigate complexity measures of entropic motion on curved statistical manifolds that arise from a probabilistic description of physical systems in the presence of limited information. The Kullback-Leibler divergence, the distance to an exponential family and volumes of curved parameter manifolds, are examples of essential IG notions exploited in our discussion of complexity. We conclude by discussing strengths, limits, and possible future applications of IG methods to the physics of complexity.

  11. Geometrical aspects of quantum spaces

    International Nuclear Information System (INIS)

    Ho, P.M.

    1996-01-01

    Various geometrical aspects of quantum spaces are presented showing the possibility of building physics on quantum spaces. In the first chapter the authors give the motivations for studying noncommutative geometry and also review the definition of a Hopf algebra and some general features of the differential geometry on quantum groups and quantum planes. In Chapter 2 and Chapter 3 the noncommutative version of differential calculus, integration and complex structure are established for the quantum sphere S 1 2 and the quantum complex projective space CP q (N), on which there are quantum group symmetries that are represented nonlinearly, and are respected by all the aforementioned structures. The braiding of S q 2 and CP q (N) is also described. In Chapter 4 the quantum projective geometry over the quantum projective space CP q (N) is developed. Collinearity conditions, coplanarity conditions, intersections and anharmonic ratios is described. In Chapter 5 an algebraic formulation of Reimannian geometry on quantum spaces is presented where Riemannian metric, distance, Laplacian, connection, and curvature have their quantum counterparts. This attempt is also extended to complex manifolds. Examples include the quantum sphere, the complex quantum projective space and the two-sheeted space. The quantum group of general coordinate transformations on some quantum spaces is also given

  12. Yang Mills instantons, geometrical aspects

    International Nuclear Information System (INIS)

    Stora, R.

    1977-09-01

    The word instanton has been coined by analogy with the word soliton. They both refer to solutions of elliptic non linear field equations with boundary conditions at infinity (of euclidean space time in the first case, euclidean space in the second case) lying on the set of classical vacua in such a way that stable topological properties emerge, susceptible to survive quantum effects, if those are small. Under this assumption, instantons are believed to be relevant to the description of tunnelling effects between classical vacua and signal some characteristics of the vacuum at the quantum level, whereas solitons should be associated with particles, i.e. discrete points in the mass spectrum. In one case the euclidean action is finite, in the other case, the energy is finite. From the mathematical point of view, the geometrical phenomena associated with the existence of solitons have forced physicists to learn rudiments of algebraic topology. The study of euclidean classical Yang Mills fields involves naturally mathematical items falling under the headings: differential geometry (fibre bundles, connections); differential topology (characteristic classes, index theory) and more recently algebraic geometry. These notes are divided as follows: a first section is devoted to a description of the physicist's views; a second section is devoted to the mathematician's vie

  13. Geometric Reasoning for Automated Planning

    Science.gov (United States)

    Clement, Bradley J.; Knight, Russell L.; Broderick, Daniel

    2012-01-01

    An important aspect of mission planning for NASA s operation of the International Space Station is the allocation and management of space for supplies and equipment. The Stowage, Configuration Analysis, and Operations Planning teams collaborate to perform the bulk of that planning. A Geometric Reasoning Engine is developed in a way that can be shared by the teams to optimize item placement in the context of crew planning. The ISS crew spends (at the time of this writing) a third or more of their time moving supplies and equipment around. Better logistical support and optimized packing could make a significant impact on operational efficiency of the ISS. Currently, computational geometry and motion planning do not focus specifically on the optimized orientation and placement of 3D objects based on multiple distance and containment preferences and constraints. The software performs reasoning about the manipulation of 3D solid models in order to maximize an objective function based on distance. It optimizes for 3D orientation and placement. Spatial placement optimization is a general problem and can be applied to object packing or asset relocation.

  14. Simulating geometrically complex blast scenarios

    Directory of Open Access Journals (Sweden)

    Ian G. Cullis

    2016-04-01

    Full Text Available The effects of blast waves generated by energetic and non-energetic sources are of continuing interest to the ballistics research community. Modern conflicts are increasingly characterised by asymmetric urban warfare, with improvised explosive devices (IEDs often playing a dominant role on the one hand and an armed forces requirement for minimal collateral effects from their weapons on the other. These problems are characterised by disparate length- and time-scales and may also be governed by complex physics. There is thus an increasing need to be able to rapidly assess and accurately predict the effects of energetic blast in topologically complex scenarios. To this end, this paper presents a new QinetiQ-developed advanced computational package called EAGLE-Blast, which is capable of accurately resolving the generation, propagation and interaction of blast waves around geometrically complex shapes such as vehicles and buildings. After a brief description of the numerical methodology, various blast scenario simulations are described and the results compared with experimental data to demonstrate the validation of the scheme and its ability to describe these complex scenarios accurately and efficiently. The paper concludes with a brief discussion on the use of the code in supporting the development of algorithms for fast running engineering models.

  15. Generalized Geometric Quantum Speed Limits

    Directory of Open Access Journals (Sweden)

    Diego Paiva Pires

    2016-06-01

    Full Text Available The attempt to gain a theoretical understanding of the concept of time in quantum mechanics has triggered significant progress towards the search for faster and more efficient quantum technologies. One of such advances consists in the interpretation of the time-energy uncertainty relations as lower bounds for the minimal evolution time between two distinguishable states of a quantum system, also known as quantum speed limits. We investigate how the nonuniqueness of a bona fide measure of distinguishability defined on the quantum-state space affects the quantum speed limits and can be exploited in order to derive improved bounds. Specifically, we establish an infinite family of quantum speed limits valid for unitary and nonunitary evolutions, based on an elegant information geometric formalism. Our work unifies and generalizes existing results on quantum speed limits and provides instances of novel bounds that are tighter than any established one based on the conventional quantum Fisher information. We illustrate our findings with relevant examples, demonstrating the importance of choosing different information metrics for open system dynamics, as well as clarifying the roles of classical populations versus quantum coherences, in the determination and saturation of the speed limits. Our results can find applications in the optimization and control of quantum technologies such as quantum computation and metrology, and might provide new insights in fundamental investigations of quantum thermodynamics.

  16. Geometric structure of percolation clusters.

    Science.gov (United States)

    Xu, Xiao; Wang, Junfeng; Zhou, Zongzheng; Garoni, Timothy M; Deng, Youjin

    2014-01-01

    We investigate the geometric properties of percolation clusters by studying square-lattice bond percolation on the torus. We show that the density of bridges and nonbridges both tend to 1/4 for large system sizes. Using Monte Carlo simulations, we study the probability that a given edge is not a bridge but has both its loop arcs in the same loop and find that it is governed by the two-arm exponent. We then classify bridges into two types: branches and junctions. A bridge is a branch iff at least one of the two clusters produced by its deletion is a tree. Starting from a percolation configuration and deleting the branches results in a leaf-free configuration, whereas, deleting all bridges produces a bridge-free configuration. Although branches account for ≈43% of all occupied bonds, we find that the fractal dimensions of the cluster size and hull length of leaf-free configurations are consistent with those for standard percolation configurations. By contrast, we find that the fractal dimensions of the cluster size and hull length of bridge-free configurations are given by the backbone and external perimeter dimensions, respectively. We estimate the backbone fractal dimension to be 1.643 36(10).

  17. Geometric Phase Generated Optical Illusion.

    Science.gov (United States)

    Yue, Fuyong; Zang, Xiaofei; Wen, Dandan; Li, Zile; Zhang, Chunmei; Liu, Huigang; Gerardot, Brian D; Wang, Wei; Zheng, Guoxing; Chen, Xianzhong

    2017-09-12

    An optical illusion, such as "Rubin's vase", is caused by the information gathered by the eye, which is processed in the brain to give a perception that does not tally with a physical measurement of the stimulus source. Metasurfaces are metamaterials of reduced dimensionality which have opened up new avenues for flat optics. The recent advancement in spin-controlled metasurface holograms has attracted considerate attention, providing a new method to realize optical illusions. We propose and experimentally demonstrate a metasurface device to generate an optical illusion. The metasurface device is designed to display two asymmetrically distributed off-axis images of "Rubin faces" with high fidelity, high efficiency and broadband operation that are interchangeable by controlling the helicity of the incident light. Upon the illumination of a linearly polarized light beam, the optical illusion of a 'vase' is perceived. Our result provides an intuitive demonstration of the figure-ground distinction that our brains make during the visual perception. The alliance between geometric metasurface and the optical illusion opens a pathway for new applications related to encryption, optical patterning, and information processing.

  18. Low Rank Approximation Algorithms, Implementation, Applications

    CERN Document Server

    Markovsky, Ivan

    2012-01-01

    Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...

  19. Resolution of ranking hierarchies in directed networks

    Science.gov (United States)

    Barucca, Paolo; Lillo, Fabrizio

    2018-01-01

    Identifying hierarchies and rankings of nodes in directed graphs is fundamental in many applications such as social network analysis, biology, economics, and finance. A recently proposed method identifies the hierarchy by finding the ordered partition of nodes which minimises a score function, termed agony. This function penalises the links violating the hierarchy in a way depending on the strength of the violation. To investigate the resolution of ranking hierarchies we introduce an ensemble of random graphs, the Ranked Stochastic Block Model. We find that agony may fail to identify hierarchies when the structure is not strong enough and the size of the classes is small with respect to the whole network. We analytically characterise the resolution threshold and we show that an iterated version of agony can partly overcome this resolution limit. PMID:29394278

  20. Ranking beta sheet topologies of proteins

    DEFF Research Database (Denmark)

    Fonseca, Rasmus; Helles, Glennie; Winter, Pawel

    2010-01-01

    One of the challenges of protein structure prediction is to identify long-range interactions between amino acids. To reliably predict such interactions, we enumerate, score and rank all beta-topologies (partitions of beta-strands into sheets, orderings of strands within sheets and orientations...... of paired strands) of a given protein. We show that the beta-topology corresponding to the native structure is, with high probability, among the top-ranked. Since full enumeration is very time-consuming, we also suggest a method to deal with proteins with many beta-strands. The results reported...... in this paper are highly relevant for ab initio protein structure prediction methods based on decoy generation. The top-ranked beta-topologies can be used to find initial conformations from which conformational searches can be started. They can also be used to filter decoys by removing those with poorly...

  1. Data envelopment analysis of randomized ranks

    Directory of Open Access Journals (Sweden)

    Sant'Anna Annibal P.

    2002-01-01

    Full Text Available Probabilities and odds, derived from vectors of ranks, are here compared as measures of efficiency of decision-making units (DMUs. These measures are computed with the goal of providing preliminary information before starting a Data Envelopment Analysis (DEA or the application of any other evaluation or composition of preferences methodology. Preferences, quality and productivity evaluations are usually measured with errors or subject to influence of other random disturbances. Reducing evaluations to ranks and treating the ranks as estimates of location parameters of random variables, we are able to compute the probability of each DMU being classified as the best according to the consumption of each input and the production of each output. Employing the probabilities of being the best as efficiency measures, we stretch distances between the most efficient units. We combine these partial probabilities in a global efficiency score determined in terms of proximity to the efficiency frontier.

  2. Ranking spreaders by decomposing complex networks

    International Nuclear Information System (INIS)

    Zeng, An; Zhang, Cheng-Jun

    2013-01-01

    Ranking the nodes' ability of spreading in networks is crucial for designing efficient strategies to hinder spreading in the case of diseases or accelerate spreading in the case of information dissemination. In the well-known k-shell method, nodes are ranked only according to the links between the remaining nodes (residual links) while the links connecting to the removed nodes (exhausted links) are entirely ignored. In this Letter, we propose a mixed degree decomposition (MDD) procedure in which both the residual degree and the exhausted degree are considered. By simulating the epidemic spreading process on real networks, we show that the MDD method can outperform the k-shell and degree methods in ranking spreaders.

  3. Geometrical scaling, furry branching and minijets

    International Nuclear Information System (INIS)

    Hwa, R.C.

    1988-01-01

    Scaling properties and their violations in hadronic collisions are discussed in the framework of the geometrical branching model. Geometrical scaling supplemented by Furry branching characterizes the soft component, while the production of jets specifies the hard component. Many features of multiparticle production processes are well described by this model. 21 refs

  4. Geometric integrators for stochastic rigid body dynamics

    KAUST Repository

    Tretyakov, Mikhail

    2016-01-05

    Geometric integrators play an important role in simulating dynamical systems on long time intervals with high accuracy. We will illustrate geometric integration ideas within the stochastic context, mostly on examples of stochastic thermostats for rigid body dynamics. The talk will be mainly based on joint recent work with Rusland Davidchak and Tom Ouldridge.

  5. Geometric integrators for stochastic rigid body dynamics

    KAUST Repository

    Tretyakov, Mikhail

    2016-01-01

    Geometric integrators play an important role in simulating dynamical systems on long time intervals with high accuracy. We will illustrate geometric integration ideas within the stochastic context, mostly on examples of stochastic thermostats for rigid body dynamics. The talk will be mainly based on joint recent work with Rusland Davidchak and Tom Ouldridge.

  6. Geometric phases in discrete dynamical systems

    Energy Technology Data Exchange (ETDEWEB)

    Cartwright, Julyan H.E., E-mail: julyan.cartwright@csic.es [Instituto Andaluz de Ciencias de la Tierra, CSIC–Universidad de Granada, E-18100 Armilla, Granada (Spain); Instituto Carlos I de Física Teórica y Computacional, Universidad de Granada, E-18071 Granada (Spain); Piro, Nicolas, E-mail: nicolas.piro@epfl.ch [École Polytechnique Fédérale de Lausanne (EPFL), 1015 Lausanne (Switzerland); Piro, Oreste, E-mail: piro@imedea.uib-csic.es [Departamento de Física, Universitat de les Illes Balears, E-07122 Palma de Mallorca (Spain); Tuval, Idan, E-mail: ituval@imedea.uib-csic.es [Mediterranean Institute for Advanced Studies, CSIC–Universitat de les Illes Balears, E-07190 Mallorca (Spain)

    2016-10-14

    In order to study the behaviour of discrete dynamical systems under adiabatic cyclic variations of their parameters, we consider discrete versions of adiabatically-rotated rotators. Parallelling the studies in continuous systems, we generalize the concept of geometric phase to discrete dynamics and investigate its presence in these rotators. For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number of the system. For the discrete version of the rotated rotator considered by Berry, the rotated standard map, we further explore this connection as well as the role of the geometric phase at the onset of chaos. Further into the chaotic regime, we show that the geometric phase is also related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent. - Highlights: • We extend the concept of geometric phase to maps. • For the rotated sine circle map, we demonstrate an analytical relationship between the geometric phase and the rotation number. • For the rotated standard map, we explore the role of the geometric phase at the onset of chaos. • We show that the geometric phase is related to the diffusive behaviour of the dynamical variables and the Lyapunov exponent.

  7. Geometrical optics and the diffraction phenomenon

    International Nuclear Information System (INIS)

    Timofeev, Aleksandr V

    2005-01-01

    This note outlines the principles of the geometrical optics of inhomogeneous waves whose description necessitates the use of complex values of the wave vector. Generalizing geometrical optics to inhomogeneous waves permits including in its scope the analysis of the diffraction phenomenon. (methodological notes)

  8. Solving Absolute Value Equations Algebraically and Geometrically

    Science.gov (United States)

    Shiyuan, Wei

    2005-01-01

    The way in which students can improve their comprehension by understanding the geometrical meaning of algebraic equations or solving algebraic equation geometrically is described. Students can experiment with the conditions of the absolute value equation presented, for an interesting way to form an overall understanding of the concept.

  9. Sign rank versus Vapnik-Chervonenkis dimension

    Science.gov (United States)

    Alon, N.; Moran, Sh; Yehudayoff, A.

    2017-12-01

    This work studies the maximum possible sign rank of sign (N × N)-matrices with a given Vapnik-Chervonenkis dimension d. For d=1, this maximum is three. For d=2, this maximum is \\widetilde{\\Theta}(N1/2). For d >2, similar but slightly less accurate statements hold. The lower bounds improve on previous ones by Ben-David et al., and the upper bounds are novel. The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given Vapnik-Chervonenkis dimension, and the number of maximum classes of a given Vapnik-Chervonenkis dimension--answering a question of Frankl from 1989, and (ii) design an efficient algorithm that provides an O(N/log(N)) multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the adjacency (N × N)-matrix of a Δ-regular graph with a second eigenvalue of absolute value λ and Δ ≤ N/2. We show that the sign rank of the signed version of this matrix is at least Δ/λ. We use this connection to prove the existence of a maximum class C\\subseteq\\{+/- 1\\}^N with Vapnik-Chervonenkis dimension 2 and sign rank \\widetilde{\\Theta}(N1/2). This answers a question of Ben-David et al. regarding the sign rank of large Vapnik-Chervonenkis classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics. Bibliography: 69 titles.

  10. RankProdIt: A web-interactive Rank Products analysis tool

    Directory of Open Access Journals (Sweden)

    Laing Emma

    2010-08-01

    Full Text Available Abstract Background The first objective of a DNA microarray experiment is typically to generate a list of genes or probes that are found to be differentially expressed or represented (in the case of comparative genomic hybridizations and/or copy number variation between two conditions or strains. Rank Products analysis comprises a robust algorithm for deriving such lists from microarray experiments that comprise small numbers of replicates, for example, less than the number required for the commonly used t-test. Currently, users wishing to apply Rank Products analysis to their own microarray data sets have been restricted to the use of command line-based software which can limit its usage within the biological community. Findings Here we have developed a web interface to existing Rank Products analysis tools allowing users to quickly process their data in an intuitive and step-wise manner to obtain the respective Rank Product or Rank Sum, probability of false prediction and p-values in a downloadable file. Conclusions The online interactive Rank Products analysis tool RankProdIt, for analysis of any data set containing measurements for multiple replicated conditions, is available at: http://strep-microarray.sbs.surrey.ac.uk/RankProducts

  11. Rank-based Tests of the Cointegrating Rank in Semiparametric Error Correction Models

    NARCIS (Netherlands)

    Hallin, M.; van den Akker, R.; Werker, B.J.M.

    2012-01-01

    Abstract: This paper introduces rank-based tests for the cointegrating rank in an Error Correction Model with i.i.d. elliptical innovations. The tests are asymptotically distribution-free, and their validity does not depend on the actual distribution of the innovations. This result holds despite the

  12. When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

    KAUST Repository

    Wang, Jim Jing-Yan

    2017-06-28

    Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

  13. Learning to rank for information retrieval

    CERN Document Server

    Liu, Tie-Yan

    2011-01-01

    Due to the fast growth of the Web and the difficulties in finding desired information, efficient and effective information retrieval systems have become more important than ever, and the search engine has become an essential tool for many people. The ranker, a central component in every search engine, is responsible for the matching between processed queries and indexed documents. Because of its central role, great attention has been paid to the research and development of ranking technologies. In addition, ranking is also pivotal for many other information retrieval applications, such as coll

  14. Cointegration rank testing under conditional heteroskedasticity

    DEFF Research Database (Denmark)

    Cavaliere, Giuseppe; Rahbek, Anders Christian; Taylor, Robert M.

    2010-01-01

    We analyze the properties of the conventional Gaussian-based cointegrating rank tests of Johansen (1996, Likelihood-Based Inference in Cointegrated Vector Autoregressive Models) in the case where the vector of series under test is driven by globally stationary, conditionally heteroskedastic......, relative to tests based on the asymptotic critical values or the i.i.d. bootstrap, the wild bootstrap rank tests perform very well in small samples under a variety of conditionally heteroskedastic innovation processes. An empirical application to the term structure of interest rates is given....

  15. Ranking health between countries in international comparisons

    DEFF Research Database (Denmark)

    Brønnum-Hansen, Henrik

    2014-01-01

    Cross-national comparisons and ranking of summary measures of population health sometimes give rise to inconsistent and diverging conclusions. In order to minimise confusion, international comparative studies ought to be based on well-harmonised data with common standards of definitions and docum......Cross-national comparisons and ranking of summary measures of population health sometimes give rise to inconsistent and diverging conclusions. In order to minimise confusion, international comparative studies ought to be based on well-harmonised data with common standards of definitions...

  16. Preference Learning and Ranking by Pairwise Comparison

    Science.gov (United States)

    Fürnkranz, Johannes; Hüllermeier, Eyke

    This chapter provides an overview of recent work on preference learning and ranking via pairwise classification. The learning by pairwise comparison (LPC) paradigm is the natural machine learning counterpart to the relational approach to preference modeling and decision making. From a machine learning point of view, LPC is especially appealing as it decomposes a possibly complex prediction problem into a certain number of learning problems of the simplest type, namely binary classification. We explain how to approach different preference learning problems, such as label and instance ranking, within the framework of LPC. We primarily focus on methodological aspects, but also address theoretical questions as well as algorithmic and complexity issues.

  17. Compressed Sensing with Rank Deficient Dictionaries

    DEFF Research Database (Denmark)

    Hansen, Thomas Lundgaard; Johansen, Daniel Højrup; Jørgensen, Peter Bjørn

    2012-01-01

    In compressed sensing it is generally assumed that the dictionary matrix constitutes a (possibly overcomplete) basis of the signal space. In this paper we consider dictionaries that do not span the signal space, i.e. rank deficient dictionaries. We show that in this case the signal-to-noise ratio...... (SNR) in the compressed samples can be increased by selecting the rows of the measurement matrix from the column space of the dictionary. As an example application of compressed sensing with a rank deficient dictionary, we present a case study of compressed sensing applied to the Coarse Acquisition (C...

  18. Ranking mutual funds using Sortino method

    Directory of Open Access Journals (Sweden)

    Khosro Faghani Makrani

    2014-04-01

    Full Text Available One of the primary concerns on most business activities is to determine an efficient method for ranking mutual funds. This paper performs an empirical investigation to rank 42 mutual funds listed on Tehran Stock Exchange using Sortino method over the period 2011-2012. The results of survey have been compared with market return and the results have confirmed that there were some positive and meaningful relationships between Sortino return and market return. In addition, there were some positive and meaningful relationship between two Sortino methods.

  19. Research of Subgraph Estimation Page Rank Algorithm for Web Page Rank

    Directory of Open Access Journals (Sweden)

    LI Lan-yin

    2017-04-01

    Full Text Available The traditional PageRank algorithm can not efficiently perform large data Webpage scheduling problem. This paper proposes an accelerated algorithm named topK-Rank,which is based on PageRank on the MapReduce platform. It can find top k nodes efficiently for a given graph without sacrificing accuracy. In order to identify top k nodes,topK-Rank algorithm prunes unnecessary nodes and edges in each iteration to dynamically construct subgraphs,and iteratively estimates lower/upper bounds of PageRank scores through subgraphs. Theoretical analysis shows that this method guarantees result exactness. Experiments show that topK-Rank algorithm can find k nodes much faster than the existing approaches.

  20. Subject Gateway Sites and Search Engine Ranking.

    Science.gov (United States)

    Thelwall, Mike

    2002-01-01

    Discusses subject gateway sites and commercial search engines for the Web and presents an explanation of Google's PageRank algorithm. The principle question addressed is the conditions under which a gateway site will increase the likelihood that a target page is found in search engines. (LRW)

  1. Rank reduction of correlation matrices by majorization

    NARCIS (Netherlands)

    R. Pietersz (Raoul); P.J.F. Groenen (Patrick)

    2004-01-01

    textabstractIn this paper a novel method is developed for the problem of finding a low-rank correlation matrix nearest to a given correlation matrix. The method is based on majorization and therefore it is globally convergent. The method is computationally efficient, is straightforward to implement,

  2. Ranking related entities: components and analyses

    NARCIS (Netherlands)

    Bron, M.; Balog, K.; de Rijke, M.

    2010-01-01

    Related entity finding is the task of returning a ranked list of homepages of relevant entities of a specified type that need to engage in a given relationship with a given source entity. We propose a framework for addressing this task and perform a detailed analysis of four core components;

  3. Ranking Very Many Typed Entities on Wikipedia

    NARCIS (Netherlands)

    Zaragoza, Hugo; Rode, H.; Mika, Peter; Atserias, Jordi; Ciaramita, Massimiliano; Attardi, Guiseppe

    2007-01-01

    We discuss the problem of ranking very many entities of different types. In particular we deal with a heterogeneous set of types, some being very generic and some very specific. We discuss two approaches for this problem: i) exploiting the entity containment graph and ii) using a Web search engine

  4. On the Dirac groups of rank n

    International Nuclear Information System (INIS)

    Ferreira, P.L.; Alcaras, J.A.C.

    1980-01-01

    The group theoretical properties of the Dirac groups of rank n are discussed together with the properties and construction of their IR's. The cases n even and n odd show distinct features. Furthermore, for n odd, the cases n=4K+1 and n=4K+3 exhibit some different properties too. (Author) [pt

  5. On rank 2 Seiberg-Witten equations

    International Nuclear Information System (INIS)

    Massamba, F.; Thompson, G.

    2004-02-01

    We introduce and study a set of rank 2 Seiberg-Witten equations. We show that the moduli space of solutions is a compact, orientational and smooth manifold. For minimal surfaces of general type we are able to determine the basic classes. (author)

  6. A tilting approach to ranking influence

    KAUST Repository

    Genton, Marc G.; Hall, Peter

    2014-01-01

    We suggest a new approach, which is applicable for general statistics computed from random samples of univariate or vector-valued or functional data, to assessing the influence that individual data have on the value of a statistic, and to ranking

  7. Texture Repairing by Unified Low Rank Optimization

    Institute of Scientific and Technical Information of China (English)

    Xiao Liang; Xiang Ren; Zhengdong Zhang; Yi Ma

    2016-01-01

    In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruption. In addition to the low rank property of texture, the algorithm also uses the sparse assumption of the natural image: because the natural image is piecewise smooth, it is sparse in certain transformed domain (such as Fourier or wavelet transform). We combine low-rank and sparsity properties of the texture image together in the proposed algorithm. Our algorithm based on convex optimization can automatically and correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. This algorithm integrates texture rectification and repairing into one optimization problem. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Our method demonstrates significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.

  8. Semantic association ranking schemes for information retrieval ...

    Indian Academy of Sciences (India)

    retrieval applications using term association graph representation ... Department of Computer Science and Engineering, Government College of ... Introduction ... leads to poor precision, e.g., model, python, and chip. ...... The approaches proposed in this paper focuses on the query-centric re-ranking of search results.

  9. Zero forcing parameters and minimum rank problems

    NARCIS (Netherlands)

    Barioli, F.; Barrett, W.; Fallat, S.M.; Hall, H.T.; Hogben, L.; Shader, B.L.; Driessche, van den P.; Holst, van der H.

    2010-01-01

    The zero forcing number Z(G), which is the minimum number of vertices in a zero forcing set of a graph G, is used to study the maximum nullity/minimum rank of the family of symmetric matrices described by G. It is shown that for a connected graph of order at least two, no vertex is in every zero

  10. A note on ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, L.R.; Andersen, K.A.

    2005-01-01

    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...

  11. Language Games: University Responses to Ranking Metrics

    Science.gov (United States)

    Heffernan, Troy A.; Heffernan, Amanda

    2018-01-01

    League tables of universities that measure performance in various ways are now commonplace, with numerous bodies providing their own rankings of how institutions throughout the world are seen to be performing on a range of metrics. This paper uses Lyotard's notion of language games to theorise that universities are regaining some power over being…

  12. Ranking Thinning Potential of Lodgepole Pine Stands

    OpenAIRE

    United States Department of Agriculture, Forest Service

    1987-01-01

    This paper presents models for predicting edge-response of dominant and codominant trees to clearing. Procedures are given for converting predictions to a thinning response index, for ranking stands for thinning priority. Data requirements, sampling suggestions, examples of application, and suggestions for management use are included to facilitate use as a field guide.

  13. Primate Innovation: Sex, Age and Social Rank

    NARCIS (Netherlands)

    Reader, S.M.; Laland, K.N.

    2001-01-01

    Analysis of an exhaustive survey of primate behavior collated from the published literature revealed significant variation in rates of innovation among individuals of different sex, age and social rank. We searched approximately 1,000 articles in four primatology journals, together with other

  14. Biomechanics Scholar Citations across Academic Ranks

    Directory of Open Access Journals (Sweden)

    Knudson Duane

    2015-11-01

    Full Text Available Study aim: citations to the publications of a scholar have been used as a measure of the quality or influence of their research record. A world-wide descriptive study of the citations to the publications of biomechanics scholars of various academic ranks was conducted.

  15. An algorithm for ranking assignments using reoptimization

    DEFF Research Database (Denmark)

    Pedersen, Christian Roed; Nielsen, Lars Relund; Andersen, Kim Allan

    2008-01-01

    We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization...... technique. Computational results for the new algorithm are presented...

  16. Ranking Workplace Competencies: Student and Graduate Perceptions.

    Science.gov (United States)

    Rainsbury, Elizabeth; Hodges, Dave; Burchell, Noel; Lay, Mark

    2002-01-01

    New Zealand business students and graduates made similar rankings of the five most important workplace competencies: computer literacy, customer service orientation, teamwork and cooperation, self-confidence, and willingness to learn. Graduates placed greater importance on most of the 24 competencies, resulting in a statistically significant…

  17. Comparing survival curves using rank tests

    NARCIS (Netherlands)

    Albers, Willem/Wim

    1990-01-01

    Survival times of patients can be compared using rank tests in various experimental setups, including the two-sample case and the case of paired data. Attention is focussed on two frequently occurring complications in medical applications: censoring and tail alternatives. A review is given of the

  18. A generalization of Friedman's rank statistic

    NARCIS (Netherlands)

    Kroon, de J.; Laan, van der P.

    1983-01-01

    In this paper a very natural generalization of the two·way analysis of variance rank statistic of FRIEDMAN is given. The general distribution-free test procedure based on this statistic for the effect of J treatments in a random block design can be applied in general two-way layouts without

  19. Probabilistic relation between In-Degree and PageRank

    NARCIS (Netherlands)

    Litvak, Nelli; Scheinhardt, Willem R.W.; Volkovich, Y.

    2008-01-01

    This paper presents a novel stochastic model that explains the relation between power laws of In-Degree and PageRank. PageRank is a popularity measure designed by Google to rank Web pages. We model the relation between PageRank and In-Degree through a stochastic equation, which is inspired by the

  20. Generalized reduced rank tests using the singular value decomposition

    NARCIS (Netherlands)

    Kleibergen, F.R.; Paap, R.

    2002-01-01

    We propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: necessity of a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson (1951), sensitivity to the ordering of the variables for the LDU

  1. Nominal versus Attained Weights in Universitas 21 Ranking

    Science.gov (United States)

    Soh, Kaycheng

    2014-01-01

    Universitas 21 Ranking of National Higher Education Systems (U21 Ranking) is one of the three new ranking systems appearing in 2012. In contrast with the other systems, U21 Ranking uses countries as the unit of analysis. It has several features which lend it with greater trustworthiness, but it also shared some methodological issues with the other…

  2. The effect of new links on Google PageRank

    NARCIS (Netherlands)

    Avrachenkov, Konstatin; Litvak, Nelli

    2004-01-01

    PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer and thus it reflects the popularity of a Web page. We study the effect of newly created links on Google PageRank. We discuss to

  3. Generalized Reduced Rank Tests using the Singular Value Decomposition

    NARCIS (Netherlands)

    F.R. Kleibergen (Frank); R. Paap (Richard)

    2003-01-01

    textabstractWe propose a novel statistic to test the rank of a matrix. The rank statistic overcomes deficiencies of existing rank statistics, like: necessity of a Kronecker covariance matrix for the canonical correlation rank statistic of Anderson (1951), sensitivity to the ordering of the variables

  4. VaRank: a simple and powerful tool for ranking genetic variants

    Directory of Open Access Journals (Sweden)

    Véronique Geoffroy

    2015-03-01

    Full Text Available Background. Most genetic disorders are caused by single nucleotide variations (SNVs or small insertion/deletions (indels. High throughput sequencing has broadened the catalogue of human variation, including common polymorphisms, rare variations or disease causing mutations. However, identifying one variation among hundreds or thousands of others is still a complex task for biologists, geneticists and clinicians.Results. We have developed VaRank, a command-line tool for the ranking of genetic variants detected by high-throughput sequencing. VaRank scores and prioritizes variants annotated either by Alamut Batch or SnpEff. A barcode allows users to quickly view the presence/absence of variants (with homozygote/heterozygote status in analyzed samples. VaRank supports the commonly used VCF input format for variants analysis thus allowing it to be easily integrated into NGS bioinformatics analysis pipelines. VaRank has been successfully applied to disease-gene identification as well as to molecular diagnostics setup for several hundred patients.Conclusions. VaRank is implemented in Tcl/Tk, a scripting language which is platform-independent but has been tested only on Unix environment. The source code is available under the GNU GPL, and together with sample data and detailed documentation can be downloaded from http://www.lbgi.fr/VaRank/.

  5. Model of Decision Making through Consensus in Ranking Case

    Science.gov (United States)

    Tarigan, Gim; Darnius, Open

    2018-01-01

    The basic problem to determine ranking consensus is a problem to combine some rankings those are decided by two or more Decision Maker (DM) into ranking consensus. DM is frequently asked to present their preferences over a group of objects in terms of ranks, for example to determine a new project, new product, a candidate in a election, and so on. The problem in ranking can be classified into two major categories; namely, cardinal and ordinal rankings. The objective of the study is to obtin the ranking consensus by appying some algorithms and methods. The algorithms and methods used in this study were partial algorithm, optimal ranking consensus, BAK (Borde-Kendal)Model. A method proposed as an alternative in ranking conssensus is a Weighted Distance Forward-Backward (WDFB) method, which gave a little difference i ranking consensus result compare to the result oethe example solved by Cook, et.al (2005).

  6. Statistical Optimality in Multipartite Ranking and Ordinal Regression.

    Science.gov (United States)

    Uematsu, Kazuki; Lee, Yoonkyung

    2015-05-01

    Statistical optimality in multipartite ranking is investigated as an extension of bipartite ranking. We consider the optimality of ranking algorithms through minimization of the theoretical risk which combines pairwise ranking errors of ordinal categories with differential ranking costs. The extension shows that for a certain class of convex loss functions including exponential loss, the optimal ranking function can be represented as a ratio of weighted conditional probability of upper categories to lower categories, where the weights are given by the misranking costs. This result also bridges traditional ranking methods such as proportional odds model in statistics with various ranking algorithms in machine learning. Further, the analysis of multipartite ranking with different costs provides a new perspective on non-smooth list-wise ranking measures such as the discounted cumulative gain and preference learning. We illustrate our findings with simulation study and real data analysis.

  7. Geometrical formulation of the conformal Ward identity

    International Nuclear Information System (INIS)

    Kachkachi, M.

    2002-08-01

    In this paper we use deep ideas in complex geometry that proved to be very powerful in unveiling the Polyakov measure on the moduli space of Riemann surfaces and lead to obtain the partition function of perturbative string theory for 2, 3, 4 loops. Indeed, a geometrical interpretation of the conformal Ward identity in two dimensional conformal field theory is proposed: the conformal anomaly is interpreted as a deformation of the complex structure of the basic Riemann surface. This point of view is in line with the modern trend of geometric quantizations that are based on deformations of classical structures. Then, we solve the conformal Ward identity by using this geometrical formalism. (author)

  8. Initial singularity and pure geometric field theories

    Science.gov (United States)

    Wanas, M. I.; Kamal, Mona M.; Dabash, Tahia F.

    2018-01-01

    In the present article we use a modified version of the geodesic equation, together with a modified version of the Raychaudhuri equation, to study initial singularities. These modified equations are used to account for the effect of the spin-torsion interaction on the existence of initial singularities in cosmological models. Such models are the results of solutions of the field equations of a class of field theories termed pure geometric. The geometric structure used in this study is an absolute parallelism structure satisfying the cosmological principle. It is shown that the existence of initial singularities is subject to some mathematical (geometric) conditions. The scheme suggested for this study can be easily generalized.

  9. SOME PROPERTIES OF GEOMETRIC DEA MODELS

    Directory of Open Access Journals (Sweden)

    Ozren Despić

    2013-02-01

    Full Text Available Some specific geometric data envelopment analysis (DEA models are well known to the researchers in DEA through so-called multiplicative or log-linear efficiency models. Valuable properties of these models were noted by several authors but the models still remain somewhat obscure and rarely used in practice. The purpose of this paper is to show from a mathematical perspective where the geometric DEA fits in relation to the classical DEA, and to provide a brief overview of some benefits in using geometric DEA in practice of decision making and/or efficiency measurement.

  10. Refined geometric transition and qq-characters

    Science.gov (United States)

    Kimura, Taro; Mori, Hironori; Sugimoto, Yuji

    2018-01-01

    We show the refinement of the prescription for the geometric transition in the refined topological string theory and, as its application, discuss a possibility to describe qq-characters from the string theory point of view. Though the suggested way to operate the refined geometric transition has passed through several checks, it is additionally found in this paper that the presence of the preferred direction brings a nontrivial effect. We provide the modified formula involving this point. We then apply our prescription of the refined geometric transition to proposing the stringy description of doubly quantized Seiberg-Witten curves called qq-characters in certain cases.

  11. A Geometrical View of Higgs Effective Theory

    CERN Multimedia

    CERN. Geneva

    2016-01-01

    A geometric formulation of Higgs Effective Field Theory (HEFT) is presented. Experimental observables are given in terms of geometric invariants of the scalar sigma model sector such as the curvature of the scalar field manifold M. We show how the curvature can be measured experimentally via Higgs cross-sections, W_L scattering, and the S parameter. The one-loop action of HEFT is given in terms of geometric invariants of M. The distinction between the Standard Model (SM) and HEFT is whether M is flat or curved, with the curvature a signal of the scale of new physics.

  12. Geometrical analysis of the interacting boson model

    International Nuclear Information System (INIS)

    Dieperink, A.E.L.

    1983-01-01

    The Interacting Boson Model is considered, in relation with geometrical models and the application of mean field techniques to algebraic models, in three lectures. In the first, several methods are reviewed to establish a connection between the algebraic formulation of collective nuclear properties in terms of the group SU(6) and the geometric approach. In the second lecture the geometric interpretation of new degrees of freedom that arise in the neutron-proton IBA is discussed, and in the third one some further applications of algebraic techniques to the calculation of static and dynamic collective properties are presented. (U.K.)

  13. Lectures on geometrical properties of nuclei

    International Nuclear Information System (INIS)

    Myers, W.D.

    1975-11-01

    Material concerning the geometrical properties of nuclei is drawn from a number of different sources. The leptodermous nature of nuclear density distributions and potential wells is used to draw together the various geometrical properties of these systems and to provide a unified means for their description. Extensive use is made of expansions of radial properties in terms of the surface diffuseness. A strong case is made for the use of convolution as a geometrical ansatz for generating diffuse surface distributions because of the number of simplifications that arise which are of practical importance. 7 figures

  14. Stock price prediction using geometric Brownian motion

    Science.gov (United States)

    Farida Agustini, W.; Restu Affianti, Ika; Putri, Endah RM

    2018-03-01

    Geometric Brownian motion is a mathematical model for predicting the future price of stock. The phase that done before stock price prediction is determine stock expected price formulation and determine the confidence level of 95%. On stock price prediction using geometric Brownian Motion model, the algorithm starts from calculating the value of return, followed by estimating value of volatility and drift, obtain the stock price forecast, calculating the forecast MAPE, calculating the stock expected price and calculating the confidence level of 95%. Based on the research, the output analysis shows that geometric Brownian motion model is the prediction technique with high rate of accuracy. It is proven with forecast MAPE value ≤ 20%.

  15. Differential invariants for higher-rank tensors. A progress report

    International Nuclear Information System (INIS)

    Tapial, V.

    2004-07-01

    We outline the construction of differential invariants for higher-rank tensors. In section 2 we outline the general method for the construction of differential invariants. A first result is that the simplest tensor differential invariant contains derivatives of the same order as the rank of the tensor. In section 3 we review the construction for the first-rank tensors (vectors) and second-rank tensors (metrics). In section 4 we outline the same construction for higher-rank tensors. (author)

  16. Beyond Low Rank: A Data-Adaptive Tensor Completion Method

    OpenAIRE

    Zhang, Lei; Wei, Wei; Shi, Qinfeng; Shen, Chunhua; Hengel, Anton van den; Zhang, Yanning

    2017-01-01

    Low rank tensor representation underpins much of recent progress in tensor completion. In real applications, however, this approach is confronted with two challenging problems, namely (1) tensor rank determination; (2) handling real tensor data which only approximately fulfils the low-rank requirement. To address these two issues, we develop a data-adaptive tensor completion model which explicitly represents both the low-rank and non-low-rank structures in a latent tensor. Representing the no...

  17. Transition curves for highway geometric design

    CERN Document Server

    Kobryń, Andrzej

    2017-01-01

    This book provides concise descriptions of the various solutions of transition curves, which can be used in geometric design of roads and highways. It presents mathematical methods and curvature functions for defining transition curves. .

  18. Geometrical scaling of jet fragmentation photons

    Energy Technology Data Exchange (ETDEWEB)

    Hattori, Koichi, E-mail: koichi.hattori@riken.jp [RIKEN BNL Research Center, Brookhaven National Laboratory, Upton NY 11973 (United States); Theoretical Research Division, Nishina Center, RIKEN, Wako, Saitama 351-0198 (Japan); McLerran, Larry, E-mail: mclerran@bnl.gov [RIKEN BNL Research Center, Brookhaven National Laboratory, Upton NY 11973 (United States); Physics Dept., Bdg. 510A, Brookhaven National Laboratory, Upton, NY-11973 (United States); Physics Dept., China Central Normal University, Wuhan (China); Schenke, Björn, E-mail: bschenke@bnl.gov [Physics Dept., Bdg. 510A, Brookhaven National Laboratory, Upton, NY-11973 (United States)

    2016-12-15

    We discuss jet fragmentation photons in ultrarelativistic heavy-ion collisions. We argue that, if the jet distribution satisfies geometrical scaling and an anisotropic spectrum, these properties are transferred to photons during the jet fragmentation.

  19. Geometric U-folds in four dimensions

    Science.gov (United States)

    Lazaroiu, C. I.; Shahbazi, C. S.

    2018-01-01

    We describe a general construction of geometric U-folds compatible with a non-trivial extension of the global formulation of four-dimensional extended supergravity on a differentiable spin manifold. The topology of geometric U-folds depends on certain flat fiber bundles which encode how supergravity fields are globally glued together. We show that smooth non-trivial U-folds of this type can exist only in theories where both the scalar and space-time manifolds have non-trivial fundamental group and in addition the scalar map of the solution is homotopically non-trivial. Consistency with string theory requires smooth geometric U-folds to be glued using subgroups of the effective discrete U-duality group, implying that the fundamental group of the scalar manifold of such solutions must be a subgroup of the latter. We construct simple examples of geometric U-folds in a generalization of the axion-dilaton model of \

  20. 5th Dagstuhl Seminar on Geometric Modelling

    CERN Document Server

    Brunnett, Guido; Farin, Gerald; Goldman, Ron

    2004-01-01

    In 19 articles presented by leading experts in the field of geometric modelling the state-of-the-art on representing, modeling, and analyzing curves, surfaces as well as other 3-dimensional geometry is given. The range of applications include CAD/CAM-systems, computer graphics, scientific visualization, virtual reality, simulation and medical imaging. The content of this book is based on selected lectures given at a workshop held at IBFI Schloss Dagstuhl, Germany. Topics treated are: – curve and surface modelling – non-manifold modelling in CAD – multiresolution analysis of complex geometric models – surface reconstruction – variational design – computational geometry of curves and surfaces – 3D meshing – geometric modelling for scientific visualization – geometric models for biomedical applications

  1. The perception of geometrical structure from congruence

    Science.gov (United States)

    Lappin, Joseph S.; Wason, Thomas D.

    1989-01-01

    The principle function of vision is to measure the environment. As demonstrated by the coordination of motor actions with the positions and trajectories of moving objects in cluttered environments and by rapid recognition of solid objects in varying contexts from changing perspectives, vision provides real-time information about the geometrical structure and location of environmental objects and events. The geometric information provided by 2-D spatial displays is examined. It is proposed that the geometry of this information is best understood not within the traditional framework of perspective trigonometry, but in terms of the structure of qualitative relations defined by congruences among intrinsic geometric relations in images of surfaces. The basic concepts of this geometrical theory are outlined.

  2. Mechanisms of geometrical seismic attenuation

    Directory of Open Access Journals (Sweden)

    Igor B. Morozov

    2011-07-01

    Full Text Available In several recent reports, we have explained the frequency dependence of the apparent seismic quality-factor (Q observed in many studies according to the effects of geometrical attenuation, which was defined as the zero-frequency limit of the temporal attenuation coefficient. In particular, geometrical attenuation was found to be positive for most waves traveling within the lithosphere. Here, we present three theoretical models that illustrate the origin of this geometrical attenuation, and we investigate the causes of its preferential positive values. In addition, we discuss the physical basis and limitations of both the conventional and new attenuation models. For waves in media with slowly varying properties, geometrical attenuation is caused by variations in the wavefront curvature, which can be both positive (for defocusing and negative (for focusing. In media with velocity/density contrasts, incoherent reflectivity leads to geometrical-attenuation coefficients which are proportional to the mean squared reflectivity and are always positive. For «coherent» reflectivity, the geometrical attenuation is approximately zero, and the attenuation process can be described according to the concept of «scattering Q». However, the true meaning of this parameter is in describing the mean reflectivity within the medium, and not that of the traditional resonator quality factor known in mechanics. The general conclusion from these models is that non-zero and often positive levels of geometrical attenuation are common in realistic, heterogeneous media, both observationally and theoretically. When transformed into the conventional Q-factor form, this positive geometrical attenuation leads to Q values that quickly increase with frequency. These predictions show that the positive frequency-dependent Q observed in many datasets might represent artifacts of the transformations of the attenuation coefficients into Q.

  1. Rank-dependant factorization of entanglement evolution

    International Nuclear Information System (INIS)

    Siomau, Michael

    2016-01-01

    Highlights: • In some cases the complex entanglement evolution can be factorized on simple terms. • We suggest factorization equations for multiqubit entanglement evolution. • The factorization is solely defined by the rank of the final state density matrices. • The factorization is independent on the local noisy channels and initial pure states. - Abstract: The description of the entanglement evolution of a complex quantum system can be significantly simplified due to the symmetries of the initial state and the quantum channels, which simultaneously affect parts of the system. Using concurrence as the entanglement measure, we study the entanglement evolution of few qubit systems, when each of the qubits is affected by a local unital channel independently on the others. We found that for low-rank density matrices of the final quantum state, such complex entanglement dynamics can be completely described by a combination of independent factors representing the evolution of entanglement of the initial state, when just one of the qubits is affected by a local channel. We suggest necessary conditions for the rank of the density matrices to represent the entanglement evolution through the factors. Our finding is supported with analytical examples and numerical simulations.

  2. Fourth-rank gravity and cosmology

    International Nuclear Information System (INIS)

    Marrakchi, A.L.; Tapia, V.

    1992-07-01

    We consider the consequences of describing the metric properties of space-time through a quartic line element. The associated ''metric'' is a fourth-rank tensor G μυλπ . In order to recover a Riemannian behaviour of the geometry it is necessary to have G μυλπ = g (μυ g λπ) . We construct a theory for the gravitational field based on the fourth-rank metric G μυλπ . In the absence of matter the fourth-rank metric becomes separable and the theory coincides with General Relativity. In the presence of matter we can maintain Riemmanianicity, but now gravitation couples, as compared to General Relativity, in a different way to matter. We develop a simple cosmological model based on a FRW metric with matter described by a perfect fluid. For the present time the field equations are compatible with k OBS = O and Ω OBS t CLAS approx. 10 20 t PLANCK approx. 10 -23 s. Our final and most important result is the fact that the entropy is an increasing function of time. When interpreted at the light of General Relativity the treatment is shown to be almost equivalent to that of the standard model of cosmology combined with the inflationary scenario. (author). 16 refs, 1 fig

  3. Ranking agility factors affecting hospitals in Iran

    Directory of Open Access Journals (Sweden)

    M. Abdi Talarposht

    2017-04-01

    Full Text Available Background: Agility is an effective response to the changing and unpredictable environment and using these changes as opportunities for organizational improvement. Objective: The aim of the present study was to rank the factors affecting agile supply chain of hospitals of Iran. Methods: This applied study was conducted by cross sectional-descriptive method at some point of 2015 for one year. The research population included managers, administrators, faculty members and experts were selected hospitals. A total of 260 people were selected as sample from the health centers. The construct validity of the questionnaire was approved by confirmatory factor analysis test and its reliability was approved by Cronbach's alpha (α=0.97. All data were analyzed by Kolmogorov-Smirnov, Chi-square and Friedman tests. Findings: The development of staff skills, the use of information technology, the integration of processes, appropriate planning, and customer satisfaction and product quality had a significant impact on the agility of public hospitals of Iran (P<0.001. New product introductions had earned the highest ranking and the development of staff skills earned the lowest ranking. Conclusion: The new product introduction, market responsiveness and sensitivity, reduce costs, and the integration of organizational processes, ratings better to have acquired agility hospitals in Iran. Therefore, planners and officials of hospitals have to, through the promotion quality and variety of services customer-oriented, providing a basis for investing in the hospital and etc to apply for agility supply chain public hospitals of Iran.

  4. Estimation of rank correlation for clustered data.

    Science.gov (United States)

    Rosner, Bernard; Glynn, Robert J

    2017-06-30

    It is well known that the sample correlation coefficient (R xy ) is the maximum likelihood estimator of the Pearson correlation (ρ xy ) for independent and identically distributed (i.i.d.) bivariate normal data. However, this is not true for ophthalmologic data where X (e.g., visual acuity) and Y (e.g., visual field) are available for each eye and there is positive intraclass correlation for both X and Y in fellow eyes. In this paper, we provide a regression-based approach for obtaining the maximum likelihood estimator of ρ xy for clustered data, which can be implemented using standard mixed effects model software. This method is also extended to allow for estimation of partial correlation by controlling both X and Y for a vector U_ of other covariates. In addition, these methods can be extended to allow for estimation of rank correlation for clustered data by (i) converting ranks of both X and Y to the probit scale, (ii) estimating the Pearson correlation between probit scores for X and Y, and (iii) using the relationship between Pearson and rank correlation for bivariate normally distributed data. The validity of the methods in finite-sized samples is supported by simulation studies. Finally, two examples from ophthalmology and analgesic abuse are used to illustrate the methods. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

  5. Ranking environmental liabilities at a petroleum refinery

    International Nuclear Information System (INIS)

    Lupo, M.

    1995-01-01

    A new computer model is available to allow the management of a petroleum refinery to prioritize environmental action and construct a holistic approach to remediation. A large refinery may have numerous solid waste management units regulated by the Resource Conservation and Recovery Act (RCRA), as well as process units that emit hazardous chemicals into the environment. These sources can impact several environmental media, potentially including the air, the soil, the groundwater, the unsaturated zone water, and surface water. The number of chemicals of concern may be large. The new model is able to rank the sources by considering the impact of each chemical in each medium from each source in terms of concentration, release rate, and a weighted index based on toxicity. In addition to environmental impact, the sources can be ranked in three other ways: (1) by cost to remediate, (2) by environmental risk reduction caused by the remediation in terms of the decreases in release rate, concentration, and weighted index, and (3) by cost-benefit, which is the environmental risk reduction for each source divided by the cost of the remedy. Ranking each unit in the refinery allows management to use its limited environmental resources in a pro-active strategic manner that produces long-term results, rather than in reactive, narrowly focused, costly, regulatory-driven campaigns that produce only short-term results

  6. Iris Template Protection Based on Local Ranking

    Directory of Open Access Journals (Sweden)

    Dongdong Zhao

    2018-01-01

    Full Text Available Biometrics have been widely studied in recent years, and they are increasingly employed in real-world applications. Meanwhile, a number of potential threats to the privacy of biometric data arise. Iris template protection demands that the privacy of iris data should be protected when performing iris recognition. According to the international standard ISO/IEC 24745, iris template protection should satisfy the irreversibility, revocability, and unlinkability. However, existing works about iris template protection demonstrate that it is difficult to satisfy the three privacy requirements simultaneously while supporting effective iris recognition. In this paper, we propose an iris template protection method based on local ranking. Specifically, the iris data are first XORed (Exclusive OR operation with an application-specific string; next, we divide the results into blocks and then partition the blocks into groups. The blocks in each group are ranked according to their decimal values, and original blocks are transformed to their rank values for storage. We also extend the basic method to support the shifting strategy and masking strategy, which are two important strategies for iris recognition. We demonstrate that the proposed method satisfies the irreversibility, revocability, and unlinkability. Experimental results on typical iris datasets (i.e., CASIA-IrisV3-Interval, CASIA-IrisV4-Lamp, UBIRIS-V1-S1, and MMU-V1 show that the proposed method could maintain the recognition performance while protecting the privacy of iris data.

  7. Country-specific determinants of world university rankings.

    Science.gov (United States)

    Pietrucha, Jacek

    2018-01-01

    This paper examines country-specific factors that affect the three most influential world university rankings (the Academic Ranking of World Universities, the QS World University Ranking, and the Times Higher Education World University Ranking). We run a cross sectional regression that covers 42-71 countries (depending on the ranking and data availability). We show that the position of universities from a country in the ranking is determined by the following country-specific variables: economic potential of the country, research and development expenditure, long-term political stability (freedom from war, occupation, coups and major changes in the political system), and institutional variables, including government effectiveness.

  8. Ranking U-Sapiens 2010-2

    Directory of Open Access Journals (Sweden)

    Carlos-Roberto Peña-Barrera

    2011-08-01

    Full Text Available Los principales objetivos de esta investigación son los siguientes: (1 que la comunidad científica nacional e internacional y la sociedad en general co-nozcan los resultados del Ranking U-Sapiens Colombia 2010_2, el cual clasifica a cada institución de educación superior colombiana según puntaje, posición y cuartil; (2 destacar los movimientos más importantes al comparar los resultados del ranking 2010_1 con los del 2010_2; (3 publicar las respuestas de algunos actores de la academia nacional con respecto a la dinámica de la investigación en el país; (4 reconocer algunas instituciones, medios de comunicación e investigadores que se han interesado a modo de reflexión, referenciación o citación por esta investigación; y (5 dar a conocer el «Sello Ranking U-Sapiens Colombia» para las IES clasificadas. El alcance de este estudio en cuanto a actores abordó todas y cada una de las IES nacionales (aunque solo algunas lograran entrar al ranking y en cuanto a tiempo, un periodo referido al primer semestre de 2010 con respecto a: (1 los resultados 2010-1 de revistas indexadas en Publindex, (2 los programas de maestrías y doctorados activos durante 2010-1 según el Ministerio de Educación Nacional, y (3 los resultados de grupos de investigación clasificados para 2010 según Colciencias. El método empleado para esta investigación es el mismo que para el ranking 2010_1, salvo por una especificación aún más detallada en uno de los pasos del modelo (las variables α, β, γ; es completamente cuantitativo y los datos de las variables que fundamentan sus resultados provienen de Colciencias y el Ministerio de Educación Nacional; y en esta ocasión se darán a conocer los resultados por variable para 2010_1 y 2010_2. Los resultados más relevantes son estos: (1 entraron 8 IES al ranking y salieron 3; (2 las 3 primeras IES son públicas; (3 en total hay 6 instituciones universitarias en el ranking; (4 7 de las 10 primeras IES son

  9. Morphing of geometric composites via residual swelling.

    Science.gov (United States)

    Pezzulla, Matteo; Shillig, Steven A; Nardinocchi, Paola; Holmes, Douglas P

    2015-08-07

    Understanding and controlling the shape of thin, soft objects has been the focus of significant research efforts among physicists, biologists, and engineers in the last decade. These studies aim to utilize advanced materials in novel, adaptive ways such as fabricating smart actuators or mimicking living tissues. Here, we present the controlled growth-like morphing of 2D sheets into 3D shapes by preparing geometric composite structures that deform by residual swelling. The morphing of these geometric composites is dictated by both swelling and geometry, with diffusion controlling the swelling-induced actuation, and geometric confinement dictating the structure's deformed shape. Building on a simple mechanical analog, we present an analytical model that quantitatively describes how the Gaussian and mean curvatures of a thin disk are affected by the interplay among geometry, mechanics, and swelling. This model is in excellent agreement with our experiments and numerics. We show that the dynamics of residual swelling is dictated by a competition between two characteristic diffusive length scales governed by geometry. Our results provide the first 2D analog of Timoshenko's classical formula for the thermal bending of bimetallic beams - our generalization explains how the Gaussian curvature of a 2D geometric composite is affected by geometry and elasticity. The understanding conferred by these results suggests that the controlled shaping of geometric composites may provide a simple complement to traditional manufacturing techniques.

  10. Geometric phases and hidden local gauge symmetry

    International Nuclear Information System (INIS)

    Fujikawa, Kazuo

    2005-01-01

    The analysis of geometric phases associated with level crossing is reduced to the familiar diagonalization of the Hamiltonian in the second quantized formulation. A hidden local gauge symmetry, which is associated with the arbitrariness of the phase choice of a complete orthonormal basis set, becomes explicit in this formulation (in particular, in the adiabatic approximation) and specifies physical observables. The choice of a basis set which specifies the coordinate in the functional space is arbitrary in the second quantization, and a subclass of coordinate transformations, which keeps the form of the action invariant, is recognized as the gauge symmetry. We discuss the implications of this hidden local gauge symmetry in detail by analyzing geometric phases for cyclic and noncyclic evolutions. It is shown that the hidden local symmetry provides a basic concept alternative to the notion of holonomy to analyze geometric phases and that the analysis based on the hidden local gauge symmetry leads to results consistent with the general prescription of Pancharatnam. We however note an important difference between the geometric phases for cyclic and noncyclic evolutions. We also explain a basic difference between our hidden local gauge symmetry and a gauge symmetry (or equivalence class) used by Aharonov and Anandan in their definition of generalized geometric phases

  11. Generalized unitaries and the Picard group

    Indian Academy of Sciences (India)

    some explicit calculations of that type.) So the range of this .... when we restrict our attention to generalized unitaries and full modules, that is, to modules. E for which BE = B. For every ..... without dividing out equivalence classes. But there is no ...

  12. Ranking the Online Documents Based on Relative Credibility Measures

    Directory of Open Access Journals (Sweden)

    Ahmad Dahlan

    2013-09-01

    Full Text Available Information searching is the most popular activity in Internet. Usually the search engine provides the search results ranked by the relevance. However, for a certain purpose that concerns with information credibility, particularly citing information for scientific works, another approach of ranking the search engine results is required. This paper presents a study on developing a new ranking method based on the credibility of information. The method is built up upon two well-known algorithms, PageRank and Citation Analysis. The result of the experiment that used Spearman Rank Correlation Coefficient to compare the proposed rank (generated by the method with the standard rank (generated manually by a group of experts showed that the average Spearman 0 < rS < critical value. It means that the correlation was proven but it was not significant. Hence the proposed rank does not satisfy the standard but the performance could be improved.

  13. Ranking the Online Documents Based on Relative Credibility Measures

    Directory of Open Access Journals (Sweden)

    Ahmad Dahlan

    2009-05-01

    Full Text Available Information searching is the most popular activity in Internet. Usually the search engine provides the search results ranked by the relevance. However, for a certain purpose that concerns with information credibility, particularly citing information for scientific works, another approach of ranking the search engine results is required. This paper presents a study on developing a new ranking method based on the credibility of information. The method is built up upon two well-known algorithms, PageRank and Citation Analysis. The result of the experiment that used Spearman Rank Correlation Coefficient to compare the proposed rank (generated by the method with the standard rank (generated manually by a group of experts showed that the average Spearman 0 < rS < critical value. It means that the correlation was proven but it was not significant. Hence the proposed rank does not satisfy the standard but the performance could be improved.

  14. Algebraic and computational aspects of real tensor ranks

    CERN Document Server

    Sakata, Toshio; Miyazaki, Mitsuhiro

    2016-01-01

    This book provides comprehensive summaries of theoretical (algebraic) and computational aspects of tensor ranks, maximal ranks, and typical ranks, over the real number field. Although tensor ranks have been often argued in the complex number field, it should be emphasized that this book treats real tensor ranks, which have direct applications in statistics. The book provides several interesting ideas, including determinant polynomials, determinantal ideals, absolutely nonsingular tensors, absolutely full column rank tensors, and their connection to bilinear maps and Hurwitz-Radon numbers. In addition to reviews of methods to determine real tensor ranks in details, global theories such as the Jacobian method are also reviewed in details. The book includes as well an accessible and comprehensive introduction of mathematical backgrounds, with basics of positive polynomials and calculations by using the Groebner basis. Furthermore, this book provides insights into numerical methods of finding tensor ranks through...

  15. On Locally Most Powerful Sequential Rank Tests

    Czech Academy of Sciences Publication Activity Database

    Kalina, Jan

    2017-01-01

    Roč. 36, č. 1 (2017), s. 111-125 ISSN 0747-4946 R&D Projects: GA ČR GA17-07384S Grant - others:Nadační fond na podporu vědy(CZ) Neuron Institutional support: RVO:67985556 Keywords : nonparametric test s * sequential ranks * stopping variable Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.339, year: 2016 http://library.utia.cas.cz/separaty/2017/SI/kalina-0474065.pdf

  16. Motion in fourth-rank gravity

    International Nuclear Information System (INIS)

    Tapia, V.

    1992-04-01

    Recently we have explored the consequences of describing the metric properties of our universe through a quartic line element. In this geometry the natural object is a fourth-rank metric, i.e., a tensor with four indices. Based on this geometry we constructed a simple field theory for the gravitational field. The field equations coincide with the Einstein field equations in the vacuum case. This fact, however, does not guarantee the observational equivalence of both theories since one must still verify that, as a consequence of the field equations, test particles move along geodesics. This letter is aimed at establishing this result. (author). 7 refs

  17. Classical impurities associated to high rank algebras

    Energy Technology Data Exchange (ETDEWEB)

    Doikou, Anastasia, E-mail: A.Doikou@hw.ac.uk [Department of Mathematics, Heriot–Watt University, EH14 4AS, Edinburgh (United Kingdom); Department of Computer Engineering and Informatics, University of Patras, Patras GR-26500 (Greece)

    2014-07-15

    Classical integrable impurities associated with high rank (gl{sub N}) algebras are investigated. A particular prototype, i.e. the vector non-linear Schrödinger (NLS) model, is chosen as an example. A systematic construction of local integrals of motion as well as the time components of the corresponding Lax pairs is presented based on the underlying classical algebra. Suitable gluing conditions compatible with integrability are also extracted. The defect contribution is also examined in the case where non-trivial integrable conditions are implemented. It turns out that the integrable boundaries may drastically alter the bulk behavior, and in particular the defect contribution.

  18. Low-rank driving in quantum systems

    International Nuclear Information System (INIS)

    Burkey, R.S.

    1989-01-01

    A new property of quantum systems called low-rank driving is introduced. Numerous simplifications in the solution of the time-dependent Schroedinger equation are pointed out for systems having this property. These simplifications are in the areas of finding eigenvalues, taking the Laplace transform, converting Schroedinger's equation to an integral form, discretizing the continuum, generalizing the Weisskopf-Wigner approximation, band-diagonalizing the Hamiltonian, finding new exact solutions to Schroedinger's equation, and so forth. The principal physical application considered is the phenomenon of coherent populations-trapping in continuum-continuum interactions

  19. Classical impurities associated to high rank algebras

    International Nuclear Information System (INIS)

    Doikou, Anastasia

    2014-01-01

    Classical integrable impurities associated with high rank (gl N ) algebras are investigated. A particular prototype, i.e. the vector non-linear Schrödinger (NLS) model, is chosen as an example. A systematic construction of local integrals of motion as well as the time components of the corresponding Lax pairs is presented based on the underlying classical algebra. Suitable gluing conditions compatible with integrability are also extracted. The defect contribution is also examined in the case where non-trivial integrable conditions are implemented. It turns out that the integrable boundaries may drastically alter the bulk behavior, and in particular the defect contribution

  20. Geometric inequalities for axially symmetric black holes

    International Nuclear Information System (INIS)

    Dain, Sergio

    2012-01-01

    A geometric inequality in general relativity relates quantities that have both a physical interpretation and a geometrical definition. It is well known that the parameters that characterize the Kerr-Newman black hole satisfy several important geometric inequalities. Remarkably enough, some of these inequalities also hold for dynamical black holes. This kind of inequalities play an important role in the characterization of the gravitational collapse; they are closely related with the cosmic censorship conjecture. Axially symmetric black holes are the natural candidates to study these inequalities because the quasi-local angular momentum is well defined for them. We review recent results in this subject and we also describe the main ideas behind the proofs. Finally, a list of relevant open problems is presented. (topical review)

  1. MM Algorithms for Geometric and Signomial Programming.

    Science.gov (United States)

    Lange, Kenneth; Zhou, Hua

    2014-02-01

    This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates.

  2. The Geometric Phase of Stock Trading.

    Science.gov (United States)

    Altafini, Claudio

    2016-01-01

    Geometric phases describe how in a continuous-time dynamical system the displacement of a variable (called phase variable) can be related to other variables (shape variables) undergoing a cyclic motion, according to an area rule. The aim of this paper is to show that geometric phases can exist also for discrete-time systems, and even when the cycles in shape space have zero area. A context in which this principle can be applied is stock trading. A zero-area cycle in shape space represents the type of trading operations normally carried out by high-frequency traders (entering and exiting a position on a fast time-scale), while the phase variable represents the cash balance of a trader. Under the assumption that trading impacts stock prices, even zero-area cyclic trading operations can induce geometric phases, i.e., profits or losses, without affecting the stock quote.

  3. Exponentiated Lomax Geometric Distribution: Properties and Applications

    Directory of Open Access Journals (Sweden)

    Amal Soliman Hassan

    2017-09-01

    Full Text Available In this paper, a new four-parameter lifetime distribution, called the exponentiated Lomax geometric (ELG is introduced. The new lifetime distribution contains the Lomax geometric and exponentiated Pareto geometric as new sub-models. Explicit algebraic formulas of probability density function, survival and hazard functions are derived. Various structural properties of the new model are derived including; quantile function, Re'nyi entropy, moments, probability weighted moments, order statistic, Lorenz and Bonferroni curves. The estimation of the model parameters is performed by maximum likelihood method and inference for a large sample is discussed. The flexibility and potentiality of the new model in comparison with some other distributions are shown via an application to a real data set. We hope that the new model will be an adequate model for applications in various studies.

  4. Normed algebras and the geometric series test

    Directory of Open Access Journals (Sweden)

    Robert Kantrowitz

    2017-11-01

    Full Text Available The purpose of this article is to survey a class of normed algebras that share many central features of Banach algebras, save for completeness. The likeness of these algebras to Banach algebras derives from the fact that the geometric series test is valid, whereas the lack of completeness points to the failure of the absolute convergence test for series in the algebra. Our main result is a compendium of conditions that are all equivalent to the validity of the geometric series test for commutative unital normed algebras. Several examples in the final section showcase some incomplete normed algebras for which the geometric series test is valid, and still others for which it is not.

  5. Geometric function theory in higher dimension

    CERN Document Server

    2017-01-01

    The book collects the most relevant outcomes from the INdAM Workshop “Geometric Function Theory in Higher Dimension” held in Cortona on September 5-9, 2016. The Workshop was mainly devoted to discussions of basic open problems in the area, and this volume follows the same line. In particular, it offers a selection of original contributions on Loewner theory in one and higher dimensions, semigroups theory, iteration theory and related topics. Written by experts in geometric function theory in one and several complex variables, it focuses on new research frontiers in this area and on challenging open problems. The book is intended for graduate students and researchers working in complex analysis, several complex variables and geometric function theory.

  6. EARLY HISTORY OF GEOMETRIC PROBABILITY AND STEREOLOGY

    Directory of Open Access Journals (Sweden)

    Magdalena Hykšová

    2012-03-01

    Full Text Available The paper provides an account of the history of geometric probability and stereology from the time of Newton to the early 20th century. It depicts the development of two parallel ways: on one hand, the theory of geometric probability was formed with minor attention paid to other applications than those concerning spatial chance games. On the other hand, practical rules of the estimation of area or volume fraction and other characteristics, easily deducible from geometric probability theory, were proposed without the knowledge of this branch. A special attention is paid to the paper of J.-É. Barbier published in 1860, which contained the fundamental stereological formulas, but remained almost unnoticed both by mathematicians and practicians.

  7. Geometric optimization and sums of algebraic functions

    KAUST Repository

    Vigneron, Antoine E.

    2014-01-01

    We present a new optimization technique that yields the first FPTAS for several geometric problems. These problems reduce to optimizing a sum of nonnegative, constant description complexity algebraic functions. We first give an FPTAS for optimizing such a sum of algebraic functions, and then we apply it to several geometric optimization problems. We obtain the first FPTAS for two fundamental geometric shape-matching problems in fixed dimension: maximizing the volume of overlap of two polyhedra under rigid motions and minimizing their symmetric difference. We obtain the first FPTAS for other problems in fixed dimension, such as computing an optimal ray in a weighted subdivision, finding the largest axially symmetric subset of a polyhedron, and computing minimum-area hulls.

  8. Understanding geometric algebra for electromagnetic theory

    CERN Document Server

    Arthur, John W

    2011-01-01

    "This book aims to disseminate geometric algebra as a straightforward mathematical tool set for working with and understanding classical electromagnetic theory. It's target readership is anyone who has some knowledge of electromagnetic theory, predominantly ordinary scientists and engineers who use it in the course of their work, or postgraduate students and senior undergraduates who are seeking to broaden their knowledge and increase their understanding of the subject. It is assumed that the reader is not a mathematical specialist and is neither familiar with geometric algebra or its application to electromagnetic theory. The modern approach, geometric algebra, is the mathematical tool set we should all have started out with and once the reader has a grasp of the subject, he or she cannot fail to realize that traditional vector analysis is really awkward and even misleading by comparison"--Provided by publisher.

  9. Spherical projections and liftings in geometric tomography

    DEFF Research Database (Denmark)

    Goodey, Paul; Kiderlen, Markus; Weil, Wolfgang

    2011-01-01

    We consider a variety of integral transforms arising in Geometric Tomography. It will be shown that these can be put into a common framework using spherical projection and lifting operators. These operators will be applied to support functions and surface area measures of convex bodies and to rad......We consider a variety of integral transforms arising in Geometric Tomography. It will be shown that these can be put into a common framework using spherical projection and lifting operators. These operators will be applied to support functions and surface area measures of convex bodies...... and to radial functions of star bodies. We then investigate averages of lifted projections and show that they correspond to self-adjoint intertwining operators. We obtain formulas for the eigenvalues of these operators and use them to ascertain circumstances under which tomographic measurements determine...... the original bodies. This approach via mean lifted projections leads us to some unexpected relationships between seemingly disparate geometric constructions....

  10. The effect of photometric and geometric context on photometric and geometric lightness effects.

    Science.gov (United States)

    Lee, Thomas Y; Brainard, David H

    2014-01-24

    We measured the lightness of probe tabs embedded at different orientations in various contextual images presented on a computer-controlled stereo display. Two background context planes met along a horizontal roof-like ridge. Each plane was a graphic rendering of a set of achromatic surfaces with the simulated illumination for each plane controlled independently. Photometric context was varied by changing the difference in simulated illumination intensity between the two background planes. Geometric context was varied by changing the angle between them. We parsed the data into separate photometric effects and geometric effects. For fixed geometry, varying photometric context led to linear changes in both the photometric and geometric effects. Varying geometric context did not produce a statistically reliable change in either the photometric or geometric effects.

  11. Two Ranking Methods of Single Valued Triangular Neutrosophic Numbers to Rank and Evaluate Information Systems Quality

    Directory of Open Access Journals (Sweden)

    Samah Ibrahim Abdel Aal

    2018-03-01

    Full Text Available The concept of neutrosophic can provide a generalization of fuzzy set and intuitionistic fuzzy set that make it is the best fit in representing indeterminacy and uncertainty. Single Valued Triangular Numbers (SVTrN-numbers is a special case of neutrosophic set that can handle ill-known quantity very difficult problems. This work intended to introduce a framework with two types of ranking methods. The results indicated that each ranking method has its own advantage. In this perspective, the weighted value and ambiguity based method gives more attention to uncertainty in ranking and evaluating ISQ as well as it takes into account cut sets of SVTrN numbers that can reflect the information on Truth-membership-membership degree, false membership-membership degree and Indeterminacy-membership degree. The value index and ambiguity index method can reflect the decision maker's subjectivity attitude to the SVTrN- numbers.

  12. The BiPublishers ranking: Main results and methodological problems when constructing rankings of academic publishers

    Directory of Open Access Journals (Sweden)

    Torres-Salinas, Daniel

    2015-12-01

    Full Text Available We present the results of the Bibliometric Indicators for Publishers project (also known as BiPublishers. This project represents the first attempt to systematically develop bibliometric publisher rankings. The data for this project was derived from the Book Citation Index and the study time period was 2009-2013. We have developed 42 rankings: 4 by fields and 38 by disciplines. We display six indicators for publishers divided into three types: output, impact and publisher’s profile. The aim is to capture different characteristics of the research performance of publishers. 254 publishers were processed and classified according to publisher type: commercial publishers and university presses. We present the main publishers by field and then discuss the principal challenges presented when developing this type of tool. The BiPublishers ranking is an on-going project which aims to develop and explore new data sources and indicators to better capture and define the research impact of publishers.Presentamos los resultados del proyecto Bibliometric Indicators for Publishers (BiPublishers. Es el primer proyecto que desarrolla de manera sistemática rankings bibliométricos de editoriales. La fuente de datos empleada es el Book Citation Index y el periodo de análisis 2009-2013. Se presentan 42 rankings: 4 por áreas y 38 por disciplinas. Mostramos seis indicadores por editorial divididos según su tipología: producción, impacto y características editoriales. Se procesaron 254 editoriales y se clasificaron según el tipo: comerciales y universitarias. Se presentan las principales editoriales por áreas. Después, se discuten los principales retos a superar en el desarrollo de este tipo de herramientas. El ranking Bipublishers es un proyecto en desarrollo que persigue analizar y explorar nuevas fuentes de datos e indicadores para captar y definir el impacto de las editoriales académicas.

  13. Generalized PageRank on Directed Configuration Networks

    NARCIS (Netherlands)

    Chen, Ningyuan; Litvak, Nelli; Olvera-Cravioto, Mariana

    2017-01-01

    Note: formula is not displayed correctly. This paper studies the distribution of a family of rankings, which includes Google’s PageRank, on a directed configuration model. In particular, it is shown that the distribution of the rank of a randomly chosen node in the graph converges in distribution to

  14. PageRank in scale-free random graphs

    NARCIS (Netherlands)

    Chen, Ningyuan; Litvak, Nelli; Olvera-Cravioto, Mariana; Bonata, Anthony; Chung, Fan; Pralat, Paweł

    2014-01-01

    We analyze the distribution of PageRank on a directed configuration model and show that as the size of the graph grows to infinity, the PageRank of a randomly chosen node can be closely approximated by the PageRank of the root node of an appropriately constructed tree. This tree approximation is in

  15. Ranking Quality in Higher Education: Guiding or Misleading?

    Science.gov (United States)

    Bergseth, Brita; Petocz, Peter; Abrandt Dahlgren, Madeleine

    2014-01-01

    The study examines two different models of measuring, assessing and ranking quality in higher education. Do different systems of quality assessment lead to equivalent conclusions about the quality of education? This comparative study is based on the rankings of 24 Swedish higher education institutions. Two ranking actors have independently…

  16. Revisiting the Relationship between Institutional Rank and Student Engagement

    Science.gov (United States)

    Zilvinskis, John; Louis Rocconi

    2018-01-01

    College rankings dominate the conversation regarding quality in postsecondary education. However, the criteria used to rank institutions often have nothing to do with the quality of education students receive. A decade ago, Pike (2004) demonstrated that institutional rank had little association with student involvement in educational activities.…

  17. Academic Ranking--From Its Genesis to Its International Expansion

    Science.gov (United States)

    Vieira, Rosilene C.; Lima, Manolita C.

    2015-01-01

    Given the visibility and popularity of rankings that encompass the measurement of quality of post-graduate courses, for instance, the MBA (Master of Business Administration) or graduate studies program (MSc and PhD) as do global academic rankings--Academic Ranking of World Universities-ARWU, Times Higher/Thomson Reuters World University Ranking…

  18. 7 CFR 1491.6 - Ranking considerations and proposal selection.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 10 2010-01-01 2010-01-01 false Ranking considerations and proposal selection. 1491.6... PROGRAM General Provisions § 1491.6 Ranking considerations and proposal selection. (a) Before the State.... The national ranking criteria will be established by the Chief and the State criteria will be...

  19. 46 CFR 282.11 - Ranking of flags.

    Science.gov (United States)

    2010-10-01

    ... 46 Shipping 8 2010-10-01 2010-10-01 false Ranking of flags. 282.11 Section 282.11 Shipping... COMMERCE OF THE UNITED STATES Foreign-Flag Competition § 282.11 Ranking of flags. The operators under each... priority of costs which are representative of the flag. For liner cargo vessels, the ranking of operators...

  20. 10 CFR 455.131 - State ranking of grant applications.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 3 2010-01-01 2010-01-01 false State ranking of grant applications. 455.131 Section 455... State ranking of grant applications. (a) Except as provided by § 455.92 of this part, all eligible... audit or energy use evaluation pursuant to § 455.20(k). Each State shall develop separate rankings for...

  1. Control by Numbers: New Managerialism and Ranking in Higher Education

    Science.gov (United States)

    Lynch, Kathleen

    2015-01-01

    This paper analyses the role of rankings as an instrument of new managerialism. It shows how rankings are reconstituting the purpose of universities, the role of academics and the definition of what it is to be a student. The paper opens by examining the forces that have facilitated the emergence of the ranking industry and the ideologies…

  2. Paired comparisons analysis: an axiomatic approach to ranking methods

    NARCIS (Netherlands)

    Gonzalez-Diaz, J.; Hendrickx, Ruud; Lohmann, E.R.M.A.

    2014-01-01

    In this paper we present an axiomatic analysis of several ranking methods for general tournaments. We find that the ranking method obtained by applying maximum likelihood to the (Zermelo-)Bradley-Terry model, the most common method in statistics and psychology, is one of the ranking methods that

  3. Extracting Rankings for Spatial Keyword Queries from GPS Data

    DEFF Research Database (Denmark)

    Keles, Ilkcan; Jensen, Christian Søndergaard; Saltenis, Simonas

    2018-01-01

    Studies suggest that many search engine queries have local intent. We consider the evaluation of ranking functions important for such queries. The key challenge is to be able to determine the “best” ranking for a query, as this enables evaluation of the results of ranking functions. We propose...

  4. Tutorial: Calculating Percentile Rank and Percentile Norms Using SPSS

    Science.gov (United States)

    Baumgartner, Ted A.

    2009-01-01

    Practitioners can benefit from using norms, but they often have to develop their own percentile rank and percentile norms. This article is a tutorial on how to quickly and easily calculate percentile rank and percentile norms using SPSS, and this information is presented for a data set. Some issues in calculating percentile rank and percentile…

  5. Variation in rank abundance replicate samples and impact of clustering

    NARCIS (Netherlands)

    Neuteboom, J.H.; Struik, P.C.

    2005-01-01

    Calculating a single-sample rank abundance curve by using the negative-binomial distribution provides a way to investigate the variability within rank abundance replicate samples and yields a measure of the degree of heterogeneity of the sampled community. The calculation of the single-sample rank

  6. A Fast Algorithm for Generating Permutation Distribution of Ranks in ...

    African Journals Online (AJOL)

    ... function of the distribution of the ranks. This further gives insight into the permutation distribution of a rank statistics. The algorithm is implemented with the aid of the computer algebra system Mathematica. Key words: Combinatorics, generating function, permutation distribution, rank statistics, partitions, computer algebra.

  7. Sudan-decoding generalized geometric Goppa codes

    DEFF Research Database (Denmark)

    Heydtmann, Agnes Eileen

    2003-01-01

    Generalized geometric Goppa codes are vector spaces of n-tuples with entries from different extension fields of a ground field. They are derived from evaluating functions similar to conventional geometric Goppa codes, but allowing evaluation in places of arbitrary degree. A decoding scheme...... for these codes based on Sudan's improved algorithm is presented and its error-correcting capacity is analyzed. For the implementation of the algorithm it is necessary that the so-called increasing zero bases of certain spaces of functions are available. A method to obtain such bases is developed....

  8. The geometric phase in quantum physics

    International Nuclear Information System (INIS)

    Bohm, A.

    1993-03-01

    After an explanatory introduction, a quantum system in a classical time-dependent environment is discussed; an example is a magnetic moment in a classical magnetic field. At first, the general abelian case is discussed in the adiabatic approximation. Then the geometric phase for nonadiabatic change of the environment (Anandan--Aharonov phase) is introduced, and after that general cyclic (nonadiabatic) evolution is discussed. The mathematics of fiber bundles is introduced, and some of its results are used to describe the relation between the adiabatic Berry phase and the geometric phase for general cyclic evolution of a pure state. The discussion is restricted to the abelian, U(1) phase

  9. Geometric modular action and transformation groups

    International Nuclear Information System (INIS)

    Summers, S.J.

    1996-01-01

    We study a weak form of geometric modular action, which is naturally associated with transformation groups of partially ordered sets and which provides these groups with projective representations. Under suitable conditions it is shown that these groups are implemented by point transformations of topological spaces serving as models for space-times, leading to groups which may be interpreted as symmetry groups of the space-times. As concrete examples, it is shown that the Poincare group and the de Sitter group can be derived from this condition of geometric modular action. Further consequences and examples are discussed. (orig.)

  10. Geometrical methods for power network analysis

    Energy Technology Data Exchange (ETDEWEB)

    Bellucci, Stefano; Tiwari, Bhupendra Nath [Istituto Nazioneale di Fisica Nucleare, Frascati, Rome (Italy). Lab. Nazionali di Frascati; Gupta, Neeraj [Indian Institute of Technology, Kanpur (India). Dept. of Electrical Engineering

    2013-02-01

    Uses advanced geometrical methods to analyse power networks. Provides a self-contained and tutorial introduction. Includes a fully worked-out example for the IEEE 5 bus system. This book is a short introduction to power system planning and operation using advanced geometrical methods. The approach is based on well-known insights and techniques developed in theoretical physics in the context of Riemannian manifolds. The proof of principle and robustness of this approach is examined in the context of the IEEE 5 bus system. This work addresses applied mathematicians, theoretical physicists and power engineers interested in novel mathematical approaches to power network theory.

  11. Aspects of the geometrical approach to supermanifolds

    International Nuclear Information System (INIS)

    Rogers, A.

    1984-01-01

    Various topics in the theory and application of the geometrical approach to supermanifolds are discussed. The construction of the superspace used in supergravity over an arbitrary spacetime manifold is described. Super Lie groups and their relation to graded Lie algebras (and more general structures referred to as 'graded Lie modules') are discussed, with examples. Certain supermanifolds, allowed in the geometric approach (using the fine topology), but having no analogue in the algebraic approach, are discussed. Finally lattice supersymmetry, and its relation to the differential geometry of supermanifolds, is discussed. (orig.)

  12. Geometrical superresolved imaging using nonperiodic spatial masking.

    Science.gov (United States)

    Borkowski, Amikam; Zalevsky, Zeev; Javidi, Bahram

    2009-03-01

    The resolution of every imaging system is limited either by the F-number of its optics or by the geometry of its detection array. The geometrical limitation is caused by lack of spatial sampling points as well as by the shape of every sampling pixel that generates spectral low-pass filtering. We present a novel approach to overcome the low-pass filtering that is due to the shape of the sampling pixels. The approach combines special algorithms together with spatial masking placed in the intermediate image plane and eventually allows geometrical superresolved imaging without relation to the actual shape of the pixels.

  13. Workshop on Topology and Geometric Group Theory

    CERN Document Server

    Fowler, James; Lafont, Jean-Francois; Leary, Ian

    2016-01-01

    This book presents articles at the interface of two active areas of research: classical topology and the relatively new field of geometric group theory. It includes two long survey articles, one on proofs of the Farrell–Jones conjectures, and the other on ends of spaces and groups. In 2010–2011, Ohio State University (OSU) hosted a special year in topology and geometric group theory. Over the course of the year, there were seminars, workshops, short weekend conferences, and a major conference out of which this book resulted. Four other research articles complement these surveys, making this book ideal for graduate students and established mathematicians interested in entering this area of research.

  14. Rank hypocrisies the insult of the REF

    CERN Document Server

    Sayer, Derek

    2015-01-01

    "The REF is right out of Havel's and Kundera's Eastern Europe: a state-administered exercise to rank academic research like hotel chains dependent on the active collaboration of the UK professoriate. In crystalline text steeped in cold rage, Sayer takes aim at the REF's central claim, that it is a legitimate process of expert peer review. He critiques university and national-level REF processes against actual practices of scholarly review as found in academic journals, university presses, and North American tenure procedures. His analysis is damning. If the REF fails as scholarly review, how can academics and universities continue to participate? And how can government use its rankings as a basis for public policy?" - Tarak Barkawi, Reader in the Department of International Relations, London School of Economics "Many academics across the world have come to see the REF as an arrogant attempt to raise national research standards that has resulted in a variety of self-inflicted wounds to UK higher education. Der...

  15. Demographic Ranking of the Baltic Sea States

    Directory of Open Access Journals (Sweden)

    Sluka N.

    2014-06-01

    Full Text Available The relevance of the study lies in the acute need to modernise the tools for a more accurate and comparable reflection of the demographic reality of spatial objects of different scales. This article aims to test the methods of “demographic rankings” developed by Yermakov and Shmakov. The method is based on the principles of indirect standardisation of the major demographic coefficients relative to the age structure.The article describes the first attempt to apply the method to the analysis of birth and mortality rates in 1995 and 2010 for 140 countries against the global average, and for the Baltic Sea states against the European average. The grouping of countries and the analysis of changes over the given period confirmed a number of demographic development trends and the persistence of wide territorial disparities in major indicators. The authors identify opposite trends in ranking based on the standardised birth (country consolidation at the level of averaged values and mortality (polarisation rates. The features of demographic process development in the Baltic regions states are described against the global and European background. The study confirmed the validity of the demographic ranking method, which can be instrumental in solving not only scientific but also practical tasks, including those in the field of demographic and social policy.

  16. Theoretical frameworks for the learning of geometrical reasoning

    OpenAIRE

    Jones, Keith

    1998-01-01

    With the growth in interest in geometrical ideas it is important to be clear about the nature of geometrical reasoning and how it develops. This paper provides an overview of three theoretical frameworks for the learning of geometrical reasoning: the van Hiele model of thinking in geometry, Fischbein’s theory of figural concepts, and Duval’s cognitive model of geometrical reasoning. Each of these frameworks provides theoretical resources to support research into the development of geometrical...

  17. Generalization Performance of Regularized Ranking With Multiscale Kernels.

    Science.gov (United States)

    Zhou, Yicong; Chen, Hong; Lan, Rushi; Pan, Zhibin

    2016-05-01

    The regularized kernel method for the ranking problem has attracted increasing attentions in machine learning. The previous regularized ranking algorithms are usually based on reproducing kernel Hilbert spaces with a single kernel. In this paper, we go beyond this framework by investigating the generalization performance of the regularized ranking with multiscale kernels. A novel ranking algorithm with multiscale kernels is proposed and its representer theorem is proved. We establish the upper bound of the generalization error in terms of the complexity of hypothesis spaces. It shows that the multiscale ranking algorithm can achieve satisfactory learning rates under mild conditions. Experiments demonstrate the effectiveness of the proposed method for drug discovery and recommendation tasks.

  18. Two particle entanglement and its geometric duals

    Energy Technology Data Exchange (ETDEWEB)

    Wasay, Muhammad Abdul [University of Agriculture, Department of Physics, Faisalabad (Pakistan); Quaid-i-Azam University Campus, National Centre for Physics, Islamabad (Pakistan); Bashir, Asma [University of Agriculture, Department of Physics, Faisalabad (Pakistan)

    2017-12-15

    We show that for a system of two entangled particles, there is a dual description to the particle equations in terms of classical theory of conformally stretched spacetime. We also connect these entangled particle equations with Finsler geometry. We show that this duality translates strongly coupled quantum equations in the pilot-wave limit to weakly coupled geometric equations. (orig.)

  19. Impossible Geometric Constructions: A Calculus Writing Project

    Science.gov (United States)

    Awtrey, Chad

    2013-01-01

    This article discusses a writing project that offers students the opportunity to solve one of the most famous geometric problems of Greek antiquity; namely, the impossibility of trisecting the angle [pi]/3. Along the way, students study the history of Greek geometry problems as well as the life and achievements of Carl Friedrich Gauss. Included is…

  20. Rejuvenating Allen's Arc with the Geometric Mean.

    Science.gov (United States)

    Phillips, William A.

    1994-01-01

    Contends that, despite ongoing criticism, Allen's arc elasticity formula remains entrenched in the microeconomics principles curriculum. Reviews the evolution and continuing scrutiny of the formula. Argues that the use of the geometric mean offers pedagogical advantages over the traditional arithmetic mean approach. (CFR)

  1. Geometric Models for Collaborative Search and Filtering

    Science.gov (United States)

    Bitton, Ephrat

    2011-01-01

    This dissertation explores the use of geometric and graphical models for a variety of information search and filtering applications. These models serve to provide an intuitive understanding of the problem domains and as well as computational efficiencies to our solution approaches. We begin by considering a search and rescue scenario where both…

  2. Two particle entanglement and its geometric duals

    International Nuclear Information System (INIS)

    Wasay, Muhammad Abdul; Bashir, Asma

    2017-01-01

    We show that for a system of two entangled particles, there is a dual description to the particle equations in terms of classical theory of conformally stretched spacetime. We also connect these entangled particle equations with Finsler geometry. We show that this duality translates strongly coupled quantum equations in the pilot-wave limit to weakly coupled geometric equations. (orig.)

  3. Geometric Abstract Art and Public Health Data

    Centers for Disease Control (CDC) Podcasts

    2016-10-18

    Dr. Salaam Semaan, a CDC behavioral scientist, discusses the similarities between geometric abstract art and public health data analysis.  Created: 10/18/2016 by National Center for Emerging and Zoonotic Infectious Diseases (NCEZID).   Date Released: 10/18/2016.

  4. Geometric phase topology in weak measurement

    Science.gov (United States)

    Samlan, C. T.; Viswanathan, Nirmal K.

    2017-12-01

    The geometric phase visualization proposed by Bhandari (R Bhandari 1997 Phys. Rep. 281 1-64) in the ellipticity-ellipse orientation basis of the polarization ellipse of light is implemented to understand the geometric aspects of weak measurement. The weak interaction of a pre-selected state, acheived via spin-Hall effect of light (SHEL), results in a spread in the polarization ellipticity (η) or ellipse orientation (χ) depending on the resulting spatial or angular shift, respectively. The post-selection leads to the projection of the η spread in the complementary χ basis results in the appearance of a geometric phase with helical phase topology in the η - χ parameter space. By representing the weak measurement on the Poincaré sphere and using Jones calculus, the complex weak value and the geometric phase topology are obtained. This deeper understanding of the weak measurement process enabled us to explore the techniques’ capabilities maximally, as demonstrated via SHEL in two examples—external reflection at glass-air interface and transmission through a tilted half-wave plate.

  5. Geometrical tile design for complex neighborhoods.

    Science.gov (United States)

    Czeizler, Eugen; Kari, Lila

    2009-01-01

    Recent research has showed that tile systems are one of the most suitable theoretical frameworks for the spatial study and modeling of self-assembly processes, such as the formation of DNA and protein oligomeric structures. A Wang tile is a unit square, with glues on its edges, attaching to other tiles and forming larger and larger structures. Although quite intuitive, the idea of glues placed on the edges of a tile is not always natural for simulating the interactions occurring in some real systems. For example, when considering protein self-assembly, the shape of a protein is the main determinant of its functions and its interactions with other proteins. Our goal is to use geometric tiles, i.e., square tiles with geometrical protrusions on their edges, for simulating tiled paths (zippers) with complex neighborhoods, by ribbons of geometric tiles with simple, local neighborhoods. This paper is a step toward solving the general case of an arbitrary neighborhood, by proposing geometric tile designs that solve the case of a "tall" von Neumann neighborhood, the case of the f-shaped neighborhood, and the case of a 3 x 5 "filled" rectangular neighborhood. The techniques can be combined and generalized to solve the problem in the case of any neighborhood, centered at the tile of reference, and included in a 3 x (2k + 1) rectangle.

  6. Geometric Representations for Discrete Fourier Transforms

    Science.gov (United States)

    Cambell, C. W.

    1986-01-01

    Simple geometric representations show symmetry and periodicity of discrete Fourier transforms (DFT's). Help in visualizing requirements for storing and manipulating transform value in computations. Representations useful in any number of dimensions, but particularly in one-, two-, and three-dimensional cases often encountered in practice.

  7. Geometric Series and Computers--An Application.

    Science.gov (United States)

    McNerney, Charles R.

    1983-01-01

    This article considers the sum of a finite geometric series as applied to numeric data storage in the memory of an electronic digital computer. The presentation is viewed as relevant to programing in several languages and removes some of the mystique associated with syntax constraints that any language imposes. (MP)

  8. Geometric Transformations in Middle School Mathematics Textbooks

    Science.gov (United States)

    Zorin, Barbara

    2011-01-01

    This study analyzed treatment of geometric transformations in presently available middle grades (6, 7, 8) student mathematics textbooks. Fourteen textbooks from four widely used textbook series were evaluated: two mainline publisher series, Pearson (Prentice Hall) and Glencoe (Math Connects); one National Science Foundation (NSF) funded curriculum…

  9. Geometric calibration of ERS satellite SAR images

    DEFF Research Database (Denmark)

    Mohr, Johan Jacob; Madsen, Søren Nørvang

    2001-01-01

    Geometric calibration of the European Remote Sensing (ERS) Satellite synthetic aperture radar (SAR) slant range images is important in relation to mapping areas without ground reference points and also in relation to automated processing. The relevant SAR system parameters are discussed...

  10. Non-crossing geometric steiner arborescences

    NARCIS (Netherlands)

    Kostitsyna, I.; Speckmann, B.; Verbeek, K.A.B.; Okamoto, Yoshio; Tokuyama, Takeshi

    2017-01-01

    Motivated by the question of simultaneous embedding of several flow maps, we consider the problem of drawing multiple geometric Steiner arborescences with no crossings in the rectilinear and in the angle-restricted setting. When terminal-to-root paths are allowed to turn freely, we show that two

  11. On Kaehler's geometric description of dirac fields

    International Nuclear Information System (INIS)

    Goeckeler, M.; Joos, H.

    1983-12-01

    A differential geometric generalization of the Dirac equation due to E. Kaehler seems to be an appropriate starting point for the lattice approximation of matter fields. It is the purpose of this lecture to illustrate several aspects of this approach. (orig./HSI)

  12. Robust Geometric Control of a Distillation Column

    DEFF Research Database (Denmark)

    Kymmel, Mogens; Andersen, Henrik Weisberg

    1987-01-01

    A frequency domain method, which makes it possible to adjust multivariable controllers with respect to both nominal performance and robustness, is presented. The basic idea in the approach is that the designer assigns objectives such as steady-state tracking, maximum resonance peaks, bandwidth, m...... is used to examine and improve geometric control of a binary distillation column....

  13. Geometric Algorithms for Part Orienting and Probing

    NARCIS (Netherlands)

    Panahi, F.

    2015-01-01

    In this thesis, detailed solutions are presented to several problems dealing with geometric shape and orientation of an object in the field of robotics and automation. We first have considered a general model for shape variations that allows variation along the entire boundary of an object, both in

  14. Non-equilibrium current via geometric scatterers

    Czech Academy of Sciences Publication Activity Database

    Exner, Pavel; Neidhardt, H.; Tater, Miloš; Zagrebnov, V. A.

    2014-01-01

    Roč. 47, č. 39 (2014), s. 395301 ISSN 1751-8113 R&D Projects: GA ČR(CZ) GA14-06818S Institutional support: RVO:61389005 Keywords : non-equilibrioum steady states * geometric scatterer * Landauer-Buttiker formula Subject RIV: BE - Theoretical Physics Impact factor: 1.583, year: 2014

  15. Geometrical scaling in high energy hadron collisions

    International Nuclear Information System (INIS)

    Kundrat, V.; Lokajicek, M.V.

    1984-06-01

    The concept of geometrical scaling for high energy elastic hadron scattering is analyzed and its basic equations are solved in a consistent way. It is shown that they are applicable to a rather small interval of momentum transfers, e.g. maximally for |t| 2 for pp scattering at the ISR energies. (author)

  16. Geometrical efficiency in computerized tomography: generalized model

    International Nuclear Information System (INIS)

    Costa, P.R.; Robilotta, C.C.

    1992-01-01

    A simplified model for producing sensitivity and exposure profiles in computerized tomographic system was recently developed allowing the forecast of profiles behaviour in the rotation center of the system. The generalization of this model for some point of the image plane was described, and the geometrical efficiency could be evaluated. (C.G.C.)

  17. Exact distributions of two-sample rank statistics and block rank statistics using computer algebra

    NARCIS (Netherlands)

    Wiel, van de M.A.

    1998-01-01

    We derive generating functions for various rank statistics and we use computer algebra to compute the exact null distribution of these statistics. We present various techniques for reducing time and memory space used by the computations. We use the results to write Mathematica notebooks for

  18. Low ranks make the difference : How achievement goals and ranking information affect cooperation intentions

    NARCIS (Netherlands)

    Poortvliet, P. Marijn; Janssen, Onne; Van Yperen, N.W.; Van de Vliert, E.

    This investigation tested the joint effect of achievement goals and ranking information on information exchange intentions with a commensurate exchange partner. Results showed that individuals with performance goals were less inclined to cooperate with an exchange partner when they had low or high

  19. Can EPR non-locality be geometrical?

    International Nuclear Information System (INIS)

    Ne'eman, Y.

    1995-01-01

    The presence in Quantum Mechanics of non-local correlations is one of the two fundamentally non-intuitive features of that theory. The non-local correlations themselves fall into two classes: EPR and Geometrical. The non-local characteristics of the geometrical type are well-understood and are not suspected of possibly generating acausal features, such as faster-than-light propagation of information. This has especially become true since the emergence of a geometrical treatment for the relevant gauge theories, i.e. Fiber Bundle geometry, in which the quantum non-localities are seen to correspond to pure homotopy considerations. This aspect is reviewed in section 2. Contrary-wise, from its very conception, the EPR situation was felt to be paradoxical. It has been suggested that the non-local features of EPR might also derive from geometrical considerations, like all other non-local characteristics of QM. In[7], one of the authors was able to point out several plausibility arguments for this thesis, emphasizing in particular similarities between the non-local correlations provided by any gauge field theory and those required by the preservation of the quantum numbers of the original EPR state-vector, throughout its spatially-extended mode. The derivation was, however, somewhat incomplete, especially because of the apparent difference between, on the one hand, the closed spatial loops arising in the analysis of the geometrical non-localities, from Aharonov-Bohm and Berry phases to magnetic monopoles and instantons, and on the other hand, in the EPR case, the open line drawn by the positions of the two moving decay products of the disintegrating particle. In what follows, the authors endeavor to remove this obstacle and show that as in all other QM non-localities, EPR is somehow related to closed loops, almost involving homotopy considerations. They develop this view in section 3

  20. A GEOMETRICAL HEIGHT SCALE FOR SUNSPOT PENUMBRAE

    International Nuclear Information System (INIS)

    Puschmann, K. G.; Ruiz Cobo, B.; MartInez Pillet, V.

    2010-01-01

    Inversions of spectropolarimetric observations of penumbral filaments deliver the stratification of different physical quantities in an optical depth scale. However, without establishing a geometrical height scale, their three-dimensional geometrical structure cannot be derived. This is crucial in understanding the correct spatial variation of physical properties in the penumbral atmosphere and to provide insights into the mechanism capable of explaining the observed penumbral brightness. The aim of this work is to determine a global geometrical height scale in the penumbra by minimizing the divergence of the magnetic field vector and the deviations from static equilibrium as imposed by a force balance equation that includes pressure gradients, gravity, and the Lorentz force. Optical depth models are derived from the inversion of spectropolarimetric data of an active region observed with the Solar Optical Telescope on board the Hinode satellite. We use a genetic algorithm to determine the boundary condition for the inference of geometrical heights. The retrieved geometrical height scale permits the evaluation of the Wilson depression at each pixel and the correlation of physical quantities at each height. Our results fit into the uncombed penumbral scenario, i.e., a penumbra composed of flux tubes with channeled mass flow and with a weaker and more horizontal magnetic field as compared with the background field. The ascending material is hotter and denser than their surroundings. We do not find evidence of overturning convection or field-free regions in the inner penumbral area analyzed. The penumbral brightness can be explained by the energy transfer of the ascending mass carried by the Evershed flow, if the physical quantities below z = -75 km are extrapolated from the results of the inversion.

  1. Inhibition of osteoclastogenesis by RNA interference targeting RANK

    Directory of Open Access Journals (Sweden)

    Ma Ruofan

    2012-08-01

    Full Text Available Abstract Background Osteoclasts and osteoblasts regulate bone resorption and formation to allow bone remodeling and homeostasis. The balance between bone resorption and formation is disturbed by abnormal recruitment of osteoclasts. Osteoclast differentiation is dependent on the receptor activator of nuclear factor NF-kappa B (RANK ligand (RANKL as well as the macrophage colony-stimulating factor (M-CSF. The RANKL/RANK system and RANK signaling induce osteoclast formation mediated by various cytokines. The RANK/RANKL pathway has been primarily implicated in metabolic, degenerative and neoplastic bone disorders or osteolysis. The central role of RANK/RANKL interaction in osteoclastogenesis makes RANK an attractive target for potential therapies in treatment of osteolysis. The purpose of this study was to assess the effect of inhibition of RANK expression in mouse bone marrow macrophages on osteoclast differentiation and bone resorption. Methods Three pairs of short hairpin RNAs (shRNA targeting RANK were designed and synthesized. The optimal shRNA was selected among three pairs of shRNAs by RANK expression analyzed by Western blot and Real-time PCR. We investigated suppression of osteoclastogenesis of mouse bone marrow macrophages (BMMs using the optimal shRNA by targeting RANK. Results Among the three shRANKs examined, shRANK-3 significantly suppressed [88.3%] the RANK expression (p Conclusions These findings suggest that retrovirus-mediated shRNA targeting RANK inhibits osteoclast differentiation and osteolysis. It may appear an attractive target for preventing osteolysis in humans with a potential clinical application.

  2. Are university rankings useful to improve research? A systematic review.

    Science.gov (United States)

    Vernon, Marlo M; Balas, E Andrew; Momani, Shaher

    2018-01-01

    Concerns about reproducibility and impact of research urge improvement initiatives. Current university ranking systems evaluate and compare universities on measures of academic and research performance. Although often useful for marketing purposes, the value of ranking systems when examining quality and outcomes is unclear. The purpose of this study was to evaluate usefulness of ranking systems and identify opportunities to support research quality and performance improvement. A systematic review of university ranking systems was conducted to investigate research performance and academic quality measures. Eligibility requirements included: inclusion of at least 100 doctoral granting institutions, be currently produced on an ongoing basis and include both global and US universities, publish rank calculation methodology in English and independently calculate ranks. Ranking systems must also include some measures of research outcomes. Indicators were abstracted and contrasted with basic quality improvement requirements. Exploration of aggregation methods, validity of research and academic quality indicators, and suitability for quality improvement within ranking systems were also conducted. A total of 24 ranking systems were identified and 13 eligible ranking systems were evaluated. Six of the 13 rankings are 100% focused on research performance. For those reporting weighting, 76% of the total ranks are attributed to research indicators, with 24% attributed to academic or teaching quality. Seven systems rely on reputation surveys and/or faculty and alumni awards. Rankings influence academic choice yet research performance measures are the most weighted indicators. There are no generally accepted academic quality indicators in ranking systems. No single ranking system provides a comprehensive evaluation of research and academic quality. Utilizing a combined approach of the Leiden, Thomson Reuters Most Innovative Universities, and the SCImago ranking systems may provide

  3. Asynchronous Gossip for Averaging and Spectral Ranking

    Science.gov (United States)

    Borkar, Vivek S.; Makhijani, Rahul; Sundaresan, Rajesh

    2014-08-01

    We consider two variants of the classical gossip algorithm. The first variant is a version of asynchronous stochastic approximation. We highlight a fundamental difficulty associated with the classical asynchronous gossip scheme, viz., that it may not converge to a desired average, and suggest an alternative scheme based on reinforcement learning that has guaranteed convergence to the desired average. We then discuss a potential application to a wireless network setting with simultaneous link activation constraints. The second variant is a gossip algorithm for distributed computation of the Perron-Frobenius eigenvector of a nonnegative matrix. While the first variant draws upon a reinforcement learning algorithm for an average cost controlled Markov decision problem, the second variant draws upon a reinforcement learning algorithm for risk-sensitive control. We then discuss potential applications of the second variant to ranking schemes, reputation networks, and principal component analysis.

  4. Fuzzy-set based contingency ranking

    International Nuclear Information System (INIS)

    Hsu, Y.Y.; Kuo, H.C.

    1992-01-01

    In this paper, a new approach based on fuzzy set theory is developed for contingency ranking of Taiwan power system. To examine whether a power system can remain in a secure and reliable operating state under contingency conditions, those contingency cases that will result in loss-of-load, loss-of generation, or islanding are first identified. Then 1P-1Q iteration of fast decoupled load flow is preformed to estimate post-contingent quantities (line flows, bus voltages) for other contingency cases. Based on system operators' past experience, each post-contingent quantity is assigned a degree of severity according to the potential damage that could be imposed on the power system by the quantity, should the contingency occurs. An approach based on fuzzy set theory is developed to deal with the imprecision of linguistic terms

  5. Motif discovery in ranked lists of sequences

    DEFF Research Database (Denmark)

    Nielsen, Morten Muhlig; Tataru, Paula; Madsen, Tobias

    2016-01-01

    Motif analysis has long been an important method to characterize biological functionality and the current growth of sequencing-based genomics experiments further extends its potential. These diverse experiments often generate sequence lists ranked by some functional property. There is therefore...... advantage of the regular expression feature, including enrichments for combinations of different microRNA seed sites. The method is implemented and made publicly available as an R package and supports high parallelization on multi-core machinery....... a growing need for motif analysis methods that can exploit this coupled data structure and be tailored for specific biological questions. Here, we present an exploratory motif analysis tool, Regmex (REGular expression Motif EXplorer), which offers several methods to evaluate the correlation of motifs...

  6. Ranked retrieval of Computational Biology models.

    Science.gov (United States)

    Henkel, Ron; Endler, Lukas; Peters, Andre; Le Novère, Nicolas; Waltemath, Dagmar

    2010-08-11

    The study of biological systems demands computational support. If targeting a biological problem, the reuse of existing computational models can save time and effort. Deciding for potentially suitable models, however, becomes more challenging with the increasing number of computational models available, and even more when considering the models' growing complexity. Firstly, among a set of potential model candidates it is difficult to decide for the model that best suits ones needs. Secondly, it is hard to grasp the nature of an unknown model listed in a search result set, and to judge how well it fits for the particular problem one has in mind. Here we present an improved search approach for computational models of biological processes. It is based on existing retrieval and ranking methods from Information Retrieval. The approach incorporates annotations suggested by MIRIAM, and additional meta-information. It is now part of the search engine of BioModels Database, a standard repository for computational models. The introduced concept and implementation are, to our knowledge, the first application of Information Retrieval techniques on model search in Computational Systems Biology. Using the example of BioModels Database, it was shown that the approach is feasible and extends the current possibilities to search for relevant models. The advantages of our system over existing solutions are that we incorporate a rich set of meta-information, and that we provide the user with a relevance ranking of the models found for a query. Better search capabilities in model databases are expected to have a positive effect on the reuse of existing models.

  7. An R package for analyzing and modeling ranking data.

    Science.gov (United States)

    Lee, Paul H; Yu, Philip L H

    2013-05-14

    In medical informatics, psychology, market research and many other fields, researchers often need to analyze and model ranking data. However, there is no statistical software that provides tools for the comprehensive analysis of ranking data. Here, we present pmr, an R package for analyzing and modeling ranking data with a bundle of tools. The pmr package enables descriptive statistics (mean rank, pairwise frequencies, and marginal matrix), Analytic Hierarchy Process models (with Saaty's and Koczkodaj's inconsistencies), probability models (Luce model, distance-based model, and rank-ordered logit model), and the visualization of ranking data with multidimensional preference analysis. Examples of the use of package pmr are given using a real ranking dataset from medical informatics, in which 566 Hong Kong physicians ranked the top five incentives (1: competitive pressures; 2: increased savings; 3: government regulation; 4: improved efficiency; 5: improved quality care; 6: patient demand; 7: financial incentives) to the computerization of clinical practice. The mean rank showed that item 4 is the most preferred item and item 3 is the least preferred item, and significance difference was found between physicians' preferences with respect to their monthly income. A multidimensional preference analysis identified two dimensions that explain 42% of the total variance. The first can be interpreted as the overall preference of the seven items (labeled as "internal/external"), and the second dimension can be interpreted as their overall variance of (labeled as "push/pull factors"). Various statistical models were fitted, and the best were found to be weighted distance-based models with Spearman's footrule distance. In this paper, we presented the R package pmr, the first package for analyzing and modeling ranking data. The package provides insight to users through descriptive statistics of ranking data. Users can also visualize ranking data by applying a thought

  8. Geometric description of images as topographic maps

    CERN Document Server

    Caselles, Vicent

    2010-01-01

    This volume discusses the basic geometric contents of an image and presents a tree data structure to handle those contents efficiently. The nodes of the tree are derived from connected components of level sets of the intensity, while the edges represent inclusion information. Grain filters, morphological operators simplifying these geometric contents, are analyzed and several applications to image comparison and registration, and to edge and corner detection, are presented. The mathematically inclined reader may be most interested in Chapters 2 to 6, which generalize the topological Morse description to continuous or semicontinuous functions, while mathematical morphologists may more closely consider grain filters in Chapter 3. Computer scientists will find algorithmic considerations in Chapters 6 and 7, the full justification of which may be found in Chapters 2 and 4 respectively. Lastly, all readers can learn more about the motivation for this work in the image processing applications presented in Chapter 8...

  9. Towards a theory of geometric graphs

    CERN Document Server

    Pach, Janos

    2004-01-01

    The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

  10. Plasmon Geometric Phase and Plasmon Hall Shift

    Science.gov (United States)

    Shi, Li-kun; Song, Justin C. W.

    2018-04-01

    The collective plasmonic modes of a metal comprise a simple pattern of oscillating charge density that yields enhanced light-matter interaction. Here we unveil that beneath this familiar facade plasmons possess a hidden internal structure that fundamentally alters its dynamics. In particular, we find that metals with nonzero Hall conductivity host plasmons with an intricate current density configuration that sharply departs from that of ordinary zero Hall conductivity metals. This nontrivial internal structure dramatically enriches the dynamics of plasmon propagation, enabling plasmon wave packets to acquire geometric phases as they scatter. At boundaries, these phases accumulate allowing plasmon waves that reflect off to experience a nonreciprocal parallel shift. This plasmon Hall shift, tunable by Hall conductivity as well as plasmon wavelength, displaces the incident and reflected plasmon trajectories and can be readily probed by near-field photonics techniques. Anomalous plasmon geometric phases dramatically enrich the nanophotonics toolbox, and yield radical new means for directing plasmonic beams.

  11. Geometric mechanics of periodic pleated origami.

    Science.gov (United States)

    Wei, Z Y; Guo, Z V; Dudte, L; Liang, H Y; Mahadevan, L

    2013-05-24

    Origami structures are mechanical metamaterials with properties that arise almost exclusively from the geometry of the constituent folds and the constraint of piecewise isometric deformations. Here we characterize the geometry and planar and nonplanar effective elastic response of a simple periodically folded Miura-ori structure, which is composed of identical unit cells of mountain and valley folds with four-coordinated ridges, defined completely by two angles and two lengths. We show that the in-plane and out-of-plane Poisson's ratios are equal in magnitude, but opposite in sign, independent of material properties. Furthermore, we show that effective bending stiffness of the unit cell is singular, allowing us to characterize the two-dimensional deformation of a plate in terms of a one-dimensional theory. Finally, we solve the inverse design problem of determining the geometric parameters for the optimal geometric and mechanical response of these extreme structures.

  12. Geometric methods in PDE’s

    CERN Document Server

    Manfredini, Maria; Morbidelli, Daniele; Polidoro, Sergio; Uguzzoni, Francesco

    2015-01-01

    The analysis of PDEs is a prominent discipline in mathematics research, both in terms of its theoretical aspects and its relevance in applications. In recent years, the geometric properties of linear and nonlinear second order PDEs of elliptic and parabolic type have been extensively studied by many outstanding researchers. This book collects contributions from a selected group of leading experts who took part in the INdAM meeting "Geometric methods in PDEs", on the occasion of the 70th birthday of Ermanno Lanconelli. They describe a number of new achievements and/or the state of the art in their discipline of research, providing readers an overview of recent progress and future research trends in PDEs. In particular, the volume collects significant results for sub-elliptic equations, potential theory and diffusion equations, with an emphasis on comparing different methodologies and on their implications for theory and applications. .

  13. A Practical Guide to Experimental Geometrical Optics

    Science.gov (United States)

    Garbovskiy, Yuriy A.; Glushchenko, Anatoliy V.

    2017-12-01

    Preface; 1. Markets of optical materials, components, accessories, light sources and detectors; 2. Introduction to optical experiments: light producing, light managing, light detection and measuring; 3. Light detectors based on semiconductors: photoresistors, photodiodes in a photo-galvanic regime. Principles of operation and measurements; 4. Linear light detectors based on photodiodes; 5. Basic laws of geometrical optics: experimental verification; 6. Converging and diverging thin lenses; 7. Thick lenses; 8. Lens systems; 9. Simple optical instruments I: the eye and the magnifier, eyepieces and telescopes; 10. Simple optical instruments II: light illuminators and microscope; 11. Spherical mirrors; 12. Introduction to optical aberrations; 13. Elements of optical radiometry; 14. Cylindrical lenses and vials; 15. Methods of geometrical optics to measure refractive index; 16. Dispersion of light and prism spectroscope; 17. Elements of computer aided optical design; Index.

  14. Coated sphere scattering by geometric optics approximation.

    Science.gov (United States)

    Mengran, Zhai; Qieni, Lü; Hongxia, Zhang; Yinxin, Zhang

    2014-10-01

    A new geometric optics model has been developed for the calculation of light scattering by a coated sphere, and the analytic expression for scattering is presented according to whether rays hit the core or not. The ray of various geometric optics approximation (GOA) terms is parameterized by the number of reflections in the coating/core interface, the coating/medium interface, and the number of chords in the core, with the degeneracy path and repeated path terms considered for the rays striking the core, which simplifies the calculation. For the ray missing the core, the various GOA terms are dealt with by a homogeneous sphere. The scattering intensity of coated particles are calculated and then compared with those of Debye series and Aden-Kerker theory. The consistency of the results proves the validity of the method proposed in this work.

  15. Geometrical Description of fractional quantum Hall quasiparticles

    Science.gov (United States)

    Park, Yeje; Yang, Bo; Haldane, F. D. M.

    2012-02-01

    We examine a description of fractional quantum Hall quasiparticles and quasiholes suggested by a recent geometrical approach (F. D. M. Haldane, Phys. Rev. Lett. 108, 116801 (2011)) to FQH systems, where the local excess electric charge density in the incompressible state is given by a topologically-quantized ``guiding-center spin'' times the Gaussian curvature of a ``guiding-center metric tensor'' that characterizes the local shape of the correlation hole around electrons in the fluid. We use a phenomenological energy function with two ingredients: the shear distortion energy of area-preserving distortions of the fluid, and a local (short-range) approximation to the Coulomb energy of the fluctuation of charge density associated with the Gaussian curvature. Quasiparticles and quasiholes of the 1/3 Laughlin state are modeled as ``punctures'' in the incompressible fluid which then relax by geometric distortion which generates Gaussian curvature, giving rise to the charge-density profile around the topological excitation.

  16. The geometric Hopf invariant and surgery theory

    CERN Document Server

    Crabb, Michael

    2017-01-01

    Written by leading experts in the field, this monograph provides homotopy theoretic foundations for surgery theory on higher-dimensional manifolds. Presenting classical ideas in a modern framework, the authors carefully highlight how their results relate to (and generalize) existing results in the literature. The central result of the book expresses algebraic surgery theory in terms of the geometric Hopf invariant, a construction in stable homotopy theory which captures the double points of immersions. Many illustrative examples and applications of the abstract results are included in the book, making it of wide interest to topologists. Serving as a valuable reference, this work is aimed at graduate students and researchers interested in understanding how the algebraic and geometric topology fit together in the surgery theory of manifolds. It is the only book providing such a wide-ranging historical approach to the Hopf invariant, double points and surgery theory, with many results old and new. .

  17. Geometric modeling in probability and statistics

    CERN Document Server

    Calin, Ovidiu

    2014-01-01

    This book covers topics of Informational Geometry, a field which deals with the differential geometric study of the manifold probability density functions. This is a field that is increasingly attracting the interest of researchers from many different areas of science, including mathematics, statistics, geometry, computer science, signal processing, physics and neuroscience. It is the authors’ hope that the present book will be a valuable reference for researchers and graduate students in one of the aforementioned fields. This textbook is a unified presentation of differential geometry and probability theory, and constitutes a text for a course directed at graduate or advanced undergraduate students interested in applications of differential geometry in probability and statistics. The book contains over 100 proposed exercises meant to help students deepen their understanding, and it is accompanied by software that is able to provide numerical computations of several information geometric objects. The reader...

  18. Geometrical dynamics of Born-Infeld objects

    Energy Technology Data Exchange (ETDEWEB)

    Cordero, Ruben [Departamento de Fisica, Escuela Superior de Fisica y Matematicas del I.P.N., Unidad Adolfo Lopez Mateos, Edificio 9, 07738 Mexico, D.F. (Mexico); Molgado, Alberto [Facultad de Ciencias, Universidad de Colima, Bernal DIaz del Castillo 340, Col. Villas San Sebastian, Colima (Mexico); Rojas, Efrain [Facultad de Fisica e Inteligencia Artificial, Universidad Veracruzana, 91000 Xalapa, Veracruz (Mexico)

    2007-03-21

    We present a geometrically inspired study of the dynamics of Dp-branes. We focus on the usual non-polynomial Dirac-Born-Infeld action for the worldvolume swept out by the brane in its evolution in general background spacetimes. We emphasize the form of the resulting equations of motion which are quite simple and resemble Newton's second law, complemented with a conservation law for a worldvolume bicurrent. We take a closer look at the classical Hamiltonian analysis which is supported by the ADM framework of general relativity. The constraints and their algebra are identified as well as the geometrical role they play in phase space. In order to illustrate our results, we review the dynamics of a D1-brane immersed in a AdS{sub 3} x S{sup 3} background spacetime. We exhibit the mechanical properties of Born-Infeld objects paving the way to a consistent quantum formulation.

  19. Geometrical dynamics of Born-Infeld objects

    International Nuclear Information System (INIS)

    Cordero, Ruben; Molgado, Alberto; Rojas, Efrain

    2007-01-01

    We present a geometrically inspired study of the dynamics of Dp-branes. We focus on the usual non-polynomial Dirac-Born-Infeld action for the worldvolume swept out by the brane in its evolution in general background spacetimes. We emphasize the form of the resulting equations of motion which are quite simple and resemble Newton's second law, complemented with a conservation law for a worldvolume bicurrent. We take a closer look at the classical Hamiltonian analysis which is supported by the ADM framework of general relativity. The constraints and their algebra are identified as well as the geometrical role they play in phase space. In order to illustrate our results, we review the dynamics of a D1-brane immersed in a AdS 3 x S 3 background spacetime. We exhibit the mechanical properties of Born-Infeld objects paving the way to a consistent quantum formulation

  20. A practical guide to experimental geometrical optics

    CERN Document Server

    Garbovskiy, Yuriy A

    2017-01-01

    A concise, yet deep introduction to experimental, geometrical optics, this book begins with fundamental concepts and then develops the practical skills and research techniques routinely used in modern laboratories. Suitable for students, researchers and optical engineers, this accessible text teaches readers how to build their own optical laboratory and to design and perform optical experiments. It uses a hands-on approach which fills a gap between theory-based textbooks and laboratory manuals, allowing the reader to develop their practical skills in this interdisciplinary field, and also explores the ways in which this knowledge can be applied to the design and production of commercial optical devices. Including supplementary online resources to help readers track and evaluate their experimental results, this text is the ideal companion for anyone with a practical interest in experimental geometrical optics.

  1. Fast decoding algorithms for geometric coded apertures

    International Nuclear Information System (INIS)

    Byard, Kevin

    2015-01-01

    Fast decoding algorithms are described for the class of coded aperture designs known as geometric coded apertures which were introduced by Gourlay and Stephen. When compared to the direct decoding method, the algorithms significantly reduce the number of calculations required when performing the decoding for these apertures and hence speed up the decoding process. Experimental tests confirm the efficacy of these fast algorithms, demonstrating a speed up of approximately two to three orders of magnitude over direct decoding.

  2. Geometrical framework for robust portfolio optimization

    OpenAIRE

    Bazovkin, Pavel

    2014-01-01

    We consider a vector-valued multivariate risk measure that depends on the user's profile given by the user's utility. It is constructed on the basis of weighted-mean trimmed regions and represents the solution of an optimization problem. The key feature of this measure is convexity. We apply the measure to the portfolio selection problem, employing different measures of performance as objective functions in a common geometrical framework.

  3. Geometric measure theory a beginner's guide

    CERN Document Server

    Morgan, Frank

    1995-01-01

    Geometric measure theory is the mathematical framework for the study of crystal growth, clusters of soap bubbles, and similar structures involving minimization of energy. Morgan emphasizes geometry over proofs and technicalities, and includes a bibliography and abundant illustrations and examples. This Second Edition features a new chapter on soap bubbles as well as updated sections addressing volume constraints, surfaces in manifolds, free boundaries, and Besicovitch constant results. The text will introduce newcomers to the field and appeal to mathematicians working in the field.

  4. Geometrical Aspects of non-gravitational interactions

    OpenAIRE

    Roldan, Omar; Barros Jr, C. C.

    2016-01-01

    In this work we look for a geometric description of non-gravitational forces. The basic ideas are proposed studying the interaction between a punctual particle and an electromagnetic external field. For this purpose, we introduce the concept of proper space-time, that allow us to describe this interaction in a way analogous to the one that the general relativity theory does for gravitation. The field equations that define this geometry are similar to the Einstein's equations, where in general...

  5. Chirality: a relational geometric-physical property.

    Science.gov (United States)

    Gerlach, Hans

    2013-11-01

    The definition of the term chirality by Lord Kelvin in 1893 and 1904 is analyzed by taking crystallography at that time into account. This shows clearly that chirality is a relational geometric-physical property, i.e., two relations between isometric objects are possible: homochiral or heterochiral. In scientific articles the relational term chirality is often mistaken for the two valued measure for the individual (absolute) sense of chirality, an arbitrary attributive term. © 2013 Wiley Periodicals, Inc.

  6. Geometric (Berry) phases in neutron molecular spectroscopy

    International Nuclear Information System (INIS)

    Lovesey, S.W.

    1992-02-01

    A theory of neutron scattering by nuclei in a molecule, accompanied by an electronic transition, is formulated with attention to gauge potentials and geometric phases in the Born-Oppenheimer scheme. Non-degenerate and nearly degenerate electronic levels are considered. For nearly degenerate levels it is shown that, the cross-section is free of the singular structure which characterizes the corresponding gauge potential for the phase, and much larger than for well separated electronic states. (author)

  7. Geometric continuum regularization of quantum field theory

    International Nuclear Information System (INIS)

    Halpern, M.B.

    1989-01-01

    An overview of the continuum regularization program is given. The program is traced from its roots in stochastic quantization, with emphasis on the examples of regularized gauge theory, the regularized general nonlinear sigma model and regularized quantum gravity. In its coordinate-invariant form, the regularization is seen as entirely geometric: only the supermetric on field deformations is regularized, and the prescription provides universal nonperturbative invariant continuum regularization across all quantum field theory. 54 refs

  8. Graph Treewidth and Geometric Thickness Parameters

    OpenAIRE

    Dujmović, Vida; Wood, David R.

    2005-01-01

    Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness". By restricting the edges to be straight, we obtain the "geometric thickness". By further restricting the vertices to be in convex position, we obtain the "book thickness". This paper studies the relationship between these parameters and treewidth. Our first main result states that for grap...

  9. Geometric morphometric footprint analysis of young women

    OpenAIRE

    Domjanic, Jacqueline; Fieder, Martin; Seidler, Horst; Mitteroecker, Philipp

    2013-01-01

    Background Most published attempts to quantify footprint shape are based on a small number of measurements. We applied geometric morphometric methods to study shape variation of the complete footprint outline in a sample of 83 adult women. Methods The outline of the footprint, including the toes, was represented by a comprehensive set of 85 landmarks and semilandmarks. Shape coordinates were computed by Generalized Procrustes Analysis. Results The first four principal components represented t...

  10. Geometrical characterization of micro end milling tools

    DEFF Research Database (Denmark)

    Borsetto, Francesca; Bariani, Paolo; Bissacco, Giuliano

    2005-01-01

    Performance of the milling process is directly affected by the accuracy of tool geometry. Development of methods suitable for dimensional characterization of such tools, with low measurement uncertainties is therefore of relevance. The present article focuses on the geometrical characterization...... of a flat micro end milling tool with a nominal mill diameter of 200 microns. An experimental investigation was carried out involving two different non-contact systems...

  11. Geometric Measure Theory and Minimal Surfaces

    CERN Document Server

    Bombieri, Enrico

    2011-01-01

    W.K. ALLARD: On the first variation of area and generalized mean curvature.- F.J. ALMGREN Jr.: Geometric measure theory and elliptic variational problems.- E. GIUSTI: Minimal surfaces with obstacles.- J. GUCKENHEIMER: Singularities in soap-bubble-like and soap-film-like surfaces.- D. KINDERLEHRER: The analyticity of the coincidence set in variational inequalities.- M. MIRANDA: Boundaries of Caciopoli sets in the calculus of variations.- L. PICCININI: De Giorgi's measure and thin obstacles.

  12. Geometrical optics in correlated imaging systems

    International Nuclear Information System (INIS)

    Cao Dezhong; Xiong Jun; Wang Kaige

    2005-01-01

    We discuss the geometrical optics of correlated imaging for two kinds of spatial correlations corresponding, respectively, to a classical thermal light source and a quantum two-photon entangled source. Due to the different features in the second-order spatial correlation, the two sources obey different imaging equations. The quantum entangled source behaves as a mirror, whereas the classical thermal source looks like a phase-conjugate mirror in the correlated imaging

  13. Nociones de geometría vectorial

    OpenAIRE

    Ospina Arteaga, Omar Evelio

    1990-01-01

    Las presentes notas de geometría vectorial pretenden ser una ayuda para los estudiantes que se inician en el tema de vectores y deberá ser complementado con ejercicios sobre el tema. Este texto contiene temas de interés tales como: Espacios euclidianos, Distancian entre dos puntos, Concepto de vector, Igualdad de vectores, entre otros relacionados con el estudio de vectores.

  14. Geometrical Determinants of Neuronal Actin Waves

    OpenAIRE

    Tomba, Caterina; Bra?ni, C?line; Bugnicourt, Ghislain; Cohen, Floriane; Friedrich, Benjamin M.; Gov, Nir S.; Villard, Catherine

    2017-01-01

    Hippocampal neurons produce in their early stages of growth propagative, actin-rich dynamical structures called actin waves. The directional motion of actin waves from the soma to the tip of neuronal extensions has been associated with net forward growth, and ultimately with the specification of neurites into axon and dendrites. Here, geometrical cues are used to control actin wave dynamics by constraining neurons on adhesive stripes of various widths. A key observable, the average time betwe...

  15. Multiphase flow in geometrically simple fracture intersections

    Science.gov (United States)

    Basagaoglu, H.; Meakin, P.; Green, C.T.; Mathew, M.; ,

    2006-01-01

    A two-dimensional lattice Boltzmann (LB) model with fluid-fluid and solid-fluid interaction potentials was used to study gravity-driven flow in geometrically simple fracture intersections. Simulated scenarios included fluid dripping from a fracture aperture, two-phase flow through intersecting fractures and thin-film flow on smooth and undulating solid surfaces. Qualitative comparisons with recently published experimental findings indicate that for these scenarios the LB model captured the underlying physics reasonably well.

  16. The Geometric Nonlinear Generalized Brazier Effect

    DEFF Research Database (Denmark)

    Nikolajsen, Jan Ánike; Lauridsen, Peter Riddersholm; Damkilde, Lars

    2016-01-01

    that the generalized Brazier effect is a local effect not influencing the overall mechanical behavior of the structure significantly. The offset is a nonlinear geometric beam-type Finite Element calculation, which takes into account the large displacements and rotations. The beam-type model defines the stresses which...... mainly are in the direction of the beam axis. The generalized Brazier effect is calculated as a linear load case based on these stresses....

  17. Feature ranking and rank aggregation for automatic sleep stage classification: a comparative study.

    Science.gov (United States)

    Najdi, Shirin; Gharbali, Ali Abdollahi; Fonseca, José Manuel

    2017-08-18

    Nowadays, sleep quality is one of the most important measures of healthy life, especially considering the huge number of sleep-related disorders. Identifying sleep stages using polysomnographic (PSG) signals is the traditional way of assessing sleep quality. However, the manual process of sleep stage classification is time-consuming, subjective and costly. Therefore, in order to improve the accuracy and efficiency of the sleep stage classification, researchers have been trying to develop automatic classification algorithms. Automatic sleep stage classification mainly consists of three steps: pre-processing, feature extraction and classification. Since classification accuracy is deeply affected by the extracted features, a poor feature vector will adversely affect the classifier and eventually lead to low classification accuracy. Therefore, special attention should be given to the feature extraction and selection process. In this paper the performance of seven feature selection methods, as well as two feature rank aggregation methods, were compared. Pz-Oz EEG, horizontal EOG and submental chin EMG recordings of 22 healthy males and females were used. A comprehensive feature set including 49 features was extracted from these recordings. The extracted features are among the most common and effective features used in sleep stage classification from temporal, spectral, entropy-based and nonlinear categories. The feature selection methods were evaluated and compared using three criteria: classification accuracy, stability, and similarity. Simulation results show that MRMR-MID achieves the highest classification performance while Fisher method provides the most stable ranking. In our simulations, the performance of the aggregation methods was in the average level, although they are known to generate more stable results and better accuracy. The Borda and RRA rank aggregation methods could not outperform significantly the conventional feature ranking methods. Among

  18. Using incomplete citation data for MEDLINE results ranking.

    Science.gov (United States)

    Herskovic, Jorge R; Bernstam, Elmer V

    2005-01-01

    Information overload is a significant problem for modern medicine. Searching MEDLINE for common topics often retrieves more relevant documents than users can review. Therefore, we must identify documents that are not only relevant, but also important. Our system ranks articles using citation counts and the PageRank algorithm, incorporating data from the Science Citation Index. However, citation data is usually incomplete. Therefore, we explore the relationship between the quantity of citation information available to the system and the quality of the result ranking. Specifically, we test the ability of citation count and PageRank to identify "important articles" as defined by experts from large result sets with decreasing citation information. We found that PageRank performs better than simple citation counts, but both algorithms are surprisingly robust to information loss. We conclude that even an incomplete citation database is likely to be effective for importance ranking.

  19. Co-integration Rank Testing under Conditional Heteroskedasticity

    DEFF Research Database (Denmark)

    Cavaliere, Guiseppe; Rahbæk, Anders; Taylor, A.M. Robert

    null distributions of the rank statistics coincide with those derived by previous authors who assume either i.i.d. or (strict and covariance) stationary martingale difference innovations. We then propose wild bootstrap implementations of the co-integrating rank tests and demonstrate that the associated...... bootstrap rank statistics replicate the first-order asymptotic null distributions of the rank statistics. We show the same is also true of the corresponding rank tests based on the i.i.d. bootstrap of Swensen (2006). The wild bootstrap, however, has the important property that, unlike the i.i.d. bootstrap......, it preserves in the re-sampled data the pattern of heteroskedasticity present in the original shocks. Consistent with this, numerical evidence sug- gests that, relative to tests based on the asymptotic critical values or the i.i.d. bootstrap, the wild bootstrap rank tests perform very well in small samples un...

  20. Social Rank, Stress, Fitness, and Life Expectancy in Wild Rabbits

    Science.gov (United States)

    von Holst, Dietrich; Hutzelmeyer, Hans; Kaetzke, Paul; Khaschei, Martin; Schönheiter, Ronald

    Wild rabbits of the two sexes have separate linear rank orders, which are established and maintained by intensive fights. The social rank of individuals strongly influence their fitness: males and females that gain a high social rank, at least at the outset of their second breeding season, have a much higher lifetime fitness than subordinate individuals. This is because of two separate factors: a much higher fecundity and annual reproductive success and a 50% longer reproductive life span. These results are in contrast to the view in evolutionary biology that current reproduction can be increased only at the expense of future survival and/or fecundity. These concepts entail higher physiological costs in high-ranking mammals, which is not supported by our data: In wild rabbits the physiological costs of social positions are caused predominantly by differential psychosocial stress responses that are much lower in high-ranking than in low-ranking individuals.