Relevant bibliographies by topics / Tur\'{a}n problem

Academic literature on the topic 'Tur\'{a}n problem'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tur\'{a}n 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 "Tur\'{a}n problem"

1

F�redi, Zolt�n. "On a Tur�n type problem of Erd�s." Combinatorica 11, no. 1 (March 1991): 75–79. http://dx.doi.org/10.1007/bf01375476.

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

Shi, Y. G. "An analogue of problem 26 of P. Turán." Bulletin of the Australian Mathematical Society 53, no. 1 (February 1996): 1–12. http://dx.doi.org/10.1017/s000497270001666x.

Full text
Abstract:
Explicit formulas for Cotes numbers of the Gaussian Hermite quadrature formula based on the zeros of the nth Chebyshev polynomial of the second kind and their asymptotic behaviour as n → ∞ are given. This provides an answer to an analogue of Problem 26 of Tur´n.
APA, Harvard, Vancouver, ISO, and other styles
3

Davoyan, Irina. "Possibilities of Using the Scratch Programming Environment at the First Stage of School Education (to the Problem Statement)." Primary Education 8, no. 5 (October 30, 2020): 30–32. http://dx.doi.org/10.12737/1998-0728-2020-30-32.

Full text
Abstract:
The article discusses approaches to the use of the Scrath programming environment in the educational process of primary school. The methodological manuals of S.N. Tur, T.P. Bokuchava, O. N. Burtaeva, describing the methodology for teaching programming, and various educational programming environments: LightBot, Little Wizzard, RoboMind. The possibilities that open up when using the Scrath programming environment in solving the problems of forming information literacy of younger students, organizing their educational research activities, as well as positive socialization are evaluated.
APA, Harvard, Vancouver, ISO, and other styles
4

Kato, Tomonori, Kazushi Nomura, Fukuo Kondo, Masami Wakisaka, and Akira Komiya. "Analysis of Japanese Patients Treated with or without Long-Term Epirubicin Plus Ara-C Intravesical Instillation Therapy for Low-Grade Superficial Bladder Cancer." Scientific World Journal 2015 (2015): 1–5. http://dx.doi.org/10.1155/2015/325305.

Full text
Abstract:
The high incidence of tumor recurrence following transurethral resection (TUR) represents a major problem encountered in the management of bladder cancer. This study examined the efficacy of intravesical chemotherapy in superficial bladder cancer. We retrospectively analyzed 90 Japanese cases with low-grade superficial transitional cell carcinoma (stage T1, grades 1 and 2) who were rendered tumor-free by TURBT (TUR of bladder tumor) and who thereafter were treated with or without intravesical chemotherapy. Among them, instillation was terminated in 2 patients due to adverse effects (severe but reversible chemical cystitis). Remaining 88 patients were divided into 2 groups according to therapy: the TURBT-only group(n=46), defined as patients treated with TURBT alone, and the Instillation group(n=42), defined as patients treated with weekly intravesical instillation therapies using epirubicin plus Ara-C. Recurrence-free rate was significantly higher in the Instillation group than in the TURBT-only group (p=0.02, HR = 0.457). The 5-year recurrence-free rate was 58.5% for the Instillation group and 38.6% for the TURBT-only group. Our instillation schedule represents the most intensive regimen among previously reported therapies and resulted in a 54.3% decrease in incidence of tumor recurrence. We believe that the results of this study could provide useful information on management of bladder cancer.
APA, Harvard, Vancouver, ISO, and other styles
5

Yin, Jianhua, and Guangming Li. "A note on the potential function of an arbitrary graph H." Filomat 34, no. 11 (2020): 3759–66. http://dx.doi.org/10.2298/fil2011759y.

Full text
Abstract:
Given a graph H, a graphic sequence ? is potentially H-graphic if there is a realization of ? containing H as a subgraph. In 1991, Erd?s et al. introduced the following problem: determine the minimum even integer ?(H,n) such that each n-term graphic sequence with sum at least ?(H,n) is potentially H-graphic. This problem can be viewed as a ?potential? degree sequence relaxation of the Tur?n problems. Let H be an arbitrary graph of order k. Ferrara et al. [Combinatorica, 36(2016)687-702] established an upper bound on ?(H,n): if ? = ?(n) is an increasing function that tends to infinity with n, then there exists an N = N(?,H) such that ?(H,n)? ?~(H)n + ?(n) for any n ? N, where ?~(H) is a parameter only depending on the graph H. Recently, Yin [European J. Combin., 85(2020)103061] obtained a new upper bound on ?(H,n): there exists an M = M(k,?(H)) such that ?(H,n) ? ?~(H)n + k2-3k+4 for any n ? M. In this paper, we investigate the precise behavior of ?(H,n) for arbitrary H with ?~?(H)+1(H < ?~(H) or??(H)+1(H) ? 2, where ??(H)+1(H) = min{?F)|F is an induced subgraph of H and |V(F)|= ?(H) + 1} and ?~?(H)+1(H) = 2(k-?(H)-1)+??(H)+1(H)-1. Moreover, we also show that ?(H,n) = (k-?(H)-1)(2n-k+?(H))+2 for those H so that ??(H)+1(H) = 1,?~?(H)+1(H)=~?~(H),?~p(H) < ?~(H) for ?(H) + 2 ? p ? k and there is an F < H with |V(F)| = ?(H) + 1 and ?(F) = (12,0?(H)-1).
APA, Harvard, Vancouver, ISO, and other styles
6

XU, JINHUI, ZHIYONG LIN, YANG YANG, and RONALD BEREZNEY. "TRAVELING SALESMAN PROBLEM OF SEGMENTS." International Journal of Computational Geometry & Applications 14, no. 01n02 (April 2004): 19–40. http://dx.doi.org/10.1142/s0218195904001342.

Full text
Abstract:
In this paper, we present a polynomial time approximation scheme (PTAS) for a variant of the traveling salesman problem (called segment TSP) in which a traveling salesman tour is sought to traverse a set of n ∊-separated segments in two dimensional space. Our results are based on an interesting combinatorial result which bounds the total number of entry points in an optimal TSP tour and a generalization of Arora's technique5 for Euclidean TSP (of a set of points). The randomized version of our algorithm takes O(n2( log n)O(1/∊2)) time to compute a (1+∊)-approximation with probability ≥l/2, and can be derandomized with an additional factor of O(n2).
APA, Harvard, Vancouver, ISO, and other styles
7

Bansal, M. S., and O. Eulenstein. "An Ω(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem." IEEE/ACM Transactions on Computational Biology and Bioinformatics 5, no. 4 (October 2008): 514–24. http://dx.doi.org/10.1109/tcbb.2008.69.

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

MONGELLI, H., and S. W. SONG. "PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS." International Journal of Foundations of Computer Science 10, no. 04 (December 1999): 375–89. http://dx.doi.org/10.1142/s0129054199000277.

Full text
Abstract:
Given an array of n real numbers A=(a0, a1, …, an-1), define MIN(i,j)= min {ai,…,aj}. The range minima problem consists of preprocessing array A such that queries MIN(i,j), for any 0≤i≤n-1 can be answered in constant time. Range minima is a basic problem that appears in many other important graph problems such as lowest common ancestor, Euler tour, etc. In this work we present a parallel algorithm under the CGM model (coarse grained multicomputer), that solves the range minima problem in O(n/p) time and constant number of communication rounds. The communication overhead involves the transmission of p numbers (independent of n). We show promising experimental results with speedup curves approximating the optimal for large n.
APA, Harvard, Vancouver, ISO, and other styles
9

Eremeev, Anton, and Yulia Kovalenko. "On solving Travelling Salesman Problem with Vertex Requisitions." Yugoslav Journal of Operations Research 27, no. 4 (2017): 415–26. http://dx.doi.org/10.2298/yjor161012003e.

Full text
Abstract:
We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard. The algorithm, we propose for this problem, has less time complexity compared to the previously known one. In particular, almost all feasible instances of the problem are solvable in O(n) time using the new algorithm, where n is the number of vertices. The developed approach also helps in fast enumeration of a neighborhood in the local search and yields an integer programming model with O(n) binary variables for the problem.
APA, Harvard, Vancouver, ISO, and other styles
10

JÁJÁ, JOSEPH, and KWAN WOO RYU. "AN OPTIMAL RANDOMIZED PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM." Parallel Processing Letters 06, no. 02 (June 1996): 187–93. http://dx.doi.org/10.1142/s0129626496000182.

Full text
Abstract:
We describe a randomized parallel algorithm to solve the single function coarsest partition problem. The algorithm runs in O( log n) time using O(n) operations with high probability on the Priority CRCW PRAM. The previous best known algorithms run in O( log 2 n) time using O(n log 2 n) operations on the CREW PRAM and O( log n) time using O(n log log n) operations on the Arbitrary CRCW PRAM. The technique presented can be used to generate the Euler tour of a rooted tree optimally from the parent representation.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Tur\'{a}n problem"

1

Breed, Elizabeth Alice. "'n Metakognitiewe onderrigleerstrategie vir paarprogrammeerders ter verbetering van kennisproduktiwiteit / Elizabeth Alice Breed." Thesis, North-West University, 2010. http://hdl.handle.net/10394/4367.

Full text
Abstract:
Metacognition in collaborative learning settings is an emerging topic in research on metacognition. This study focused on the development of metacognitive skills during pair programming in order to enhance knowledge productivity. Pair programming entails collaboration between two programmers, each fulfilling a specific role during the execution of the programming task, and has recently been used in educational contexts as a teaching and learning strategy to improve learning in computer programming (DeClue, 2003:49; Preston, 2006b:16). In this study the outcomes of collaborative learning during pair programming are referred to as knowledge productivity, which is measured against the criteria of enhanced knowledge construction, enhanced problem-solving skills, conceptual changes in individual perspectives, commitment to work with the other member of the pair, and application of the results of the learning process (Tillema & Van der Westhuizen, 2006:51,55). To investigate the influence of a metacognitive teaching and learning approach to pair programming on knowledge productivity, a repeated-measures experiment with a control group was conducted among a number of Grade 11 learners who had been implementing pair programming in the learning of Information Technology at secondary school level. At the beginning of the study both groups completed two questionnaires, one on metacognition and the other on knowledge productivity. At the same stage, a number of randomly selected participants from each group were interviewed on the same two topics, using a semi-structured interview approach. This procedure was repeated three months later, without any intervention. During the intervention phase, the experimental group implemented a set of self-directed metacognitive questions that they had to answer while doing a pair programming task. These self-directed metacognitive questions form part of a metacognitive teaching and learning strategy suggested by the researcher. The members of the experimental group also kept a journal to describe how the self-directed questions directed their thinking during the execution of the pair programming task. At the end of the experimental period, the mo questionnaires on metacognition and knowledge productivity were completed by both groups again, supported by the interviews of the same selected participants. The results derived from the empirical study showed that the knowledge productivity of learners programming in pairs can be enhanced by implementing a metacognitive teaching and learning strategy. The metacognitive teaching and learning strategy implemented during this study was then adapted to make it suitable for use by teachers and learners during pair programming.
Thesis (Ph.D. (Education)--North-West University, Potchefstroom Campus, 2010.
APA, Harvard, Vancouver, ISO, and other styles
2

Coba, Caballero Dulce Mar��a. "Expectativas del segmento l��sbico gay sobre la oferta tur��stica." Thesis, Universidad de las Am��ricas Puebla, 2010. http://catarina.udlap.mx/u_dl_a/tales/documentos/lhr/coba_c_dm/.

Full text
Abstract:
El turismo rosa est�� formado por el segmento l��sbico gay, el cual es un grupo con altos beneficios econ��micos para el turismo, ya que est�� acostumbrado a darse lujos y viajar constantemente. La oferta tur��stica para el segmento l��sbico gay es poca, por lo que se desean saber las expectativas que tiene el segmento sobre lugares como hoteles, restaurantes, centros nocturnos, entre otros. A partir de la investigaci��n, se pudo conocer los or��genes del segmento, el crecimiento del turismo l��sbico gay, al igual que la amplitud de la oferta existente. Saber la importancia de las expectativas del consumidor para proveer una oferta interesante e innovadora para dicho segmento. Se menciona el impacto que tienen las experiencias en los consumidores, y en consecuencia, su comportamiento. Fue importante saber acerca de la discriminaci��n y la aceptaci��n del segmento l��sbico gay. A trav��s de entrevistas profundas, se pudo conocer las caracter��sticas que busca el segmento l��sbico gay en la oferta tur��stica
(cont.) Se muestran las caracter��sticas que buscan para lugares como hoteles y restaurantes, al igual que sus preferencias y gustos para algunos establecimientos. Se exponen las incomodidades y molestias en varios lugares visitados. Y por ��ltimo, se mencionan los destinos gay friendly m��s importantes y frecuentados a nivel mundial
APA, Harvard, Vancouver, ISO, and other styles
3

Xie, Zhifu. "On the N-body Problem." Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1444.pdf.

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

Hernandez, David Michael. "Solving the N-body problem in astrophysics." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119107.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Physics, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 299-307).
The astrophysical N-body problem describes N point masses interacting with each other through pairwise gravitational forces. A solution of this problem is frequently necessary in dynamical astronomy. In the collisional N-body problem, the relaxation time is small compared to the timescale we are interested in studying. Collisional N-body problems include open and globular clusters and protoplanetary disks during the stage, typically lasting hundreds of Myrs, when planetary embryos collide and merge. In the first part of this Thesis, I develop new symplectic integrators which provide a solution for the N-body problem. The integrators decompose the N-body problem into a superposition of two-body problems, which are integrable. Since they are symplectic, the integrators conserve all Poincaré invariants (the evolution is Hamiltonian). We used the integrators to compute the evolution of a globular cluster through core collapse up to 20 times faster than standard techniques. In the second part of this Thesis, I apply the results from the first part of the Thesis to planetary dynamics finding that for problems with hierarchical binaries (planets with moons, planetary systems with binary stars, etc.), the integrators are far more efficient than alternatives. I show numerically that a popular code is neither symplectic nor time-symmetric, and can yield incorrect three-body dynamics. I derive symplectic integrators in various coordinate systems with different Hamiltonian splittings and compare them through backward error analysis and tests of Pluto's orbital element evolution. The final part of this Thesis is concerned with time-symmetric and time-reversible integration in astrophysics, whether we are integrating the N-body problem or other ordinary differential equations. These integrators have been proposed as an alternative to symplectic integration. I show, again using backward error analysis, that such integrators are usually useful, but can behave worse than symplectic integrators. I find time-reversibility can be eliminated in some cases while good error behavior is still maintained.
by David Michael Hernandez.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
5

Arruda, Alian Paiva de. "Os "farofeiros" em excurs?o nas lagoas de Arituba, Bo?gua e Carcar? (N?sia Floresta/RN): an?lise de uma outra face do turismo potiguar." Universidade Federal do Rio Grande do Norte, 2010. http://repositorio.ufrn.br:8080/jspui/handle/123456789/18904.

Full text
Abstract:
Made available in DSpace on 2015-03-13T17:10:40Z (GMT). No. of bitstreams: 1 AlianPA_DISSERT.pdf: 4769520 bytes, checksum: 7890c59949f5adb4689d50c9e649d658 (MD5) Previous issue date: 2010-06-11
This thesis analyzes another side of Potiguar tourism , the unplanned side, neglected and kept out of touristic activities: excursionism, a leisure practice enjoyed by tourists with low consumer power, and who are commonly referred by the pejorative term farofeiros (picnic lovers). The geographic research sites considered for this study include Arituba, Bo?gua and Carcar? lakes in N?sia Florest, Rio Grande do Norte, where on Sundays and holidays the arrival of hundreds of excursionists, from around the metropolitan region of Natal, from surrounding municipalities, and neighboring States, such as Para?ba and Pernambuco, can be observed. The objective of this study is to analyze the appropriation of the physical site by the practice of excursionism, focusing on its relation to other social agents that also appropriate a designated touristic area. The theoretical discussion considers the use of the space by the touristic leisure practice and the appropriation by distinct social agents, using categories of analysis, such as, production of the space, territory and leisure. The field work was completed with interviews and questionnaires administered to excursionists, excursion organizers, local merchants, representatives of the public setor from the municipalities, and professional dune buggy drivers; besides this, photos, informal dialogue and field observations were important methodological instruments used. From the data, statistical analysis and the development of thematic maps demonstrating the established flux between excursionists and the segregated activity were done. With this research, one can affirm that the practice of excursionism is neglected by the public sector, contrary to the intention of the hegemonic agent?s intentionality present in this touristic territory which aim at the development of a lucrative activity, geared toward tourists with greater spending power. This ignored and neglected faction of Potiguar tourism is considered poor or dirty , and generate conflicts among the distinct social agents: tourists, the market and the public sector, simultaneously peaking interest, which is then appropriated by the informal sector and formal economy. Excursionism is an expressive phenomenon, a socially relevant practice, enjoyed by citizens of the working class who, in order to have a day of leisure, use alternative consumer practices and subvert various strategies of segregation that are imposed within these tourist areas, behavior that, in part, justifies the nickname, picnic lovers , given to these tourists
Esta disserta??o analisa uma outra face do turismo potiguar , a face n?o planejada, negligenciada e segregada da atividade tur?stica. Trata-se do estudo do excursionismo, uma pr?tica de lazer tur?stico realizada por turistas com baixo poder de consumo, denominados pejorativamente de farofeiros , pelo senso comum. O recorte espacial da pesquisa compreende as lagoas de Arituba, Bo?gua e Carcar? (N?sia Floresta/RN), onde se observa nos dias de domingo e feriados a chegada de centenas de excursionistas, oriundos da Regi?o Metropolitana de Natal, de outros munic?pios do entorno e de estados vizinhos, como Para?ba e Pernambuco. O objetivo desta pesquisa ? analisar como se d? a apropria??o do espa?o pela pr?tica do excursionismo enfocando suas rela??es com outros agentes sociais os quais, tamb?m, se apropriam de um territ?rio tur?stico. A discuss?o te?rica considera o consumo do espa?o pela pr?tica do lazer tur?stico e a apropria??o por distintos agentes sociais, utilizando categorias de an?lise como produ??o do espa?o, territ?rio e lazer. A pesquisa de campo foi realizada por meio de entrevistas e aplica??o de question?rios, junto aos excursionistas, organizadores das excurs?es, comerciantes locais, representantes do poder p?blico municipal e da categoria profissional de bugueiros; al?m disto, o registro fotogr?fico, di?logos informais e a observa??o em campo foram instrumentos metodol?gicos importantes. A partir dos dados realizaram-se an?lises estat?sticas e elabora??o de mapas tem?ticos os quais expressam os fluxos estabelecidos pelos excursionistas e a segrega??o da atividade. Com a pesquisa, pode-se afirmar que a pr?tica do excursionismo ? negligenciada pelo poder p?blico, pois esta contraria a intencionalidade dos agentes hegem?nicos presentes neste territ?rio tur?stico uma vez que este visam o desenvolvimento de uma atividade lucrativa, voltada para turistas com maior poder de consumo. Observa-se nesta face ignorada do turismo potiguar, tida como pobre e suja , a exist?ncia de conflitos entre os distintos agentes sociais: turistas, comerciantes locais e poder p?blico, ao mesmo tempo em que, tamb?m, desperta o interesse e ? apropriada pelo setor informal e formal da economia. O excursionismo ? um fen?meno expressivo, uma pr?tica social relevante, realizada por cidad?os que comp?em a classe trabalhadora os quais, para terem um dia de lazer, utilizam-se de pr?ticas alternativas de consumo e burlam variadas estrat?gias de segrega??o que lhes s?o impostas neste territ?rio tur?stico, comportamentos que, em parte justifica a alcunha de farofeiro dada a estes turistas
APA, Harvard, Vancouver, ISO, and other styles
6

Valentini, Gabriele. "The Best-of-n Problem in Robot Swarms." Doctoral thesis, Universite Libre de Bruxelles, 2016. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/232502.

Full text
Abstract:
Collective decision making can be seen as a means of designing and understanding swarm robotics systems. While decision-making is generally conceived as the cognitive ability of individual agents to select a belief based only on their preferences and available information, collective decision making is a decentralized cognitive process, whereby an ensemble of agents gathers, shares, and processes information as a single organism and makes a choice that is not attributable to any of its individuals. A principled selection of the rules governing this cognitive process allows the designer to define, shape, and foresee the dynamics of the swarm.We begin this monograph by introducing the reader to the topic of collective decision making. We focus on artificial systems for discrete consensus achievement and review the literature of swarm robotics. In this endeavor, we formalize the best-of-n problem—a generalization of the logic underlying several cognitive problems—and define a taxonomy of its possible variants that are of interest for the design of robot swarms. By leveraging on this understanding, we identify the building-blocks that are essential to achieve a collective decision addressing the best-of-n problem: option exploration, opinion dissemination, modulation of positive feedback, and individual decision-making mechanism. We show how a modular perspective of a collective decision-making strategy allows for the systematic modeling of the resulting swarm performance. In doing so, we put forward a modular and model-driven design methodology that allows the designer to study the dynamics of a swarm at different level of abstractions. Successively, we employ the proposed design methodology to derive and to study different collective decision-making strategies for the best-of-n problem. We show how the designed strategies can be readily applied to different real-world scenarios by performing two series of robot experiments. In the first series, we use a swarm of 100 robots to tackle a site-selection scenario; in the second series, we show instead how the same strategies apply to a collective perception scenario. We conclude with a discussion of our research contributions and provide futuredirection of research.
Doctorat en Sciences de l'ingénieur et technologie
info:eu-repo/semantics/nonPublished
APA, Harvard, Vancouver, ISO, and other styles
7

Alhowaity, Sawsan Salem. "Relative equilibria in the curved N-body problem." Thesis, Canadian Mathematical Bulletin, 2018. https://dspace.library.uvic.ca//handle/1828/10037.

Full text
Abstract:
We consider the curved N-body problem, N > 2, on a surface of constant Gaussian curvature κ ≠ 0; i.e., on spheres S2κ, for κ > 0, and on hyperbolic manifolds H2κ, for κ < 0. Our goal is to define and study relative equilibria, which are orbits whose mutual distances remain constant during the motion. We find new relative equilibria in the curved N-body problem for N = 4, and see whether bifurcations occur when passing through κ = 0. After obtaining a criterion for the existence of quadrilateral configurations on the equator of the sphere, we study two restricted 4-body problems: One in which two bodies are massless , and the second in which only one body is massless. In the former we prove the evidence for square-like relative equilibria, whereas in the latter we discuss the existence of kite-shaped relative equilibria. We will further study the 5-body problem on surfaces of constant curvature. Four of the masses arranged at the vertices of a square, and the fifth mass at the north pole of S2κ, when the curvature is positive, it is shown that relative equilibria exists when the four masses at the vertices of the square are either equal or two of them are infinitesimal, such that they do not affect the motion of the remaining three masses. In the hyperbolic case H2κ, κ < 0, there exist two values for the angular velocity which produce negative elliptic relative equilibria when the masses at the vertices of the square are equal. We also show that the square pyramidal relative equilibria with non-equal masses do not exist in H2κ. Based on the work of Florin Diacu on the existence of relative equilibria for 3-body problem on the equator of S2κ, we investigate the motion of more than three bodies. Furthermore, we study the motion of the negative curved 2-and 3-centre problems on the Poincaré upper semi-plane model. Using this model, we prove that the 2-centre problem is integrable, and we study the dynamics around the equilibrium point. Further, we analyze the singularities of the 3- centre problem due to the collision; i.e., the configurations for which at least two bodies have identical coordinates.
Graduate
APA, Harvard, Vancouver, ISO, and other styles
8

Steiger, Don. "Numerical n-body methods in computational chemistry /." free to MU campus, to others for purchase, 1998. http://wwwlib.umi.com/cr/mo/fullcit?p9924930.

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

Stadel, Joachim Gerhard. "Cosmological N-body simulations and their analysis /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/5449.

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

Urminsky, David. "Stability and numerical errors in the N-body problem." Thesis, University of Edinburgh, 2008. http://hdl.handle.net/1842/9804.

Full text
Abstract:
Despite the wide acceptance that errors incurred in numerical solutions to N-body systems grow exponentially, most research assumes that the statistical results of these systems are reliable. However, if one is to accept that the statistical results of N-body solutions are reliable, it is important to determine if there are any systematic statistical errors resulting from the incurred growth of errors in individual solutions. In this thesis we consider numerical solutions to the 3-body problem in which one of the bodies escapes the system. It is shown for a particular 3-body con guration, known as the Sitnikov problem, that the mean lifetime of the system is dependent on the accuracy of the numerical integration. To provide a theoretical explanation of the phenomenon, an approximate Poincar´e map is developed whose dynamics on a particular surface of section is shown to be similar to the dynamics of the Sitnikov Problem. In fact there is a set on which the approximate Poincar´e map is topologically equivalent, like the Sitnikov Problem, to the shift map on the set of bi-in nite sequences. The structure of the escape regions on the surface of section form a cantor set-like structure whose boundary can more easily be delineated using the approximate Poincar´e map than for the Sitnikov problem. Further it is shown that numerical errors destroy escape regions and can cause orbits to migrate to a region in which escape is faster. Finally, a relationship between the Lyapunov time, tl, and the lifetime, td, of the 3-body problem is discussed. Firstly, the Sitnikov problem and the approximate Poincar´e map of the Sitnikov problem both exhibit a two-part power law relationship beween tl and td like that for a particular case of the general 3-body problem. Further, it is demonstrated that large perturbations to the energy of the escaping body in uences the relationship between tl and td for small tl. Finally, it is shown that the approximate Poincar´e map yields a theoretical explanation of the phenomenon based on the structure of the escape regions the orbits traverse before escape.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Tur\'{a}n problem"

1

Newton, Paul K. The N-Vortex Problem. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4684-9290-3.

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

Backes, Gertrud M. Alter(n) als ‚Gesellschaftliches Problem‘? Wiesbaden: VS Verlag für Sozialwissenschaften, 1997. http://dx.doi.org/10.1007/978-3-322-89583-7.

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

The N-vortex problem: Analytical techniques. New York: Springer, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

N-body gravitational problem: Unrestricted solution. Brampton, ON, Canada: Grevyt Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Newton, Paul K. The N-Vortex Problem: Analytical Techniques. New York, NY: Springer New York, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gravitational N-body simulations. Cambridge: Cambridge University Press, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dharma-Wardana, M. W. C. Le problème à N corps. [Paris: Association pour la diffusion de la connaissance scientifique, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Numerical solutions of the N-body problem. Dordrecht: D. Reidel, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Marciniak, Andrzej. Numerical Solutions of the N-Body Problem. Dordrecht: Springer Netherlands, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Meyer, Kenneth R. Periodic solutions of the N-body problem. Berlin: Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Tur\'{a}n problem"

1

Westermann, Thomas. "Gewöhnliche Differentialgleichungen n-ter Ordnung." In Mathematische Probleme lösen mit Maple, 130–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-12151-7_20.

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

Westermann, Thomas. "Gewöhnliche Differentialgleichungen n-ter Ordnung." In Mathematische Probleme lösen mit Maple, 130–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-41352-0_20.

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

Westermann, Thomas. "Gewöhnliche Differentialgleichungen n.-ter Ordnung." In Mathematische Probleme lösen mit Maple, 90–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-662-08569-1_17.

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

Westermann, Thomas. "Gewöhnliche Differentialgleichungen n-ter Ordnung." In Mathematische Probleme lösen mit Maple, 130–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2020. http://dx.doi.org/10.1007/978-3-662-60544-8_20.

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

Terracini, Susanna. "n-Body Problem n-Body problem choreographies and ChoreographiesChoreography n-body problem." In Mathematics of Complexity and Dynamical Systems, 1043–69. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-1806-1_61.

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

Terracini, Susanna. "n-Body Problem n-Body problem choreographies and ChoreographiesChoreography n-body problem." In Encyclopedia of Complexity and Systems Science, 5959–86. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-30440-3_351.

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

Weik, Martin H. "n-body problem." In Computer Science and Communications Dictionary, 1074. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_12120.

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

Arnold, Vladimir I., Valery V. Kozlov, and Anatoly I. Neishtadt. "The n-Body Problem." In Mathematical Aspects of Classical and Celestial Mechanics, 61–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-48926-9_2.

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

Arnold, Vladimir I. "The n-Body Problem." In Dynamical Systems III, 49–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/978-3-662-02535-2_2.

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

Back, Ralph-Johan, and Joakim Wright. "The N-Queens Problem." In Refinement Calculus, 403–12. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-1674-2_24.

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

Conference papers on the topic "Tur\'{a}n problem"

1

Zhao, Jingyang, and Mingyu Xiao. "The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/578.

Full text
Abstract:
The Traveling Tournament Problem is a well-known benchmark problem in tournament timetabling, which asks us to design a schedule of home/away games of n teams (n is even) under some feasibility requirements such that the total traveling distance of all the n teams is minimized. In this paper, we study TTP-2, the traveling tournament problem where at most two consecutive home games or away games are allowed, and give an effective algorithm for n/2 being odd. Experiments on the well-known benchmark sets show that we can beat previously known solutions for all instances with n/2 being odd by an average improvement of 2.66%. Furthermore, we improve the theoretical approximation ratio from 3/2+O(1/n) to 1+O(1/n) for n/2 being odd, answering a challenging open problem in this area.
APA, Harvard, Vancouver, ISO, and other styles
2

De Lima, Murilo Santos, Mário César San Felice, and Orlando Lee. "On a Leasing Variant of the Online Connected Facility Location Problem." In I Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/etc.2016.9837.

Full text
Abstract:
In the leasing optimization model, resources are leased for K different time periods, instead of being acquired for unlimited duration. The goal is to use these temporary resources to maintain a dynamic infrastructure that serves n requests while minimizing the total cost. We propose and study a leasing variant of the online connected facility location problem, which we call the online connected facility leasing problem. In this problem each client that arrives must be connected to a temporary facility, which in turn must be connected to a root facility using permanent edges. We present an algorithm that is O(K · lg n)-competitive if the scaling factor is M = 1.
APA, Harvard, Vancouver, ISO, and other styles
3

Sumita, Hanna, Yuma Yonebayashi, Naonori Kakimura, and Ken-ichi Kawarabayashi. "An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/616.

Full text
Abstract:
This paper focuses on a generalization of the traveling salesman problem (TSP), called the subpath planning problem (SPP). Given 2n vertices and n independent edges on a metric space, we aim to find a shortest tour that contains all the edges. SPP is one of the fundamental problems in both artificial intelligence and robotics. Our main result is to design a 1.5-approximation algorithm that runs in polynomial time, improving the currently best approximation algorithm. The idea is direct use of techniques developed for TSP. In addition, we propose a generalization of SPP called the subgroup planning problem (SGPP). In this problem, we are given a set of disjoint groups of vertices, and we aim to find a shortest tour such that all the vertices in each group are traversed sequentially. We propose a 3-approximation algorithm for SGPP. We also conduct numerical experiments. Compared with previous algorithms, our algorithms improve the solution quality by more than 10% for large instances with more than 10,000 vertices.
APA, Harvard, Vancouver, ISO, and other styles
4

Levitskaia, Tatiana. "THE FORGOTTEN WAR: WORKS BY N. A. LUKHMANOVA ABOUT MANCHURIA." In 9th International Conference ISSUES OF FAR EASTERN LITERATURES. St. Petersburg State University, 2021. http://dx.doi.org/10.21638/11701/9785288062049.28.

Full text
Abstract:
Nadezhda Lukhmanova (1841–1907) was a novelist, playwright, publicist, lecturer. Today her name is almost forgotten, but at the turn of the 19th–20th centuries she was well-known throughout Russia: her artistic and dramatic works were widely in demand, she gave lectures in the capital and abroad, worked as a journalist in the leading St. Petersburg newspapers. At the age of 62, she took part in the Russian-Japanese war as a nurse of the Red Cross and war correspondent (Peterburgskaia gazeta, Yuzhniy Krai). During her stay in the war and later in Japan, Lukhmanova wrote not only travel notes and articles for newspapers, but also short plays, stories based on real events (Shaman, Black stripe, Tree in the Palace of Chizakuin, Li-Tun-Chi), stylization of Chinese and Japanese fairy tales (The Only Language Clear for a Woman, Human Soul, Typhoon, Golden Fox). The writer raised a variety of topics: the place and role of women in the war, the organization of hospitals, unjustified victims of war and the problem of moral choice, as well as ethnographic sketches devoted to the traditions and mode of life of Manchuria and Japan. And if its early records resemble ethnographic sketches, filled with wariness towards the local population and a lack of understanding of Chinese customs, then later, in fairy tales and diary sketches, the sense of guilt before the Chinese people for the bloody slaughter taking place on their land becomes more clearly apparent. The works of the writer were undeservedly forgotten for more than a hundred years and are just beginning their return to literary memory.
APA, Harvard, Vancouver, ISO, and other styles
5

Bhargava, Nikhil, Tiago Vaquero, and Brian Williams. "Faster Conflict Generation for Dynamic Controllability." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/598.

Full text
Abstract:
In this paper, we focus on speeding up the temporal plan relaxation problem for dynamically controllable systems. We take a look at the current best-known algorithm for determining dynamic controllability and augment it to efficiently generate conflicts when the network is deemed uncontrollable. Our work preserves the O(n^3) runtime of the best available dynamic controllability checker and improves on the previous best runtime of O(n^4) for extracting dynamic controllability conflicts. We then turn our attention to temporal plan relaxation tasks and show how we can leverage our work on conflicts and the structure of the network to efficiently make incremental updates intended to restore dynamic controllability by relaxing constraints. Our new algorithm, RelaxIDC, has the same asymptotic runtime as previous algorithms but sees dramatic empirical improvements over the course of repeated dynamic controllability checks.
APA, Harvard, Vancouver, ISO, and other styles
6

Dubrov, Denis V. "N queens problem." In the 9th ACM SIGPLAN workshop. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2502488.2502492.

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

Golubeva, Natalia, Anna Ayanyan, and Svetlana Preobrazhenskaya. "FEATURES OF VIRTUAL SELF-PRESENTATION OF YOUTH IN THE MODERN TECHNOLOGICAL SOCIETY." In International Psychological Applications Conference and Trends. inScience Press, 2021. http://dx.doi.org/10.36315/2021inpact101.

Full text
Abstract:
"The article provides an overview of current research on the problem of digital socialization, as well as the features of constructing a virtual self-presentation. The proposed problem is up-to-date due to the fact that digital environment and social networks in particular, become more and more integrated into the process of socialization. The questions of how a person develops, lives and realizes his or her needs in digital environment turn out to be more and more significant. This article highlights the features of virtual self-presentation built by modern adolescents and young men (n=144). The obtained data show the features of creating a virtual self-presentation as well as internal and external factors affecting the characteristics and content of digital identity, which is mostly relevant for teenagers and youths. It was also found the relation between the level of social self-control and construction of self-presentation in social networks."
APA, Harvard, Vancouver, ISO, and other styles
8

Ishmuratova, Y. A., and V. I. Morosamova. "Conscious self-regulation as a resource of efficiency of task solving for novices and experts." In INTERNATIONAL SCIENTIFIC AND PRACTICAL ONLINE CONFERENCE. Знание-М, 2020. http://dx.doi.org/10.38006/907345-50-8.2020.526.537.

Full text
Abstract:
The article presents the results of comparing the development of conscious self-regulation and the effectiveness of solving professional tasks for novices and professionals. Participants were chemists with different levels of professional experience (N = 42), the group of novices included students of the Faculty of Chemistry (N = 21), the group of experts included chemists working in their specialty for more than ten years (N = 21). An analysis of objective indicators of the effectiveness of tasksolving has demonstrated that chemists with long work experience solve professional tasks faster and with fewer errors. Two types of strategies were identified in solving chemical tasks. Students have a «perceptual strategy» — they spend more time and effort analyzing the presented answer options, make more transitions between the presented task and answer options, and make longer fixations on the task area. Experts, in contrast, apply a «representative strategy» for solving problems, which is characterized by building a mental representation of a molecule of a substance, reducing the time it takes to solve a task, and increasing the duration of fixations on the problem area. Conscious self-regulation in this study was evaluated using the methodology «Style of self-regulation of behavior». Among the indicators of selfregulation, there are statistically reliably correlate both the indicator of the time taken to solve task and the indicator of errors made by the cognitive-regulatory process «target planning». A comparison of the regulatory indicators of students and experts revealed significant differences in the scales «Planning goals» and «Reliability». The data obtained allow us to conclude that development of conscious self-regulation of advancement and achievement of goals may turn out to be a significant resource for the effectiveness of a specialist in the field of chemistry. It is possible that the ability to plan professional goals and regulatory reliability develops with the acquisition of professional experience, which can contribute to the growth of the effectiveness of professional actions of specialists.
APA, Harvard, Vancouver, ISO, and other styles
9

Xia, Zhihong, Vasile Mioc, Cristiana Dumitrache, and Nedelia A. Popescu. "Symmetries in N-body problem." In EXPLORING THE SOLAR SYSTEM AND THE UNIVERSE. AIP, 2008. http://dx.doi.org/10.1063/1.2993622.

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

Ayala, A., H. Osman, D. Shapiro, J. M. Desmarais, J. Parri, M. Bolic, and V. Groza. "Accelerating N-queens problem using OpenMP." In 2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI). IEEE, 2011. http://dx.doi.org/10.1109/saci.2011.5873061.

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

Reports on the topic "Tur\'{a}n problem"

1

Zhang, Xingyu, Matteo Ciantia, Jonathan Knappett, and Anthony Leung. Micromechanical study of potential scale effects in small-scale modelling of sinker tree roots. University of Dundee, December 2021. http://dx.doi.org/10.20933/100001235.

Full text
Abstract:
When testing an 1:N geotechnical structure in the centrifuge, it is desirable to choose a large scale factor (N) that can fit the small-scale model in a model container and avoid unwanted boundary effects, however, this in turn may cause scale effects when the structure is overscaled. This is more significant when it comes to small-scale modelling of sinker root-soil interaction, where root-particle size ratio is much lower. In this study the Distinct Element Method (DEM) is used to investigate this problem. The sinker root of a model root system under axial loading was analysed, with both upward and downward behaviour compared with the Finite Element Method (FEM), where the soil is modelled as a continuum in which case particle-size effects are not taken into consideration. Based on the scaling law, with the same prototype scale and particle size distribution, different scale factors/g-levels were applied to quantify effects of the ratio of root diameter (𝑑𝑟) to mean particle size (𝐷50) on the root rootsoil interaction.
APA, Harvard, Vancouver, ISO, and other styles
2

Rao, N. S. V., E. M. Oblow, C. W. Glover, and G. E. liepins. N-learners problem: Fusion of concepts. Office of Scientific and Technical Information (OSTI), September 1991. http://dx.doi.org/10.2172/5241320.

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

Rao, N. S. V., E. M. Oblow, and C. W. Glover. N-learners problem: Learning Boolean combinations of halfspaces. Office of Scientific and Technical Information (OSTI), March 1992. http://dx.doi.org/10.2172/5654035.

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

Rao, N. S. V., E. M. Oblow, and C. W. Glover. N-learners problem: Learning Boolean combinations of halfspaces. Office of Scientific and Technical Information (OSTI), March 1992. http://dx.doi.org/10.2172/10133402.

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

Collins, Pat. Graphics Processing Unit (GPU) Performance on an N-Body Problem. Fort Belvoir, VA: Defense Technical Information Center, August 2009. http://dx.doi.org/10.21236/ada512706.

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

Efroimsky, Michael, and Peter Goldreich. Gauge Freedom in the N-body Problem of Celestial Mechanics. Fort Belvoir, VA: Defense Technical Information Center, July 2003. http://dx.doi.org/10.21236/ada423238.

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

Holcomb, C. T. High betaN Steady-State Tokamak Development is the Best Strategy for Solving the Disruption Problem. Office of Scientific and Technical Information (OSTI), March 2015. http://dx.doi.org/10.2172/1341982.

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

Berge, G., and J. P. Freidberg. Formulation of the Arbitrary n Stability Problem in an Axisymmetric Torus with a Finite Resistivity Vacuum Chamber and PF System. Office of Scientific and Technical Information (OSTI), June 1992. http://dx.doi.org/10.2172/1178262.

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

Baader, Franz, Carsten Lutz, Eldar Karabaev, and Manfred Theißen. A New n-ary Existential Quantifier in Description Logics. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.151.

Full text
Abstract:
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constructor, which generalizes both the usual existential restrictions and so-called qualified number restrictions. We show that the new constructor can be expressed in ALCQ, the extension of the basic DL ALC by qualified number restrictions. However, this representation results in an exponential blow-up. By giving direct algorithms for ALC extended with the new constructor, we can show that the complexity of reasoning in this new DL is actually not harder than the one of reasoning in ALCQ. Moreover, in our chemical process engineering application, a restricted DL that provides only the new constructor together with conjunction, and satisfies an additional restriction on the occurrence of roles names, is sufficient. For this DL, the subsumption problem is polynomial.
APA, Harvard, Vancouver, ISO, and other styles
10

Kuznetsov, Victor, Vladislav Litvinenko, Egor Bykov, and Vadim Lukin. A program for determining the area of the object entering the IR sensor grid, as well as determining the dynamic characteristics. Science and Innovation Center Publishing House, April 2021. http://dx.doi.org/10.12731/bykov.0415.15042021.

Full text
Abstract:
Currently, to evaluate the dynamic characteristics of objects, quite a large number of devices are used in the form of chronographs, which consist of various optical, thermal and laser sensors. Among the problems of these devices, the following can be distinguished: the lack of recording of the received data; the inaccessibility of taking into account the trajectory of the object flying in the sensor area, as well as taking into consideration the trajectory of the object during the approach to the device frame. The signal received from the infrared sensors is recorded in a separate document in txt format, in the form of a table. When you turn to the document, data is read from the current position of the input data stream in the specified list by an argument in accordance with the given condition. As a result of reading the data, it forms an array that includes N number of columns. The array is constructed in a such way that the first column includes time values, and columns 2...N- the value of voltage . The algorithm uses cycles that perform the function of deleting array rows where there is a fact of exceeding the threshold value in more than two columns, as well as rows where the threshold level was not exceeded. The modified array is converted into two new arrays, each of which includes data from different sensor frames. An array with the coordinates of the centers of the sensor operation zones was created to apply the Pythagorean theorem in three-dimensional space, which is necessary for calculating the exact distance between the zones. The time is determined by the difference in the response of the first and second sensor frames. Knowing the path and time, we are able to calculate the exact speed of the object. For visualization, the oscillograms of each sensor channel were displayed, and a chronograph model was created. The chronograph model highlights in purple the area where the threshold has been exceeded.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Tur\'{a}n problem' for particular source types:
Journal articles Dissertations / Theses Books
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