974 resultados para Space problem


Relevância:

60.00% 60.00%

Publicador:

Resumo:

Diese Arbeit befasst sich mit Eduard Study (1862-1930), einem der deutschen Geometer um die Jahrhundertwende, der seine Zeit zum Einen durch seine Kontakte zu Klein, Hilbert, Engel, Lie, Gordan, Halphen, Zeuthen, Einstein, Hausdorff und Weyl geprägt hat, zum Anderen in ihr aber auch für seine beißenden und stilistisch ausgefeilten Kritiken ebenso berühmt wie berüchtigt war. Da sich Study mit einer Vielzahl mathematischer Themen beschäftigt hat, führen wir zunächst in die von ihm bearbeiteten Gebiete der Geometrie des 19. Jahrhunderts ein (analytische und synthetische Geometrie im Sinne von Monge, Poncelet, Plücker und Reye, Invariantentheorie Clebsch-Gordan'scher Prägung, abzählende Geometrie von Chasles und Halphen, die Werke Lie's und Grassmann’s, Liniengeometrie sowie Axiomatik und Grundlagenkrise). In seiner darauf folgenden Biographie finden sich als zentrale Stellen seine Habilitation bei Klein über die Chasles’sche Vermutung, sein Streit mit Zeuthen darüber als eine der Debatten der Mathematischen Annalen (aus der er historisch zwar nicht, mathematisch aber tatsächlich als Gewinner hätte herausgehen müssen, wie wir an der Lösung des Problems durch van der Waerden sehen werden) und seine Auseinandersetzungen als etablierter Bonner Professor mit Engel über Lie, Weyl über Invariantentheorie, zahlreichen philosophischen Richtungen über das Raumproblem, Pasch’s Axiomatik, Hilbert’s Formalismus sowie Brouwer’s und Weyl’s Intuitionismus.

Relevância:

60.00% 60.00%

Publicador:

Resumo:

Der ungarische Mathematiker Friedrich Riesz studierte und forschte in den mathematischen Milieus von Budapest, Göttingen und Paris. Die vorliegende Arbeit möchte zeigen, daß die Beiträge von Riesz zur Herausbildung eines abstrakten Raumbegriffs durch eine Verknüpfung von Entwicklungen aus allen drei mathematischen Kulturen ermöglicht wurden, in denen er sich bewegt hat. Die Arbeit konzentriert sich dabei auf den von Riesz 1906 veröffentlichten Text „Die Genesis des Raumbegriffs". Sowohl für seine Fragestellungen als auch für seinen methodischen Zugang fand Riesz vor allem in Frankreich und Göttingen Anregungen: Henri Poincarés Beiträge zur Raumdiskussion, Maurice Fréchets Ansätze einer abstrakten Punktmengenlehre, David Hilberts Charakterisierung der Stetigkeit des geometrischen Raumes. Diese Impulse aufgreifend suchte Riesz ein Konzept zu schaffen, das die Forderungen von Poincaré, Hilbert und Fréchet gleichermaßen erfüllte. So schlug Riesz einen allgemeinen Begriff des mathematischen Kontinuums vor, dem sich Fréchets Konzept der L-Klasse, Hilberts Mannigfaltigkeitsbegriff und Poincarés erfahrungsgemäße Vorstellung der Stetigkeit des ‚wirklichen' Raumes unterordnen ließen. Für die Durchführung seines Projekts wandte Riesz mengentheoretische und axiomatische Methoden an, die er der Analysis in Frankreich und der Geometrie bei Hilbert entnommen hatte. Riesz' aufnahmebereite Haltung spielte dabei eine zentrale Rolle. Diese Haltung kann wiederum als ein Element der ungarischen mathematischen Kultur gedeutet werden, welche sich damals ihrerseits stark an den Entwicklungen in Frankreich und Deutschland orientierte. Darüber hinaus enthält Riesz’ Arbeit Ansätze einer konstruktiven Mengenlehre, die auf René Baire zurückzuführen sind. Aus diesen unerwarteten Ergebnissen ergibt sich die Aufgabe, den Bezug von Riesz’ und Baires Ideen zur späteren intuitionistischen Mengenlehre von L.E.J. Brouwer und Hermann Weyl weiter zu erforschen.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The image reconstruction using the EIT (Electrical Impedance Tomography) technique is a nonlinear and ill-posed inverse problem which demands a powerful direct or iterative method. A typical approach for solving the problem is to minimize an error functional using an iterative method. In this case, an initial solution close enough to the global minimum is mandatory to ensure the convergence to the correct minimum in an appropriate time interval. The aim of this paper is to present a new, simple and low cost technique (quadrant-searching) to reduce the search space and consequently to obtain an initial solution of the inverse problem of EIT. This technique calculates the error functional for four different contrast distributions placing a large prospective inclusion in the four quadrants of the domain. Comparing the four values of the error functional it is possible to get conclusions about the internal electric contrast. For this purpose, initially we performed tests to assess the accuracy of the BEM (Boundary Element Method) when applied to the direct problem of the EIT and to verify the behavior of error functional surface in the search space. Finally, numerical tests have been performed to verify the new technique.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The aim of this paper is to demonstrate that, even if Marx's solution to the transformation problem can be modified, his basic conclusions remain valid. the proposed alternative solution which is presented hare is based on the constraint of a common general profit rate in both spaces and a money wage level which will be determined simultaneously with prices.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The aim of this paper is to demonstrate that, even if Marx's solution to the transformation problem can be modified, his basic conclusions remain valid. the proposed alternative solution which is presented hare is based on the constraint of a common general profit rate in both spaces and a money wage level which will be determined simultaneously with prices.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We solve the Bjorling problem for timelike surfaces in the Lorentz-Minkowski space through a split-complex representation formula obtained for this kind of surface. Our approach uses the split-complex numbers and natural split-holomorphic extensions. As applications, we show that the minimal timelike surfaces of revolution as well as minimal ruled timelike surfaces can be characterized as solutions of certain adequate Bjorling problems in the Lorentz-Minkowski space. (C) 2010 Elsevier Inc. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We investigate the isoperimetric problem of finding the regions of prescribed volume with minimal boundary area between two parallel horospheres in hyperbolic 3-space (the part of the boundary contained in the horospheres is not included). We reduce the problem to the study of rotationally invariant regions and obtain the possible isoperimetric solutions by studying the behavior of the profile curves of the rotational surfaces with constant mean curvature in hyperbolic 3-space. We also classify all the connected compact rotational surfaces M of constant mean curvature that are contained in the region between two horospheres, have boundary partial derivative M either empty or lying on the horospheres, and meet the horospheres perpendicularly along their boundary.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper defines the 3D reconstruction problem as the process of reconstructing a 3D scene from numerous 2D visual images of that scene. It is well known that this problem is ill-posed, and numerous constraints and assumptions are used in 3D reconstruction algorithms in order to reduce the solution space. Unfortunately, most constraints only work in a certain range of situations and often constraints are built into the most fundamental methods (e.g. Area Based Matching assumes that all the pixels in the window belong to the same object). This paper presents a novel formulation of the 3D reconstruction problem, using a voxel framework and first order logic equations, which does not contain any additional constraints or assumptions. Solving this formulation for a set of input images gives all the possible solutions for that set, rather than picking a solution that is deemed most likely. Using this formulation, this paper studies the problem of uniqueness in 3D reconstruction and how the solution space changes for different configurations of input images. It is found that it is not possible to guarantee a unique solution, no matter how many images are taken of the scene, their orientation or even how much color variation is in the scene itself. Results of using the formulation to reconstruct a few small voxel spaces are also presented. They show that the number of solutions is extremely large for even very small voxel spaces (5 x 5 voxel space gives 10 to 10(7) solutions). This shows the need for constraints to reduce the solution space to a reasonable size. Finally, it is noted that because of the discrete nature of the formulation, the solution space size can be easily calculated, making the formulation a useful tool to numerically evaluate the usefulness of any constraints that are added.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

We report the detection of CoRoT-18b, a massive hot Jupiter transiting in front of its host star with a period of 1.9000693 +/- 0.0000028 days. This planet was discovered thanks to photometric data secured with the CoRoT satellite combined with spectroscopic and photometric ground-based follow-up observations. The planet has a mass M(p) = 3.47 +/- 0.38 M(Jup), a radius R(p) = 1.31 +/- 0.18 R(Jup), and a density rho(p) = 2.2 +/- 0.8 g cm(-3). It orbits a G9V star with a mass M(*) = 0.95 +/- 0.15 M(circle dot), a radius R(*) = 1.00 +/- 0.13 R(circle dot), and a rotation period P(rot) = 5.4 +/- 0.4 days. The age of the system remains uncertain, with stellar evolution models pointing either to a few tens Ma or several Ga, while gyrochronology and lithium abundance point towards ages of a few hundred Ma. This mismatch potentially points to a problem in our understanding of the evolution of young stars, with possibly significant implications for stellar physics and the interpretation of inferred sizes of exoplanets around young stars. We detected the RossiterMcLaughlin anomaly in the CoRoT-18 system thanks to the spectroscopic observation of a transit. We measured the obliquity psi = 20 degrees +/- 20 degrees +/- (sky-projected value lambda = -10 degrees +/- 20 degrees), indicating that the planet orbits in the same way as the star is rotating and that this prograde orbit is nearly aligned with the stellar equator.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.