DOCSLIB.ORG

An Update Algorithm for Restricted Random Walk Clusters

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
An Update Algorithm for Restricted Random Walk Clusters An Update Algorithm for Restricted Random Walk Clusters zur Erlangung des akademischen Grades eines Doktors der Wirtschaftswissenschaften (Dr. rer. pol.) von der Fakultat¨ fur¨ Wirtschaftswissenschaften der Universitat¨ Fridericiana zu Karlsruhe genehmigte DISSERTATION von Dipl.-Inform.Wirt. Markus Franke Tag der mundlichen¨ Prufung:¨ 28.02.2007 Referent: Prof. Dr. Andreas Geyer-Schulz Korreferent: Prof. Dr. Karl-Heinz Waldmann Karlsruhe: 24.01.2007 Contents 1 Motivation 1 1.1 Definitions.............................. 2 2 Related Work 11 2.1 StochasticProcesses . 12 2.1.1 RandomWalks ....................... 12 2.1.2 TheRestrictedRandomWalkUsedforClustering . 13 2.1.3 OtherConceptsof“RestrictedRandomWalks” . 14 2.1.4 MarkovChains ....................... 15 2.2 RandomGraphs........................... 18 2.3 ClusterAlgorithms . .. .. .. .. .. .. 20 2.3.1 k-MeansClustering. 23 2.3.2 SinglePassClustering . 24 2.3.3 HierarchicalAgglomerativeClustering . 25 2.4 DynamicClustering. 25 2.4.1 Integration of New Objects into an Existing Clustering.. 26 2.4.2 HandlingChangingSimilarities . 45 2.4.3 MobileScenarios . 49 2.5 RandomizedAlgorithms . 52 2.5.1 Randomized k-Clustering ................. 53 2.5.2 EvolutionaryClustering . 54 2.5.3 ClusteringwithSimulatedAnnealing . 55 2.5.4 RandomWalkCircuitClustering. 58 2.5.5 Randomized Generation of Hierarchical Clusters in Ad HocNetworks ....................... 59 2.5.6 High-SpeedNounClusteringbyHashFunctions . 59 2.6 Random Walk Theory and Markov Processes for Clustering . ... 60 2.6.1 ClusteringbyMarkovianRelaxation . 60 2.6.2 TextclassificationwithRandomWalks . 62 2.6.3 ClusteringbyFlowSimulation . 62 2.6.4 Separation by Neighborhood Similarity and Circular Escape 63 i ii CONTENTS 2.7 Summary .............................. 64 3 Restricted Random Walk Clustering 65 3.1 RRWClustering........................... 65 3.1.1 TheWalks ......................... 66 3.1.2 ClusterConstructionMethods . 71 3.2 PropertiesoftheMethod . 77 3.2.1 Complexity......................... 78 3.2.2 AsymptoticBehavioroftheWalkProcess . 81 3.3 Excursus:Applications . 87 3.3.1 LibraryUsagehistories. 87 3.3.2 IndexingLibraryCorpora . 88 3.3.3 GivingRecommendations . 91 3.4 Summary .............................. 97 4 Updating Restricted Random Walk Clusters 99 4.1 TheBasicUpdateCases . 100 4.1.1 NewPaths .........................101 4.1.2 IllegalSuccessors. 109 4.1.3 NewPathsandIllegalSuccessors . 113 4.1.4 NewNodes .........................113 4.1.5 DeletionofNodes . 113 4.2 ConcurrentUpdatesoftheSimilarityMatrix . 113 4.3 ComplexityoftheUpdateProcedure . 114 4.3.1 NewSuccessors . 115 4.3.2 IllegalSuccessors. 115 4.3.3 ClusterConstruction . 115 4.3.4 Simulation .........................116 4.4 Evaluation..............................117 5 Conclusion and Outlook 119 A A Sample Raw Basket 121 B The Deep South Raw Data 125 Chapter 1 Motivation Being able to quickly evaluate newly arriving data or information is a crucial capability in today’s economy. But this evaluation may be difficult, especially if the new data cannot be interpreted in an isolated way but rather is added to a data base where it may lead to the update of preexisting records or the creation of new ones. An excellent example of such a situation is a purchase data base maintained by a retailer: In regular intervals, new purchases are integrated into the data base which, in turn, may influence the marketing and product portfolio decisions made by the retailer. In a static scenario, cluster algorithms are used among other methods to reduce the complexity of such a data set and to identify for instance groups of customers with similar purchase histories. For large data sets, the execution of a cluster algo- rithm may take considerable time and computing resources [Vie97]. These time and resource requirements may be acceptable for static information, when the data set only needs to be clustered once. But what if the data is updated frequently? In most cases, a reclustering of the whole data set will be both impractical as well as not economical, especially for small updates. Since in this case large parts of the data set are not changed by the update, valuable time is lost while the cluster algorithm recomputes clusters that were not affected by the update. This problem constitutes the motivation for this thesis. In earlier contribu- tions [Fra03, FGS04, FGS05, FT05], the restricted random walk (RRW) cluster algorithm developed by Sch¨oll and Sch¨oll-Paschinger [SP02] was evaluated in the context of a large data set of library purchase histories and found to work well for that data set in static scenarios, both in terms of the quality of the clusters and of the computation time required. The challenge for this work is the integration of new data into the cluster structure with minimal computational effort. As a fur- ther condition, the cluster quality should remain the same whether the new data is integrated using the update algorithm or by reclustering the complete data set. New data in this context can mean one of three different things: 1 2 CHAPTER 1 1. New objects may enter the data set, along with information about their sim- ilarity or distance to other, existing objects. 2. An object may change its similarity or distance to other objects, either by physically moving to another location or by changing its characteristics that determine its similarity to other objects. 3. An object may be removed from the set. We will see that, contrary to other methods reviewed in chapter 2, the update procedure proposed here is able to handle all three cases within reasonable com- putational time while maintaining the cluster quality. This thesis is structured as follows: In the remainder of the first chapter, terms used in this work are defined. Chapter 2 contains an overview of the current state of research in the area of stochastic processes and cluster algorithms. In chapter 3 the RRW clustering method is introduced as a Markov chain on a similarity or distance graph. In addition, the chapter contains applications for which the algorithm has been successfully used as well as some considerations about the algorithm’s complexity and the asymptotic behavior of the walk process. The core of this thesis, the update algorithm, is developed in chapter 4 to- gether with a proof of its correctness and a comparison with the algorithm classes introduced in chapter 2. Chapter 5 concludes the thesis with an outlook. 1.1 Definitions A very fitting definition for cluster analysis has been given by Kaufman and Rousseeuw [KR90]: “Cluster analysis is the art of finding groups in data.” Al- though this view on cluster analysis may seem informal, the informality is justi- fied. There exists – to the practitioner’s regret – no “best” cluster algorithm that copes with all applications on all data sets equally well. Rather, it depends on the characteristics of the data set as well as on the requirements of the concrete application at hand what a good cluster is and, consequently, a plethora of criteria [HK01, HBV02b, HBV02a, PL02, War63, Wat81] has been proposed to measure the quality of different cluster algorithms. As we are not able to give a global exact definition, let us at least consider a sort of least common denominator. A cluster, according to the Oxford Advanced Learner’s Dictionary [Cow89, p. 215], is a 1 number of things of the same kind growing closely together: a clus- ter of berries, flowers, curls ◦ ivy growing in thick clusters. 2 number of people, animals or things grouped closely together: a cluster of CHAPTER 1 3 Figure 1.1: Cluster shapes: (a) elongated, (b) compact, (c) ring, (d) sickle houses, spectators, bees, islands, diamonds, stars ◦ a consonant clus- ter, eg str in strong. In the context of this work, the following definition (modified from [Fra03]) is used: Definition 1.1.1 (cluster) A cluster is a set of objects that are either (a) similar to each other or (b) close – in the sense of some metric – to each other. Espe- cially objects in one cluster should be more similar to each other (intra-cluster homogeneity) than to objects in any other cluster (inter-cluster heterogeneity). In this context, the intra-cluster criterion can be based for example on diam- eter, radius (cf. page 25), variance (cf. page 53), or the sum of squared errors, i.e. the variance multiplied by the number of elements in the cluster. The actual quality of a clustering can consequently be given as a function of this criterion. However, the definition does not make any assumptions concerning the actual shape of a cluster. In the literature (e.g. [KR90]) the shapes depicted in Fig. 1.1 are often considered as standard cases. Depending on the shape of the clusters, the performance of different cluster algorithms – in terms of the chosen quality criterion – may vary considerably. For instance, there are algorithms like k-means clustering that are especially fit to detect spherical objects like the ones in case 4 CHAPTER 1 (b), and that thus cannot cope well with elongated clusters like case (a) in Fig. 1.1. Others, like single linkage clustering, have the problem of bridging: If, between two clusters, there exists a “bridge” of outliers, the two clusters may be connected via this weak link, though it does not accurately reflect the natural grouping. In addition to a cluster, a clustering is defined as follows: Definition 1.1.2 (clustering) A clustering is the result of the execution of a clus- ter algorithm on an object set X. It describes the assignment of objects to clusters. X, the set of objects to be clustered, is said to be covered by the clustering C con- sisting of clusters Ci iff X = Ci (1.1) C C [i∈ Furthermore, a clustering created by a cluster algorithm can either be disjunc- tive or not and it can be hierarchical or partitional: Definition 1.1.3 (disjunctive clusters) We call a set of clusters disjunctive if each object belongs to exactly one cluster, i.e. if the clusters do not overlap. In this case, the following property holds: ∀Ci,Cj ∈ C : Ci ∩ Cj = ∅ (1.2) If a cluster algorithm produces disjunctive clusters for every object set, it is also called disjunctive.
Load more

Recommended publications
  • Memories for a Blessing Jewish Mourning Rituals and Commemorative Practices in Postwar Belarus and Ukraine, 1944-1991
    Memories for a Blessing Jewish Mourning Rituals and Commemorative Practices in Postwar Belarus and Ukraine, 1944-1991 by Sarah Garibov A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (History) in University of Michigan 2017 Doctoral Committee: Professor Ronald Suny, Co-Chair Professor Jeffrey Veidlinger, Co-Chair Emeritus Professor Todd Endelman Professor Zvi Gitelman Sarah Garibov [email protected] ORCID ID: 0000-0001-5417-6616 © Sarah Garibov 2017 DEDICATION To Grandma Grace (z”l), who took unbounded joy in the adventures and accomplishments of her grandchildren. ii ACKNOWLEDGMENTS First and foremost, I am forever indebted to my remarkable committee. The faculty labor involved in producing a single graduate is something I have never taken for granted, and I am extremely fortunate to have had a committee of outstanding academics and genuine mentshn. Jeffrey Veidlinger, thank you for arriving at Michigan at the perfect moment and for taking me on mid-degree. From the beginning, you have offered me a winning balance of autonomy and accountability. I appreciate your generous feedback on my drafts and your guidance on everything from fellowships to career development. Ronald Suny, thank you for always being a shining light of positivity and for contributing your profound insight at all the right moments. Todd Endelman, thank you for guiding me through modern Jewish history prelims with generosity and rigor. You were the first to embrace this dissertation project, and you have faithfully encouraged me throughout the writing process. Zvi Gitelman, where would I be without your wit and seykhl? Thank you for shepherding me through several tumultuous years and for remaining a steadfast mentor and ally.
    [Show full text]
  • European Jewish Digest: Looking at the Headlines Across Jewish Europe
    EUROPEAN JEWISH DIGEST: LOOKING AT THE HEADLINES ACROSS JEWISH EUROPE VOLUME 2, ISSUE 6: JUNE 2015 1 / ISSUES CONCERNING ANTISEMITISM Violence, Vandalism & Abuse Instances of antisemitic vandalism and abuse occurred again in Greece in June. The disputed Holocaust memorial in Kevala (as reported in the May digest) was finally dedicated after the mayor agreed that no changes to the memorial were needed and it would be kept in its original location. However in his speech at the dedication, Panagiotis Sgouridis, deputy minister of rural development, was accused of abusing the memory of the Holocaust when he said that atrocities continue today including “the continuation of the extermination of the Assyrians by the jihadists, the invasion and occupation in northern Cyprus, the Kurdish issue, the blockade of Gaza, the genocidal dismemberment of Yugoslavia.” He added that monuments like this one was needed “because unfortunately many times the roles switch and the victims become bullies.” The memorial itself was then desecrated two weeks after its dedication, being covered in blue paint. In Athens, a memorial to the 13,000 Greek Jewish children murdered in the Holocaust was also desecrated with a Nazi swastika and SS insignia. The memorial is located next to a playground built in the children’s memory. In the UK, two Jewish men were allegedly racially abused and violently threatened. Whilst walking along the River Lea towpath in Hackney in London, a man approached the visibly looking Jewish males and allegedly shouted “f***ing Jews” before walking right up to the victims, saying “I’ll f***ing kill you” and “I’ll f***ing break your neck”.
    [Show full text]
  • Las Vegas Optic, 05-08-1911 the Optic Publishing Co
    University of New Mexico UNM Digital Repository Las Vegas Daily Optic, 1896-1907 New Mexico Historical Newspapers 5-8-1911 Las Vegas Optic, 05-08-1911 The Optic Publishing Co. Follow this and additional works at: https://digitalrepository.unm.edu/lvdo_news Recommended Citation The Optic Publishing Co.. "Las Vegas Optic, 05-08-1911." (1911). https://digitalrepository.unm.edu/lvdo_news/2964 This Newspaper is brought to you for free and open access by the New Mexico Historical Newspapers at UNM Digital Repository. It has been accepted for inclusion in Las Vegas Daily Optic, 1896-1907 by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected]. tftrritorlal Itcrstarjr'i 0(Ah TEA THER FORECAST THE DAILY MAXIHl Tonfipjlit Fair and Swat the Fly These .Warmjer; Tues-da- y Days, Early and Fair LAS OFT Late EXCLUSIVE ASSOCIATED PRE68 LEASED WIRE TELEGRAPH SERVICE VOL. XXXII. No. 154 EAST LAS VEGAS, NEW MEXICO, MONDAY, MAY 8, 191 1 CITY EDITION the insurrectos had got into Juarez MUSICIANS IN ATLANTA and a' force of them surrounded the SUB-COMMITT- Ga., May 8. The American EE Atlanta, SNELL DECIDES TO DIAZ SIGNIFIES INTENTION TO bull ring. Federal soldiers came out Federation of Musicians, one of the to meet them and exchanged shots most prosperous and Influential lab t in the heart of the Juarez resident sec organizations in America, began its RESIGN AS MEXICO'S PRESIDENT tion. The federals returned to their MAKES REPORT annual convention In this city today PAY A FINE OF quarters, leaving two dead or wounded wtih a large attendance of delegates in the street from all over the United States and REVOLUTIONISTS NEW ARMISTICE A messenger bearing a white flag ON STATEHOOD Canada.
    [Show full text]
  • Holocaust Museums at a Crossroads: Ethical Debates and Moral Obligations
    Holocaust Museums at a Crossroads: Ethical Debates and Moral Obligations Leah Angell Sievers Midlothian, Virginia B.A. Literature, Yale University, 1997 M.T.S. World Religions, Harvard Divinity School, 2001 A Dissertation presented to the Graduate Faculty of the University of Virginia in Candidacy for the Degree of Doctor of Philosophy Department of Religious Studies University of Virginia October 4, 2013 Prof. Asher Biemann ___________________________ Prof. Larry Bouchard ___________________________ Prof. Gabriel Finder ___________________________ Prof. Jennifer Geddes ___________________________ Prof. Charles Mathewes ___________________________ TABLE OF CONTENTS Introduction Chapter One: Early Holocaust Memorial Practices Life in the Displaced Persons Camps Reestablishing a Sense of Jewish Life, Jewish Self, and Jewish Community Documenting Survivor Testimonies in the Displaced Persons Camps Post-War Immigration to the United States Conclusion Chapter Two: Holocaust Remembrance in Israel and Germany Memorials, Monuments, and Museums Yad Vashem The Jewish Museum Berlin Conclusion Chapter Three: Holocaust Museums in the United States Turning Points The United States Holocaust Memorial Museum The Los Angeles Museum of the Holocaust The Illinois Holocaust Museum & Education Center Conclusion Chapter Four: Holocaust Uniqueness and Holocaust Memory The Uniqueness Debate It’s Jewish to Remember The Memory Debate Conclusion Chapter Five: Engaging the Ethical and the Aesthetic The Ethical Tasks of Holocaust Museums Creating a Moral Museum Ethical
    [Show full text]
  • THE NEW JEWISH VOICE April 2015
    Cocktails and Comedy will raise Non-profit Organization 5 funds to support the JCC’s Tzahal U.S. POSTAGE PAID Shalom program. Permit # 184 Watertown, NY 11 UJF’s Super Sunday provided Friendship Circle members with work experience. 14 Betsy’s Buddies seeks volunteers. JFS announces its annual College 17 Ahead! program. april 2015/nisan-Iyar 5775 a publication of United jewish federation of Volume 17, Number 3 Greater Stamford, New Canaan and Darien JCC Tzahal Shalom Yom Hashoah Commemoration Making Connections to Israel Remembering the Holocaust 70 Years During this year’s JCC Tzahal Sha- unity of the Jewish people. Americans lom program, the community is invited and Israelis are given opportunities after Liberation to spend time with active-duty officers to learn about each other and their By Peter Lilienthal Shoah (the Holocaust). from the Israel Defense Forces at a societies, person-to-person, while build- On Wednesday, April 15, the Using the format of a seder led by week of community events scheduled ing lasting relationships and a sense of United Jewish Federation of Greater Rabbi Joshua Hammerman, the pro- for April 19-26. extended family. Stamford, New Canaan, and Darien gram will reflect on the story of the Now in its 37th year in Stamford, Representing all branches of armed will hold its annual Yom Hashoah liberation beginning with the honoring Tzahal Shalom, organized by the services, the officers are young men (Holocaust Remembrance Day) com- of survivors. Grandchildren, symboliz- Stamford Jewish Community Center and women who embody commitment, memoration at Temple Beth El, from ing the four sons in the haggadah, will in cooperation with the Friends of the dedication, courage and leadership, 7-9 pm.
    [Show full text]
  • The Ager Valley Historic Landscape: New Tools and Quantitative Analysis
    The Ager valley historic landscape: new tools and quantitative analysis. Architecture and agrarian parcels in the medieval settlement dynamics Antonio Porcheddu http://hdl.handle.net/10803/436891 ADVERTIMENT. L'accés als continguts d'aquesta tesi doctoral i la seva utilització ha de respectar els drets de la persona autora. Pot ser utilitzada per a consulta o estudi personal, així com en activitats o materials d'investigació i docència en els termes establerts a l'art. 32 del Text Refós de la Llei de Propietat Intel·lectual (RDL 1/1996). Per altres utilitzacions es requereix l'autorització prèvia i expressa de la persona autora. En qualsevol cas, en la utilització dels seus continguts caldrà indicar de forma clara el nom i cognoms de la persona autora i el títol de la tesi doctoral. No s'autoritza la seva reproducció o altres formes d'explotació efectuades amb finalitats de lucre ni la seva comunicació pública des d'un lloc aliè al servei TDX. Tampoc s'autoritza la presentació del seu contingut en una finestra o marc aliè a TDX (framing). Aquesta reserva de drets afecta tant als continguts de la tesi com als seus resums i índexs. ADVERTENCIA. El acceso a los contenidos de esta tesis doctoral y su utilización debe respetar los derechos de la persona autora. Puede ser utilizada para consulta o estudio personal, así como en actividades o materiales de investigación y docencia en los términos establecidos en el art. 32 del Texto Refundido de la Ley de Propiedad Intelectual (RDL 1/1996). Para otros usos se requiere la autorización previa y expresa de la persona autora.
    [Show full text]
  • Early Testimonies of Jewish Survivors of World War II
    Tragedy and Triumph Early Testimonies of Jewish Survivors of World War II Compiled and Translated by Freda Hodge ABOUT THIS BOOK In this collection Freda Hodge retrieves early voices of Holocaust survivors. Men, women and children relate experiences of deportation and ghetto­ isation, forced labour camps and death camps, death marches and liber­ ation. Such eye­witness accounts collected in the immediate post­war period constitute, as the historian Feliks Tych points out, the most important body of Jewish documents pertaining to the history of the Holocaust. The fresh­ ness of memory makes these early voices profoundly different from, and historically more significant than, later recollections gathered in oral history programs. Carefully selected and painstakingly translated, these survivor accounts were first published between 1946 and 1948 in the Yiddish journal Fun Letzten Khurben (‘From the Last Destruction’) in postwar Germany, by refugees waiting in ‘Displaced Persons’ camps, in the American zone of occupation, for the arrival of travel documents and visas. These accounts have not previously been available in English. ABOUT THE AUTHOR Freda Hodge holds degrees in English, Linguistics and Jewish Studies, and has taught at universities and colleges in South Africa and Australia. Fluent in Hebrew as well as Yiddish, she works at the Holocaust Centre in Melbourne conducting interviews with survivors and families. Copyright Information Tragedy and Triumph: Early Testimonies of Jewish Survivors of World War II Compiled and translated by Freda Hodge © Copyright 2018 All rights reserved. Apart from any uses permitted by Australia’s Copyright Act 1968, no part of this book may be reproduced by any process without prior written permission from the copyright owners.
    [Show full text]
  • Genetic Algorithms for the Exploration of Parameter Spaces in Agent-Based Models
    NORTHWESTERN UNIVERSITY Genetic Algorithms for the Exploration of Parameter Spaces in Agent-Based Models A DISSERTATION SUBMITTED TO THE GRADUATE SCHOOL IN PARTIAL FULFILLMENT OF THE REQUIREMENTS for the degree DOCTOR OF PHILOSOPHY Field of Computer Science By Forrest J. Stonedahl EVANSTON, ILLINOIS December 2011 2 c Copyright by Forrest J. Stonedahl 2011 All Rights Reserved 3 ABSTRACT Genetic Algorithms for the Exploration of Parameter Spaces in Agent-Based Models Forrest J. Stonedahl This work provides the first comprehensive investigation of the use of genetic algorithms for exploring the range of behaviors produced by agent-based models. Agent-based modeling (ABM) is a powerful computer simulation technique in which many agents interact according to simple rules resulting in the emergence of complex aggregate-level behavior. However, as ABM is increasingly employed in both natural and social sciences, the methods and tools for understanding, exploring, and analyzing the behavior of agent-based models have not kept pace. In particular, models may be characterized by a large number of parameters, and the task of discovering parameter settings for which a model will produce a certain behavior is both difficult and time-consuming. Genetic algorithms (GAs) offer a flexible metaheuristic search mechanism which has previously been successful in a variety of combinatorial opti- mization and search problems. There is a rich space of possible model exploration tasks, and we offer a new unified framework for the creation and application of quantitative measures to perform these tasks using an evolutionary-search paradigm. We demonstrate the utility of GAs for ABM parameter exploration through a sequence of case studies in various ap- plication domains, including behavioral biology, viral marketing, archeology, and web-based journalism.
    [Show full text]
  • Las Vegas Optic, 05-10-1911 the Optic Publishing Co
    University of New Mexico UNM Digital Repository Las Vegas Daily Optic, 1896-1907 New Mexico Historical Newspapers 5-10-1911 Las Vegas Optic, 05-10-1911 The Optic Publishing Co. Follow this and additional works at: https://digitalrepository.unm.edu/lvdo_news Recommended Citation The Optic Publishing Co.. "Las Vegas Optic, 05-10-1911." (1911). https://digitalrepository.unm.edu/lvdo_news/2966 This Newspaper is brought to you for free and open access by the New Mexico Historical Newspapers at UNM Digital Repository. It has been accepted for inclusion in Las Vegas Daily Optic, 1896-1907 by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected]. fsrrltorlal GscrsUr's OtB TEATHER FORECAST THE DAILY MAXIM Tonigbl Colder With Boost For the Home 't Thurs- frost; Team This day Fair OP" Tear ; EXCLUSIVE ASSOCIATED PRE68 I EASED WIFE TELEGRAPH 6ERVICEI VOL. XXXII. No. 156 EAST LAS VEGAS, NEW MEXICO, WEDNESDAY, MAY 10, 191 1 CITY EDITION JUAREZ FALLS; FEDERAL COMMANDER AND STAFF SURRENDER j FINAL CAPITULATION COMES AFTER TWO DAYS' REDELS PREPARED ARMY AVIATOR NEITHER HOUSEOF TO MOVE ON I PLUNGES TO CONGRESS IN BATTLE IN WHICH HUNDREDS WERE KILLED ENSENADA HIS DEATH SESSION LOWER General Madero CALIFORNIA PORT CITY LIEUTENANT KELLY VICTIM OF HOWEVER DAY IS Civfn nucii LAST STAND BY SOLDIERS Explains Why IS THE NEXT IDE OBJECTIVE FATAL FALL AT SAN TO MEETINGS OF VARIOUS He Ordered Attack on Juarez POINT ANTONIO COMMITTEES OF DIAZ DISPLAYED BRAVERY SCOUTING PARTIES Declares President Diaz's Manifesto of ARE OUT PITCHED FROMTHE MACHINE STATEHOOD UNDER DISCUSSION INSURRECTOS WATCHING THAT WAS NOT LOOKED FOR Intention to Resign Was En FOR WHILE MAKING A LANDING, OF-CE- REPUBLICAN MEMBERS INSIST ADVANCE OF FEDERALS FROM SUDDENLY SHOT HEAD- NEW MEXICO BE ADMITTED Too MEXICALI tirely Vague LONG TO EARTH FORTHWITH El Paso, Tex., May 10.
    [Show full text]
  • Ancient Observatories - Timeless Knowledge
    Deborah Scherrer Ancient Observatories - Timeless Knowledge Compiled by Deborah Scherrer Stanford Solar Center Compilation © 2015-2018, Stanford University Solar Center and Deborah Scherrer. Permission given to use for educational, non-commercial purposes. Copyrights for much of the material and images remain with their creators. 1 Deborah Scherrer Table of Contents Introduction to Alignment Structures ........................................ 3 Monuments .................................................................................... 4 Steppe Geoglyphs ........................................................................................................... 4 Goseck Circle .................................................................................................................. 6 Nabta Playa ..................................................................................................................... 8 Temples of Mnajdra ...................................................................................................... 10 Newgrange .................................................................................................................... 12 Majorville Medicine Wheel .......................................................................................... 15 Stonehenge .................................................................................................................... 18 Brodgar ........................................................................................................................
    [Show full text]
  • Las Vegas Optic, 05-05-1911 the Optic Publishing Co
    University of New Mexico UNM Digital Repository Las Vegas Daily Optic, 1896-1907 New Mexico Historical Newspapers 5-5-1911 Las Vegas Optic, 05-05-1911 The Optic Publishing Co. Follow this and additional works at: https://digitalrepository.unm.edu/lvdo_news Recommended Citation The Optic Publishing Co.. "Las Vegas Optic, 05-05-1911." (1911). https://digitalrepository.unm.edu/lvdo_news/2962 This Newspaper is brought to you for free and open access by the New Mexico Historical Newspapers at UNM Digital Repository. It has been accepted for inclusion in Las Vegas Daily Optic, 1896-1907 by an authorized administrator of UNM Digital Repository. For more information, please contact [email protected]. ramurtal ScrtM-f'- t otflt TEATHER FORECAST THE DAILY MAXIM Tonight and Saturday Li , Generally Fair; U ,Jt, You . Can't Smile Warmer LAS Refrain From G "V Scowling- EXCLU8IVB ASSOCIATED PRE88 LEA8ED WIRE TELEGRAPH SERVICE 7 VOL. XXXII. No. 154 EAST LAS VEGAS, NEWJEXICO, FRIDAY, MAY 5, 191 1 meat to receive or discuss the BALDWIN SOLD? resig WORKS. nesses besides McManlgaL nation of the president. Efforts were Among Philadelphia, May 5. Great surprise them were and officials of RESIGNATION being made to resume the con INDICTED SOLONS NINETEEN TRUE employes and': general interest have been o the Llewellyn Iron Works and Paul ference of the peace commissioners casloned in financial and business cir Stuperlch, proprietor of a hotel at AIRICANSIN late thU afternoon to determine cles by the announcement that the Saulito, Calif., which the alleged dyn whether a basis of agreement could ENTER PLEAS DF Baldwin Locomotive Works have been DILLS AGAINST amiter known as J.
    [Show full text]
  • Studies in Continuous Black-Box Optimization
    Technische Universität München Lehrstuhl VI: Echtzeitsysteme und Robotik Studies in Continuous Black-box Optimization Tom Schaul Vollständiger Abdruck der von der Fakultät für Informatik der Technischen Universität München zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) genehmigten Dissertation. Vorsitzender: Univ.-Prof. B. Brügge, Ph.D Prüfer der Dissertation: 1. Univ.-Prof. Dr. H.-J. Bungartz 2. Univ.-Prof. Dr. H. J. Schmidhuber Die Dissertation wurde am 06.06.2011 bei der Technischen Universität München eingereicht und durch die Fakultät für Informatik am 28.06.2011 angenommen. ii Abstract ptimization is the research field that studies that studies the design of O algorithms for finding the best solutions to problems we humans throw at them. While the whole domain is of important practical utility, the present thesis will focus on the subfield of continuous black-box optimization, presenting a collection of novel, state-of-the-art algorithms for solving problems in that class. First, we introduce a general-purpose algorithm called Natural Evolution Strategies (NES). In contrast to typical evolutionary algorithms which search in the vicinity of the fittest individuals in a population, evolution strategies aim at repeating the type of mutations that led to those individuals. We can characterize those mutations by a search distribution. The key idea of NES is to ascend the gradient on the parameters of that distribution towards higher expected fitness. We show how plain gradient ascent is destined to fail, and provide a viable alternative that instead descends along the natural gradient to adapt the search distribution, which appropriately normalizes the update step with respect to its uncertainty.
    [Show full text]