1,084 research outputs found

    Towards compliant distributed shared memory

    Get PDF
    Copyright © 2002 IEEEThere exists a wide spectrum of coherency models for use in distributed shared memory (DSM) systems. The choice of model for an application should ideally be based on the application's data access patterns and phase changes. However, in current systems, most, if not all of the parameters of the coherency model are fixed in the underlying DSM system. This forces the application either to structure its computations to suit the underlying model or to endure an inefficient coherency model. This paper introduces a unique approach to the provision of DSM based on the idea of compliance. Compliance allows an application to specify how the system should most effectively operate through a separation between mechanism, provided by the underlying system, and policy, pro-vided by the application. This is in direct contrast with the traditional view that an application must mold itself to the hard-wired choices that its operating platform has made. The contribution of this work is the definition and implementation of an architecture for compliant distributed coherency management. The efficacy of this architecture is illustrated through a worked example.Falkner, K. E.; Detmold, H.; Munro, D. S.; Olds, T

    A Probabilistic Analysis of Kademlia Networks

    Full text link
    Kademlia is currently the most widely used searching algorithm in P2P (peer-to-peer) networks. This work studies an essential question about Kademlia from a mathematical perspective: how long does it take to locate a node in the network? To answer it, we introduce a random graph K and study how many steps are needed to locate a given vertex in K using Kademlia's algorithm, which we call the routing time. Two slightly different versions of K are studied. In the first one, vertices of K are labelled with fixed IDs. In the second one, vertices are assumed to have randomly selected IDs. In both cases, we show that the routing time is about c*log(n), where n is the number of nodes in the network and c is an explicitly described constant.Comment: ISAAC 201

    Unifying static and dynamic approaches to evolution through the Compliant Systems Architecture

    Get PDF
    ©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.Support for evolution can be classified as static or dynamic. Static evolvability is principally concerned with structuring systems as separated abstractions. Dynamic evolvability is concerned with the means by which change is effected. Dynamic evolution provides the requisite flexibility for application evolution, however, the dynamic approach is not scalable in the absence of static measures to achieve separation of abstractions. This separation comes at a price in that issues of concern become trapped within static abstraction boundaries, thereby inhibiting dynamic evolution. The need for a unified approach has long been recognised but existing systems that attempt to address this need do so in an ad-hoc manner. The principal reason for this is that these approaches fail to resolve the incongruence in the underlying models. Our contention is that this disparity is incidental rather than fundamental to the problem. To this end we propose an alternative model based on the Compliant Systems Architecture (CSA), a structuring methodology for constructing software systems. The overriding benefit of this work is increased flexibility. Specifically our contribution is an instantiation of the CSA that supports unified static and dynamic evolution techniques. Our model is explored through a worked example in which we evolve an application’s concurrency model.Falkner, K.; Detmold, H.; Howard, D.; Munro, D.S.; Morrison, R.; Norcross, S

    Scalable surveillance software architecture

    Get PDF
    Copyright © 2006 IEEEVideo surveillance is a key technology for enhanced protection of facilities such as airports and power stations from various types of threat. Networks of thousands of IP-based cameras are now possible, but current surveillance methodologies become increasingly ineffective as the number of cameras grows. Constructing software that efficiently and reliably deals with networks of this size is a distributed information processing problem as much as it is a video interpretation challenge. This paper demonstrates a software architecture approach to the construction of large scale surveillance network software and explores the implications for instantiating surveillance algorithms at such a scale. A novel architecture for video surveillance is presented, and its efficacy demonstrated through application to an important class of surveillance algorithms.Henry Detmold, Anthony Dick, Katrina Falkner, David S. Munro, Anton van den Hengel, Ron Morriso

    On similarity and pseudo-similarity solutions of Falkner-Skan boundary layers

    Full text link
    The present work deals with the two-dimensional incompressible,laminar, steady-state boundary layer equations. First, we determinea family of velocity distributions outside the boundary layer suchthat these problems may have similarity solutions. Then, we examenin detail new exact solutions, called Pseudo--similarity, where the external velocity varies inversely-linear with the distance along the surface $ (U_e(x) = U_\infty x^{-1}). The present work deals with the two-dimensional incompressible, laminar, steady-state boundary layer equations. First, we determine a family of velocity distributions outside the boundary layer such that these problems may have similarity solutions. Then, we examenin detail new exact solutions. The analysis shows that solutions exist only for a lateral suction. For specified conditions, we establish the existence of an infinite number of solutions, including monotonic solutions and solutions which oscillate an infinite number of times and tend to a certain limit. The properties of solutions depend onthe suction parameter. Furthermore, making use of the fourth--order Runge--Kutta scheme together with the shooting method, numerical solutions are obtained.Comment: 15 page

    Evaluation of antigens for the serodiagnosis of kala-azar and oriental sores by means of the indirect immunofluorescence antibody test (IFAT)

    Get PDF
    Antigens and corresponding sera were collected from travellers with leishmaniasis returning to Germany from different endemic areas of the old world. The antigenicity of these Leishmania strains, which were maintained in Syrian hamsters, was compared by indirect immunofluorescence (IFAT). Antigenicity was demonstrated by antibody titres in 18 sera from 11 patients. The amastigotic stages of nine strains of Leishmania donovani and four strains of Leishmania tropica were compared with each other and with the culture forms of insect flagellates (Strigomonas oncopelti and Leptomonas ctenocephali). Eighteen sera from 11 patients were available for antibody determination with these antigens. The maximal antibody titres in a single serum varied considerably depending on which antigen was used for the test. High antibody levels could only be maintained when Leishmania donovani was employed as the antigen, but considerable differences also occurred between the different strains of this species. The other antigens were weaker. No differences in antigenicity between amastigotes and promastigotes of the same strain were observed. It is important to select suitable antigens. Low titres may be of doubtful specificity and are a poor baseline for the fall in titre which is an essential index of effective treatment.Wir sammelten Parasiten und Seren von Reisenden, die aus verschiedenen endemischen Gebieten der Alten Welt mit einer Leishmaniasis nach Deutschland zurückkehrten. Die Antigenaktivitäten der isolierten und fortlaufend in Goldhamstern gehaltenenLeishmania-Stämme wurden im indirekten Immunofluoreszenztest (IFAT) verglichen. Die Antigenität wurde an Hand von Antikörpertitern in 18 Serumproben von 11 Patienten bewiesen. Neun Stämme desLeishmania donovani-Komplexes und vierLeishmania tropica-Isolate wurden in ihrem amastigoten Stadium miteinander verglichen. Hinzu kamen zwei Insekten-Flagellaten als Kulturformen:Strigomonas oncopelti undLeptomonas ctenocephali. 18 Serumproben von 11 Patienten standen für die Antikörperbestimmung mit diesen Antigenen zur Verfügung. Die maximalen Titerhöhen variierten in ein- und derselben antiserumprobe zum Teil erheblich, je nachdem, welches Antigen für den Test benutzt wurde. Hohe Antikörpertiter konnten nur erhalten werden, wennLeishmania donovani als Antigen vorlag, es ergaben sich aber auch zwischen den einzelnen Stämmen dieser Leishmaniaart erhebliche Unterschiede in der Antigenaktivität. Antigene anderer Art erwiesen sich als wenig wirksam. Zwischen amastigoten und promastigoten Entwicklungsformen einesLeishmania donovani-Stammes konnten keine Unterschiede in der Antigenaktivität erkannt werden. Für den Nachweis möglichst hoher Antikörpertiter im IFAT ist die Auswahl geeigneter Antigene von ausschlaggebender Bedeutung. Niedrige Titer erschweren deren Beurteilung als spezifisch und sind eine schlechte Ausgangsposition für die Beobachtung des obligatorischen Titerabfalles nach erfolgreicher Therapie

    Topology estimation for thousand-camera surveillance networks

    Get PDF
    Copyright © 2007 IEEESurveillance camera technologies have reached the point whereby networks of a thousand cameras are not uncommon. Systems for collecting and storing the video generated by such networks have been deployed operationally, and sophisticated methods have been developed for interrogating individual video streams. The principal contribution of this paper is a scalable method for processing video streams collectively, rather than on a per camera basis, which enables a coordinated approach to large-scale video surveillance. To realise our ambition of thousand camera automated surveillance networks, we use distributed processing on a dedicated cluster. Our focus is on determining activity topology - the paths objects may take between cameras' fields of view. An accurate estimate of activity topology is critical to many surveillance functions, including tracking targets through the network, and may also provide a means for partitioning of distributed surveillance processing. We present several implementations using the exclusion algorithm to determine activity topology. Measurements reported for the key system component demonstrate scalability to networks with a thousand cameras. Whole-system measurements are reported for actual operation on over a hundred camera streams (this limit is based on the number of cameras and computers presently available to us, not scalability). Finally, we explore how to scale our approach to support multi-thousand camera networks. ©2007 IEEE

    Rote Liste und Artenverzeichnis der Schnecken und Muscheln Baden-Württembergs

    Get PDF
    Die vorliegende Veröffentlichung umfasst zwei Grundbausteine. Zum einen die offizielle Rote Liste mit Nennung der Gefährdungskategorien, zum anderen ein revidiertes systematisches Gesamtartenverzeichnis der Mollusken Baden-Württembergs. Die Rote Liste dient zum schnellen Feststellen der jeweiligen Gefährdungskategorien der einzelnen Arten in Baden-Württemberg und ist wie üblich alphabetisch nach Gattungen geordnet. Sehr großer Wert wurde auf die sorgfältige Analyse der Ergebnisse gelegt (Kapitel 7). Das Gesamtartenverzeichnis dient der aktuellen systematischen Einordnung aller Arten, weshalb hier die Taxa im Kontext des wissenschaftlichen Systems der Mollusken aufgeführt werden. Im systematischen Artenverzeichnis soll der momentane Kenntnisstand über die Mollusken Baden-Württembergs in knapper Darstellung zum Ausdruck kommen. Hier sind auch die bekannten Unterarten aufgeführt und es werden zusätzliche Informationen zum Verbreitungstyp, zur Verbreitung (Vorkommen in den Naturräumen 3. Ordnung) sowie zur Ökologie (Zuordnung einzelner Arten zu bestimmten Biotoptypen) gegeben. Mit diesen Zusatzinformationen werden Rote Listen und Artenverzeichnisse zu Gradmessern der Biodiversitätsforschung. In über 130 ‚Anmerkungen‘ werden die entsprechenden Angaben zur Systematik, Verbreitung und Ökologie präzisiert und es wird auf die hierfür zu Grunde liegende Literatur verwiesen. Alle Angaben der Roten Liste sind auch im ausführlichen systematischen Artenverzeichnis enthalten. In beiden Listen sind die Arten mit ihrer laufenden Nummer aufgeführt. Damit ist ein problemloser Wechsel von der Roten Liste zu den Angaben im systematischen Artenverzeichnis gewährleistet. Der Forschungsstand findet sich vielfach in der historischen Literatur, die deshalb eine sorgfältige und kritische Berücksichtigung erfuhr (siehe Anmerkungen und Literaturverzeichnis). Einen unschätzbaren Wert haben in diesem Zusammenhang die zahlreichen Veröffentlichungen David Geyer‘s, die den Beginn der modernen Regionalfaunisik in Baden-Württemberg kennzeichnen. Ein eigenes Kapitel zur Forschungsgeschichte hätte jedoch den vorgegebenen Rahmen dieser Arbeit gesprengt
    corecore