866 resultados para Locally Linear Embedding
Resumo:
A fully numerical two-dimensional solution of the Schrödinger equation is presented for the linear polyatomic molecule H^2+_3 using the finite element method (FEM). The Coulomb singularities at the nuclei are rectified by using both a condensed element distribution around the singularities and special elements. The accuracy of the results for the 1\sigma and 2\sigma orbitals is of the order of 10^-7 au.
Resumo:
Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile and wireless networks, for instance, have to organize themselves autonomously and must be able to react to changes in the environment and to failing nodes alike. Researching new approaches for the design of distributed algorithms may lead to methods with which these requirements can be met efficiently. In this thesis, one such method is developed, tested, and discussed in respect of its practical utility. Our new design approach for distributed algorithms is based on Genetic Programming, a member of the family of evolutionary algorithms. Evolutionary algorithms are metaheuristic optimization methods which copy principles from natural evolution. They use a population of solution candidates which they try to refine step by step in order to attain optimal values for predefined objective functions. The synthesis of an algorithm with our approach starts with an analysis step in which the wanted global behavior of the distributed system is specified. From this specification, objective functions are derived which steer a Genetic Programming process where the solution candidates are distributed programs. The objective functions rate how close these programs approximate the goal behavior in multiple randomized network simulations. The evolutionary process step by step selects the most promising solution candidates and modifies and combines them with mutation and crossover operators. This way, a description of the global behavior of a distributed system is translated automatically to programs which, if executed locally on the nodes of the system, exhibit this behavior. In our work, we test six different ways for representing distributed programs, comprising adaptations and extensions of well-known Genetic Programming methods (SGP, eSGP, and LGP), one bio-inspired approach (Fraglets), and two new program representations called Rule-based Genetic Programming (RBGP, eRBGP) designed by us. We breed programs in these representations for three well-known example problems in distributed systems: election algorithms, the distributed mutual exclusion at a critical section, and the distributed computation of the greatest common divisor of a set of numbers. Synthesizing distributed programs the evolutionary way does not necessarily lead to the envisaged results. In a detailed analysis, we discuss the problematic features which make this form of Genetic Programming particularly hard. The two Rule-based Genetic Programming approaches have been developed especially in order to mitigate these difficulties. In our experiments, at least one of them (eRBGP) turned out to be a very efficient approach and in most cases, was superior to the other representations.
Resumo:
Climate change and variability in sub-Saharan West Africa is expected to have negative consequences for crop and livestock farming due to the strong dependence of these sectors on rainfall and natural resources, and the low adaptive capacity of crops farmers, agro-pastoralist and pastoralists in the region. The objective of this PhD research was to investigate the anticipated impacts of expected future climate change and variability on nutrition and grazing management of livestock in the prevailing extensive agro-pastoral and pastoral systems of the Sahelian and Sudanian zones of Burkina Faso. To achieve this, three studies were undertaken in selected village territories (100 km² each) in the southern Sahelian (Taffogo), northern Sudanian (Nobere, Safane) and southern Sudanian (Sokouraba) zone of the country during 2009 and 2010. The choice of two villages in the northern Sudanian zone was guided by the dichotomy between intense agricultural land use and high population density near Safane, and lower agricultural land use in the tampon zone between the village of Nobere and the National Park Kaboré Tambi of Pô. Using global positioning and geographical information systems tools, the spatio-temporal variation in the use of grazing areas by cattle, sheep and goats, and in their foraging behaviour in the four villages was assessed by monitoring three herds each per species during a one-year cycle (Chapter 2). Maximum itinerary lengths (km/d) were observed in the hot dry season (March-May); they were longer for sheep (18.8) and cattle (17.4) than for goats (10.5, p<0.05). Daily total grazing time spent on pasture ranged from 6 - 11 h with cattle staying longer on pasture than small ruminants (p<0.05). Feeding time accounted for 52% - 72% of daily time on pasture, irrespective of species. Herds spent longer time on pasture and walked farther distances in the southern Sahelian than the two Sudanian zones (p<0.01), while daily feeding time was longer in the southern Sudanian than in the other two zones (p>0.05). Proportional time spent resting decreased from the rainy (June - October) to the cool (November - February) and hot dry season (p<0.05), while in parallel the proportion of walking time increased. Feeding time of all species was to a significantly high proportion spent on wooded land (tree crown cover 5-10%, or shrub cover >10%) in the southern Sahelian zone, and on forest land (tree crown cover >10%) in the two Sudanian zones, irrespective of season. It is concluded that with the expansion of cropland in the whole region, remaining islands of wooded land, including also fields fallowed for three or more years with their considerable shrub cover, are particularly valuable pasturing areas for ruminant stock. Measures must be taken that counteract the shrinking of wooded land and forests across the whole region, including also active protection and (re)establishment of drought-tolerant fodder trees. Observation of the selection behaviour of the above herds of cattle and small ruminant as far as browse species were concerned, and interviews with 75 of Fulani livestock keepers on use of browse as feed by their ruminant stock and as remedies for animal disease treatment was undertaken (Chapter 3) in order to evaluate the consequence of climate change for the contribution of browse to livestock nutrition and animal health in the extensive grazing-based livestock systems. The results indicated that grazing cattle and small ruminants do make considerable use of browse species on pasture across the studied agro-ecological zones. Goats spent more time (p<0.01) feeding on browse species than sheep and cattle, which spent a low to moderate proportion of their feeding time on browsing in any of the study sites. As far as the agro-ecological zones were concerned, the contribution of browse species to livestock nutrition was more important in the southern Sahelian and northern Sudanian zone than the southern Sudanian zone, and this contribution is higher during the cold and hot dry season than during the rainy season. A total of 75 browse species were selected on pasture year around, whereby cattle strongly preferred Afzelia africana, Pterocarpus erinaceus and Piliostigma sp., while sheep and goats primarily fed on Balanites aegyptiaca, Ziziphus mauritiana and Acacia sp. Crude protein concentration (in DM) of pods or fruits of the most important browse species selected by goats, sheep and cattle ranged from 7% to 13% for pods, and from 10% to 18% for foliage. The concentration of digestible organic matter of preferred browse species mostly ranged from 40% to 60%, and the concentrations of total phenols, condensed tannins and acid detergent lignin were low. Linear regression analyses showed that browse preference on pasture is strongly related to its contents (% of DM) of CP, ADF, NDF and OM digestibility. Interviewed livestock keepers reported that browse species are increasingly use by their grazing animals, while for animal health care use of tree- and shrub-based remedies decreased over the last two decades. It is concluded that due to climate change with expected negative impact on the productivity of the herbaceous layer of communal pastures browse fodder will gain in importance for animal nutrition. Therefore re-establishment and dissemination of locally adapted browse species preferred by ruminants is needed to increase the nutritional situation of ruminant stock in the region and contribute to species diversity and soil fertility restoration in degraded pasture areas. In Chapter 4 a combination of household surveys and participatory research approaches was used in the four villages, and additionally in the village of Zogoré (southern Sahelian zone) and of Karangasso Vigué (northern Sudanian zone) to investigate pastoralists’ (n= 76) and agro-pastoralists’ (n= 83) perception of climate change, and their adaptation strategies in crop and livestock production at farm level. Across the three agro-ecological zones, the majority of the interviewees perceived an increase in maximum day temperatures and decrease of total annual rainfall over the last two decades. Perceptions of change in climate patterns were in line with meteorological data for increased temperatures while for total rainfall farmers’ views contrasted the rainfall records which showed a slight increase of precipitation. According to all interviewees climate change and variability have negative impacts on their crop and animal husbandry, and most of them already adopted some coping and adaptation strategies at farm level to secure their livelihoods and reduce negative impacts on their farming system. Although these strategies are valuable and can help crop and livestock farmers to cope with the recurrent droughts and climate variability, they are not effective against expected extreme climate events. Governmental and non-governmental organisations should develop effective policies and strategies at local, regional and national level to support farmers in their endeavours to cope with climate change phenomena; measures should be site-specific and take into account farmers’ experiences and strategies already in place.
Resumo:
Die vorliegende Arbeit beschäftigt sich mit den Einflüssen visuell wahrgenommener Bewegungsmerkmale auf die Handlungssteuerung eines Beobachters. Im speziellen geht es darum, wie die Bewegungsrichtung und die Bewegungsgeschwindigkeit als aufgabenirrelevante Reize die Ausführung von motorischen Reaktionen auf Farbreize beeinflussen und dabei schnellere bzw. verzögerte Reaktionszeiten bewirken. Bisherige Studien dazu waren auf lineare Bewegungen (von rechts nach links und umgekehrt) und sehr einfache Reizumgebungen (Bewegungen einfacher geometrischer Symbole, Punktwolken, Lichtpunktläufer etc.) begrenzt (z.B. Ehrenstein, 1994; Bosbach, 2004, Wittfoth, Buck, Fahle & Herrmann, 2006). In der vorliegenden Dissertation wurde die Gültigkeit dieser Befunde für Dreh- und Tiefenbewegungen sowie komplexe Bewegungsformen (menschliche Bewegungsabläufe im Sport) erweitert, theoretisch aufgearbeitet sowie in einer Serie von sechs Reaktionszeitexperimenten mittels Simon-Paradigma empirisch überprüft. Allen Experimenten war gemeinsam, dass Versuchspersonen an einem Computermonitor auf einen Farbwechsel innerhalb des dynamischen visuellen Reizes durch einen Tastendruck (links, rechts, proximal oder distal positionierte Taste) reagieren sollten, wobei die Geschwindigkeit und die Richtung der Bewegungen für die Reaktionen irrelevant waren. Zum Einfluss von Drehbewegungen bei geometrischen Symbolen (Exp. 1 und 1a) sowie bei menschlichen Drehbewegungen (Exp. 2) zeigen die Ergebnisse, dass Probanden signifikant schneller reagieren, wenn die Richtungsinformationen einer Drehbewegung kompatibel zu den räumlichen Merkmalen der geforderten Tastenreaktion sind. Der Komplexitätsgrad des visuellen Ereignisses spielt dabei keine Rolle. Für die kognitive Verarbeitung des Bewegungsreizes stellt nicht der Drehsinn, sondern die relative Bewegungsrichtung oberhalb und unterhalb der Drehachse das entscheidende räumliche Kriterium dar. Zum Einfluss räumlicher Tiefenbewegungen einer Kugel (Exp. 3) und einer gehenden Person (Exp. 4) belegen unsere Befunde, dass Probanden signifikant schneller reagieren, wenn sich der Reiz auf den Beobachter zu bewegt und ein proximaler gegenüber einem distalen Tastendruck gefordert ist sowie umgekehrt. Auch hier spielt der Komplexitätsgrad des visuellen Ereignisses keine Rolle. In beiden Experimenten führt die Wahrnehmung der Bewegungsrichtung zu einer Handlungsinduktion, die im kompatiblen Fall eine schnelle und im inkompatiblen Fall eine verzögerte Handlungsausführung bewirkt. In den Experimenten 5 und 6 wurden die Einflüsse von wahrgenommenen menschlichen Laufbewegungen (freies Laufen vs. Laufbandlaufen) untersucht, die mit und ohne eine Positionsveränderung erfolgten. Dabei zeigte sich, dass unabhängig von der Positionsveränderung die Laufgeschwindigkeit zu keiner Modulation des richtungsbasierten Simon Effekts führt. Zusammenfassend lassen sich die Studienergebnisse gut in effektbasierte Konzepte zur Handlungssteuerung (z.B. die Theorie der Ereigniskodierung von Hommel et al., 2001) einordnen. Weitere Untersuchungen sind nötig, um diese Ergebnisse auf großmotorische Reaktionen und Displays, die stärker an visuell wahrnehmbaren Ereignissen des Sports angelehnt sind, zu übertragen.
Resumo:
Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear naming you cannot create more than one outstanding reference to an entity. As a result, linear naming is cheap to support and easy to reason about. Programs can be translated into the linear graph reduction model such that linear names in the program are implemented directly as linear names in the model. Nonlinear names are supported by constructing them out of linear names. The translation thus exposes those places where the program uses names in expensive, nonlinear ways. Two applications demonstrate the utility of using linear graph reduction: First, in the area of distributed computing, linear naming makes it easy to support cheap cross-network references and highly portable data structures, Linear naming also facilitates demand driven migration of tasks and data around the network without requiring explicit guidance from the programmer. Second, linear graph reduction reveals a new characterization of the phenomenon of state. Systems in which state appears are those which depend on certain -global- system properties. State is not a localizable phenomenon, which suggests that our usual object oriented metaphor for state is flawed.
Resumo:
When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.
Resumo:
We describe a method for modeling object classes (such as faces) using 2D example images and an algorithm for matching a model to a novel image. The object class models are "learned'' from example images that we call prototypes. In addition to the images, the pixelwise correspondences between a reference prototype and each of the other prototypes must also be provided. Thus a model consists of a linear combination of prototypical shapes and textures. A stochastic gradient descent algorithm is used to match a model to a novel image by minimizing the error between the model and the novel image. Example models are shown as well as example matches to novel images. The robustness of the matching algorithm is also evaluated. The technique can be used for a number of applications including the computation of correspondence between novel images of a certain known class, object recognition, image synthesis and image compression.
Resumo:
In previous work (Olshausen & Field 1996), an algorithm was described for learning linear sparse codes which, when trained on natural images, produces a set of basis functions that are spatially localized, oriented, and bandpass (i.e., wavelet-like). This note shows how the algorithm may be interpreted within a maximum-likelihood framework. Several useful insights emerge from this connection: it makes explicit the relation to statistical independence (i.e., factorial coding), it shows a formal relationship to the algorithm of Bell and Sejnowski (1995), and it suggests how to adapt parameters that were previously fixed.
Resumo:
We describe a technique for finding pixelwise correspondences between two images by using models of objects of the same class to guide the search. The object models are 'learned' from example images (also called prototypes) of an object class. The models consist of a linear combination ofsprototypes. The flow fields giving pixelwise correspondences between a base prototype and each of the other prototypes must be given. A novel image of an object of the same class is matched to a model by minimizing an error between the novel image and the current guess for the closest modelsimage. Currently, the algorithm applies to line drawings of objects. An extension to real grey level images is discussed.
Resumo:
This paper investigates the linear degeneracies of projective structure estimation from point and line features across three views. We show that the rank of the linear system of equations for recovering the trilinear tensor of three views reduces to 23 (instead of 26) in the case when the scene is a Linear Line Complex (set of lines in space intersecting at a common line) and is 21 when the scene is planar. The LLC situation is only linearly degenerate, and we show that one can obtain a unique solution when the admissibility constraints of the tensor are accounted for. The line configuration described by an LLC, rather than being some obscure case, is in fact quite typical. It includes, as a particular example, the case of a camera moving down a hallway in an office environment or down an urban street. Furthermore, an LLC situation may occur as an artifact such as in direct estimation from spatio-temporal derivatives of image brightness. Therefore, an investigation into degeneracies and their remedy is important also in practice.