186 research outputs found

    Higher in-hospital mortality during weekend admission for acute coronary syndrome: a large-scale cross-sectional Italian study

    Get PDF
    AIMS: An increased mortality risk during weekend hospital admission has been consistently observed. In the present study, we evaluated whether the current improvement in management of acute coronary syndromes (ACS) has reduced this phenomenon. METHODS AND RESULTS: We extracted data from the Italian National Healthcare System Databank of 80\u200a391 ACS admissions in the region of Lombardia between 2010 and 2014. ICD-9 codes were used to assess the diagnosis. We performed a multiple logistic regression analysis to compare the mortality rates between weekend and weekday admissions.Mean age of the study population was 67.6 years; 30.1% of patients were women. ST segment elevation myocardial infarction (STEMI) accounts for 42.2% of admissions. The total in-hospital mortality was 3.05% and was positively predicted by weekend admission [odds ratio (OR) 1.13, P\u200a=\u200a0.006], age and female sex. The weekend effect on mortality was only significant for STEMI (OR 1.11, P\u200a=\u200a0.04) in comparison to non-STEMI (NSTEMI) or unstable angina.The trend of the risk of death was found to be negatively correlated with age: the risk of death was significantly higher in all age clusters younger than 75 (OR 1.22, P\u200a<\u200a0.01) and even greater in the very young subgroup under 45 years of age (OR 2.09, P\u200a=\u200a0.03). CONCLUSION: Our data indicate that increased mortality risk is still present during weekend admissions. This phenomenon is particularly evident in younger patients and in individuals admitted for STEMI

    On the Benefits of Network-Level Cooperation in Millimeter-Wave Communications

    Full text link
    Relaying techniques for millimeter-wave wireless networks represent a powerful solution for improving the transmission performance. In this work, we quantify the benefits in terms of delay and throughput for a random-access multi-user millimeter-wave wireless network, assisted by a full-duplex network cooperative relay. The relay is equipped with a queue for which we analyze the performance characteristics (e.g., arrival rate, service rate, average size, and stability condition). Moreover, we study two possible transmission schemes: fully directional and broadcast. In the former, the source nodes transmit a packet either to the relay or to the destination by using narrow beams, whereas, in the latter, the nodes transmit to both the destination and the relay in the same timeslot by using a wider beam, but with lower beamforming gain. In our analysis, we also take into account the beam alignment phase that occurs every time a transmitter node changes the destination node. We show how the beam alignment duration, as well as position and number of transmitting nodes, significantly affect the network performance. Moreover, we illustrate the optimal transmission scheme (i.e., broadcast or fully directional) for several system parameters and show that a fully directional transmission is not always beneficial, but, in some scenarios, broadcasting and relaying can improve the performance in terms of throughput and delay.Comment: arXiv admin note: text overlap with arXiv:1804.0945

    Beam Based Stochastic Model of the Coverage Probability in 5G Millimeter Wave Systems

    Full text link
    Communications using frequency bands in the millimeter-wave range can play a key role in future generations of mobile networks. By allowing large bandwidth allocations, high carrier frequencies will provide high data rates to support the ever-growing capacity demand. The prevailing challenge at high frequencies is the mitigation of large path loss and link blockage effects. Highly directional beams are expected to overcome this challenge. In this paper, we propose a stochastic model for characterizing beam coverage probability. The model takes into account both line-of-sight and first-order non-line-of-sight reflections. We model the scattering environment as a stochastic process and we derive an analytical expression of the coverage probability for any given beam. The results derived are validated numerically and compared with simulations to assess the accuracy of the model

    Maximum Throughput Scheduling for Multi-connectivity in Millimeter-Wave Networks

    Full text link
    Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range, connectivity to multiple cells can drastically increase the network performance in terms of throughput and reliability by coordination among the network elements. In this paper, we propose an algorithm for the link scheduling optimization that maximizes the network throughput for multi-connectivity in millimeter-wave cellular networks. The considered approach exploits a centralized architecture, fast link switching, proactive context preparation and data forwarding between millimeter-wave access points and the users. The proposed algorithm is able to numerically approach the global optimum and to quantify the potential gain of multi-connectivity in millimeter-wave cellular networks

    Non-cognitive factors of educational achievement: motivation and anxiety

    Get PDF
    Educational achievement has traditionally been closely associated with general cognitive ability (g). Although g explains a substantial portion of variance in educational attainment, several non-cognitive factors have been found to relate to achievement beyond g. The present thesis focuses on exploring the association between achievement and two such factors: motivation and anxiety. The five empirical chapters included in the present thesis address several questions regarding the relation between motivation, anxiety and achievement, which to date remained unexplored. The present thesis includes data from two samples: the Twins Early Development Study (TEDS), a large-scale developmental twin sample from the United Kingdom (UK), and a sample of students attending the first year of secondary school in the UK, who contributed data longitudinally. The results showed that academic anxiety and motivation are domain-specific constructs. This observed domain-specificity of motivation and anxiety was also found to apply to their association with academic achievement. Motivation and anxiety constructs were moderately heritable, and the remaining variance explained by nonshared, individual specific, environmental influences. The cross-sectional and longitudinal links between motivation, anxiety and achievement were largely due to genetic influences common to all measures within a specific academic domain. The present thesis also explored the directionality of effects in the longitudinal associations between educational achievement and motivation; partly supporting the view of reciprocal links between the two constructs in several academic domains. However, a reciprocal relation between motivation and achievement was not observed in the domain of second language in a sample of naïve learners. The results of the present thesis have important implication for future research and practice. For example, it is argued that future interventions aimed at reducing the academic anxiety should consider three main factors: (1) its domain specific; (2) the directionality of effects in its association with achievement; (3) possible factors moderating or mediating the association between anxiety and achievement (i.e. motivation)

    Network Selection and Resource Allocation Games for Wireless Access Networks

    Get PDF
    Wireless access networks are often characterized by the interaction of different end users, communication technologies, and network operators. This paper analyzes the dynamics among these "actors" by focusing on the processes of wireless network selection, where end users may choose among multiple available access networks to get connectivity, and resource allocation, where network operators may set their radio resources to provide connectivity. The interaction among end users is modeled as a non-cooperative congestion game where players (end users) selfishly select the access network that minimizes their perceived selection cost. A method based on mathematical programming is proposed to find Nash equilibria and characterize their optimality under three cost functions, which are representative of different technological scenarios. System level simulations are then used to evaluate the actual throughput and fairness of the equilibrium points. The interaction among end users and network operators is then assessed through a two-stage multi-leader/multi-follower game, where network operators (leaders) play in the first stage by properly setting the radio resources to maximize their users, and end users (followers) play in the second stage the aforementioned network selection game. The existence of exact and approximated subgame perfect Nash equilibria of the two-stage game is thoroughly assessed and numerical results are provided on the "quality" of such equilibria

    Stochastic characterization of the spectrum sharing game in ad-hoc networks

    Get PDF
    Abstract This work focuses on infrastructure-less ad hoc wireless networks where multiple transmitter/receiver pairs share the same radio resources (spectrum); transmitters have to choose how to split a total power budget across orthogonal spectrum bands with the goal to maximize their sum rate under cumulative interference from concurrent transmissions. We start off by introducing and characterizing the non-cooperative game among transmitter/receiver pairs when the network topology is deterministically given. The corresponding Nash equilibria are derived, highlighting their dependency on the topological parameters (distances between wireless nodes, propagation model, and background noise power). The analysis is then extended to the case of random network topologies drawn from a given spatial stochastic process. Tools of stochastic geometry are leveraged to derive a statistical characterization of the equilibria of the spectrum sharing game. Finally, a distributed algorithm is proposed to let the players of the spectrum sharing game converge to equilibria conditions. Numerical simulations show that the proposed algorithm drives the users to stable points that are close to the equilibria of the game requiring limited information exchange among nodes

    The developmental interplay between the p-factor of psychopathology and the g-factor of intelligence from age 7 through 16 years

    Get PDF
    Intelligence and mental health are the core pillars of individual adaptation, growth, and opportunity. Here, we charted across childhood and adolescence the developmental interplay between the p-factor of psychopathology, which captures the experience of symptoms across the spectrum of psychiatric disorders, and the g-factor of general intelligence that describes the ability to think, reason, and learn.Our preregistered analyses included 7,433 twin pairs from the Twins Early Development Study (TEDS), who were born 1994 to 1996 in England and Wales. At the ages 7, 9, 12, and 16 years, the twins completed two to four intelligence tests, and multi-informant measures (i.e., self-, parent- and teacher-rated) of psychopathology were collected.Independent of their cross-sectional correlations, p- and g-factors were linked by consistent, bidirectional, and negative cross-lagged paths across childhood and adolescence (from -.07 to -.13 with 95% CIs from -.03 to -.15). The cross-lagged paths from intelligence to psychopathology were largely due to genetic influences, but the paths from psychopathology to intelligence were driven by environmental factors, and increasingly so with age.Our findings suggest that intelligence and psychopathology are developmentally intertwined due to fluctuating etiological processes. Understanding the interplay of g- and p-factors is key for improving children's developmental outcomes

    A note on nonlinear critical problems involving the Grushin Subelliptic Operator: bifurcation and multiplicity results

    Full text link
    We consider the boundary value problem \cases{ -\Delta_\gamma u = \lambda u + \left\vert u \right\vert^{2^*_\gamma-2}u &in $\Omega$\cr u = 0 &on $\partial\Omega$,\cr } where Ω\Omega is an open bounded domain in RN\mathbb{R}^N, N≥3N \geq 3, while Δγ\Delta_\gamma is the Grushin operator Δγu(z)=Δxu(z)+∣x∣2γΔyu(z)(γ≥0). \Delta_ \gamma u(z) = \Delta_x u(z) + \vert x \vert^{2\gamma} \Delta_y u (z) \quad (\gamma\ge 0). We prove a multiplicity and bifurcation result for this problem, extending the results of Cerami, Fortunato and Struwe and of Fiscella, Molica Bisci and Servadei

    Game theoretic models for resource sharing in wireless networks

    Get PDF
    Wireless communications have been recently characterized by rapid proliferation of wireless networks, impressive growth of standard and technologies, evolution of the end-user terminals, and increasing demand in the wireless spectrum. New, more flexible schemes for the management of the available resources, from both the user and the network side, are necessary in order to improve the efficiency in the usage of the available resources.This work aims at shedding light on the performance modeling of radio resource sharing/allocation situations. Since, in general, the quality of service perceived by a system (e.g., user, network) strictly depends on the behavior of the other entities, and the involved interactions are mainly competitive, this work introduces a framework based on non–cooperative game theoretic tools. Furthermore, non–cooperative game theory is suitable in distributed networks, where control and management are inherently decentralized.First, we consider the case in which many users have to make decisions on which wireless access point to connect to. In this scenario, the quality perceived by the users mainly depends on the number of other users choosing the very same accessing opportunity. In this context, we also consider two–stage games where network make decisions on how to use the available resources, and users react to this selecting the network that maximizes their satisfaction. Then, we refer to the problem of spectrum sharing, where users directly compete for portions of the available spectrum. Finally, we provide a more complex model where the users utility function is based on the Shannon rate. The aim of this second part is to provide a better representation of the satisfaction perceived by the users, i.e., in terms of achievable throughput. Due to the complexity of the game model, we first provide a complete analytical analysis of the two–user case. Then, we extend the model to the N–user case. We mainly analyze this game through simulations. Finally, inspired by the results obtained numerically, we introduce stochastic geometry in the analysis of spectrum games in order to predict the performance of the game in large networks.Ph.D., Electrical Engineering -- Drexel University, 201
    • …
    corecore