Continuous-time orbit problems are decidable in polynomial-time

We place the continuous-time orbit problem in P , sharpening the decidability result shown by Hainry [7

On the Complexity of the Orbit Problem

We consider higher-dimensional versions of Kannan and Lipton's Orbit Problem---determining whether a target vector space V may be reached from a starting point x under repeated applications of a linear transformation A. Answering two questions posed by Kannan and Lipton in the 1980s, we show that when V has dimension one, this problem is solvable in polynomial time, and when V has dimension two or three, the problem is in NP^{RP}

Space Transportation System and associated payloads: Glossary, acronyms, and abbreviations

A collection of acronyms now in everyday use in the Shuttle world are listed. It is a combination of lists that were prepared at the Kennedy and Johnson Space Centers and by the Air Force

Space Transportation System and associated payloads: Glossary, acronyms, and abbreviations

A collection of acronyms in everyday use concerning shuttle activities is presented. A glossary of terms pertaining to the Space Transportation System is included

Space transportation system and associated payloads: Glossary, acronyms, and abbreviations

A collection of some of the acronyms and abbreviations now in everyday use in the shuttle world is presented. It is a combination of lists that were prepared at Marshall Space Flight Center and Kennedy and Johnson Space Centers, places where intensive shuttle activities are being carried out. This list is intended as a guide or reference and should not be considered to have the status and sanction of a dictionary

On social and technical aspects of managing mobile Ad-hoc communities

Soziale Software beschreibt eine Klasse von Anwendungen, die es Benutzern erlaubt ueber das Internet mit Freunden zu kommunizieren und Informationen auszutauschen. Mit zunehmender Leistungsfaehigkeit mobiler Prozessoren verwandeln sich Mobiltelefone in vollwertige Computer und eroeffnen neue Moeglichkeiten fuer die mobile Nutzung sozialer Software. Da Menschen Mobiltelefone haeufig bei sich fuehren, koennen vergleichbare mobile Anwendungen staerker auf ihre unmittelbare Umgebungssituation zugeschnitten werden. Moegliche Szenarien sind die Unterstuetzung realer Treffen und damit verbundenen Mitgliederinteraktionen. Client-Server-Plattformen, die dabei haeufig zum Einsatz kommen wurden allerdings nie fuer solche hochflexiblen Gruppensituationen konstruiert. Mobile Encounter Netzwerke (MENe) verprechen hier mehr Flexibilitaet. Ein MEN stellt eine mobiler Peer-to-Peer-Plattformen dar, das ueber ein kurzreichweitiges Funknetz betrieben wird. Mit diesem Netzwerk werden Beitraege ueber einen raeumlichen Diffusionsprozess von einem mobilen Endgeraet zum naechsten verbreitet. Das hat zwei entscheidende Vorteile: Zunaechst ist der direkte Nachrichtenaustausch besser geeignet zur Verbreitung von situationsspezifischer Information, da die Informationsrelevanz mit ihrer Entfehrnung abnimmt. Gleichzeitig koennen aber auch Inhalte, die fuer einen breiten Interessenkreis bestimmt sind ueber Mitglieder mit herausragenden Mobilitaetscharakteristik in weit entfernte Gebiete transportiert werden. Ein Nachteil ist jedoch der hohe Ressourcenverbrauch. Zur Loesung dieses Problems entwickeln wir ein Rahmenwerk zur Unterstuetzung mobiler ad-hoc Gruppen, das es uns erlaubt, Gruppensynergien gezielt auszunutzen. Dieses Rahmenwerk bietet Dienstleistungen zur Verwaltung der Gruppendynamik und zur Verbreitung von Inhalten an. Mittels soziale Netzwerkanalyse wird die technische Infrastruktur ohne notwendige Benutzereingriffe kontinuierlich an die reale Umgebungssituation angepasst. Dabei werden moegliche Beziehungen zwischen benachbarten Personen anhand frueher Begegnungen analysiert, spontane Gruppenbildungen mit Clusterverfahren identifiziert und jedem Gruppenmitglied eine geeignete Rolle durch eine Positionsanalyse zugewiesen. Eine Grundvorraussetzung fuer eine erfolgreiche Kooperation ist ein effizienter Wissensaustausch innerhalb einer Gemeinschaft. Wie die Small World-Theorie zeigt, koennen Menschen Wissen auch dann effizient verbreiten, wenn ihre Entscheidung nur auf lokaler Umgebungsinformation basiert. Verschiedene Forscher machten sich das zu nutze, indem sie kurze Verbreitungspfade durch eine Verkettung hochvernetzter Mitglieder innerhalb einer Gemeinschaft konstruierten. Allerdings laesst sich dieses Verfahren nicht einfach auf MENe uebertragen, da die Transferzeit im Gegensatz zu dem drahtgebundenen Internet beschraenkt ist. Unser Ansatz beruht daher, auf der von Reagan et al. vorgestellten Least Effort Transfer-Hypothese. Diese Hypothese besagt, dass Menschen Wissen nur dann weitergeben, wenn sich der Aufwand zur Informationsuebertragung innerhalb bestimmter Grenzen bewegt. Eine erfolgreiche Wissensuebertragung haengt in diesem Fall vom Hintergrundwissen aller Beteiligter ab, was wiederum von unterschiedlichen kognitiven und sozialen Faktoren abhaengt. Entsprechend leiten wir ein Diffusionsverfahren ab, dass in der Lage ist, Inhalte in verschiedene Kompexitaetstufen einzuteilen und Datenuebertragungen an die vorgefundene soziale Situation anzupassen. Mit einem Prototyp evaluieren wir die Machbarkeit der Gruppen- und Informationsmanagementkomponente unseres Rahmenwerkes. Da Laborexperimente keinen ausreichenden Aufschluss ueber Diffusionseigenschaften im groesseren Massstab geben koennen, simulieren wir die Beitragsdiffusion. Dazu dient uns eine Verkehrsimulation, bei der Agenten zusaetzlich mit aktivitaetsbezogenen, sozialen und territorialen Modellen erweitern werden. Um eine realitaetsnahe Simulation zu gewaehrleisten, werden diese Modelle in Uebereinstimmung mit verschiedenen Studien zum Stadtleben generiert. Der technische Uebertragungsprozess wird anhand der Ergebnisse einer vorangegangenen Prototypuntersuchung parametrisiert. Waehrend eines Simulationslaufes bewegen sich Agenten auf einem Stadtplan und sammeln Kontakt- und Beitragsdaten. Analysiert man anschliessend die Netzwerktopologie auf Small World-Eigenschaften, so findet man eine Netzstruktur mit einer ausgepraegten Neigung zum Clustering (Freundschaftsnetzwerke) und einer ueberdurschnittlichen kurzen Weglaenge. Offensichtlich reicht die Alltagsmobilitaet aus, um ausreichend viele Verknuepfungen zwischen Gemeinschaftmitgliedern zu bilden. Die nachfolgende Diffusionsanalyse zeigt, dass vergleichbare Reichweiten wie bei einem flutungsbasierten Ansatz erzielt werden, allerdings mit anfaenglichen Verzoegerungen. Da unser Verfahren bei einem Ortswechsel die Anzahl der Informationsuebermittler auf zentrale Gruppenmitglieder begrenzt, steht mehr Bandbreite fuer den Datenaustausch zur Verfuegung. Herkoemliche Mitglieder (ohne Leitungsaufgaben) tauschen Inhalte vornehmlich in zeitunkritschen Situationen aus. Das hat den positiven Nebeneffekt, dass im Cache erheblich weniger Kopien aussortiert werden muessen. Wechselt man waehrend der Simulation die Beitragskategorie so erkennt man, dass zeitabhaengige Inhalte besser ueber regelmaessige Kontakte und zeitunabhaengig Inhalte durch zufaellige Kontakte verbreitet werden. Eine abschliessende Precision-Recall Analyse zeigt, dass herkoemmliche Gruppenmitglieder eine bessere Genauigkeit (Precision), und zentrale Mitglieder eine bessere Trefferquote (Recall) im Vergleich zu traditionellen Ansaetzen besitzen. Eine Erklaerung dafuer ist, dass der von uns gewaehlte gruppenbasierte Cacheansatz zu weniger Saeuberungszyklen aller Gruppenmitglieder fuehrt und somit nachhaltiger ausgerichtet ist.Social software encompasses a range of software systems that allow users to interact and share data. This computer-mediated communication has become very popular with social networking sites like Facebook and Twitter. The evolvement of smart phones toward mobile computers opens new possibilities to use social software also in mobile usage scenarios. Since mobile phones are permanently carried by their owners, the support focus is, however, much stronger set on promoting and augmenting real group gatherings. Traditional client-server platforms are not flexible enough to support complex and dynamic human encounter behavior. Mobile encounter networks (MENs) which represent a mobile peer-to-peer platform on top of a short range wireless network promise better flexibility. MENs diffuse content from neighbor-to-neighbor in a spatial diffusion process. For physical group gatherings this is advantageous for two reasons. Direct device-to-device interactions encourage sharing of situation-dependent content. Moreover, content is not necessarily locked within friend groups and may trigger networking effects by reaching larger audiences through user mobility. One disadvantage is, however, the high resource usage. We develop a social software framework for mobile ad-hoc groups, which partly solves this problem. This framework supports services for the management of group dynamics and content diffusion within and between groups. Social network analysis as an inherent part of the framework is used to adapt internal community states continuously with real world encounter situations. We hereby qualify interpersonal relationships based on encounter and communication statistics, identify social groups through incremental clustering and assign diffusion roles through position analysis. To achieve efficient content dissemination we make use of social diffusion phenomena. Other researchers have experimented extensively with the small world model as it proofs that people transfer knowledge based on local knowledge but are still capable of diffusing it efficiently on a global scale. Their approach is often based on identifying short paths through member connectivity. However, this scenario is not applicable in MENs as transfer time is limited in contrast to the wired Internet. Our approach is therefore based on the least effort transfer theory. Following Reagan et al., who first postulated this hypothesis, people transfer knowledge only if the transfer effort is within specific limits, which depends on different social and cognitive factors. We derive routing mechanisms, which are capable of distinguishing between different content complexities and apply information about peer's expertise and social network to identify advantageous paths and content transfers options. We evaluate the feasibility of the group management and content transfer component with prototypes. Since labor settings do not allow to obtain information about large scale diffusion experiences, we also conduct a multi-agent simulation to evaluate the diffusion capabilities of the system. Experiences from an earlier prototype implementation have been used to quantify the technical routing process. To emulate realistic community life, we assigned to each agent an individual daily agenda, social contacts and territory preferences specified according to outcomes from different urban city life surveys. During the simulation agents move on a city map according to these models and collect contact and content specific data. Analyzing the network topology according to small world characteristics shows a structure with a high tendency for clustering (friend networks) and a short average path length. Daily urban mobility creates enough opportunities to form shortcuts through the community. Content diffusion analysis shows that our approach reaches a similar amount of peers as network flooding but with delays in the beginning. Since our approach artificially limits the number of intermediates to central community peers more bandwidth is available during traveling and more content can be transferred as in the case of the flooding approach. Ordinary peers seem to have significantly fewer content replications if an unlimited cache is assumed proofing that our mechanism is more efficient. By varying the content type used during the simulation we recognize that time dependent content is better disseminated through frequent contacts and time independent content through random contacts. Performing a precision-recall analysis on peers caches shows that ordinary peers gain an overall better context precision, and central peers a better community recall. One explanation is that the shared cache approach leads to fewer content replacements in the cache as for instance the least recently used cache strategy

A Ground Robot for Search And Rescue in Hostile Environment

The recent sheer developments in the field of robotics has encouraged the researcher to consider the robots assisting human in different aspects of life. In this context, search and rescue is a very interesting ambient where the capabilities offered by the robots can be used to not only augment the quality of service but also impose lower risk to the human members of the rescue team. To this purpose, project SHERPA has been defined to investigate an intelligent heterogeneous robotic team in a search and rescue mission. The robotic team includes flying robots such as fixed wing and quad copters for the purpose of patrolling and surveillance and a ground rover that is mainly considered to provide a mobile power replenishment service for the quadrotors. Navigation of the ground rover on the unstructured outdoor environment defined by the SHERPA is of the main focuses of this thesis. Due to roughness of the terrain, there are a lot of issues on the way of a successful localization. Moreover, the planning has to be compatible with the robot and environment constraints to avoid imposing a risk of mechanical damage to the system. To accomplish the battery exchange operation, the rover is equipped with two auxiliary devices namely "Sherpa box" and "Sherpa robotic arm". In this thesis, firstly, designs of the two devices are introduced to the reader in details. Secondly, their integration with the ground rover will be covered. Finally two important benchmarks of the SHERPA project, namely "human leashing" and "battery exchange operation", will be addressed

Proceedings of the workshop on the science of intense radioactive ion beams

This report contains the proceedings of a 2-1/2 day workshop on the Science of Intense Radioactive Ion Beams which was held at the Los Alamos National Laboratory on April 10--12, 1990. The workshop was attended by 105 people, representing 30 institutions from 10 countries. The thrust of the workshop was to develop the scientific opportunities which become possible with a new generation intense Radioactive Ion Beam (RIB) facility, currently being discussed within North America. The workshop was organized around five primary topics: (1) reaction physics; (2) nuclei far from stability/nuclear structure; (3) nuclear astrophysics; (4) atomic physics, material science, and applied research; and (5) facilities. Overview talks were presented on each of these topics, followed by 1-1/2 days of intense parallel working group sessions. The final half day of the workshop was devoted to the presentation and discussion of the working group summary reports, closing remarks and a discussion of future plans for this effort

Alterations within the structural hierarchy of parchment induced by damage mechanisms

Collagen plays an important role in many biological tissues, including skin, which, once dried and treated, forms parchment and leather. The structural alterations that occur in collagenous materials due to X-ray radiation damage, fluctuation of relative humidity, and mechanical deformation (with a special focus on historical parchment) are the focus of this thesis. The primary aim of this thesis is to investigate major structural changes to collagen within parchment when exposed to inappropriate levels of relative humidity during conservation treatments, and cyclic-humidity during long-term storage in archives, museums and libraries. This study led to the discovery that each parchment sample reacted to the application and removal of moisture in a different way, indicating the fundamental need to treat individual parchment documents as in-homogeneous materials. This thesis investigates the changes that fibrillar collagen undergoes and describes the creation of computational models capable of reproducing the X-ray diffraction patterns for collagen. Previous structural models have been created that sufficiently account for native collagen, however, models created as part of this thesis succeed where previous models have failed in explaining the X-ray diffraction patterns collected from damaged collagen. This study provided the opportunity to contribute towards a large-scale international collaborative project on the hugely important historical resource, the Domesday Book. X-ray diffraction was used to provide unprecedented analysis of Domesday Book samples, providing a structural survey at a molecular level. This analysis produced the conclusion that the majority of samples displayed the presence of collagen axial structure, and were generally of a degraded state as a consequence of the method used to source them the samples were scrapings from the surface, which was less intact than the bulk of the parchment