ODIN: Optimal design integration system

The report provides a summary of the Optimal Design Integration (ODIN) System as it exists at Langley Research Center. A discussion of the ODIN System, the executive program and the data base concepts are presented. Two examples illustrate the capabilities of the system which have been exploited. Appended to the report are a summary of abstracts for the ODIN library programs and a description of the use of the executive program in linking the library programs

Order-disorder transition in supramolecular polymer combs/brushes with polymeric side chains

Supramolecular polymer combs/brushes can be used as smart materials which incorporate the properties of linear polymers with branch polymers depending on the temperature, grafting density, branch molecular weight and most importantly type of non-covalent interaction between the main chain and side chains. Three sets of polymers were synthesized and mixed based on a specific interaction between the main chain and the side chain polymers. The first two sets based on the combination of 2,4-diamino-1,3,5-triazine (DAT) : thymine (THY) and 2-ureido-4[1H]-pyrimidinone (UPy) : (1-(6-isocyanatohexyl)-3-(7-oxo-7,8-dihydro-1,8-naphthyridin-2-yl)urea) (ODIN) were a blend and the third one using ODIN : ODIN interactions was used without a main chain. The polymer set using ODIN : ODIN interaction showed long-range ordering due to strong ODIN aggregation, whereas UPy : ODIN-based polymer combs showed comb-like clusters without any ordering. The phase separation in the THY : DAT system was more pronounced and was further improved after the addition of more equivalents of side chains. Moreover, using melt rheology, consistent with the SAXS data, it was concluded that long-range ordering is responsible for the elastic properties and the flow temperature (T-flow) is lower than the order-disorder transition temperature (T-ODT). This work can be considered as a toolkit for the design of bottlebrush and comb polymers as well as supersoft elastomers and stimuli-responsive materials

Asynchronously Replicated Shared Workspaces for a Multi-Media Annotation Service over Internet

This paper describes a world wide collaboration system through multimedia Post-its (user generated annotations). DIANE is a service to create multimedia annotations to every application output on the computer, as well as to existing multimedia annotations. Users collaborate by registering multimedia documents and user generated annotation in shared workspaces. However, DIANE only allows effective participation in a shared workspace over a high performance network (ATM, fast Ethernet) since it deals with large multimedia object. When only slow or unreliable connections are available between a DIANE terminal and server, useful work becomes impossible. To overcome these restrictions we need to replicate DIANE servers so that users do not suffer degradation in the quality of service. We use the asynchronous replication service ODIN to replicate the shared workspaces to every interested site in a transparent way to users. ODIN provides a cost-effective object replication by building a dynamic virtual network over Internet. The topology of this virtual network optimizes the use of network resources while it satisfies the changing requirements of the users

Front-Running Protection for Distributed Exchanges using Tamper-Resistant Round Trip Time Measurements

In this paper we present ODIN, a front-running protection system that uses a novel algorithm to measure Round-Trip-Time (RTT) to untrusted servers. ODIN is the decentralized equivalent of THOR, a RTT-aware front-running protection system for trading on centralized exchanges. Unlike centralized exchanges, P2P exchanges have potentially malicious peers which makes reliable direct RTT measurement impossible. In order to prevent tampering by an arbitrarily malicious peer, ODIN performs an indirect RTT measurement that never interacts directly with the target machine. The RTT to the target is estimated by measuring the RTT to a randomized IP address that is known to be close to the target's IP address in the global routing network. We find that ODIN's RTT estimation algorithm provides an accurate, practical, and generic solution for collecting network latency data in a hostile network environment

ODIN: A dataspace management system

ODIN is a system that supports the incremental pay-as-you-go integration of data sources into dataspaces and provides user-friendly querying mechanisms on top of them. We describe its main characteristics and underlying assumptions, including the user interactions required. Odin’s novelty lies in a largely automated bottom-up approach (i.e., driven by the sources at hand) that includes the user in the loop for disambiguation purposes. The on-site demonstration will feature an ongoing project with the World Health Organization (WHO). Online demo and videos: www.essi.upc.edu/dtim/odin/Peer ReviewedPostprint (published version

Computer-aided space shuttle orbiter wing design study

An analytical and experimental investigation has been made to provide a space shuttle orbiter wing design that met the guideline requirements of landing performance, stability, and hypersonic trim for a specified center-of-gravity envelope. The analytical study was facilitated by the use of the Optimal Design Integration system (ODIN) and the experimental part of the investigation was conducted in the Langley low-turbulence pressure tunnel and the Langley continuous-flow hypersonic tunnel

ODIN: Obfuscation-based privacy-preserving consensus algorithm for Decentralized Information fusion in smart device Networks

The large spread of sensors and smart devices in urban infrastructures are motivating research in the area of the Internet of Things (IoT) to develop new services and improve citizens’ quality of life. Sensors and smart devices generate large amounts of measurement data from sensing the environment, which is used to enable services such as control of power consumption or traffic density. To deal with such a large amount of information and provide accurate measurements, service providers can adopt information fusion, which given the decentralized nature of urban deployments can be performed by means of consensus algorithms. These algorithms allow distributed agents to (iteratively) compute linear functions on the exchanged data, and take decisions based on the outcome, without the need for the support of a central entity. However, the use of consensus algorithms raises several security concerns, especially when private or security critical information is involved in the computation. In this article we propose ODIN, a novel algorithm allowing information fusion over encrypted data. ODIN is a privacy-preserving extension of the popular consensus gossip algorithm, which prevents distributed agents from having direct access to the data while they iteratively reach consensus; agents cannot access even the final consensus value but can only retrieve partial information (e.g., a binary decision). ODIN uses efficient additive obfuscation and proxy re-encryption during the update steps and garbled circuits to make final decisions on the obfuscated consensus. We discuss the security of our proposal and show its practicability and efficiency on real-world resource-constrained devices, developing a prototype implementation for Raspberry Pi devices

ODIN: Obfuscation-based privacy-preserving consensus algorithm for Decentralized Information fusion in smart device Networks

The large spread of sensors and smart devices in urban infrastructures are motivating research in the area of the Internet of Things (IoT) to develop new services and improve citizens’ quality of life. Sensors and smart devices generate large amounts of measurement data from sensing the environment, which is used to enable services such as control of power consumption or traffic density. To deal with such a large amount of information and provide accurate measurements, service providers can adopt information fusion, which given the decentralized nature of urban deployments can be performed by means of consensus algorithms. These algorithms allow distributed agents to (iteratively) compute linear functions on the exchanged data, and take decisions based on the outcome, without the need for the support of a central entity. However, the use of consensus algorithms raises several security concerns, especially when private or security critical information is involved in the computation. In this article we propose ODIN, a novel algorithm allowing information fusion over encrypted data. ODIN is a privacy-preserving extension of the popular consensus gossip algorithm, which prevents distributed agents from having direct access to the data while they iteratively reach consensus; agents cannot access even the final consensus value but can only retrieve partial information (e.g., a binary decision). ODIN uses efficient additive obfuscation and proxy re-encryption during the update steps and garbled circuits to make final decisions on the obfuscated consensus. We discuss the security of our proposal and show its practicability and efficiency on real-world resource-constrained devices, developing a prototype implementation for Raspberry Pi devices

A spectral line survey of Orion KL in the bands 486-492 and 541-577 GHz with the Odin satellite I. The observational data

Spectral line surveys are useful since they allow identification of new molecules and new lines in uniformly calibrated data sets. Nonetheless, large portions of the sub-millimetre spectral regime remain unexplored due to severe absorptions by H2O and O2 in the terrestrial atmosphere. The purpose of the measurements presented here is to cover wavelength regions at and around 0.55 mm -- regions largely unobservable from the ground. Using the Odin astronomy/aeronomy satellite, we performed the first spectral survey of the Orion KL molecular cloud core in the bands 486--492 and 541--576 GHz with rather uniform sensitivity (22--25 mK baseline noise). Odin's 1.1 m size telescope, equipped with four cryo-cooled tuneable mixers connected to broad band spectrometers, was used in a satellite position-switching mode. Two mixers simultaneously observed different 1.1 GHz bands using frequency steps of 0.5 GHz (25 hours each). An on-source integration time of 20 hours was achieved for most bands. The entire campaign consumed ~1100 orbits, each containing one hour of serviceable astro-observation. We identified 280 spectral lines from 38 known interstellar molecules (including isotopologues) having intensities in the range 80 to 0.05 K. An additional 64 weak lines remain unidentified. Apart from the ground state rotational 1(1,0)--1(0,1) transitions of ortho-H2O, H218O and H217O, the high energy 6(2,4)--7(1,7) line of para-H2O and the HDO(2,0,2--1,1,1) line have been observed, as well as the 1,0--0,1 lines from NH3 and its rare isotopologue 15NH3. We suggest assignments for some unidentified features, notably the new interstellar molecules ND and SH-. Severe blends have been detected in the line wings of the H218O, H217O and 13CO lines changing the true linewidths of the outflow emission.Comment: 21 pages, 10 figures, 7 tables, accepeted for publication in Astronomy and Astrophysics 30 August 200