21,198 research outputs found
Exact and approximate solving approaches in multi-objective combinatorial optimization, application to the minimum weight spanning tree problem
No full textOn s'attache dans cette thèse à plusieurs aspects liés à la résolution de problèmes multi-objectifs, sans se limiter au cas biobjectif. Nous considérons la résolution exacte, dans le sens de la détermination de l'ensemble des points non dominés, ainsi que la résolution approchée dans laquelle on cherche une approximation de cet ensemble dont la qualité est garantie a priori.Nous nous intéressons d'abord au problème de la détermination d'une représentation explicite de la région de recherche. La région de recherche, étant donné un ensemble de points réalisables connus, exclut la partie de l'espace des objectifs que dominent ces points et constitue donc la partie de l'espace des objectifs où les efforts futurs doivent être concentrés dans la perspective de déterminer tous les points non dominés.Puis nous considérons le recours aux algorithmes de séparation et évaluation ainsi qu'aux algorithmes de ranking afin de proposer une nouvelle méthode hybride de détermination de l'ensemble des points non dominés. Nous montrons que celle-ci peut également servir à obtenir une approximation de l'ensemble des points non dominés. Cette méthode est implantée pour le problème de l'arbre couvrant de poids minimal. Les quelques propriétés de ce problème que nous passons en revue nous permettent de spécialiser certaines procédures et d'intégrer des prétraitements spécifiques. L'intérêt de cette approche est alors soutenu à l'aide de résultats expérimentaux.This thesis deals with several aspects related to solving multi-objective problems, without restriction to the bi-objective case. We consider exact solving, which generates the nondominated set, and approximate solving, which computes an approximation of the nondominated set with a priori guarantee on the quality.We first consider the determination of an explicit representation of the search region. The search region, defined with respect to a set of known feasible points, excludes from the objective space the part which is dominated by these points. Future efforts to find all nondominated points should therefore be concentrated on the search region.Then we review branch and bound and ranking algorithms and we propose a new hybrid approach for the determination of the nondominated set. We show how the proposed method can be adapted to generate an approximation of the nondominated set. This approach is instantiated on the minimum spanning tree problem. We review several properties of this problem which enable us to specialize some procedures of the proposed approach and integrate specific preprocessing rules. This approach is finally supported through experimental results
Report on Meteorological Research March 1, 1935 (m-1)
No full textThe object of the report was to elucidate in detail the various features of the research program in meteorology being carried on at the Daniel Guggenheim Airship Institute in Akron, Ohio. Mr. L. J. Fangman, of the U.S. Weather Bureau, was collaborating with the author in carrying out work such as a study of autographic records of the various meteorological elements during frontal passages with a view to the possible prediction of the intensity of the accompanying disturbance as it may affect the operation of aircraft and a study of atmospheric gustiness with a view to finding the dependence between frequency end amplitude of velocity fluctuations and the vertical temperature and velocity gradients
(Fourth) Report on Meteorological Activities at the DGAI (8-1-36)(Weather Bureau Copy)
No full textThis report is on the investigations of frontal phenomena at the Daniel Guggenheim Airship Institute in Akron, Ohio from January 1, 1935 through August 1, 1936. The investigation was carried out with the cooperation of the U.S. Bureau of Aeronautics, the U.S. Weather Bureau, the California Institute of Technology, and the Guggenheim Airship Institute. Mr. R.C. Robinson of the Weather Bureau cooperated with the author in carrying out the investigation. The object of the investigation was to determine the intensity of the atmospheric disturbances (i.e. rapidity of wind shift and gustiness) accompanying the passage of cold fronts, along with a study of the characteristics of the air masses involved and other features which might affect the intensity of the disturbance. The report treated thirty cold fronts which passed the station during 1935 to 1936
Archives and Images as Repositories of Time, Language, and Forms from the Past: A Conversation with Daniel Eisenberg
No full textOptimizing over the Efficient Set of a Multi-Objective Discrete Optimization Problem
No full textOptimizing over the efficient set of a discrete multi-objective problem is a challenging issue. The main reason is that, unlike when optimizing over the feasible set, the efficient set is implicitly characterized. Therefore, methods designed for this purpose iteratively generate efficient solutions by solving appropriate single-objective problems. However, the number of efficient solutions can be quite large and the problems to be solved can be difficult practically. Thus, the challenge is both to minimize the number of iterations and to reduce the difficulty of the problems to be solved at each iteration.
In this paper, a new enumeration scheme is proposed. By introducing some constraints and optimizing over projections of the search region, potentially large parts of the search space can be discarded, drastically reducing the number of iterations. Moreover, the single-objective programs to be solved can be guaranteed to be feasible, and a starting solution can be provided allowing warm start resolutions. This results in a fast algorithm that is simple to implement.
Experimental computations on two standard multi-objective instance families show that our approach seems to perform significantly faster than the state of the art algorithm
Daniel Akech
No full textabstract: Daniel was a little boy when the war came to his village. He witnessed people being shot and running for shelter. There was no food or water so he drank urine and ate tree leaves.
“Lost Boys Found” is an ongoing, interdisciplinary project that is collecting, recording and archiving the oral histories of the Lost Boys/Girls of Sudan. The collection is a work-in-progress, seeking to record the oral history of as many Lost Boys/Girls as are willing, and will be used in a future book.Age: 24Region: Upper NileThis picture and bio was donated to the "Lost Boys Found" oral history project from The Arizona Lost Boys Cente
Daniel Emmett postcard
No full textPostcard of Daniel Emmett and his home in Mount Vernon, Ohio. Emmett is considered to be the author of the antebellum song "Dixie," written in 1859, which became the unofficial song of the Confederate soldiers during the American Civil War. He was born in Mount Vernon in 1815 and taught himself the fiddle, and later became associated with minstrel shows and helped to define that genre. Minstrel shows traveled around the United States, presenting skits and musical performances. Emmett also composed many other songs, including "Old Dan Tucker," "Turkey in the Straw," and "The Blue Tail Fly." He died in 1904
Daniel Jau Maper
No full textabstract: Daniel Jau Maper was herding cattle when Arabs attacked his village.
“Lost Boys Found” is an ongoing, interdisciplinary project that is collecting, recording and archiving the oral histories of the Lost Boys/Girls of Sudan. The collection is a work-in-progress, seeking to record the oral history of as many Lost Boys/Girls as are willing, and will be used in a future book.Age: 27Region: Upper NileThis picture and bio was donated to the "Lost Boys Found" oral history project from The Arizona Lost Boys Cente
Daniel A. Ngor
No full textWhen Daniel was five years old Arab soldiers attacked his village.
“Lost Boys Found” is an ongoing, interdisciplinary project that is collecting, recording and archiving the oral histories of the Lost Boys/Girls of Sudan. The collection is a work-in-progress, seeking to record the oral history of as many Lost Boys/Girls as are willing, and will be used in a future book.Age : 23Region: Upper NileThis picture and bio was donated to the "Lost Boys Found" oral history project from The Arizona Lost Boys Cente
Personal Papers (MS 80-0002)
No full textLetter from Mary T. Steyn of The Readers Digest to Daniel W. Kempner providing some information on the author of an article he was asking about
- …
