Meeting Summary of The NYO3 5th NO-Age/AD Meeting and the 1st Norway-UK Joint Meeting on Aging and Dementia:Recent Progress on the Mechanisms and Interventional Strategies

Unhealthy aging poses a global challenge with profound healthcare and socioeconomic implications. Slowing down the aging process offers a promising approach to reduce the burden of a number of age-related diseases, such as dementia, and promoting healthy longevity in the old population. In response to the challenge of the aging population and with a view to the future, Norway and the United Kingdom are fostering collaborations, supported by a "Money Follows Cooperation agreement" between the 2 nations. The inaugural Norway-UK joint meeting on aging and dementia gathered leading experts on aging and dementia from the 2 nations to share their latest discoveries in related fields. Since aging is an international challenge, and to foster collaborations, we also invited leading scholars from 11 additional countries to join this event. This report provides a summary of the conference, highlighting recent progress on molecular aging mechanisms, genetic risk factors, DNA damage and repair, mitophagy, autophagy, as well as progress on a series of clinical trials (eg, using NAD+ precursors). The meeting facilitated dialogue among policymakers, administrative leaders, researchers, and clinical experts, aiming to promote international research collaborations and to translate findings into clinical applications and interventions to advance healthy aging.</p

Parallel Computing Methods For The Epri Spatial Kinetics Code Arrotta

New neutronics solution methods implemented in the EPRI spatial kinetics code ARROTTA are presented. The new methods were originally developed for parallel execution, but significant performance improvement was achieved with the new methods even in serial applications. The methods are characterized by the nonlinear nodal method based on two-node coupling relations derived for both the analytic nodal method (ANM) and the nodal expansion method (NEM), a solver for the coarse mesh finite differenced problem based on a Krylov subspace method, and a domain decomposition method to achieve parallelism. The new code is examined using various transient benchmark problems which include the NEA PWR rod ejection and uncontrolled rod withdrawal at HZP. To verify the solution accuracy of the new method, comparisons are made between the original ARROTTA solutions and the new solutions for both eigenvalue and transient calculations. Comparisons are also made to assess the solution accuracy of the two-..

A relaxed approach to combinatorial problems in robustness and diagnostics

A range of procedures in both robustness and diagnostics require optimisation of a target functional over all subsamples of given size. Whereas such combinatorial problems are extremely difficult to solve exactly, something less than the global optimum can be ‘good enough’ for many practical purposes, as shown by example. Again, a relaxation strategy embeds these discrete, high-dimensional problems in continuous, low-dimensional ones. Overall, nonlinear optimisation methods can be exploited to provide a single, reasonably fast algorithm to handle a wide variety of problems of this kind, thereby providing a certain unity. Four running examples illustrate the approach. On the robustness side, algorithmic approximations to minimum covariance determinant (MCD) and least trimmed squares (LTS) estimation. And, on the diagnostic side, detection of multiple multivariate outliers and global diagnostic use of the likelihood displacement function. This last is developed here as a global complement to Cook’s (in J. R. Stat. Soc. 48:133–169, 1986) local analysis. Appropriate convergence of each branch of the algorithm is guaranteed for any target functional whose relaxed form is—in a natural generalisation of concavity, introduced here—‘gravitational’. Again, its descent strategy can downweight to zero contaminating cases in the starting position. A simulation study shows that, although not optimised for the LTS problem, our general algorithm holds its own with algorithms that are so optimised. An adapted algorithm relaxes the gravitational condition itself