Search results for "HEMA"

showing 10 items of 32275 documents

MonteCarlo Methods

2016

010104 statistics & probabilityComputer science010501 environmental sciences0101 mathematics01 natural sciences0105 earth and related environmental sciencesWiley StatsRef: Statistics Reference Online
researchProduct

Análisis de la utilidad del algoritmo Gradient Boosting Machine (GBM) en la predicción del fracaso empresarial

2018

Este estudio, novedoso en cuanto a la utilizacion de la metodologia basada en la cultura de los algoritmos, prueba la capacidad de la tecnica ‘Gradient Boosting Machine’ (GBM) en la prediccion de l...

010104 statistics & probabilityEconomics and EconometricsAccounting0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing02 engineering and technology0101 mathematics01 natural sciencesFinanceSpanish Journal of Finance and Accounting / Revista Española de Financiación y Contabilidad
researchProduct

Adjusting the Knox test by accounting for spatio-temporal crime risk heterogeneity to analyse near-repeats

2020

The near-repeat phenomenon usually occurs with any crime. Hence, to implement preventive measures, it is of great interest to figure out at which spatio-temporal scale crimes are more likely to be repeated by offenders. The Knox test is the most used statistical tool for evaluating the presence of the near-repeat phenomenon given a dataset of crimes that are located in space and time. The classic version of this test assumes that crime risk is homogeneous in both space and time, although this assumption rarely holds in reality. Therefore, the main goal of this article is to highlight the necessity of adjusting the standard version of the Knox test, including spatial and temporal effects th…

010104 statistics & probabilityGeographyScale (ratio)050901 criminology05 social sciencesEconometrics0509 other social sciences0101 mathematics01 natural sciencesLawTest (assessment)European Journal of Criminology
researchProduct

Emotions and Digital Delivery Platforms

2021

From the global spread of the infectious disease COVID-19, in Argentina as in other states worldwide, health measures, social emergency, economic and public order measures were taken. One of the main and earliest measures of social order in the face of this disease was the delimitation of a period of population isolation, known as preventive and obligatory social isolation. The compulsory social isolation generated unprecedented growth in the demand for services to the platform economies in Argentina in general and in Buenos Aires in particular, causing the platform delivery activity to be conceived as an essential activity. The purpose of the writing is to explore the configuration of a ce…

010104 statistics & probabilityHistoryCoronavirus disease 2019 (COVID-19)Isolation (health care)0502 economics and business05 social sciencesPandemic0101 mathematicsComputer securitycomputer.software_genre01 natural sciencescomputer050205 econometrics
researchProduct

Permutation invariant functionals of Lévy processes

2017

010104 statistics & probabilityPure mathematicsApplied MathematicsGeneral Mathematics010102 general mathematicsta111stochastic processes0101 mathematicsInvariant (mathematics)01 natural sciencesLévy processMathematicsstokastiset prosessitTransactions of the American Mathematical Society
researchProduct

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …

0102 computer and information sciences01 natural scienceslittlewood–offord theory60C05 60B20 05C80 15B52 46B06law.inventionCombinatoricsSingularityanti-concentrationlawFOS: MathematicsMathematics - CombinatoricsAdjacency matrix0101 mathematicsMathematicsinvertibility of random matricesApplied Mathematics010102 general mathematicsProbability (math.PR)random regular graphsDirected graphsingular probabilityGraphVertex (geometry)Invertible matrix010201 computation theory & mathematicsadjacency matricesCombinatorics (math.CO)Mathematics - ProbabilityAnalysis
researchProduct

Restricted compositions and permutations: from old to new Gray codes

2011

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…

0102 computer and information sciences02 engineering and technologyInterval (mathematics)[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatoricsGray codePermutationsymbols.namesakeInteger020204 information systems[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsExtension (predicate logic)Composition (combinatorics)Cartesian productComputer Science Applications010201 computation theory & mathematicsComputer Science::Computer Vision and Pattern RecognitionBounded functionSignal ProcessingsymbolsInformation Systems
researchProduct

Statistics-preserving bijections between classical and cyclic permutations

2012

Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…

0102 computer and information sciencesFixed point[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesCombinatorial problemsTheoretical Computer ScienceCyclic permutationSet (abstract data type)CombinatoricsBijections[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsDescent (mathematics)Discrete mathematicsStatistics on permutationsMathematics::Combinatorics010102 general mathematicsDescentComputer Science ApplicationsDerangement010201 computation theory & mathematicsExcedenceSignal ProcessingBijectionBijection injection and surjectionMaximaInformation Systems
researchProduct

Promotion et Développement d'un Master Erasmus Mundus - L'Exemple du VIBOT

2011

Cet article decrit l’offre de formation a l’internationale proposee au Centre Universitaire Condorcet du Creusot (Universite de Bourgogne) dans le domaine de la vision par ordinateur et de la robotique. Il presente l’organisation particuliere de ces formations et les actions de support mises en place pour en assurer la perennite.

010201 computation theory & mathematics05 social sciences050301 education[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]0102 computer and information sciences16. Peace & justice[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]0503 education01 natural sciences
researchProduct

Analysis of the specific common competences of the Degree Courses in Speech Therapy and on the ability to apply in the didactic systems

2020

Law 11 January 2018 n. 3 places the attention of the Health Professions on the specific common skills, which must be evident in the didactic systems to protect the Profession. The purpose of this work is to identify which skills are always present among the training objectives of the Degree Courses in Speech Therapy, and which instead become "specific" for our profession. The data analysis was conducted on 27 Degree Courses in Speech Therapy present in Italy, using the portal "Universitaly" and evaluating the SUA cards of the various Degree Courses. The analysis of the data revealed that: basic skills were insufficient for the areas of labor law and corporate organization; transversal skill…

0103 physical sciencesMathematics educationGeneral Medicine010306 general physicsPsychology01 natural sciencesDegree (music)Speech therapy010305 fluids & plasmasJournal of Advanced Health Care
researchProduct