ppxscal/embedding_network huggingface dataset:
2D vs 3D, Implications on Spatial Memory
Authors: Monica Tavanti, Mats Lind
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

Since the introduction of graphical user interfaces (GUI) and two-dimensional (2D ) displays, the concept of space has entered the information technology (IT) domain. Interactions with computers were re-encoded in terms of fidelity to the interactions with real environment and consequently in terms of fitness to cognitive and spatial abilities. A further step in this direction was the creation of three-dimensional (3D) displays which have amplified the fidelity of digital representations. However, there are no systematic results evaluating the extent to which 3D displays better support cognitive spatial abilities. The aim of this research is to empirically investigate spatial memory performance across different instances of 2D and 3D displays. Two experiments were performed. The displays used in the experimental situation represented hierarchical information structures. The results of the test show that the 3D display does improve performances in the designed spatial memory task.
Inversion of a Recursive Tree Traversal
Authors: Jan L. A. Van de Snepscheut
Venue:  (1991)

A recursive algorithm for generating the prefix and infix traversaCls of a binary tree is inverted to obtain an algorithm for constructing the tree from its traversals.
On Some Most Probable Separations of Complexity Classes
Authors: Jin Cai
Venue:  (1986)

This thesis is a study of separations of some complexity classes which take place in almost all relativized worlds. We achieve probability one separations of PSPACE from the Polynomial-time Hierarchy PH. Also we separate with probability one all levels of the Boolean Hierarchy BH. The study on the Boolean Hierarchy is a continuation of the work by Bennet and Gill in [BG81] and the joint work in [CH86], where we introduced the ``sawing'''' argument. This ``sawing'''' technique is adapted here to yield probability one separation. The study on PSPACE versus the Polynomial-time Hierarchy is more intriguing. Several novel techniques are employed here. The connection with Boolean circuit is exploited to reduce the problem to a Boolean circuit computation problem. The fixed depth unbounded fan-in Boolean circuit model is considered in connection with the parity function. We show that with an exponential bound of the form $exp(n^{\lambda}$ on the size of the circuits, they make asymptomatically 50% error on all possible inputs, uniformly. Certain probabilistic and game theoretic methods are applied extensively to conclude the result.
Virtual Pockets
Authors: Juha Lehikoinen
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

We present a new way to store and activate applications and documents in a wearable computer. The metaphor behind this idea is a conventional pocket. In real life, we use pockets to store different objects we carry around with us. Virtual Pockets metaphor behaves exactly like its real-world counterpart, allowing us to carry virtual objects in our clothes, to take them out when needed, and to put them back after usage. Virtual Pockets is a natural and intuitive metaphor that supports the context and using environment of a wearable computer.
On The Schur Decomposition of a Matrix for Parallel Computation
Authors: Patricia J. Eberlein
Venue:  (1985)

An algorithm to solve the eigenproblem for non-symmetric matrices on an $N \times N$ array of mesh connected processors, isomorphic to the architecture described by Brent and Luk for symmetric matrices, is presented. This algorithm is a generalization of the classical Jacobi method, which holds promise for parallel architectures. The rotational parameters for the non-symmetric case are carefully analyzed; many examples of a working program, simulating the parallel architecture, are given.
Fusebox: Developing ColdFusion Applications
Authors: Jeffrey Peters, Nat Papovich, Hal Helms
Venue:  (2002)

:Developers face a constant struggle to launch projects on time and under budget, especially without pulling all-nighters. Fusebox helps ensure successful projects by providing a framework that serves as a base for applications. It's a standard process that makes projects more manageable and simplifies maintenance and requests for change during development. With this book, you'll learn to make ColdFusion applications reliably successful by following a standardized system. In addition, relying on the Fusebox framework to help plan and organize your ColdFusion code will allow you to write increasingly complex and specialized applications.Jeff Peters and Nat Papovich, both members of the Fusebox Council, share their extensive experience in this book. They'll teach you to use Fusebox with your ColdFusion applications and develop a set of best practices for managing web projects. Read this book if you want to eliminate frustrations and roadblocks in your projects, such as unmanageable complexity, wasteful redundancy of effort, time-consuming code maintenance, and slow development speed.
Implementing the Multicast Inter-ORB Protocol
Authors: Alysson Neves Bessani, Joni da Silva Fraga, Lau Cheuk Lung
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

This paper presents our experiments for integrating OMG MIOP (Multicast Inter-ORB Protocol)specifications into a CORBA ORB. We proposed an integration model which allows the coexistence of two different protocol stacks (IIOP/TCP/IP and MIOP/UDP/IP multicast), making possible a large spectrum of middleware support for distributed objects communication. That integration model is discussed in this paper, giving evidence of the compatibility of ourapproach with the CORBA specifications. We also do some considerations about the implementation of this model in a CORBA compliant ORB.
Fluid queues with long-tailed activity period distributions
Authors: Onno J. Boxma, Vincent Dumas
Venue:  (1997)

This is a survey paper on fluid queues, with a strong emphasis on recent attempts to represent phenomena like long-range dependence. The central model of the paper is a fluid queueing system fed by $N$ independent sources that alternate between silence and activity periods. The distribution of the activity periods of at least one source is assumed to be long-tailed, which may give rise to long-range dependence. We consider the effect of this tail behaviour on the steady-state distributions of the buffer content at embedded points in time and at arbitrary time, and on the busy period distribution. Both exact results and bounds are discussed.
On weighted possibilistic mean and variance of fuzzy numbers
Authors: Robert Fullér, Péter Majlender
Venue: Fuzzy Sets and Systems (2003)

Dubois and Prade defined an interval-valued expectation of fuzzy numbers, viewing them as consonant random sets. Carlsson and Fullér defined an interval-valued mean value of fuzzy numbers, viewing them as possibility distributions. In this paper, we shall introduce the notation of weighted interval-valued possibilistic mean value of fuzzy numbers and investigate its relationship to the interval-valued probabilistic mean. We shall also introduce the notations of crisp weighted possibilistic mean value, variance and covariance of fuzzy numbers, which are consistent with the extension principle. Furthermore, we show that the weighted variance of linear combination of fuzzy numbers can be computed in a similar manner as in probability theory.
Vector potential formulation for Magnetostatics and modeling of permanent magnets
Authors: Paolo Fernandes, Ilaria Perugia
Venue:  (1999)

A very general magnetostatic problem, involving inhomogeneous anisotropic materials filling irregular regions and with mixed boundary conditions is formulated in terms of magnetic vector potential. Some restrictions inherent to the introduction of a vector potential become apparent and additional conditions for the uniqueness of the vector potential naturally arise. The modeling of permanent magnets is introduced in both the vector potential and the field formulations by weakening the regularity requirements on the source term. The vector potential formulation is also shown to be equivalent to a penalized formulation widely used in numerical applications. TEL:: +39.0382.505655 KEYWORDS:: Magnetostatics,vector potential,existence and uniqueness,inhomogeneous and anisotropic materials,permanent magnets EMAIL:: perugia@dimat.unipv.it
The Russell Semantics: An Exercise in Abstract Data Types
Authors: Alan J. Demers, James E. Donahue
Venue:  (1980)

NO SUPPLIED
Wavelet transform in similarity paradigm I
Authors: Zbigniew R. Struzik, Arno P.J.M. Siebes
Venue:  (1998)

Searching for similarity in time series finds still broader applications in data mining. However, due to the very broad spectrum of data involved, there is no possibility of defining one single notion of similarity suitable to serve all applications.
Efficient Calculation of Fixed-Polarity Polynomial Expressions for Multiple-Valued Logic Functions
Authors: Dragan Jankovic, Radomir S. Stankovic
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

This paper presents a tabular technique for calculation offixed-polarity polynomial expressions for MV functions. The technique isderived from a generalization of the corresponding methods for Fixed-PolarityReed-Muller (FPRM) expressions for switching functions. All usefulfeatures of tabular techniques for FPRMs, as for example,simplicity of involved operations and high possibilities forparallelization of the calculation procedure, are preserved. Themethod can be extended to the calculation of coefficients inKronecker expressions for MV functions.
A Sensate Liner for Personnel Monitoring Applications
Authors: Eric J. Lind, Sundaresan Jayaraman, Sungmee Park, Rangaswamy Rajamanickam, Robert Eisler, George Burghart, Tony McKee
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

This program develops and demonstrates technologies useful for implementing a manageable cost effective systems approach to monitoring the medical condition of personnel by way of an instrumented uniform hereafter referred to as a Sensate Liner (SL). The SL consists of a form fitting garment which contains and interconnects sensing elements and devices to an electronics pack containing a processor and transmitter. The SL prototype requires fiber, textile, garment and sensor development. The SL textile consists of a mesh of electrically and optically conductive fibers integrated into the normal structure (woven or knitted) of fibers and yarns selected for comfort and durability. A suite of SL garment compatible embedded biological and physical sensors are then integrated into the SL. The initial SL sensor suite is selected to improve triage for combat casualties. Additional SL sensor concepts for medical monitoring will be discussed .
Towards practical reasoning agents for the semantic web
Authors: Ian Dickinson, Michael Wooldridge
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We describe Nuin: a flexible agent architecture designed for practical development of agents in Semantic Web applications, based around belief-desire-intention (BDI) principles. We outline the central design features of the platform, and show how the implementation is designed to give maximum flexibility to agent designers, while retaining the overall coherence of the design.
A Winning Strategy for the Ramsey Graph Game
Authors: A. Pekec
Venue:  (1995)

We consider a "Maker-Breaker" version of the Ramsey Graph Game, RG(n), and present a winning strategy for maker requiring less than n(2^n) moves. This is the fastest winning strategy known so far. We also demonstrate how the ideas presented can be used to develop winning strategies for some related combinatorial games. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Blocking Java Applets at the Firewall
Authors: David M. Martin, Sivaramakrishnan Rajagopalan, Aviel D. Rubin
Venue:  (1996)

Abstract This paper explores the problem of protecting a site on the Internet against hostile external Java applets while allowing trusted internal applets to run. With careful implementation, a site can be made resistant to current Java security weaknesses as well as those yet to be discovered. In addition, we describe a new attack on certain sophisticated firewalls that is most effectively realized as a Java applet.
Quantifying and evaluating the space overhead for alternative C++ memory layouts
Authors: Peter F. Sweeney, Michael Burke
Venue: Software&mdash;Practice Experience (2003)

This paper develops a formalism that precisely characterizes when class tables are required for C++ memory layouts. A memory layout is a particular choice of data structures for implementing run-time support for object-oriented languages. We use this formalism to quantify and evaluate, on a set of benchmarks, the space overhead for a set of C++ memory layouts. In particular, this paper studies the space overhead due to three language features: virtual dispatch, virtual inheritance, and dynamic typing. To date, there has been no scientific quantification or evaluation of C++ memory layouts. Our approach can help C++ implementors. This work has already influenced the memory layout design choices in IBM's Visual Age C++ V5 compiler.Applying our approach to a set of five benchmarks, we demonstrate that the impact of object-oriented space overhead can vary dramatically between applications (ranging from 0.42% to 99.79% for our benchmarks). In particular, applications whose object space is dominated by instances of classes that heavily use object-oriented language features will be significantly impacted by the choice of a memory layout.
Advanced database functions for distance education system: VIEW Classroom
Authors: O. Kagawa, Y. Kambayashi
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

We have been developing an important application of distributed systems: a distance education system called VIEW Classroom. Conventional distance education systems use video images of teachers and selected students when required. From its initial stages, this system has taken a non-video base (although video function can be utilized) and tried to use database technology extensively in order to assist the whole range of teaching and learning activities. Typical features of VIEW Classroom are presented. (1) Asynchronous interaction support: many conventional education systems are based on synchronous interaction, though asynchronous interaction can be also realized by object oriented database functions. (2) Database views: teacher and student can see different teaching materials if required. (3) Question-answer database: in order to answer questions issued by students, previously asked questions are stored together with corresponding answers in question-answer databases for such a purpose. (4) Database to analyze student achievement: we store abstracted information of student actions during the lecture, which can be used to improve the teaching material. The database can be regarded as a kind of temporal database which also stores past achievement data on each student. Extensive use of such database technology is a promising way for next generation distance education systems.
Associatively tied implications
Authors: A. A. Abdel-Hamid, Nehad N. Morsi
Venue: Fuzzy Sets and Systems (2003)

We say that an implication operator A, on a complete lattice L, is "associatively tied" if there is a binary operation T on L that "ties" A; that is, the identity A(α,A(β,gamma;))=A(T(α,β),γ) holds for all α, β, γ in L. This property extends to multiple-valued logic the following equivalence in classical logic: (X ⇒ (Y ⇒ Z)) ≡ ((X & Y) ⇒ Z). We show that in this case there exists an associative binary operation TA that ties A; hence, the nomenclature. We study properties of that TA when A is associatively tied. We then seek a characterization for the validity of associative tiedness for an implication A, phrased in terms of A and two "adjoints" of it.
About reuse in multi-paradigm process modelling approach
Authors: J. Estublier, S. Dami
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Process model reuse has become a hot topic in the process community. As far as we are concerned, reuse has found its origin within the practical framework of software quality improvement we are involved in as participants of the PERFECT project. The objective of this project is to define a conceptual approach (PERFECT Improvement Approach), in which process improvement is justified as a means towards product improvement, and is implemented through the concepts of goal-oriented measurement, learning, packaging of explicit experience and reuse. Reuse is therefore a main concern that must be made explicit and well formalized for all of the process aspects, i.e., product, activity, role and measurement aspects. While reuse of product, role and measurement models did not cause us much trouble (owing to the object-orientation of their representation), reusing activities has been rather problematic. The work reported in this paper emphasizes the main issues we encountered in our experience facing the problem of process reuse. Our experience has been acquired through the design, implementation and evaluation of two major versions of the APEL tool; a textual and graphical language for describing and enacting process models.
Localizing a Robot with Minimum Travel
Authors: G. Rudek, K. Romanik, S. Whitesides
Venue:  (1995)

We consider the problem of localizing a robot in a known environment modeled by a simple polygon P. We assume that the robot has a map of P but is placed at an unknown location inside P. From its initial location, the robot sees a set of points called the visibility polygon V of its location. In general, sensing at a single point will not suffice to uniquely localize the robot, since the set H of points in P with visibility polygon V may have more than one element. Hence, the robot must move around and use range sensing and a compass to determine its position (i.e. localize itself). We seek a strategy that minimizes the distance the robot travels to determine its exact location. We show that the problem of localizing a robot with minimum travel is NP-hard. We then give a polynomial time approximation scheme that causes the robot to travel a distance of at most (k-1)d, where k = |H| and d is the length of a minumum length tour that would allow the robot to verify its true initial location by sensing. We also show that this bound is the best possible.
Towards a Compositional Approach to the Design and Verification of Distributed Systems
Authors: Michel Charpentier, K. M Chandy
Venue:  (1999)

We are investigating a component-based approach for formal design of distributed systems. In this paper, we introduce the framework we use for specification, composition and communication and we apply it to an example that highlights the different aspects of a compositional design, including top-down and bottom-up phases, proofs of composition, refinement proofs, proofs of program texts, and component reuse.
Using type-extension to organize virtual-memory mechanisms
Authors: P. A. Janson
Venue: ACM SIGOPS Operating Systems Review (1981)

Much effort is currently being devoted to producing computer systems that are easy to understand, to verify and to develop. The general methodology for designing such a system consists of decomposing it into a structured set of modules so that the modules can be understood, verified and developed individually, and so that the understanding/verification of the system can be derived from the understanding/verification of its modules. While many of the mechanisms in a computer system have been decomposed successfully into a structured set of modules, no technique has been proposed to organize the virtual memory mechanism of a system in such a way.The present paper proposes using type extension for that purpose. The virtaul memory mechanism consists of a set of type manager modules implementing abstract information containers. The structure of the mechanism reflects the structure of the containers that are implemented. While using type extension to organize a virtual memory mechanism is conceptually simple, it is hard to achieve in practice. All existing or proposed uses of type extension assume the existence of information containers that are uniformly accessible, can always be grown and are protected. Using type extension inside a virtual memory mechanism raises implementation problems since such containers are not implemented. Their implementation is precisely the objective of the virtual memory mechanism. In addition to explaining how type extension can be supported inside a virtual memory mechanism, the paper briefly discusses some aspects of its application to the reorganization of the kernal of a commercial, general-purpose, time-sharing system. It concludes by presenting some results of that case study concerning the organization of operating systems.