ppxscal/embedding_network huggingface dataset:
Action-Tracking in DIVE
Authors: Charles G Brown, Annika W?rn
Venue:  (1994)

Several approaches to intelligent tutoring monitor the learners actions in order to understand his/her abilities. This requires that the learner''s actions can be monitored. In traditional single-user command interfaces this is straightforward. As a result action tracking has not been subject to much study. However, in more advanced interfaces and applications, it is no longer self-evident how action tracking should be done, or even what should be considered an action. This paper addresses two particular aspects of systems of today that make action tracking hard: The increasing naturalness of interfaces, and the introduction of environments for human collaboration. The DIVE environment is extremely advanced in both these aspects, being a virtual reality environment for unconstrained human collaboration. We characterize the possibilities and limitations for action tracking in DIVE, and suggest an architecture for the task.
Empirical Study of a Stacking State-space
Authors: Agapito Ledezma, Ricardo Aler, Daniel Borrajo
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Nowadays, there is no doubt that machine learning techniques can be successfully applied to data mining tasks. Currently, the combination of several classifiers is one of the most active fields within inductive machine learning. Examples of such techniques are boosting, bagging and stacking. From these three techniques, stacking is perhaps the less used one. One of the main reasons for this relates to the difficulty to define and parameterize its components: selecting which combination of base classifiers to use, and which classifier to use as the meta-classifier. One could use for that purpose simple search methods (e.g. hill climbing), or more complex ones (e.g. genetic algorithms). But before search is attempted, it is important to know the properties of the search space itself. In this paper we study exhaustively the space of Stacking systems that can be built by using four base learning systems: C4.5, IB1, Naive Bayes, and PART. The results that have been obtained in this paper will be useful for designing new Stacking-based algorithms and tools.
An Adaptive Transport Protocol for Multimedia Communication
Authors: Dane Dwyer, Sungwon Ha, Jia-Ru Li, Vaduvur Bharghavan
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

In this paper, we propose a novel approach for effectively supporting multimedia packet flows in an Internet environment. The following are the key contributions of this paper: (a) we propose a new transport protocol called HPF that supports multiple interleaved reliable and unreliable data sub-streams, (b) we decouple the congestion control and reliability mechanisms that are integrated in TCP -- this allows us to provide congestion control for unreliable streams as well as reliable streams, and (c) we use priorities within sub-streams of a packet flow as application-defined hints for the link level scheduler to drop packets during congestion.We show through performance measurements in our experimental testbed that our approach can provide effective support for heterogeneous packet flows in the presence of dynamic networking resources.
Refining the Submesh Strategy in the Two-level Finite Element Method: Application to the Advection-Diffusion Equation
Authors: Leopoldo P. Franca, Feng Hwang
Venue:  (2000)

We introduce a new submesh strategy for the two-level finite element method (TLFEM). The numerical results show that the new submesh is able to better capture the boundary layer which is caused by the choice of bubble functions. The effect of an improved approximation of the residual free bubbles is studied for the advective-diffusive equation.
Nearest neighbor estimation of the intensity function of a cyclic Poisson process
Authors: I. W. Mangku
Venue:  (1999)

We consider the problem of estimating the intensity function of a cyclic Poisson point process. We suppose that only a single realization of the cyclic Poisson point process is observed within a bounded ''window'', and our aim is to estimate consistently the intensity function at a given point. A nearest neighbor estimator of the intensity function is proposed, and we show that our estimator is weakly and strongly consistent, as the window expands.
JPP: A Java Pre-Processor
Authors: Joseph R. Kiniry, Elaine Cheong
Venue:  (1998)

The Java Pre-Processor, or JPP for short, is a parsing pre-processor for the Java programming language. Unlike its namesake (the C/C++ Pre-Processor, cpp), JPP provides functionality above and beyond simple textual substitution. JPP''s capabilities include code beautification, code standard conformance checking, class and interface specification and testing, and documentation generation.
Structural Testing of Web Applications
Authors: Chien-Hung Liu, David C. Kung, Pei Hsia, Chih-Tung Hsu
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

In recent years, Web applications have become prevalent around the world. Many companies have developed or integrated their mission-critical applications using Web technologies. As Web applications become more complex, testing Web applications becomes crucial. In this paper, we extend data flow-testing techniques to Web applications. Several data flow issues for analyzing HTML and eXtensible Markup Language (XML) documents in Web applications are discussed. An approach to supporting data flow testing foe Web applications is presented. In our approach, the structural test artifacts of a Web application are captured in a Web Application Test Model (WATM) where each component of the Web application is treated as an object. The elements of an HTML or XML document are considered as structured variables within an object. Data flow test cases for Web applications are derived from flow graphs in five levels according to the types of definition-use chains for the variables of interest.
On the Use of Clustered File Organization in Information Search and Retrieval
Authors: Gerard Salton, Jose E. Araya
Venue:  (1989)

In modern retrieval environments, collection searches are normally conducted on-line under user control. Iterative collection searches can then be performed where tentative queries are initially processed, to be successively improved and refined during the search process. When searches are carried out directly by the users, classified document organizations are especially useful, because collection browsing becomes possible, and access is provided to complete groups of related documents. The state-of-the-art in automatic document classification is summarized in the present study, and evaluation data are provided to demonstrate the effectiveness and efficiency of clustered file search operations.
A Probabilistic Approach to Text Understanding
Authors: Robert P. Goldman, Eugene Charniak
Venue:  (1990)

We discuss a new framework for text understanding. Three major design decisions characterize this approach. First, we take the problem of text understanding to be a particular case of the general problem of abductive inference: reasoning from effects to causes. Second, we use probability theory to handle the uncertainty that arises in abductive inference in general and natural language understanding in particular. Finally, we treat all aspects of the text-understanding problem in a unified way. All aspects of natural language processing are treated in the same framework, allowing us to integrate syntactic, semantic and pragmatic constraints. In order to apply probability theory to this problem, we have developed a probabilistic model of text understanding. To make it practical to use this model, we have devised a way of incrementally constructing and evaluating belief networks that is applicable to other abduction problems. We have written a program, Wimp3, to experiment with this framework.
A Note on the Complexity of Goedel Numberings and Isomorphisms
Authors: Jim Kadin
Venue:  (1981)

Some problems involved in looking at recursive function theory and thinking about the complexity of computations are discussed. Complexity classes of Goedel numberings are studied where a Goedel numbering is in a given complexity class if every other Goedel numbering can be translated into it by functions ina given complexity class. In particular, we look at the class of numberings that can be trnslated into by polynomial time mappings (GNP) and the class that can be translated into by linear bounded automation mappings (GNLBA). It is shown that polynomial time isomorphisms and LBA computable isomorphisms between two Goedel numberings relate the complexity of the syntax of the numberings. Since the classes GNP and GNLBA contain Goedel numberings with arbitrarily hard syntax, not all members of these classes are isomorphic by polynomial time or LBA mappings. LBA computable isomorphisms can be found between members of GNLBA whose syntax is LBA recognizable. A similar result holds for polynomial time isomorphisms and GNP if P=NP. 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
Interoperable Databases: A Programming Language Approach
Authors: Olivier Jautzy
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Even though federated multidatabase systems solve most of the issues in integrating heterogeneous data sources, they do not solve what we call data access heterogeneity: i.e. they do not allow users to structure and manage in the same way persistent, volatile and distributed data with the tools that match their needs. To solve this problem, we propose to add generic MDBS management facilities into a general purpose object oriented programming language.This extension is mainly based on new transactional and view approaches and the resulting system can be completely customized in order to match the needs of its users. An implementation of this system for Java, named JavaViews, currently allows to integrate ODBC as well as Versant or Poet databases. 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
Self-Checking FSM Design with Observing only FSM Outputs
Authors: A. Matrosova, S. Ostanin
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

We deal with the problem of a self-checking FSM design with observing only FSM outputs. We suggest a special PLA description of the FSM behavior that is well suited for a practice. It is established that a factorized multilevel synthesis method applied to this PLA description and followed by the gate implementation provides observing only FSM outputs. We assume that a set of faults considered does not demand introducing additional FSM input lines. We also propose a mathematical tool that makes possible for any synthesis method applied to this special PLA description to clarify a possibility of observing only FSM outputs.
Global solution to a viscous Cahn-Hilliard equation for tin-lead alloys with mechanical stresses
Authors: Elena Bonetti, Wolfgang Dreyer, Giulio Schimperna
Venue:  (2001)

We address a viscous Cahn-Hilliard equation describing the phase separation process in a binary alloy. Such a material is subject to the influence of internal and external mechanical stresses, whose contribution is assumed to be known. The physical modelling refers to a recent work by Dreyer and Muller. The main features and difficulties of this model are given by a nonlinear fourth order elliptic term which is not in divergence form, a strong constraint imposed by the presence of a double obstacle energy potential, and the dependence of the mobility matrix on the concentration variable (i.e., the unknown of the problem). We are able to prove global existence of solutions of the corresponding initial boundary value problem by using approximation and compactness tools. Hence, we perform some asymptotic analysis of the problem and obtain, at the limit, two models of independent physical interest.
Components for operating system design
Authors: A. Messer, T. Wilkinson
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Components are being increasingly used in the construction of complex application software. Operating systems suffer from similar software complexities, causing a move to architectures such as micro-kernels. The authors propose a low-overhead technique for providing components that allow the level of coupling between components to be varied at run-time. In doing so, they indicate their use in a component-orientated operating system to allow its components to be 'hot-plugged' during execution.
A Reconvergence-Based Circuit Partitioning Technique for Combinational and Sequential Logic Synthesis
Authors: Sujit Dey
Venue:  (1991)

\indent Over the last decade, the field of combinational logic synthesis has matured considerably. However, the importance of fast and efficient logic synthesis of very large circuits has emerged recently. Today, more designs are being specified at higher levels of abstraction. In order to be useful, high-level synthesis should be able to synthesize very large systems. High-level synthesis of large systems can result in large unoptimized circuits, which cannot always be efficiently optimized by current logic optimization techniques, with acceptable CPU time or memory requirements. The goal of this thesis is to make the optimization of large circuits feasible and efficient, using partitioning in a divide-and-conquer paradigm. The objective of the partitioning strategy is to ensure that the optimization quality is not compromised while significantly reducing CPU time. A new technique to partition circuit graphs, based on an analysis of signal reconvergence is introduced. The circuit is partitioned into corollas, which are disjoint sets of overlapping reconvergent regions. The notion of resynthesis potential is used to guide the partitioning process to select partitions that resynthesize with most gain. The role of ``don''t cares'''' to minimize the corollas is analyzed. Resynthesis of large benchmark circuits using the corollas consistently reduces transistor pairs and layout area while improving delay and testability. When compared to other logic optimization methods, the partitioning a resynthesis technique reduces the running time of the optimization process by several orders of magnitude, while maintaining the optimization quality. Compiling a typical high level design specification produces a sequential circuit, consisting of combinational logic blocks separated by latches. Combinational logic optimization techniques, including the partitioning and resynthesis technique, can be applied to the combinational blocks individually. However, logical relationships between several combinational blocks remain unexploited. The emerging field of sequential circuit optimization considers both combinational and sequential elements of the circuit, and is therefore not restricted by the partition boundaries imposed by the hierarchy at the highest level of abstraction. A sequential optimization technique which has proved to be successful for acyclic sequential circuits is the retiming and resynthesis approach. The second part of the thesis addresses the problem of partitioning sequential circuits for logic optimization. The aim is to make the retiming and resynthesis technique viable for the general class of sequential circuits with feedbacks. The concepts of signal reconvergence and corolla partitioning are extended from combinational circuits to general sequential circuits. The sequential circuit is partitioned into consistent corollas across latch boundaries. The consistent corollas are such that the latches can be moved to the peripheries, and the corolla ca
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
Authors: James A. Davis, Andrew H. Fagg, Brian N. Levine
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

The decreasing size and cost of wearable computers and mobile sensors is presenting new challenges and opportunities for deploying networks. Existing network routing protocols provide reliable communication between nodes and allow for mobility and even ad-hoc deployment. They rely, however, on the assumption of a dense scattering of nodes and end-to-end connectivity in the network. In this paper, we address routing support for ad-hoc, wireless networks under conditions of sporadic connectivity and ever-present network partitions. This work proposes a general framework of agent movement and communication in which mobile computers physically carry packets across network partitions. We then propose algorithms that exploit the relative position of stationary devices and non-randomness in the movement of mobile agents in the network. The learned structure of the network is used to inform an adaptive routing strategy. With a simulation, we evaluate these algorithms and their ability to route packets efficiently through a highly-partitioned network.
Interfacing Java with the Virtual Interface Architecture
Authors: Chi Chang, Thorsten von Eicken
Venue:  (1999)

User-level network interfaces (UNIs) have reduced the overheads of communication by exposing the buffers used by the network interface DMA engine to the applications. This removes the kernel from the critical path of message transmission and reception, and it reduces the number of data copies performed on that path. Unfortunately, the fact that UNIs require the application to manage buffers explicitly makes it difficult to provide direct access to a UNI from Java, as the language explicitly prevents programs from controlling the location or layout of objects. This paper describes Javia, a Java interface to the Virtual Interface Architecture (VIA), an emerging UNI standard in the industry. Javia implements a special buffer abstraction that allows Java programs to allocate arrays in pinned memory and use them as communication buffers without copy. The location and lifetime of these arrays are controlled through small modifications to the garbage collector. Simple experiments show that Java programs can achieve round-trip times of 21us for small messages and bandwidths of 95Mbytes/sec for 4Kbyte messages.
An Efficient Algorithm for Processing Distributed Queries Using Partition Dependency
Authors: Hao Chen, Chengwen Liu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

We present an efficient algorithm for processing distributed queries with the existence of partition dependency. For a given query, the algorithm first partitions the referenced relations into a number of non-exclusive subsets such that the join operation(s) associated with the relations in the subset can be locally processed without data transfer. Each subset is associated with a set of processing sites and can be used to generate an execution plan for the given query. Then, the algorithm determines a set of referenced fragmented relations not in the subset such that only the fragments instead of the whole relation need to be replicated at the processing sites. The other referenced relations are duplicated at each of the processing sites. Among the alternatives, the algorithm picks the plan that gives the minimum response time for the query. The experimental results show that our algorithm improves the performance of distributed query processing significantly.
Formal Foundations of Object-Oriented Modeling Notations
Authors: Claudia Pons, Gabriel Baum
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

In the paper we describe and classify the different solutions that have been proposed to realize the integration of graphic modeling languages, known and accepted by the software developers, with formal modeling languages having analysis and verification tools. Inspired from that classification we define a new integration proposal, based on first-order dynamic logic. The principal benefits of the proposed formalization can be summarized as follows: - The different views on a system are integrated in a single formal model; this allows us to define rules of compatibility between the separate views, on syntactical and semantic level. -Using formal manipulation, it is possible to deduce further knowledge from the specification. -The faults of specifications expressed using a user-friendly notation can be revealed using analysis and verification techniques based on the formal kernel model.The principal difference between this model and other object-oriented formal models is that it integrates both of the levels in the architecture of modeling notations into a single conceptual framework. The integration of modeling entities and modeled entities into a single formalism allows us to express both static aspects and dynamic aspects of either the model or the modeled system within a first-order formalism.
A language for modeling agents' decision making processes in games
Authors: Ya'akov Gal, Avi Pfeffer
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Multi-agent systems that use game-theoretic analysis for decision making traditionally take a normative approach, in which agents' decisions are derived rationally from the game description. This approach is insufficient to capture the decision making processes of real-life agents. Such agents may be partially irrational, they may use models other than the real world to make decisions, and they may be uncertain about their opponents' decision making processes. We present Networks of Influence Diagrams (NIDs), a language for descriptive decision and game theory that is based on graphical models. NIDs provide a framework for computing optimal decisions for agents that operate in an environment characterized by uncertainty, not only over states of knowledge but also over game mechanics and others' decision processes. NIDs allow the modeling of situations in which an agent has an incorrect model of the way the world works, or in which a modeler has uncertainty about the agent's model. One can also recursively model agents' uncertain beliefs about other agents' decision making models. We present an algorithm that computes the actions of agents under the assumption that they are rational with respect to their own model, but not necessarily with respect to the real world. Applications of our language include determining the cost to an agent of using an incorrect model, opponent modeling in games, and modeling bounded rationality.
Teaching an old course new tricks: a portable courseware language based on xml
Authors: Lutz Wegner
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Producing eLearning material remains a costly and challenging task. Reflecting on a course written 20 years ago and still in use today, the author tries to identify the essentials for successful computer-supported teaching material. One apparent need is to make the contents more portable. In particular, the Web is seen as the universal distribution and presentation channel. To allow for interaction, animation, vector graphics and display independence, a Portable CourseWare Language (PCWL) is proposed. PCWL is based on XML, SVG and Java. An editor for PCWL is provided. The paper leads from past to future with screenshots from Teletext to IE5 with SVG plug-in.