Search results for "lcsh:Mathematics"
showing 10 items of 384 documents
Bayesian Analysis of Population Health Data
2021
The analysis of population-wide datasets can provide insight on the health status of large populations so that public health officials can make data-driven decisions. The analysis of such datasets often requires highly parameterized models with different types of fixed and random effects to account for risk factors, spatial and temporal variations, multilevel effects and other sources on uncertainty. To illustrate the potential of Bayesian hierarchical models, a dataset of about 500,000 inhabitants released by the Polish National Health Fund containing information about ischemic stroke incidence for a 2-year period is analyzed using different types of models. Spatial logistic regression and…
The Bias toward the Right Side of Others Is Stronger for Hands than for Feet
2021
As shown by a series of previous studies, ambiguous human bodies performing unimanual or unipedal actions tend to be perceived more frequently as right-handed or right-footed rather than left-handed or left-footed, which indicates a perceptual and attentional bias toward the right side of others&rsquo
An Approach to the Concept of Soft Fuzzy Proximity
2014
The purpose of this paper is to introduce the concept of soft fuzzy proximity. Firstly, we give the definitions of soft fuzzy proximity and Katsaras soft fuzzy proximity, and also we investigate the relations between the soft fuzzy proximity and slightly modified version of Katsaras soft fuzzy proximity. Secondly, we induce a soft fuzzy topology from a given soft fuzzy proximity by using soft fuzzy closure operator. Then, we obtain the initial soft fuzzy proximity from a given family of soft fuzzy proximities. So, we describe products in the category of soft fuzzy proximities. Finally, we show that a family of all soft fuzzy proximities on a given set constitutes a complete lattice.
Selección de personal basada en métodos difusos
2011
[ES] Las decisiones de los directivos en cuanto a la selección de personal determinan en gran medida el éxito de la empresa. Una elección adecuada de los empleados proporciona una ventaja comparativa. Proponemos un método borroso para la selección de personal basado en la gestión de competencias y la comparación con la valoración que la empresa considera más adecuada para cada trabajo (el candidato ideal). Nuestro método utiliza la distancia de Hamming y el Matching Level Index. Los algoritmos, implementados con el software Sta¿Designer, nos permite establecer un ranking de candidatos, incluso cuando las competencias del candidato ideal han sido evaluadas tan solo en parte. Nuestro enfoque …
Strong chromatic index of products of graphs
2007
Graphs and Algorithms
Local Normal Forms for First-Order Logic with Applications to Games and Automata
1999
Building on work of Gaifman [Gai82] it is shown that every first-order formula is logically equivalent to a formula of the form ∃ x_1,...,x_l, \forall y, φ where φ is r-local around y, i.e. quantification in φ is restricted to elements of the universe of distance at most r from y. \par From this and related normal forms, variants of the Ehrenfeucht game for first-order and existential monadic second-order logic are developed that restrict the possible strategies for the spoiler, one of the two players. This makes proofs of the existence of a winning strategy for the duplicator, the other player, easier and can thus simplify inexpressibility proofs. \par As another application, automata mode…
Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
2006
A multicoloring of a weighted graph G is an assignment of sets of colors to the vertices of G so that two adjacent vertices receive two disjoint sets of colors. A multicoloring problem on G is to find a multicoloring of G. In particular, we are interested in a minimum multicoloring that uses the least total number of colors. The main focus of this work is to obtain upper bounds on the weighted chromatic number of some classes of graphs in terms of the weighted clique number. We first propose an 11/6-approximation algorithm for multicoloring any weighted planar graph. We then study the multicoloring problem on powers of square and triangular meshes. Among other results, we show that the infi…
Recent Nordic research in mathematics education illustrated by examples from NORMA17
2021
A characterization of recent Nordic research in didactics of mathematics is presented based on the 32 research reports from the Nordic and Baltic countries in the proceedings from NORMA17 (The eighth Nordic conference on didactics of mathematics). Recent Nordic research in didactics of mathematics is observed from several aspects such as choice of problem, theory, method, result, and target for the message. The analyses of the papers on different levels and from a manifold of perspectives build up an image of what Nordic research in DM (didactics of mathematics) contains and represents currently. The closeness and cooperation between researchers in the Nordic countries is characteristic as …
Logistic Growth Described by Birth-Death and Diffusion Processes
2019
We consider the logistic growth model and analyze its relevant properties, such as the limits, the monotony, the concavity, the inflection point, the maximum specific growth rate, the lag time, and the threshold crossing time problem. We also perform a comparison with other growth models, such as the Gompertz, Korf, and modified Korf models. Moreover, we focus on some stochastic counterparts of the logistic model. First, we study a time-inhomogeneous linear birth-death process whose conditional mean satisfies an equation of the same form of the logistic one. We also find a sufficient and necessary condition in order to have a logistic mean even in the presence of an absorbing endpoint. Then…
Improving the Representativeness of a Simple Random Sample: An Optimization Model and Its Application to the Continuous Sample of Working Lives
2020
This paper proposes an optimization model for selecting a larger subsample that improves the representativeness of a simple random sample previously obtained from a population larger than the population of interest. The problem formulation involves convex mixed-integer nonlinear programming (convex MINLP) and is, therefore, NP-hard. However, the solution is found by maximizing the size of the subsample taken from a stratified random sample with proportional allocation and restricting it to a p-value large enough to achieve a good fit to the population of interest using Pearson&rsquo