ppxscal/embedding_network huggingface dataset:
Augmented Reality Projects in the Automotive and Aerospace Industries
Authors: Holger Regenbrecht, Gregory Baratoff, Wilhelm Wilke
Venue: IEEE Computer Graphics and Applications (2005)

The 2003 International Symposium on Mixed and Augmented Reality was accompanied by a workshop on potential industrial applications. The real use of augmented reality (AR) in an industrial context is still in its infancy and the authors' own experience in this field supports this viewpoint. They have been actively involved in the research, development, and deployment of AR systems in the automotive, aviation, and astronautics industries for more than 5 years and have developed and implemented AR systems in a wide variety of environments.In this article they have selected 10 AR projects from those we have managed and implemented in the past to examine the main challenges faced and to share some of the lessons learned.
Fault-Based Testing of Database Application Programs with Conceptual Data Model
Authors: W. K. Chan, S. C. Cheung, T. H. Tse
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Database application programs typically contain program units that use SQL statements to manipulate records in database instances. Testing the correctness of data manipulation by these programs is challenging. When a tester provides a database instance to test such a program, the program unit may output faulty SQL statements and, hence, manipulate inappropriate database records. Nonetheless, these failures may only be revealed in very specific database instances. This paper proposes to integrate SQL statements and the conceptual data models of an application for faultbased testing. It proposes a set of mutation operators based on the standard types of constraint used in the enhanced entity-relationship model. These operators are semantic in nature. This semantic information guides the construction of affected attributes and join conditions of mutants. The usefulness of our proposal is illustrated by an example in which a missing-record fault is revealed.
Security mechanisms for wireless sensor networks
Authors: Donggang Liu
Venue:  (2005)

Wireless sensor networks have received a lot of attention recently due to their wide applications in military and civilian operations. Example applications include target tracking, scientific exploration, and data acquisition in hazardous environments. Security becomes one of the main concerns when there are malicious attacks against the network. However, providing security services in such networks turns out to be a challenging task due to the resource constraints on sensor nodes and the node compromise attacks. These features and challenges motivate the research on security mechanisms for wireless sensor networks. This dissertation includes three studies on security mechanisms for wireless sensor networks. The first study extends the capabilities of &mu;TESLA, a broadcast authentication technique for wireless sensor networks, so that it can cover a long time period and support a large number of sensor nodes as well as potential senders in the network. The second study addresses how to establish pairwise keys between sensor nodes in a wireless sensor network. A key pre-distribution framework based on bivariate polynomial pool is developed for this purpose. Two efficient instantiations of this framework are also provided: a random subset assignment scheme and a hypercube-based key pre-distribution scheme. To further improve the pairwise key establishment in static sensor networks, prior deployment knowledge, post deployment knowledge and group-based deployment knowledge are used to facilitate key pre-distribution. The third study investigates how to enhance the security of location discovery in sensor networks. An attack-resistant MMSE method and a voting-based method are developed to tolerate malicious attacks against location discovery. Both methods can survive malicious attacks even if the attacks bypass traditional cryptographic protections such as authentication, as long as the benign beacon signals constitute the majority of the &ldquo;consistent&rdquo; beacon signals. In addition, a number of techniques are proposed to detect and revoke malicious beacon nodes that supply malicious beacon signals to sensor nodes.
Automatic construction of personalized customer interfaces
Authors: Bob Price, Russ Greiner, Gerald Häubl, Alden Flatt
Venue: Proceedings of the 11th international conference on Intelligent user interfaces (2006)

Interface personalization can improve a user's performance and subjective impression of interface quality and responsiveness. Personalization is difficult to implement as it requires an accurate model of a user's intentions and a formal model of how an interface meets a user's need. We present a novel model for tractable inference of consumer intentions in the context of grocery shopping. The model makes unique use of a priori temporal relations to simplify inference. We then present a simple interface generation framework that was inspired by viewing user interface interaction as a channel coding problem. The resulting model defines a simplified but clear notion of a user's utility for an interface. We demonstrate the effectiveness of the research prototype on some simple data, and explain how the model can be augmented with richer user modeling to create a deployable application.
Dielectric breakdown in SiO2 via electric field induced attached hydrogen defects
Authors: Jamil Tahir-Kheli, M. Miyata, W. A. Goddard,  III
Venue: Microelectronic Engineering (2005)

We propose a new mechanism for dielectric breakdown in thin gate oxides. Using First Principles calculations, we have found a new meta-stable structure where an interstitial Hydrogen Radical attaches to a network Oxygen without breaking the Si-O bond (Att_Rad state). Calculations in an external electric field find that the energy of the Att_Rad state is reduced. A pair of such Att_Rad states is further stabilized when they form a dimer (Att-Dimer state). This electric field induced Att_Dimer state is thermally accessible for very thin oxides and can form a percolating path that may explain the phenomenon of soft breakdown.
Multilevel expansion-based VLSI placement with blockages
Authors: Bo Hu, M. Marek-Sadowska
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

The rapid growth of system-on-chip designs makes it a necessity for physical design tools to efficiently handle the coexistence of large intellectual property (IP) blocks and small standard cells in a single design. In this work, we present an efficient expansion-based placer to address standard-cell placement problem in the presence of blockages induced by pre-placed IP blocks. Expansion refers to the process during which cells are gradually distributed over a specified region. We implement expansion in a new placer by enhancing a quadratic placement technique based on fixed-point addition originally presented by B. Hu and M. Marek-Sadowska (2003), where fixed points were defined as dimensionless pseudo cells, and were deliberately introduced into the circuit to pull cells from one location to another. The new placer not only produces very competitive placement results over multiple sets of public-domain benchmarks with conventional rectangle-like chip boundary, but also efficiently handles the existence of blockages. Especially, we develop three expansion strategies and use them under different blockage settings.
Automated documentation
Authors: Martin A. Goetz
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

The problem of developing and maintaining adequate documentation for computerized user applications is certainly not being addressed properly at most installations. Documentation is needed at the module, program, and system levels, at the user levels, and at the operations level.
Problems on IPv4-IPv6 network Transition
Authors: Ruri Hiromi, Hideaki Yoshifuji
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

IPv6 (Internet Protocol Version 6) is now available in various OSs and applications. It is also deployed in major ISP backbone networks. Although most of all IPv6 features work as they were designed, we may have potential problems with them and they might exist in IPv4-IPv6 dual stack environment. On the other hand, we don't have much opportunities to exchange enough information about dual stack network operation. We build a special research group named "IPv6-Fix" [1] in WIDE Project in Japan to investigate the potential issues related to IPv6 deployment. We concern about the problems on IPv4-IPv6 dual stack environment from various perspectives, such as specification, implementation and network operation. From our survey and analysis, we found some problems to be fixed. In this paper, we show some error cases taken by harmful specification, poor implementations and wrong operation. For the healthy coexistence of IPv4-IPv6, we'll share and consider how we should design and operate dual stack network.
Reflections on sonic browsing: Comments on Fernstr&ouml;m and McNamara, ICAD 1998
Authors: Mikael Fernström
Venue: ACM Transactions on Applied Perception (TAP) (2005)

In the original Fernstr&ouml;m and McNamara paper at ICAD 1998, we described our work on a novel user interface for sonic browsing of music collections. In this commentary, we reflect upon the continued research in this area and how our interactive sonification approach has come to be used also for browsing collections of everyday sounds and for perception experiments.
Using ASIS to generate C++ bindings
Authors: Howard Ausden, Karl Nyberg
Venue: ACM SIGAda Ada Letters (2005)

In this paper, we describe an approach to automatically creating C++ bindings to Ada libraries utilizing capabilities of the Ada Semantic Interface Specification (ASIS). We discuss language mapping issues and provide examples of usage of ASIS features during the implementation of a binding tool.
Automated trust negotiation using cryptographic credentials
Authors: Jiangtao Li, Ninghui Li, William H. Winsborough
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Because the information in question is often sensitive, credentials are protected according to access control policies. In traditional ATN, credentials are transmitted either in their entirety or not at all. This approach can at times fail unnecessarily, either because a cyclic dependency makes neither negotiator willing to reveal her credential before her opponent, because the opponent must be authorized for all attributes packaged together in a credential to receive any of them, or because it is necessary to fully disclose exact attribute values, rather than merely proving they satisfy some predicate (such as being over 21 years of age). Recently, several cryptographic credential schemes and associated protocols have been developed to address these and other problems. However, they can be used only as fragments of an ATN process. This paper introduces a framework for ATN in which the diverse credential schemes and protocols can be combined, integrated, and used as needed. A policy language is introduced that enables negotiators to specify authorization requirements that must be met by an opponent to receive various amounts of information about certified attributes and the credentials that contain it. The language also supports the use of uncertified attributes, allowing them to be required as part of policy satisfaction, and to place their (automatic) disclosure under policy control.
Quality of Service Vertical and Horizontal Integration in Active Nodes
Authors: David Fuin, Eric Garcia, Herve Guyennet, Emmanuel Jeanvoine
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In this paper we focus on possibilities of quality of service mechanisms implementations in active routers. We show that a different location generates a different resulting QoS. Indeed, two types of QoS can be provided in active network: one that provides "classical" network QoS and one that provides more computing resources to priority flows. We describe a number of implementations we have realized in ANTS and Tamanoir active nodes. In these implementations based on flow differentiation, we have developed several schedulers. We present experimentations realized in order to validate our implementations. In these experimentations, we emphasize on the two kinds of QoS provided. We show the interest of our innovative and efficient approach.
BIST Technique for GALS Systems
Authors: Milos Krstic, Eckhard Grass
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

In this paper a test technique based on the Built-In Self- Test (BIST) is proposed. Our BIST concept is based on hierarchical testing of the digital systems. The presented test scheme is optimized for Globally Asynchronous Locally Synchronous (GALS) systems. The BIST technique, described here, is implemented on a GALS baseband processor compliant to the IEEE 802.11a standard. Some results on the performance of our test solution are given. The GALS processor with embedded BIST was fabricated in IHP¿s 0.25 µm CMOS technology and test results are presented.
Approximate Global Alignment of Sequences
Authors: Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao, Tao Li
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method solves the bounded alignment problem. It computes the distribution of the edit distance between the remaining suffixes. For a given bound k and approximation p %, it uses this distribution to prune the entries of the DP matrix that will lead to alignments with more than k edit operations with more than p%probability. Our second method addresses the unbounded global alignment problem. For each entry of the distance matrix, it dynamically computes an upper bound to the distance between the unaligned suffixes.This bound, along with the lower bound as computed for the bounded case, is then used to eliminate the entries of the distance matrix. According to our experimental results, our methods are up to three times faster than the competing methods for the bounded alignment and up to two times faster for the unbounded alignment, even with 100% approximation. Our methods use only 17-68% of the space used by the next best competitor.
Best-first word-lattice parsing: techniques for integrated syntactic language modeling
Authors: Mark Johnson
Venue:  (2005)

This thesis explores a language modeling technique based on statistical parsing. Previous research that exploits syntactic structure for modeling language has shown improved accuracy over the standard trigram models. Unlike previous techniques, our parsing model performs syntactic analysis on sets of hypothesized word-strings simultaneously; these sets are encoded as weighted finite state automata word-lattices. We present a best-first word-lattice chart parsing algorithm which combines the search for good parses with the search for good strings in the word-lattice. We describe how the word-lattice parser is combined with the Charniak language model, a sophisticated syntactic language model, in order to provide an efficient syntactic language model. We present results for this model on a standard set of speech recognition word-lattices. Finally, we examine variations of the word-lattice parser in order to increase performance as well as accuracy.
A Hybrid and Linear Registration Method Utilizing Inclination Constraint
Authors: Daisuke Kotake, Kiyohide Satoh, Shinji Uchiyama, Hiroyuki Yamamoto
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

This paper describes a new hybrid vision-based registration method with an inclination sensor. In the method, a camera is tracked by solving linear equations under inclination constraint. Linear operations are faster than the nonlinear optimization process, but the output does not usually satisfy the orthonormality constraint. On the contrary, the proposed method calculates the camera position and azimuth directly, thus the result satisfies the orthonormality constraint. Many hybrid approaches using inertia sensors have been proposed for AR/MR. However, such methods still depend on vision-based methods in initialization processes. On the other hand, the proposed method is totally hybrid in that the inclination measured by the sensor is always incorporated in pose calculation process as well as vision information. The method can be used in initialization process of conventional hybrid methods as well as it can be used as an independent registration method. The proposed method can be applied to not only inside-out-style camera tracking but also outside-in-style object tracking.
An overview of cognitive skills and impairments for cognitive work
Authors: Ray Adams
Venue: Issue 83 (September 2005) (2005)

A practical taxonomy of IST functional requirements is developed here based upon occupational and cognitive factors to consider systematically:&bull; the IST requirements of individuals with different cognitive skills and impairments; and,&bull; the opportunities and solutions that IST developers can generate.The focus is on functionality and accessibility to IST function in the work-place. Whilst vocational factors provide the context of use, cognitive notions proved more useful and precise when considering systematically the range of accessibility solutions that need to be developed in IST. Analysis shows that this taxonomy captures the range of potential accessibility solutions.
Modeling Multiple Time Series for Anomaly Detection
Authors: Philip K. Chan, Matthew V. Mahoney
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Our goal is to generate comprehensible and accurate models from multiple time series for anomaly detection. The models need to produce anomaly scores in an online manner for real-life monitoring tasks. We introduce three algorithms that work in a constructed feature space and evaluate them with a real data set from the NASA shuttle program. Our offline and online evaluations indicate that our algorithms can be more accurate than two existing algorithms.
SCL: a language for security testing of network applications
Authors: Sylvain Marquis, Thomas R. Dean, Scott Knight
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

Security of network applications has become increasingly important in the past several years. Syntax-based testing is a black box, data driven testing technique, for applications for which input can be described formally. SCL is a component of Protocol Tester, a project at RMC and Queen's, that uses syntax-based testing to evaluate the security of network applications. As a language, SCL can describe the syntax and the semantic constraints of a given protocol, constraints that pertain to the testing of network application security. This paper describes how SCL captures the input syntax of a network application including both syntax and semantic constraints. Standard reverse engineering and program comprehension techniques are used to extract a detailed model from the description. This model can be used to automate the selection and generation of test cases in Protocol Tester.
Rapid Prototyping and User-Centered Design of Interactive Display-Based Systems
Authors: Daniel Fitton, Keith Cheverst, Chris Kray, Alan Dix, Mark Rouncefield, George Saslis-Lagoudakis
Venue: IEEE Pervasive Computing (2005)

Rapid prototyping is a broad field encompassing many domains and varied approaches. This article presents the authors' experiences using user-centered rapid prototyping approaches for developing display-based ubiquitous systems for deployment in real-world situations. Although rapid prototyping usually produces a single proof-of-concept demonstrator to investigate technical feasibility, they found that without investigating real use, technical feasibility can be meaningless. They adopt multiphased prototyping approaches, using different techniques at different stages to gather feedback. They hope their findings will assist other researchers and practitioners in selecting appropriate prototyping techniques for future projects.This article is part of a special issue on rapid prototyping.
On Reorder Density and its Application to Characterization of Packet Reordering
Authors: Nischal M. Piratla, Anura P. Jayasumana, Tarun Banka
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A formal approach for characterizing, evaluating and modeling packet reordering is presented. Reordering is, a phenomenon that is likely to become increasingly common on Internet, and it can have an adverse impact on end-toend performance and network resource utilization. Reorder Density (RD) is a comprehensive metric for reordering. Several properties of RD are presented that provide insight into the nature of reordering present in a sequence. Based on measurements of packet reordering, certain basic patterns of reordering that are prevalent on the Internet are identified. By focusing on these basic patterns, a model is developed for reordering in networks involving two parallel paths, using a simple loadbalancing scenario as an example. The model is verified using an emulation testbed.
Traffic Configuration for Evaluating Networks on Chips
Authors: Zhonghai Lu, Axel Jantsch
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Network-on-Chip (NoC) provides a network as a global communication platform for future SoC designs. Evaluating network architectures requires both synthetic workloads and application-oriented traffic. We present our trafficconfiguration methods that can be used to configure uniform and locality traffic as synthetic workloads, and to configure channel-based traffic for specific application(s). We also illustrate the significance of applying these methods toconfigure traffic for network evaluation and system simulation. These traffic configuration methods have been integrated into our Nostrum NoC simulation environment.
The security of vehicular ad hoc networks
Authors: Maxim Raya, Jean-Pierre Hubaux
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

Vehicular networks are likely to become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some major design decisions still to be made, which in some cases have more than mere technical implications. We provide a set of security protocols, we show that they protect privacy and we analyze their robustness, and we carry out a quantitative assessment of the proposed solution.