Academic literature on the topic 'Generalised n-body problem'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Generalised n-body problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Generalised n-body problem"

1

Kelishadi, Roya, Siamak Alikhani, Alireza Delavari, Farshid Alaedini, Afshin Safaie, and Eliyeh Hojatzadeh. "Obesity and associated lifestyle behaviours in Iran: findings from the First National Non-communicable Disease Risk Factor Surveillance Survey." Public Health Nutrition 11, no. 3 (March 2008): 246–51. http://dx.doi.org/10.1017/s1368980007000262.

Full text
Abstract:
AbstractObjectiveTo assess the national prevalence of overweight and obesity, as well as some associated lifestyle behaviours, for the first time in Iran.Design and SettingsThis population-based study was performed in early 2005 as part of the World Health Organization (WHO) STEPwise approach to non-communicable diseases’ risk factor surveillance. Dietary and physical activity habits were assessed by WHO questionnaires.SubjectsThe study population comprised 89 532 subjects aged over 15 years living in the 28 provinces of Iran.ResultsOverall, 50.4% (n= 45 113) of the participants were male and 64.6% (n= 57 866) were from the urban areas. The national estimates of overweight, obesity and morbid obesity were 28.6%, 10.8% and 3.4%, respectively. Body mass index (BMI) ≥ 25 kg m−2in men, women, urban residents and rural residents were found in 37%, 48%, 46.7% and 35.5%, respectively. Abdominal obesity was present in 43.4% of women, 9.7% of men, 28.5% of the urban residents and 23% of the rural residents. Overweight as well as generalised and abdominal obesity were more prevalent in the 45–64-year age group. Although there was no significant difference in frequency of consumption of the food groups in subjects with different BMI categories, various kinds of physical activities showed a steady decline with increasing BMI.ConclusionsThe findings of the present study provide alarming evidence for health professionals and policy makers about the very high prevalence of generalised and abdominal obesity in Iran. The unhealthy lifestyle habits, notably sedentary lifestyles in our community, are the major contributing factors for this emerging public health problem.
APA, Harvard, Vancouver, ISO, and other styles
2

Bharti, Aakanksha. "Hazard Exposure and Health Assessment of Construction Workers in New Delhi, India." International Journal of Preventive, Curative & Community Medicine 06, no. 02 (December 21, 2020): 22–27. http://dx.doi.org/10.24321/2454.325x.202009.

Full text
Abstract:
Introduction: Construction workers are at a risk of a number of health-related problems, and are exposed to a plethora of occupational hazards. Due to dearth of studies on construction workers about various determinants playing key role on their health. Objectives: 1) To determine the socio-demographic status of construction workers. 2) To assess workplace hazard exposure among study subjects. 3) To evaluate the overall health of the study subjects. Method: An opportunity was created in a general health camp organised by Department of Community Medicine, VMMC and Safdarjung Hospital, Delhi in collaboration with Central Public Work Department (C.P.W.D) Officers’ Wives Association. All the construction workers attending the health camp were approached and only those who consented were included in the study. An interviewer administered questionnaire was filled for all the study subjects. Along with the questionnaire, detailed clinical examination was done, blood pressure and random blood sugar was measured. Simple tables and cross tables were made to present the data. Result: Total 129 construction workers were included in the study. Nearly 87% of the workers were employed on temporary or contract basis. 63.6% (n=82) spent 8 to 12 hours per day at work. Around half of the construction workers earned Rs. 10,000 per month or less. Thermal stress affected the maximum number of workers (54.3%), followed by dust (53.5%), followed by noise (38%). Around 10% (13) of the workers complained of having some health problem. Various complaints were generalised body ache, headache, weakness, fever, cough, cold, blood in sputum, decreased appetite and blood in stools. Conclusion: Construction workers are suffering from adverse health problems. There is the importance of regulating work hours of construction workers, periodic training on safe work culture and ways to reduce workplace injuries.
APA, Harvard, Vancouver, ISO, and other styles
3

Plastino, A. R., A. Plastino, and C. Tsallis. "The classical N-body problem within a generalized statistical mechanics." Journal of Physics A: Mathematical and General 27, no. 17 (September 7, 1994): 5707–14. http://dx.doi.org/10.1088/0305-4470/27/17/008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rivera, Andrés. "Periodic Solutions in the Generalized Sitnikov $(N+1)$-Body Problem." SIAM Journal on Applied Dynamical Systems 12, no. 3 (January 2013): 1515–40. http://dx.doi.org/10.1137/120883876.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Curilef, Sergio. "Generalized statistical mechanics for the N-body quantum problem — ideal gases." Zeitschrift für Physik B Condensed Matter 100, no. 3 (December 1997): 433–40. http://dx.doi.org/10.1007/s002570050144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tibboel, Pieter. "Finiteness of polygonal relative equilibria for generalised quasi-homogeneous n-body problems and n-body problems in spaces of constant curvature." Journal of Mathematical Analysis and Applications 441, no. 1 (September 2016): 183–93. http://dx.doi.org/10.1016/j.jmaa.2016.04.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zyza, A. V. "On generalized N. Kovalevski equations in two problems of rigid body dynamics." Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki 29, no. 1 (March 2019): 73–83. http://dx.doi.org/10.20537/vm190107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hampton, Marshall, and Anders Nedergaard Jensen. "Finiteness of relative equilibria in the planar generalized $N$-body problem with fixed subconfigurations." Journal of Geometric Mechanics 7, no. 1 (2015): 35–42. http://dx.doi.org/10.3934/jgm.2015.7.35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Riahi, Hasna. "Study of the generalized solutions of n-body type problems with weak forces." Nonlinear Analysis: Theory, Methods & Applications 28, no. 1 (January 1997): 49–59. http://dx.doi.org/10.1016/0362-546x(95)00135-i.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fu, Yan-ning, and Yi-sui Sun. "Central configurations of n- body problem with generalized potential. (II). The numbers and shapes for 2 ⩽ n ⩽ 4." Chinese Astronomy and Astrophysics 17, no. 1 (January 1993): 99–106. http://dx.doi.org/10.1016/0275-1062(93)90047-s.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Generalised n-body problem"

1

Riegel, Ryan Nelson. "Generalized N-body problems: a framework for scalable computation." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50269.

Full text
Abstract:
In the wake of the Big Data phenomenon, the computing world has seen a number of computational paradigms developed in response to the sudden need to process ever-increasing volumes of data. Most notably, MapReduce has proven quite successful in scaling out an extensible class of simple algorithms to even hundreds of thousands of nodes. However, there are some tasks---even embarrassingly parallelizable ones---that neither MapReduce nor any existing automated parallelization framework is well-equipped to perform. For instance, any computation that (naively) requires consideration of all pairs of inputs becomes prohibitively expensive even when parallelized over a large number of worker nodes. Many of the most desirable methods in machine learning and statistics exhibit these kinds of all-pairs or, more generally, all-tuples computations; accordingly, their application in the Big Data setting may seem beyond hope. However, a new algorithmic strategy inspired by breakthroughs in computational physics has shown great promise for a wide class of computations dubbed generalized N-body problems (GNBPs). This strategy, which involves the simultaneous traversal of multiple space-partitioning trees, has been applied to a succession of well-known learning methods, accelerating each asymptotically and by orders of magnitude. Examples of these include all-k-nearest-neighbors search, k-nearest-neighbors classification, k-means clustering, EM for mixtures of Gaussians, kernel density estimation, kernel discriminant analysis, kernel machines, particle filters, the n-point correlation, and many others. For each of these problems, no overall faster algorithms are known. Further, these dual- and multi-tree algorithms compute either exact results or approximations to within specified error bounds, a rarity amongst fast methods. This dissertation aims to unify a family of GNBPs under a common framework in order to ease implementation and future study. We start by formalizing the problem class and then describe a general algorithm, the generalized fast multipole method (GFMM), capable of solving all problems that fit the class, though with varying degrees of speedup. We then show O(N) and O(log N) theoretical run-time bounds that may be obtained under certain conditions. As a corollary, we derive the tightest known general-dimensional run-time bounds for exact all-nearest-neighbors and several approximated kernel summations. Next, we implement a number of these algorithms in a commercial database, empirically demonstrating dramatic asymptotic speedup over their conventional SQL implementations. Lastly, we implement a fast, parallelized algorithm for kernel discriminant analysis and apply it to a large dataset (40 million points in 4D) from the Sloan Digital Sky Survey, identifying approximately one million quasars with high accuracy. This exceeds the previous largest catalog of quasars in size by a factor of ten and has since been used in a follow-up study to confirm the existence of dark energy.
APA, Harvard, Vancouver, ISO, and other styles
2

Xiao, Bo. "Parallel algorithms for generalized N-body problem in high dimensions and their applications for bayesian inference and image analysis." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53052.

Full text
Abstract:
In this dissertation, we explore parallel algorithms for general N-Body problems in high dimensions, and their applications in machine learning and image analysis on distributed infrastructures. In the first part of this work, we proposed and developed a set of basic tools built on top of Message Passing Interface and OpenMP for massively parallel nearest neighbors search. In particular, we present a distributed tree structure to index data in arbitrary number of dimensions, and a novel algorithm that eliminate the need for collective coordinate exchanges during tree construction. To the best of our knowledge, our nearest neighbors package is the first attempt that scales to millions of cores in up to a thousand dimensions. Based on our nearest neighbors search algorithms, we present "ASKIT", a parallel fast kernel summation tree code with a new near-far field decomposition and a new compact representation for the far field. Specially our algorithm is kernel independent. The efficiency of new near far decomposition depends only on the intrinsic dimensionality of data, and the new far field representation only relies on the rand of sub-blocks of the kernel matrix. In the second part, we developed a Bayesian inference framework and a variational formulation for a MAP estimation of the label field for medical image segmentation. In particular, we propose new representations for both likelihood probability and prior probability functions, as well as their fast calculation. Then a parallel matrix free optimization algorithm is given to solve the MAP estimation. Our new prior function is suitable for lots of spatial inverse problems. Experimental results show our framework is robust to noise, variations of shapes and artifacts.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Generalised n-body problem"

1

Ellis, Marquita, Aydin Buluc, and Katherine Yelick. "Scaling Generalized N-Body Problems, A Case Study from Genomics." In ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3472517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ellis, Marquita, Aydin Buluc, and Katherine Yelick. "Scaling Generalized N-Body Problems, A Case Study from Genomics." In ICPP 2021: 50th International Conference on Parallel Processing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3472456.3472517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ellis, Marquita, Aydın Buluç, and Katherine Yelick. "Asynchrony versus bulk-synchrony for a generalized N-body problem from genomics." In PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3437801.3441580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Anderson, Kurt S., and Michael J. A. Sadowski. "An Efficient Method for Contact/Impact Problems in Multibody Systems: Topologies With Many Loops." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/vib-48340.

Full text
Abstract:
This paper presents an algorithm for the efficient numerical analysis and simulation of contact/impact problems in modest to heavily constrained multi-rigid-body dynamic systems. The algorithm can accommodate the spatial motion of general multirigid-body systems containing arbitrarily many closed loops in O(n+m) operations overall for systems containing n generalized coordinates, and m independent algebraic constraints. The presented method uses a generalized momentum balance approach to determine the velocity jumps which take place across impacts in such constrained multibody dynamic systems. The presented method does not suffer from the performance (speed) penalty encountered by most other momentum balance methods given its O(n + m) cost, and exact direct embedded consideration of the all constraints. Due to these characteristics, the presented algorithm offers superior computing performance relative to other methods in situations involving both large n and m.
APA, Harvard, Vancouver, ISO, and other styles
5

Anderson, Kurt S., and Michael J. A. Sadowski. "An Efficient Method for Contact/Impact Problems in Multibody Systems: Tree Topologies." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/vib-48339.

Full text
Abstract:
This paper presents an algorithm for the efficient numerical analysis and simulation of contact/impact problems in tree topology multi-rigid-body dynamic systems. The algorithm can accommodate the jumps in structure which occur in the equations of motion of general multi-rigid-body tree systems due to a contact/impact event between bodies, or due to the locking of joints. The presented method uses a generalized momentum balance approach to determine the velocity jumps which take place across impacts in such multibody dynamic systems, and where necessary explicitly determines impact impulsive loads (both working and non-working). The presented method does not suffer from the performance (speed) penalty encountered by most other momentum balance methods given its O(n) overall cost, and exact direct embedded consideration of the all constraints. Due to these characteristics, the presented algorithm offers superior computing performance relative to other methods in situations involving both large n and potentially many unilateral constraints.
APA, Harvard, Vancouver, ISO, and other styles
6

Sadowski, Michael J., and Kurt S. Anderson. "An Efficient Method for a Category of Contact/Impact Problems in Multibody Systems: Tree Topologies." In ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2005. http://dx.doi.org/10.1115/detc2005-85563.

Full text
Abstract:
This paper presents an algorithm for the efficient numerical analysis and simulation of a category of contact/impact problems in multi-rigid-body dynamic systems with tree topologies. The algorithm can accommodate the jumps in structure which occur in the equations of motion of general multi-rigid-body systems due to a contact/impact event between bodies, or due to the locking of joints as long as the resulting system is a tree topology. The presented method uses a generalized momentum balance approach to determine the velocity jumps which take place across impacts in such multibody dynamic systems where event constraint forces are of the “non-working” category. The presented method does not suffer from the performance (speed) penalty encountered by most other momentum balance methods given its O(n) overall cost, and exact direct embedded consideration of all the constraints. Due to these characteristics, the presented algorithm offers superior computing performance relative to other methods in situations involving both large n and potentially many unilateral constraints.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography