ppxscal/embedding_network huggingface dataset:
Tight upper bounds on the number of candidate patterns
Authors: Floris Geerts, Bart Goethals, Jan Van Den Bussche
Venue: ACM Transactions on Database Systems (TODS) (2005)

In the context of mining for frequent patterns using the standard levelwise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing tight upper bounds, derived from a combinatorial result from the sixties by Kruskal and Katona. Our result is useful to secure existing algorithms from a combinatorial explosion of the number of candidate patterns.
Conversational language comprehension: UCLA
Authors: Roger Parkison
Venue: Issue 79 (January 1982) (1982)

The following paragraphs are excerpts from the Introduction to my dissertation (Parkison, 1980):"This thesis describes a program which permits a person to communicate with a computer in ordinary, unrestricted English. This program has been in use for several years as one component of a computer model of paranoia known as PARRY (Colby, 1975). As part of a study of paranoid thought processes, psychiatrists are invited to interrview and diagnose the computer model via teletype as if it were a human patient."
Web-based collaboration in flexible engineering education
Authors: Anh-Vu Nguyen, Denis Gillet
Venue: ACM SIGGROUP Bulletin (2003)

This paper presents an innovative approach to sustain collaborative hands-on activities in flexible engineering education. The paper presents our research context, our objectives as well as some preliminary results. The main issues addressed include (i) object-oriented model for collaboration in Web-based learning environment for engineering education (ii) continuity of interaction in flexible engineering education (iii) awareness in Web-based learning environment, and (iv) evaluation methods and metrics. This doctoral research work is currently performed at the School of Engineering, EPFL.
A Model of Adaptation in Collaborative Multi-Agent Systems
Authors: Kristina Lerman
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

Adaptation is an essential requirement for autonomous agent systems functioning in uncertain dynamic environments. Adaptation allows agents to change their behavior in order to improve the overall sys tem performance. We describe a general mechanism for adaptation in multi-agent systems in which agents modify their behavior in response to changes in the environment or actions of other agents. The agents estimate the global state of the system from local observations and adjust their actions accordingly. We derive a mathematical model that describes the collective behavior of such adaptive systems. The model, consisting of coupled rate equations, governs how the collective behavior changes in time. We apply the model to study collaboration in a group of mobile robots. The system we study is an adaptive version of the collaborative stick pulling in a group of robots examined in detail in earlier works (Ijspeert, Martinoli, Billard, & Gambardela, 2001; Lerman, Galstyan, Martinoli, & Ijspeert, 2001). In adaptive stick pulling, robots estimate the number of robots and sticks in the system and adjust their individual behavior so as to improve collective performance. We solve the mathematical model and show that adaptation improves collective performance for all parameter values.
Providing Controlled Quality Assurance for Streaming Stored-Videos Across the Internet Using VPNs
Authors: Yingfei Dong, Zhi-Li Zhang
Venue: Multimedia Tools and Applications (2005)

Video Streaming across wide-area networks is one of the most important applications on the Internet. In this paper we focus on the quality assurance issue on best-effort networks and propose a practical technique, named staggered two-flow video streaming. We deliver a stored video through two separate flows in a staggered fashion via a VPN pipe from a central server to a proxy server. One flow containing the essential portion of the video is delivered using a novel controlled TCP (cTCP), and the other flow containing the enhanced portion of the video is transmitted using a rate-controlled RTP/UDP (rUDP). To provide video-quality assurance in such a system, we design several application-aware flow-control and adaptation approaches to control bandwidth sharing and interactions among flows by exploiting the inherent priority structure in videos, the storage space on proxy servers and the coarse-grain bandwidth assurance of VPN. Our experiments using FreeBSD and simulations on NS2 both have demonstrated the efficacy of the proposed technique in protecting essential data and significantly reducing the numbers of packets retransmitted/lost in transmission and the sizes of video prefixes required on proxy servers. In summary, our application-aware approach provides stable and predictable performance in streaming videos across wide-area best-effort networks. In addition, another salient feature of our approach is that it requires no changes on the client-receiving side and minimal changes on the server-sending side.
Studies on Throttle Sticks in High Speed Crafts " Haptics in Mechanical, Electronic and Haptic Feedback Interfaces
Authors: Hans V. Bjelland, Bjarte Knappen Roed, Thomas Hoff
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The haptic properties of the throttle sticks in the Hauk-class Fast Patrol Boat of the Norwegian Navy have been changed due to digitalization and automation of the engine control. This is an example of how haptic qualities in general are lost in the transition from mechanical to electronic interface controls. Haptic feedback is a potential way of returning the sense of touch to the interface. In order to design meaningful haptic feedback we need to understand the role haptics take when people interact with technology. This article discusses the possibilities of haptic feedback in applications such as high speed crafts through studying the effect of a change in throttle sticks on the naval ships.
On Design of Agent Home Scheme for Prefetching Strategy in DSM Systems
Authors: Ssu-Hsuan Lu, Chun-Chieh Yang, Hsiao-Hsi Wang, Kuan-Ching Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In distributed shared memory (DSM) systems, it is the common need to access data in remote nodes. Thus, it induces to remote access performance latencies, what is the major factor of overhead for DSM systems. Prefetching strategies can improve these phenomena by reducing latencies, but it adds workload to home nodes. It is proposed in this paper a method to reduce overhead of home nodes, by providing an agent home to share the workload of home nodes, by distributing these workloads to other nodes, when sending data. The performance evaluation of proposed strategy is done by performing three well-known benchmark programs: NPB/IS, 3DFFT and Red-Black SOR. The experimental results show that our proposed agent home method achieves 8% - 40% of speedup against original JIAJIA.
Closed reduction: explicit substitutions without $\alpha$-conversion
Authors: M. Fernández, I. Mackie, F.-R. Sinot
Venue: Mathematical Structures in Computer Science (2005)

Starting from the $\lambda$-calculus with names, we develop a family of calculi with explicit substitutions that overcome the usual syntactical problems of substitution. The key idea is that only closed substitutions can be moved through certain constructs. This gives a weak form of reduction, called closed reduction, which is rich enough to capture both the call-by-value and call-by-name evaluation strategies in the $\lambda$-calculus. Moreover, since substitutions can move through abstractions and reductions are allowed under abstractions (if certain conditions hold), closed reduction naturally provides an efficient notion of reduction with a high degree of sharing and low overheads. We present a family of abstract machines for closed reduction. Our benchmarks show that closed reduction performs better than all standard weak strategies, and its low overheads make it more efficient than optimal reduction in many cases.
Automated Variable Weighting in k-Means Type Clustering
Authors: Joshua Zhexue Huang, Michael K. Ng, Hongqiang Rong, Zichen Li
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

This paper proposes a k\hbox{-}{\rm{means}} type clustering algorithm that can automatically calculate variable weights. A new step is introduced to the k\hbox{-}{\rm{means}} clustering process to iteratively update variable weights based on the current partition of data and a formula for weight calculation is proposed. The convergency theorem of the new clustering process is given. The variable weights produced by the algorithm measure the importance of variables in clustering and can be used in variable selection in data mining applications where large and complex real data are often involved. Experimental results on both synthetic and real data have shown that the new algorithm outperformed the standard k\hbox{-}{\rm{means}} type algorithms in recovering clusters in data.
Secure key agreement protocols for three-party against guessing attacks
Authors: Hung-Min Sun, Bing-Chang Chen, Tzonelih Hwang
Venue: Journal of Systems and Software (2005)

Key exchange protocol is important for sending secret messages using the session key between two parties. In order to reach the objective, the premise is to generate a session key securely. Encryption key exchange was first proposed to generate a session key with a weak authenticated password against guessing attacks. Next, another authenticated key exchange protocols for three-party, two clients who request the session key and one server who authenticates the user's identity and assist in generating at session key, were proposed. In this paper, we focus on the three-party authenticated key exchange protocol. In addition to analyzing and improving a password-based atuthenticated key exchange protocol, a new verified-based protocol is also proposed.
Adaptive Simulation: Dynamic Data Driven Application in Geophysical Mass Flows
Authors: M. D. Jones, E. B. Pitman, A. K. Patra, K. Dalbey, A. C. Bauer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The ability to dynamically change data input to a computation is a key feature enabling simulation to be used in many applications. In this study, computation of geophysical mass flow is updated on the fly by changing terrain data. Accommodating such changes in a parallel environment entails new developments in parallel data management and gridding. Adaptivity, and in particular unrefinement, is critical for maintaining parallel efficiency. The application under study in this work is the result of a multidisciplinary collaboration between engineers, mathematicians, geologists, and hazard assessment personnel. In addition, adaptive gridding enables efficient use of computational resources, allowing for run-time determination of optimal computing resources. Combining these attributes allows run time conditions to inform calculations, which in turn provide up-to-date information to hazard management personnel.
Failure, connectivity and disconnection detectors
Authors: Lynda Temal, Denis Conan
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

In mobile environments, mobile terminals are subject to disconnections, for instance, when moving out of the range of a base station. In addition, users execute distributed applications that fail when a single crash occurs. These two extra-functionalities (disconnection management and fault tolerance) are supported by detection mechanisms (of connectivity and disconnection, and of failure). In this paper, we define the concepts of connectivity detector and disconnection detector, by comparison with unreliable failure detectors. These three types of detectors are then mixed for extending disconnection management and leveraging fault tolerance.
Stochastic analysis and performance evaluation of wireless schedulers: Research Articles
Authors: Raphael Rom, Hwee Pink Tan
Venue: Wireless Communications Mobile Computing (2004)

In the last few years, wireless scheduling algorithms have been proposed by supplementing wireline scheduling algorithms with a wireless adaptation scheme. However, Quality of Service (QoS) bounds have either been derived for flows that perceive error-free conditions or a static worst-case channel condition. Such an assumption of the channel condition is unrealistic, since channel errors are known to be bursty in nature. Hence, these bounds are inadequate to characterize the scheduler's QoS performance. Our research focuses on performing an extensive analysis of wireless scheduling in order to derive statistical QoS performance bounds under realistic channel conditions. In this paper, we develop stochastic models for various wireless schedulers. Based on these models, we define and evaluate statistical QoS performance metrics in terms of throughput, delay and fairness under various channel conditions and over different time scales. Numerical results indicate that no single scheduler outperforms the others in terms of all the QoS metrics under all channel conditions. The choice of an optimal scheduling mechanism depends on the priority of QoS requirements as well as the channel conditions. Copyright &copy; 2004 John Wiley & Sons, Ltd.
On the Application of ROC Analysis to Predict Classification Performance Under Varying Class Distributions
Authors: Geoffrey I. Webb, Kai Ming Ting
Venue: Machine Learning (2005)

We counsel caution in the application of ROC analysis for prediction of classifier performance under varying class distributions. We argue that it is not reasonable to expect ROC analysis to provide accurate prediction of model performance under varying distributions if the classes contain causally relevant subclasses whose frequencies may vary at different rates or if there are attributes upon which the classes are causally dependent.
Near-linear CMOS I/O driver with less sensitivity to process, voltage, and temperature variations
Authors: Gerald Esch, Tom Chen
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

Matching input/output (I/O) driver output resistance to transmission line impedance is critical for high-speed I/O operation in source series termination environments. Tuning driver output resistance can be accomplished through the use of calibration circuitry. Under ideal conditions, calibration circuitry can properly calibrate an I/O driver. Operating in an environment with die process, voltage, and temperature variations, that same calibration circuitry may perform improperly. This brief presents an I/O driver design that is less sensitive to process, voltage, and temperature variations. The proposed driver design provides a near linear or flat, output resistance response verses output voltage. Advantages of the proposed I/O driver architecture lie in applications where the output DC operating point may have a large variation, thus, reducing the error in matching output resistance.
Space-efficient construction variants of dynamic programming
Authors: Hans L. Bodlaender, Jan Arne Telle
Venue: Nordic Journal of Computing (2004)

Many dynamic programming algorithms that solve a decision problem can be modified to algorithms that solve the construction variant of the problem by additional bookkeeping and going backwards through stored answers to subproblems. It is also well known that for many dynamic programming algorithms, one can save memory space by throwing away tables of information that is no longer needed, thus reusing the memory. Somewhat surprisingly, the observation that these two modifications cannot be combined is frequently not made. In this paper we consider the case of dynamic programming algorithms on graphs of bounded treewidth. We give algorithms to solve the construction variants of such problems that use only twice the amount of memory space of the decision versions, with only a logarithmic factor increase in running time. Using the concept of strong directed treewidth we then discuss how these algorithms can be applied to dynamic programming in general.
Analysing preventative and detective control mechanisms in international trade using value modelling
Authors: Vera Kartseva, Jaap Gordijn, Yao-Hua Tan
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Exploration and development of e-business models takes a series of viewpoints. One important perspective is the value web perspective, which can be modelled using the e3value methodology. However this perspective supposes a perfectly honest world, an assumption which turns out to be not true in practice. As a consequence, it is important to explore fraudulent behaviour of actors in value web, preferably by using a lightweight and graphical approach similar to the e3value methodology. Using a real-life e-business scenario (Bill of Lading) we show that e3value, with some extensions, is capable of modelling a control perspective that captures mechanisms for preventive and detective controls. Additionally, we show that such controls themselves can be seen as a kind of commercial services.
Approximation of probability distribution functions by Coxian distribution to evaluate multimedia systems
Authors: Yukie Sasaki, Hiroei Imai, Masahiro Tsunoyama, Ikuo Ishii
Venue: Systems and Computers in Japan (2004)

It has been reported in several studies that the probability distribution functions for interarrival times of tasks in multimedia systems cannot be represented by traditional probability distribution functions, such as exponential ones.In this paper we propose an approximation method, based on the Coxian distribution function, to calculate the probability distribution functions used in analyzing multimedia systems. Although the Coxian function can represent arbitrary distribution functions, it is difficult to determine their parameters directly from a given distribution function. In this work, this drawback is remedied by first approximating the given distribution function with a linear combination of Erlang function, and then converting it to a Coxian function. We also present examples of the approximation and evaluate its accuracy. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 16&ndash;24, 2003; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10446
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering
Authors: Bernardo Llanas
Venue: Computational Optimization and Applications (2005)

In this paper, a simple yet efficient randomized algorithm (Exterior Random Covering) for finding the maximum distance from a point set to an arbitrary compact set in Rd is presented. This algorithm can be used for accelerating the computation of the Hausdorff distance between complex polytopes.
A conceptual framework for accessibility tools to benefit users with cognitive disabilities
Authors: Paul Ryan Bohman, Shane Anderson
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

The authors present a conceptual framework which tool developers can use to chart future directions of development of tools to benefit users with cognitive disabilities. The framework includes categories of functional cognitive disabilities, principles of cognitive disability accessibility, units of Web content analysis, aspects of analysis, and realms of responsibility.
A three-tiered evaluation approach for interactive spoken dialogue systems
Authors: Kathleen Stibler, James Denny
Venue: Proceedings of the first international conference on Human language technology research (2001)

We describe a three-tiered approach for evaluation of spoken dialogue systems. The three tiers measure user satisfaction, system support of mission success and component performance. We describe our use of this approach in numerous fielded user studies conducted with the U.S. military.
A note on Aitken's &delta;2 technique
Authors: Bush Jones
Venue: ACM SIGNUM Newsletter (1982)

This note provides a simple solution to a problem posed by Wilkinson [1] and Ralston [2]. Aitken's &delta;2 technique is widely employed in numerical analysis to obtain the limit point of a sequence. However, a problem with the technique has been the determination of when to start employing the technique in a sequence. If an application is very simple, say finding the zero of a univariate function, the technique can be employed on the sequence and validated by a simple improvement check. In more complex applications, it has been much more complicated or impossible to validate the employment of the technique.
The homespun museum: computers, fabrication,and the design of personalized exhibits
Authors: M. Eisenberg, N. Elumeze, L. Buechley, G. Blauvelt, S. Hendrix, A. Eisenberg
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The traditional view of the "home computer" is as a self-contained appliance: computation, on this view, is something that takes place within a desktop box, and that produces interesting visual effects only on a screen. In this paper, we argue that one can alternatively view "the computer" through its tangible effects on larger settings: that is, the computer can be imagined as the heart of a creative workshop centered within the home or classroom. The advent of accessible fabrication devices, as well as small computers that can be embedded in craft items, permits users to think of the room at large as a place in which computationally-enriched or computationally-designed "exhibits" of various types may be displayed. We illustrate this idea with a variety of projects undertaken within our laboratory.
Using information visualization to give rapid insight into information-intensive problems
Authors: Joanna Fivelsdal
Venue: Journal of Computing Sciences in Colleges (2005)

Because most interesting tasks are too difficult to be dealt with purely mentally, information visualization can aid in the completion of useful tasks, thus increasing user efficiency, by providing a way for the computer to act as a co-participant in such tasks. It accomplishes this by allowing mental operations to rapidly access large amounts of data outside the mind.
A selected descriptor-indexed bibliography to the literature on belief revision
Authors: Jon Doyle, Philip London
Venue: Issue 71 (April 1980) (1980)

This article presents an overview of research in an area loosely called belief revision. Belief revision concentrates on the issue of revising systems of beliefs to reflect perceived changes in the environment or acquisition of new information. In addition, belief revision research includes the study of methods for representing models of environments as collections of beliefs and the development of formal theories of belief. The bulk of the article consists of a descriptor-indexed bibliography of research addressing these topics. Our intention is that this bibliography serve both to introduce the interested researcher to this literature, and to capture the current state of the field. Towards this purpose, we begin with an overview of belief revision research.