ppxscal/embedding_network huggingface dataset:
A System for Evaluating Augmented Reality User Interfaces in Wearable Computers
Authors: Riku Suomela, Juha Lehikoinen, Ilkka Salminen
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Usability tests with wearable computers are difficult to conduct due to the nature of wearable computers. Wearable computers are intended for personal use and the test supervisor does not know exactly what the test subject is currently seeing in augmented reality through the head-worn display of the wearable computer. Due to this personal nature, the concepts of traditional usability testing need some rethinking. This paper presents a combination of techniques that connects the computers of the test subject and the supervisor. Both of the computers share the same view of augmented reality and the supervisor knows exactly what the user is doing and what state the computer is in. All actions and sensor data are also recorded for later analysis. Complete usability tests have been made with this system and the system fulfilled its goals
High-Level Synthesis Methodology for On-Line Testability Optimization
Authors: M. A. Naal, E. Simeu
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

Introducing testability considerations as soon as possible in the design process results in more testable design with reduced area overhead. Very important improvements can be carried out before the scheduling step. An optimization, which takes effect at behavioral specifications and leads to produce an improved scheduling, is proposed by this study. This optimization is good for improving not only on-line testability but also for some other objectives in the obtained synthesis.
Support for Maintaining Object-Oriented Programs
Authors: Moises Lejter, Scott Meyers, Steven P. Reiss
Venue:  (1991)

In this paper, we explain how inheritance and dynamic binding make object-oriented programs difficult to maintain, and give a concrete example of the problems that arise. We show that the difficulty lies in the fact that conventional tools are poorly suited for work with object-oriented languages, and we argue that semantics-based tools are essential for effective maintenance of object-oriented programs. We then describe a system we have developed for working with C++ programs. This system comprises a relational database system for information about programs and an interactive database interface integrated with a text editor. We describe our system architecture, detail the database relations, provide informal evidence on the system''s effectiveness, and compare it to other research with similar goals.
ASSO: Portability as a Methodological Goal
Authors: Elvira Locuratolo
Venue:  (2001)

In this paper an algorithm is presented to transform a database schema, generated in a high level semantic model, to more specific database schemas, specified according to object-oriented data model, with different levels of implementation of efficiency, down to a corresponding relational schema. In particular, the problem of transforming Is-a class hierarchies is considered. This algorithm serves to support the portability of a database application design to a target modelling level with the chosen database system characteristics. TEL:: +39 50 593403 EMAIL:: locuratolo@iei.pi.cnr.it
On traces for functional spaces related to Maxwell''s equations. Part I: an integration by parts formula in Lipschitz polyhedra. Part II: Hodge decompositions on the boundary of Lipschitz polyhedra and Applications
Authors: A. Buffa, P. Ciarlet,  Jr.
Venue:  (1999)

The aim of these papers is to study the characterization of the tangential traces for the space $H(\curl,\Omega)$ when \$Omega$ is a Lipschitz polyhedron. To this aim, an integration by parts formula is proved in the Part I and Hodge decompositions for tangential vector fields are provided in Part II. TEL:: 0382-548236 EMAIL:: annalisa@dragon.ian.pv.cnr.it
B* Probability Based Search
Authors: Hans J. Berliner, Chris McConnell
Venue:  (2001)

Keywords: Probabilistic B*, computer chess, selective search, two-person games 54 pages [FTP: Unavailable] We describe a search algorithm for two-player games that relies on selectivity rather than brute-force to achieve success. The key ideas behind the algorithm are: 1. Stopping when one alternative is clearly better than all the others, and 2. Focusing the search on the place where the most progress can likely be made toward being able to stop. Critical to this process is identifying uncertainty about the ultimate value of any move. The lower bound on uncertainty is the best estimate of the real value of a move, while the upper bound is its optimistic value, based on some measure of unexplored potential. Uncertainty is represented as probability densities. The search develops those parts of the tree where moving existing bounds would be most likely to succeed and make the most progress toward terminating the search. Termination is achieved when the established real value of the best move is so good that the likelihood of this being achieved by any other alternative is minimal. The B* probability based search algorithm has been implemented on the chess machine Hitech. "En route" we have developed effective techniques for: *Dealing with independence of alternative moves, *Producing viable optimistic estimates to guide the search and *Dealing with the Graph History Interaction problem. This report describes the implementation, and the results of tests including games played against brute-force programs. The data indicate that B* Hitech is a better pure selective searcher than anything previously reported. Further, analysis of the data indicates that should additional power become available, the B* technique will scale up considerably better than brute-force techniques.
Iterative reengineering to compensate for quick-fix maintenance
Authors: F. Lanubile, G. Visaggio
Venue: Proceedings of the International Conference on Software Maintenance (1995)

A typical approach to software maintenance is analyzing just the source code, applying some patches, releasing the new version, and then updating the documentation. This quick-fix approach usually leads to documentation not aligned with the current system and degrades the original system structure, thus rendering the evolution of the system costly and error-prone. Although there are alternative maintenance models which avoid these problems, by analyzing and updating the system documentation first, the quick-fix approach continues to be popular because of the time pressure for new releases and the resistance to change of maintenance programmers. In this paper, we propose an iterative reengineering model which can be run each time the maintainability and reliability of a software system degrade under a tolerance level. The reengineering process, applied after a number of modifications, can result in renovation of the current system or simply in realignment of the documentation. In this context, reengineering is no longer a one-shot process but becomes an ordinary process which runs concurrently with the quick-fix maintenance process. The results obtained with an industrial case study are presented and the lessons learned are discussed.
A Robot with a Decentralized Consensus-making Mechanism Based on the Immune System
Authors: Akio Ishiguro, Yuji Watanabe, Toshiyuki Kondo, Yasuhiro Shirai, Yoshiki Uchikawa
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

In recent years much attention has been focused on behavior-based artificial intelligence(AI), which has already demonstrated its robustness and flexibility against dynamically changing world. However, in this approach, the followings have not yet been resolved: how do we construct an appropriate arbitration mechanism, and how do we prepare appropriate competence modules. In this paper, to overcome these problems, we propose a new decentralized consensus-making system inspired by the biological immune system. And we apply our proposed method to behavior arbitration for an autonomous mobile robot, namely garbage collecting problem that takes into account of the concept of self-sufficiency. To verify the feasibility of our method, we carry out some simulations. In addition, we investigate two types of adaptation mechanisms, and try to evolve the proposed artificial immune network using reinforcement signals.
Area Requirement and Symmetry Display of Planar-Upward Drawings
Authors: Giuseppe D Battista, Roberto Tamassia, Ioannis G. Tollis
Venue:  (1990)

In this paper we investigate the problem of constructing planar straight-line drawings of acyclic digraphs such that all the edges flow in the same direction, e.g. from bottom to top. Our contribution is twofold. First, we show the existence of a family of planar acyclic digraphs that require exponential area for any such drawing. Second, motivated by the preceding lower bound, we relax the straight-line constraint and allow bends along the edges. We present a linear-time algorithm that produces drawings with a small number of bends, asymptotically optimal area, and such that symmetries and isomorphisms of the digraph are displayed. If the digraph has no transitive edges then the obtained drawing has no bends. Also, a variation of the algorithm produces drawings with exact minimum area.
A Collaborative Wearable System with Remote Sensing
Authors: Martin Bauer, Timo Heiber, Gerd Kortuem, Zary Segall
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

This paper presents a collaborative wearable system based on the notion of remote sensing. Remote sensing lets users of wearable or stationary computers perceive a remote environment through the sensors of a remote wearable computer. We describe a concrete system with remote sensing capability that is designed to enhance the communication and cooperation of highly mobile computer technicians.
On generalized vector equilibrium problems
Authors: Wen Song
Venue: Journal of Computational and Applied Mathematics (2002)

An existence result for a generalized vector equilibrium problem is proved in a general topological vector space. As applications, existence results are derived for vector equilibrium problems and vector variational-like inequalities with set-valued mappings under Ψ-monotonicity condition and maximal Ψ-monotonicity condition. These results extend and unify a number of existence results for vector variational inequalities in the previous literature.
Applying Model Checking to Concurrent Object-Oriented Software
Authors: Seung Mo Cho, Doo Hwan Bae, Sung Deok Cha, Young Gon Kim, Byung Kyu Yoo, Sang Taek Kim
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Model checking is a formal verification technique which checks the consistency between a requirement specification and a behavior model of the system by explorating the state space of the model. We apply model checking to formal verification of concurrent object-oriented systems, using an existing model checker SPIN which has been successful in verifying parallel systems. First, we propose an Actor-based modeling language, called APromela, by extending a modeling language Promela which is a modeling language supported in SPIN. APromela supports not only all the primitives of Promela, but additional primitives needed to model concurrent object-oriented systems, such as class definition, object instantiation, message send, and synchronization. Second, we provide translation rules for mapping APromela's such modeling primitives to Promela's. By giving an example of specification, translation, and verification, we also demonstrate the applicability of our proposed approach, and discuss the limitations and further research issues.
Vapnik-Chervonenkis Dimension of Recurrent Neural Networks
Authors: Pascal Koiran, Eduardo D. Sontag
Venue:  (1996)

Most of the work on the Vapnik-Chervonenkis dimension of neural networks has been focused on feedforward networks. However, recurrent networks are also widely used in learning applications, in particular when time is a relevant parameter. This paper provides lower and upper bounds for the VC dimension of such networks. Several types of activation functions are discussed, including threshold, polynomial, piecewise-polynomial and sigmoidal functions. The bounds depend on two independent parameters: the number $w$ of weights in the network, and the length $k$ of the input sequence. In contrast, for feedforward networks, VC dimension bounds can be expressed as a function of $w$ only. An important difference between recurrent and feedforward nets is that a fixed recurrent net can receive inputs of arbitrary length. Therefore we are particularly interested in the case~$k \gg w$. Ignoring multiplicative constants, the main results say roughly the following: \begin{itemize} \item For architectures with activation $\sigma $ = any fixed nonlinear polynomial, the VC dimension is $\approx \nopar\leninp$. \item For architectures with activation $\sigma $ = any fixed {\it piecewise\/} polynomial, the VC dimension is between $\nopar\leninp$ and $\nopar^2\leninp$. \item For architectures with activation $\sigma = {\cal H}$ (threshold nets), the VC dimension is between $\nopar\log(\leninp/\nopar)$ and $\min\{\nopar\leninp\log\nopar\leninp,\nopar^2+\nopar\log\nopar\leninp\}$. \item For the standard sigmoid $\sigma(x)=1/(1+e^{-x})$, the VC dimension is between $\nopar\leninp$ and $\nopar^4\leninp^2$. \ei
A Type System for Expressive Security Policies
Authors: David Walker
Venue:  (1999)

{\em Certified code} is a general mechanism for enforcing security properties. In this paradigm, untrusted agent code carries annotations that allow a host to verify its trustworthiness. Before running the agent, the host checks the annotations and proves that they imply the host''s security policy. Despite the flexibility of this scheme, so far, compilers that generate proof-carrying code have focused on simple memory and control-flow safety rather than more general security properties. {\em Security automata} can enforce an expressive collection of security policies including access control policies and resource bounds policies. In this paper, we show how to take specifications in the form of security automata and automatically transform them into signatures for a typed lambda calculus that will enforce the corresponding safety property. Moreover, we describe how to instrument typed source language programs with security checks and typing annotations so that the resulting programs are provably secure and can be mechanically checked. This work provides a foundation for the process of automatically generating secure certified code in a type-theoretic framework.
All-electron Local Density and Generalized Gradient Calculations of Structural Properties of Semiconductors
Authors: C. Filippi, D. J. Singh, C. J. Umrigar
Venue:  (1994)

The lattice constant, bulk modulus and single particle eigenvalues of Si, Ge, and GaAs are evaluated by using the local density approximation (LDA) and the generalized gradient approximation (GGA) for the exchange-correlation energy. We consider two different generalized gradient functionals, the exchange-correlation recently proposed by Perdew and Wang and the Becke exchange combined with a previous version of the Perdew-Wang correlation. We perform an all-electron calculation with the linear augmented plane wave method (LAPW) to test the capability of these generalized gradient exchange-correlation functionals to describe structural properties of semiconductor systems. Our results differ from previous calculations of the same quantities within the pseudopotential scheme although the qualitative trends are the same. The LDA yields lattice constants that are smaller by less than 0.6% than the experimental values. Both GGA''s overcorrect, giving lattice constants that are larger than the experimental ones by about 2% for the earlier GGA and by about 1.5% for the latter GGA. The LDA predicts bulk moduli that are within 3% of the experimental value whereas the GGA''s underestimate the bulk moduli by 14-22%. The underestimate of the LDA band gaps is not improved by either of the GGA''s.
Complexity in Human Centered Systems: The Case of Software Processes
Authors: Carlo Ghezzi
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

Human centered systems are systems where humans interact, supported by technology, to accomplish complex tasks that involve a great deal of autonomy and individual responsibility and, at the same time, global coordination and sharing of information. Examples include large financial systems and computer-aided design environments for new product lines. The talk focuses on software processes, i.e. the processes through which software applications are conceived, developed, deployed, and evolved. The talk will provide a retrospective view of software process research over the past thirty years, identifying the strengths and weaknesses of the proposed approaches, their successes and failures. It will then turn to an evaluation of the current state of the art and will examine some important research directions for the future.
The Role of Selection in Genetic Algorithms
Authors: Vladimir Estivill-Castro
Venue:  (1996)

Genetic Algorithms have gained wide populatity due to their conceptual simplicity and their ability to obtain approximate solutions for complex searching and optimization problems. Their wide applicability contrasts with their rather undeveloped theoretical basis. In particular, the convergence of genetic algorithms has been one of the most challenging theoretical issues in the evolutionary computation area. We provide a careful analysis of the structure of the classical genetic algorithm. We demonstrate that, when a Genetic Algorithm is used to maximize a function, selection is the process that assures convergence to the global optimum (in the limit) for the fitness of the population. Our results have several practical implications; among these, the number of generations up to which reasonable improvement could be expected may be approximated ahead or during the working of the genetic algorithm.
Odyssey: a high-performance clustered video server
Authors: Min-You Wu, Wei Shu, Chow-Sing Lin
Venue: Software&mdash;Practice Experience (2003)

Video servers are essential in video-on-demand and other multimedia applications. In this paper, we present our high-performance clustered CBR video server, Odyssey. Odyssey is a server connecting PCs with switched Ethernet. It provides efficient support for normal play and interactive browsing functions such as fast-forward and fast-backward. We designed a set of algorithms for scheduling, synchronization and admission control, which results in a high utilization of resources. Odyssey is able to deliver a large number of video streams.
How Secure is Your Wireless Network? Safeguarding Your Wi-Fi LAN
Authors: Lee Barken
Venue:  (2003)

Now you can have the awesome benefits of wireless LANswithout falling victim to their notorious security flaws. Leadingwireless security expert Lee Barken shows you practicalworkarounds and fixes for the vulnerabilities in today'sWLANs, introduces high-security wireless protocols new to themarketplace, and offers step-by-step instructions for protectingall your wireless information, from the home to the enterprise.This is the definitive and easy-to-use WLAN security book you'vebeen searching for--whether you're a network administrator,security specialist, manager, or home user.Topics covered include-- Why conventional wireless LANs are so insecure--and what you can do about it "Wardriving" software, equipment, and techniques: knowing your enemy 802.11i, WPA, TKIP, and AES: the new wireless security options 802.1x and EAP: enabling port-based authentication on your WLAN Safely connecting WLANs to wired networks Securing home and small office environments, one step at a time Accessing VPNs from wireless devices Integrating firewalls and wireless access points Improving security in public access environments Securing enterprise environments with 802.1x--a start-to-finish walkthrough
Factorization of differential systems in characteristic p
Authors: Thomas Cluzeau
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We present an algorithm for factoring differential systems with coefficients in Fp(z). Such an algorithm has already been given by van der Put in [20], [24, 13.1] and [22]. We recast his ideas to handle systems directly and we add some comparisons of strategies, an implementation in Maple1 and a complexity analysis. The central tool for factoring in characteristic p is the p curvature. We prove the links between the p-curvature and the eigenring and we show how to use these to obtain another algorithm following the exposition of Barkatou in [1].
A fine-grained protection mechanism in object-based operating systems
Authors: S. Shigeta, T. Tanimori, K. Shimizu, H. Ashihara
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

The paper describes the design and implementation of a flexible, fine-grained protection mechanism for operating systems based on an object/thread model. The mechanism has the following features: (1) it provides fine-grained protection: each thread has a list of keys (capabilities) and inherits object's keys when it invokes an abject. (2) The mechanism is very flexible: a combination of multiple keys are used to represent various conditions for accessing objects. (3) It allows a group of keys to be defined as key group, which realizes hierarchical, integrated key processing and management. (4) Users can specify an SCL (subject control list), which defines a list of objects that a subject can invoke. This is used to restrict subjects; suspected subjects are only allowed to access the objects specified in the SCL. The proposed mechanism is being implemented in an object-based operating system which the authors are developing. Implementation techniques to improve efficiency are also described.
Hypothetical-reasoning and radical non-constituent coordination in categorial logic
Authors: Nissim Francez
Venue:  (1997)

The paper investigates the connection between non-constituent coordination, as implemented in categorial grammar by means of a polymorphic type-assignment to lexical conjunctions, and hypothetical reasoning in Categorial Logics. A way of extending the logic is suggested, so that coordination can be applied to types depending on undischarged assumptions. By a certain ``resource manipulation'''' of assumptions (of hypothetical reasoning), a late-discharge is facilitated, leading to what is referred to as the {\em radical non-constituent coordination}, wherby only basic types (and not functional types of any kind) are coordinated.
The automorphism group of the random graph: four conjugates good, three conjugates better
Authors: J. K. Truss
Venue: Discrete Mathematics (2003)

In Math. Proc. Cambridge Philos. Soc. 98 (1985) 213 it was shown that the automorphism group of the random graph is simple, and that 'five conjugates' suffice to demonstrate this. Rubin (Handwritten notes on simple automorphism groups, 1988) improved this number to four, and here I show that three suffice. This number is optimal.