Journals
2015 EN
Sérgio Augusto Paredes Moreira · Janaine Christine Silva · Laysa Bianca Gomes de Lima
+3 more
Objective: to present notifications of femoral neck fractures in the elderly. Method: documentary retrospective study from the Health Indicator System and Aging Policy Monitoring on the femur fractures, including: admissions; proportion of hospitalizations and hospitalization rate according to sex. Results: 2008 to 2012 were registered 1,200 procedures related to fractures, among which 687 were in the elderly. Note that in 2009 there was a higher number of admissions in women with a ratio of 2.53 and hospitalization rate of 29,45; in 2010 the proportion of women in hospitalizations was 1.67. Conclusion: The fracture is a public health problem, although it is considered an event of old age, has consequences such as fear of walking, loss of ability to perform daily activities, decreased quality of life, and is the leading cause of hospitalization and death among elderly
Federal University of the State of Rio de Janeiro
Journals
2015 EN
Bruna Rodrigues Monteiro · Mônica Gisele Costa Pinheiro · Deyla Moura Ramos Isoldi
+3 more
Objective: To identify the knowledge of adolescents linked to the National Program for Youth Inclusion on leprosy, involving issues such as etiology, transmission, signs and symptoms and the search for treatment. Method: An exploratory and descriptive study. For data collection was used a questionnaire with closed questions about the disease before and after the educational action with 109 young men and women 13-17 years old. Results: Show of knowledge regarding the etiology, transmission, signs and symptoms, and acquired after the lecture. Conclusion: Health education enables the nursing staff to promote interactive and dynamic knowledge of the young
Federal University of the State of Rio de Janeiro
Resource
2015 EN
Michele Dall'Arno · Elsa Passaro · Rodrigo Gallego
+2 more
Semi-device-independent quantum protocols realize information tasks - e.g.secure key distribution, random access coding, and randomness generation - in ascenario where no assumption on the internal working of the devices used in theprotocol is made, except their dimension. These protocols offer two mainadvantages: first, their implementation is often less demanding thanfully-device-independent protocols. Second, they are more secure than theirdevice-dependent counterparts. Their classical analogous is represented byrandom access codes, which provide a general framework for describing one-sidedclassical communication tasks. We discuss conditions under which detectioninefficiencies can be exploited by a malicious provider to fake the performanceof semi-device-independent quantum and classical protocols - and how to preventit.
Resource
2015 EN
Michele Conforti · Bert Gerards · Kanstantsin Pashkovich
We develop decomposition/composition tools for efficiently solving maximumweight stable sets problems as well as for describing them as polynomiallysized linear programs (using "compact systems"). Some of these are well-knownbut need some extra work to yield polynomial "decomposition schemes". We apply the tools to graphs with no even hole and no cap. A hole is achordless cycle of length greater than three and a cap is a hole together withan additional node that is adjacent to two adjacent nodes of the hole and thathas no other neighbors on the hole.
Resource
2015 EN
Jean-Christophe Aval · Michele D'Adderio · Mark Dukes
+1 more
We introduce two operators on stable configurations of the sandpile modelthat provide an algorithmic bijection between recurrent and parkingconfigurations. This bijection preserves their equivalence classes with respectto the sandpile group. The study of these operators in the special case of thecomplete bipartite graph ${K}_{m,n}$ naturally leads to a generalization of thewell known Cyclic Lemma of Dvoretsky and Motzkin, via pairs of periodicbi-infinite paths in the plane having slightly different slopes. We achieve ourresults by interpreting the action of these operators as an action on a pointin the grid $\mathbb{Z}^2$ which is pointed to by one of these pairs of paths.Our Cyclic lemma allows us to enumerate several classes of polyominoes, andtherefore builds on the work of Irving and Rattan (2009), Chapman et al.(2009), and Bonin et al. (2003).
Resource
2015 EN
Mikhail Khristoforov · Victor Kleptsyn · Michele Triestino
This paper is inspired by the problem of understanding in a mathematicalsense the Liouville quantum gravity on surfaces. Here we show how to define astationary random metric on self-similar spaces which are the limit of nicefinite graphs: these are the so-called hierarchical graphs. They possess awell-defined level structure and any level is built using a simple recursion.Stopping the construction at any finite level, we have a discrete random metricspace when we set the edges to have random length (using a multiplicativecascade with fixed law $m$). We introduce a tool, the cut-off process, by meansof which one finds that renormalizing the sequence of metrics by an exponentialfactor, they converge in law to a non-trivial metric on the limit space. Suchlimit law is stationary, in the sense that glueing together a certain number ofcopies of the random limit space, according to the combinatorics of the brickgraph, the obtained random metric has the same law when rescaled by a randomfactor of law $m$. In other words, the stationary random metric is the solutionof a distributional equation. When the measure $m$ has continuous positivedensity on $\mathbf{R}_+$, the stationary law is unique up to rescaling and anyother distribution tends to a rescaled stationary law under the iterations ofthe hierarchical transformation. We also investigate topological and geometricproperties of the random space when $m$ is $\log$-normal, detecting a phasetransition influenced by the branching random walk associated to themultiplicative cascade.
Resource
2015 EN
SNS Michele Marini · IF Berardo Ruffini
We solve a class of weighted isoperimetric problems of the form $$ \min\left\{\int\_{\partial E}w e^V\,dx:\int\_E e^V\,dx={\rm constant}\right\}$$ where $w$ and $V$ are suitable functions on $\R^d$. As a consequence, weprove a comparison result for the solutions of degenerate elliptic equations.
Resource
2015 EN
Michele Bolognesi · Michael Lönne
In this paper we study the topology of the stack $\mathcal{T}_g$ of smoothtrigonal curves of genus g, over the complex field. We make use of aconstruction by the first named author and Vistoli, that describes$\mathcal{T}_g$ as a quotient stack of the complement of the discriminant. Thisallows us to use techniques developed by the second named author to givepresentations of the orbifold fundamental group of $\mathcal{T}_g$, of itssubstrata with prescribed Maroni invariant and describe their relation with themapping class group $\mathcal{M}ap_g$ of Riemann surfaces of genus g.
Resource
2015 EN
Roghayeh Joda · Michele Zorzi
In this paper, an underlay cognitive radio network that consists of anarbitrary number of secondary users (SU) is considered, in which the primaryuser (PU) employs Type-I Hybrid Automatic Repeat Request (HARQ). Exploiting theredundancy in PU retransmissions, each SU receiver applies forward interferencecancelation to remove a successfully decoded PU message in the subsequent PUretransmissions. The knowledge of the PU message state at the SU receivers andthe ACK/NACK message from the PU receiver are sent back to the transmitters.With this approach and using a Constrained Markov Decision Process (CMDP) modeland Constrained Multi-agent MDP (CMMDP), centralized and decentralized optimumaccess policies for SUs are proposed to maximize their average sum throughputunder a PU throughput constraint. In the decentralized case, the channel accessdecision of each SU is unknown to the other SU. Numerical results demonstratethe benefits of the proposed policies in terms of sum throughput of SUs. Theresults also reveal that the centralized access policy design outperforms thedecentralized design especially when the PU can tolerate a low average longterm throughput. Finally, the difficulties in decentralized access policydesign with partial state information are discussed.
Resource
2015 EN
Francesca Arrigo · Michele Benzi
The total communicability of a network (or graph) is defined as the sum ofthe entries in the exponential of the adjacency matrix of the network, possiblynormalized by the number of nodes. This quantity offers a good measure of howeasily information spreads across the network, and can be useful in the designof networks having certain desirable properties. The total communicability canbe computed quickly even for large networks using techniques based on theLanczos algorithm. In this work we introduce some heuristics that can be used to add, delete, orrewire a limited number of edges in a given sparse network so that the modifiednetwork has a large total communicability. To this end, we introduce new edgecentrality measures which can be used to guide in the selection of edges to beadded or removed. Moreover, we show experimentally that the total communicability provides aneffective and easily computable measure of how "well-connected" a sparsenetwork is.