| 541. |
- Lundberg, Frida E., et al.
(författare)
-
Mortality in 43,598 men with infertility - a Swedish nationwide population-based cohort study
- 2019
-
Ingår i: Clinical Epidemiology. - : DOVE Medical Press Ltd.. - 1179-1349 .- 1179-1349. ; 11, s. 645-657
-
Tidskriftsartikel (refereegranskat)abstract
- Background: Previous studies indicate a higher risk of comorbidity in men with infertility; however, research on mortality is scarce and the few studies that do exist have rarely differentiated between infertility and infertility-related diagnoses.Objective: To examine mortality in men with an infertility or infertility-related diagnosis.Design, setting, and participants: Population-based cohort study of men born in 1944-1992 in Sweden. We used Cox regression estimated hazard ratios (HRs) for infertility while adjusting for number of children, education, year of birth, country of birth, diabetes, hypertension, liver disease and end-stage renal disease. In all, 43,598 men with a diagnosis of infertility and 57,733 men with an infertility-related diagnosis were compared with 2,762,254 men (reference group) without such diagnoses.Outcome measures: All-cause and cause-specific mortality at age 20 to 69 years.Results and limitations: The 2,863,585 men in the study were followed for a median time of 22.0 years. During follow-up, 439 men with a diagnosis of infertility died, corresponding to a crude incidence rate of 1.56 deaths per 1,000 person-years. These figures can be compared with 1,400 deaths in men with an infertility-related diagnosis (1.96 deaths/1,000 person-years) and 99,463 deaths in reference individuals (2.17 deaths/1,000 person-years). Overall, men with a diagnosis of infertility did not have a higher risk of death (adjusted [a] HR=0.98; 95% confidence interval [95% CI]=0.89-1.08), but had a higher risk of death before age 30 (20-29 years) (aHR=3.26; 95% CI=2.42-4.41). This early excess mortality was largely explained by cancer diagnosed before infertility. Having an infertility-related diagnosis was associated with death (aHR=1.23; 95% CI=1.17-1.30). Limitations include the lack of general screening for infertility in Sweden and the lack of information on semen parameters.Conclusion: Men with a diagnosis of infertility are not at a higher risk of death than the general population, although having a diagnosis related to infertility may be linked to a higher risk of death.Patient summary: Men with a diagnosis of infertility do not seem to have a higher risk of death though an infertility-related diagnosis in men is associated with the risk of death.
|
|
| 542. |
- Lundberg, F. E., et al.
(författare)
-
Ovarian stimulation and risk of breast cancer in Swedish women
- 2017
-
Ingår i: Fertility and Sterility. - : Elsevier BV. - 0015-0282 .- 1556-5653. ; 108:1, s. 137-144
-
Tidskriftsartikel (refereegranskat)abstract
- Objective: To investigate whether ovarian stimulation for treating infertility is associated with the risk of breast cancer. Patient(s): In a cohort of 1,340,211 women who gave birth 1982-2012, we investigated the relationship between assisted reproductive technology (ART) and incidence of breast cancer. Associations between any ovarian stimulation since 2005 and breast cancer incidence were studied in a separate cohort of 1,877,140 women born 1960-92. Both cohorts were followed through 2012. Main Outcome Measure(s): Hazard ratios (HRs) and 95% confidence intervals (CIs) for breast cancer. Result(s): There was no increased risk of breast cancer in women who gave birth after ART compared with women who gave birth after spontaneous conception (adjusted HR, 0.84; 95% CI, 0.74-0.95). The incidence of breast cancer was not increased among women who received controlled ovarian stimulation or among women who received other hormonal fertility treatments since 2005, regardless of live birth (adjusted HR, 0.86; 95% CI, 0.69-1.07; and adjusted HR, 0.79; 95% CI, 0.60-1.05, respectively). Conclusion(s): No increased incidence of breast cancer was found among women who had gone through ovarian stimulations, including ART. These results are consistent with other studies and reassuring given the widespread and increasing use of ART. (C) 2017 The Authors. Published by Elsevier Inc. on behalf of the American Society for Reproductive Medicine.
|
|
| 543. |
- Machado, J., et al.
(författare)
-
Performance of timing Resistive Plate Chambers with protons from 200 to 800 MeV
- 2015
-
Ingår i: Journal of Instrumentation. - 1748-0221. ; 10:1, s. C01043-
-
Tidskriftsartikel (refereegranskat)abstract
- A prototype composed of four resistive plate chamber layers has been exposed to quasi-monoenergetic protons produced from a deuteron beam of varying energy (200 to 800 AMeV) in experiment S406 at GSI, Darmstadt, Germany. The aim of the experiment is to characterize the response of the prototype to protons in this energy range, which deposit from 1.75 to 6 times more energy than minimum ionizing particles. Each layer, with an active area of about 2000 × 500 mm 2 , is made of modules containing the active gaps, all in multigap construction. Each gap is defined by 0.3 mm nylon mono-filaments positioned between 2.85 mm thick float glass electrodes. The modules are operated in avalanche mode with a non-flammable gas mixture composed of 90% C 2 H 2 F 4 and 10% SF 6 . The signals are readout by a pick-up electrode formed by 15 copper strips (per layer), spaced at a pitch of 30 mm, connected at both sides to timing front end electronics. Results show an uniform efficiency close to 100% along with a timing resolution of around 60 ps on the entire 2000 × 500 mm 2 area.
|
|
| 544. |
- Mai, Vien V., et al.
(författare)
-
Curvature-exploiting acceleration of elastic net computations
- 2019
-
Ingår i: 36th International Conference on Machine Learning, ICML 2019. - : International Machine Learning Society (IMLS). ; , s. 7573-7594
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces an efficient second-order method for solving the elastic net problem. Its key innovation is a computationally efficient technique for injecting curvature information in the optimization process which admits a strong theoretical performance guarantee. In particular, we show improved run time over popular first-order methods and quantify the speed-up in terms of statistical measures of the data matrix. The improved time complexity is the result of an extensive exploitation of the problem structure and a careful combination of second-order information, variance reduction techniques, and momentum acceleration. Beside theoretical speed-up, experimental results demonstrate great practical performance benefits of curvature information, especially for ill-conditioned data sets.
|
|
| 545. |
- Mai, Vien V., et al.
(författare)
-
Lock-Free Incremental Coordinate Descent
- 2017
-
Ingår i: 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509028733
-
Konferensbidrag (refereegranskat)abstract
- We study a flexible algorithm for minimizing a sum of component functions, each of which depends on a large number of decision variables. The algorithm combines aspects of incremental gradient method with that of coordinate descent. In contrast to earlier algorithms of this kind, our algorithm is lock-free and does not require synchronization of access to the shared memory. We prove convergence of the algorithm under asynchronous operation and provide explicit bounds on how the solution times depend on the degree of asynchrony. Numerical experiments confirm our theoretical results.
|
|
| 546. |
- Mai, Vien V., et al.
(författare)
-
Noisy Accelerated Power Method for Eigenproblems With Applications
- 2019
-
Ingår i: IEEE Transactions on Signal Processing. - : IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. - 1053-587X .- 1941-0476. ; 67:12, s. 3287-3299
-
Tidskriftsartikel (refereegranskat)abstract
- This paper introduces an efficient algorithm for finding the dominant generalized eigenvectors of a pair of symmetric matrices. Combining tools from approximation theory and convex optimization, we develop a simple scalable algorithm with strong theoretical performance guarantees. More precisely, the algorithm retains the simplicity of the well-knownpower method but enjoys the asymptotic iteration complexity of the powerful Lanczos method. Unlike these classic techniques, our algorithm is designed to decompose the overall problem into a series of subproblems that only need to be solved approximately. The combination of good initializations, fast iterative solvers, and appropriate error control in solving the subproblems lead to a linear running time in the input sizes compared to the superlinear time for the traditional methods. The improved running time immediately offers acceleration for several applications. As an example, we demonstrate how the proposed algorithm can be used to accelerate canonical correlation analysis, which is a fundamental statistical tool for learning of a low-dimensional representation of high-dimensional objects. Numerical experiments on real-world datasets confirm that our approach yields significant improvements over the current state of the art.
|
|
| 547. |
- Mai, Vien V., et al.
(författare)
-
NONLINEAR ACCELERATION OF CONSTRAINED OPTIMIZATION ALGORITHMS
- 2019
-
Ingår i: 2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP). - : IEEE. - 9781479981311 ; , s. 4903-4907
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces a novel technique for nonlinear acceleration of first-order methods for constrained convex optimization. Previous studies of nonlinear acceleration have only been able to provide convergence guarantees for unconstrained convex optimization. In contrast, our method is able to avoid infeasibility of the accelerated iterates and retains the theoretical performance guarantees of the unconstrained case. We focus on Anderson acceleration of the classical projected gradient descent (PGD) method, but our techniques can easily be extended to more sophisticated algorithms, such as mirror descent. Due to the presence of a constraint set, the relevant fixed-point mapping for PGD is not differentiable. However, we show that the convergence results for Anderson acceleration of smooth fixed-point iterations can be extended to the non-smooth case under certain technical conditions.
|
|
| 548. |
|
|
| 549. |
|
|
| 550. |
|
|
