| 661. |
|
|
| 662. |
- Yoneyama, Sachiko, et al.
(författare)
-
Gene-centric meta-analyses for central adiposity traits in up to 57 412 individuals of European descent confirm known loci and reveal several novel associations
- 2014
-
Ingår i: Human Molecular Genetics. - : Oxford University Press (OUP). - 0964-6906 .- 1460-2083. ; 23:9, s. 2498-2510
-
Tidskriftsartikel (refereegranskat)abstract
- Waist circumference (WC) and waist-to-hip ratio (WHR) are surrogate measures of central adiposity that are associated with adverse cardiovascular events, type 2 diabetes and cancer independent of body mass index (BMI). WC and WHR are highly heritable with multiple susceptibility loci identified to date. We assessed the association between SNPs and BMI-adjusted WC and WHR and unadjusted WC in up to 57 412 individuals of European descent from 22 cohorts collaborating with the NHLBIs Candidate Gene Association Resource (CARe) project. The study population consisted of women and men aged 2080 years. Study participants were genotyped using the ITMAT/Broad/CARE array, which includes 50 000 cosmopolitan tagged SNPs across 2100 cardiovascular-related genes. Each trait was modeled as a function of age, study site and principal components to control for population stratification, and we conducted a fixed-effects meta-analysis. No new loci for WC were observed. For WHR analyses, three novel loci were significantly associated (P 2.4 10(6)). Previously unreported rs2811337-G near TMCC1 was associated with increased WHR ( SE, 0.048 0.008, P 7.7 10(9)) as was rs7302703-G in HOXC10 ( 0.044 0.008, P 2.9 10(7)) and rs936108-C in PEMT ( 0.035 0.007, P 1.9 10(6)). Sex-stratified analyses revealed two additional novel signals among females only, rs12076073-A in SHC1 ( 0.10 0.02, P 1.9 10(6)) and rs1037575-A in ATBDB4 ( 0.046 0.01, P 2.2 10(6)), supporting an already established sexual dimorphism of central adiposity-related genetic variants. Functional analysis using ENCODE and eQTL databases revealed that several of these loci are in regulatory regions or regions with differential expression in adipose tissue.
|
|
| 663. |
|
|
| 664. |
- Bender, Michael A., et al.
(författare)
-
The minimum backlog problem
- 2015
-
Ingår i: Theoretical Computer Science. - : ELSEVIER SCIENCE BV. - 0304-3975 .- 1879-2294. ; 605, s. 51-61
-
Tidskriftsartikel (refereegranskat)abstract
- We study the minimum backlog problem (MBP). This online problem arises, e.g., in the context of sensor networks. We focus on two main variants of MBP. The discrete MBP is a 2-person game played on a graph G = (V, E). The player is initially located at a vertex of the graph. In each time step, the adversary pours a total of one unit of water into cups that are located on the vertices of the graph, arbitrarily distributing the water among the cups. The player then moves from her current vertex to an adjacent vertex and empties the cup at that vertex. The players objective is to minimize the backlog, i.e., the maximum amount of water in any cup at any time. The geometric MBP is a continuous-time version of the MBP: the cups are points in the two-dimensional plane, the adversary pours water continuously at a constant rate, and the player moves in the plane with unit speed. Again, the players objective is to minimize the backlog. We show that the competitive ratio of any algorithm for the MBP has a lower bound of Omega (D), where D is the diameter of the graph (for the discrete MBP) or the diameter of the point set (for the geometric MBP). Therefore we focus on determining a strategy for the player that guarantees a uniform upper bound on the absolute value of the backlog. For the absolute value of the backlog there is a trivial lower bound of Omega (D), and the deamortization analysis of Dietz and Sleator gives an upper bound of O (D log N) for N cups. Our main result is a tight upper bound for the geometric MBP: we show that there is a strategy for the player that guarantees a backlog of O(D), independently of the number of cups. We also study a localized version of the discrete MBP: the adversary has a location within the graph and must act locally (filling cups) with respect to his position, just as the player acts locally (emptying cups) with respect to her position. We prove that deciding the value of this game is PSPACE-hard. (C) 2015 Elsevier B.V. All rights reserved.
|
|
| 665. |
- Bratman, Gregory N., et al.
(författare)
-
Nature and mental health : An ecosystem service perspective
- 2019
-
Ingår i: Science Advances. - : American Association for the Advancement of Science (AAAS). - 2375-2548. ; 5:7
-
Forskningsöversikt (refereegranskat)abstract
- A growing body of empirical evidence is revealing the value of nature experience for mental health. With rapid urbanization and declines in human contact with nature globally, crucial decisions must be made about how to preserve and enhance opportunities for nature experience. Here, we first provide points of consensus across the natural, social, and health sciences on the impacts of nature experience on cognitive functioning, emotional well-being, and other dimensions of mental health. We then show how ecosystem service assessments can be expanded to include mental health, and provide a heuristic, conceptual model for doing so.
|
|
| 666. |
- Bulik, CM, et al.
(författare)
-
Selection of eating-disorder phenotypes for linkage analysis
- 2005
-
Ingår i: American journal of medical genetics. Part B, Neuropsychiatric genetics : the official publication of the International Society of Psychiatric Genetics. - : Wiley. - 1552-4841. ; 139B:1, s. 81-87
-
Tidskriftsartikel (refereegranskat)
|
|
| 667. |
- Efrat, Alon, et al.
(författare)
-
Improved Approximation Algorithms for Relay Placement
- 2016
-
Ingår i: ACM Transactions on Algorithms. - : ACM Press. - 1549-6325 .- 1549-6333. ; 12:2, s. 20-
-
Tidskriftsartikel (refereegranskat)abstract
- In the relay placement problem, the input is a set of sensors and a number r >= 1, the communication range of a relay. In the one-tier version of the problem, the objective is to place a minimum number of relays so that between every pair of sensors there is a path through sensors and/or relays such that the consecutive vertices of the path are within distance r if both vertices are relays and within distance 1 otherwise. The two-tier version adds the restrictions that the path must go through relays, and not through sensors. We present a 3.11-approximation algorithm for the one-tier version and a polynomial-time approximation scheme (PTAS) for the two-tier version. We also show that the one-tier version admits no PTAS, assuming P not equal NP.
|
|
| 668. |
|
|
| 669. |
|
|
| 670. |
- Fekete, Sandor P., et al.
(författare)
-
Computing Nonsimple Polygons of Minimum Perimeter
- 2016
-
Ingår i: EXPERIMENTAL ALGORITHMS, SEA 2016. - Cham : SPRINGER INT PUBLISHING AG. - 9783319388502 - 9783319388519 ; , s. 134-149
-
Konferensbidrag (refereegranskat)abstract
- We provide exact and approximation methods for solving a geometric relaxation of the Traveling Salesman Problem (TSP) that occurs in curve reconstruction: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techniques, we prove how the topological structure of a polygon leads to NP-hardness of the MPP. On the positive side, we show how to achieve a constant-factor approximation. When trying to solve MPP instances to provable optimality by means of integer programming, an additional difficulty compared to the TSP is the fact that only a subset of subtour constraints is valid, depending not on combinatorics, but on geometry. We overcome this difficulty by establishing and exploiting additional geometric properties. This allows us to reliably solve a wide range of benchmark instances with up to 600 vertices within reasonable time on a standard machine. We also show that using a natural geometry-based sparsification yields results that are on average within 0.5% of the optimum.
|
|
