ppxscal/embedding_network huggingface dataset:
Connection caching under various models of communication
Authors: Edith Cohen, Haim Kaplan, Uri Zwick
Venue: Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures (2000)

Motivated by Web applications, we recently introduced the following theoretical model for connection-caching: Each host on a network can maintain (cache) a limited number of connections to other hosts. A message can be transmitted from one host to another only if the connection between these two hosts is open, i.e., it is cached by both endpoints. If a message request arrives and the respective connection is not open (a miss), the connection needs to be established and certain activation cost is incurred. The establishment of the new connection may force the termination (eviction) of other connections at each endpoint. The distributed nature of connection-caching makes it considerably more involved than the standanrd caching problem. It also makes it necessary to specify the type and amount of communication the different hosts are allowed to use to coordinate the contents of their caches. We consider three different models of communication. In the first and most basic model, hosts are allowed no extra communication. In particular, they are not notified when a connection is closed by its other endpoint. In the second model, hosts are notified of connection closures but are allowed no additional communication. In the third model, hosts are allowed to exchange information regarding shared open connections. The second model of communication corresponds to TCP under normal network conditions, the first corresponds to network failures. Although the third model is not yet implemented, we believe that it is interesting to explore its potential benefits. We show that all algorithms belonging to a natural class of marking algorithms, working under the third communication model, are optimally competitive, i.e., achieve a competitive ratio of k, where k is the size of the largest cache in the network. This answers the main open problem left in [7]. Interestingly, all these optimally competitive algorithms exchange at most one extra bit per open connection. We also present an optimally competitive connection-caching algorithm that works under the second model. These results show that optimal competitiveness can be achieved with very limited communication. Finally, we also consider randomized marking algorithms and show that they are O(log k)-competitive.
The design and evaluation of a high-performance soft keyboard
Authors: I. Scott MacKenzie, Shawn X. Zhang
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

The design and evaluation of a high performance soft keyboard for mobile systems are described. Using a model to predict the upper-bound text entry rate for soft keyboards, we designed a keyboard layout with a predicted upper-bound entry rate of 58.2 wpm. This is about 35% faster than the predicted rate for a QWERTY layout. We compared our design (OPTI) with a QWERTY layout in a longitudinal evaluation using five participants and 20 45-minute sessions of text entry. Average entry rates for OPT1 increased from 17.0 wpm initially to 44.3 wpm at session 20. The average rates exceeded those for the QWERTY layout after the 10 session (about 4 hours of practice). A regression equation (R = .997) in the form of the power-law of learning predicts that our upper-bound prediction would be reach at about session 50.
A Keyword Search System for Medical Doctors to Introduce Their Patients to Specialists
Authors: Eisuke Hanada, Kazuhiro Ise, Yasuaki Antoku, Kouji Matsumura, Yuko Kenjo, Misuzu Koga, Seizaburo Kashiwagi, Yoshiaki Nose
Venue: Journal of Medical Systems (1999)

We developed an online keyword search system on a WWW server to help medical doctors to introduce their patients to specialists. The system stores special knowledge and advanced techniques of 287 medical specialists in Kyushu University Hospital. The data set was presented by the medical specialists themselves. Specialists can rewrite their data set using the browser anytime to keep their data set up to date. In addition, the specialists are reminded to keep their data set up to date by direct mail once a year. The system does not use any database management systems. We used only two text files and the &ldquo;grep&rdquo; command, one of the basic commands of the UNIX system. Then, it takes less than 1 sec to search one medical specialist's data set from 200 specialists' data sets. The system is useful not only inside the hospital but also for practitioners in the local area.
Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
Authors: Patrick L. Combettes
Venue: SIAM Journal on Control and Optimization (2000)

The strong convergence of a broad class of outer approximation methods for minimizing a convex function over the intersection of an arbitrary number of convex sets in a reflexive Banach space is studied in a unified framework. The generic outer approximation algorithm under investigation proceeds by successive minimizations over the intersection of convex supersets of the feasibility set determined in terms of the current iterate and variable blocks of constraints. The convergence analysis involves flexible constraint approximation and aggregation techniques as well as relatively mild assumptions on the constituents of the problem. Various well-known schemes are recovered as special realizations of the generic algorithm and parallel block-iterative extensions of these schemes are devised within the proposed framework. The case of inconsistent constraints is also considered.
An Integral Equation Approach to the Incompressible Navier--Stokes Equations in Two Dimensions
Authors: Leslie Greengard, Mary Catherine Kropinski
Venue: SIAM Journal on Scientific Computing (1998)

We present a collection of methods for solving the incompressible Navier--Stokes equations in the plane that are based on a pure stream function formulation. The advantages of this approach are twofold: first, the velocity is automatically divergence free, and second, complicated (nonlocal) boundary conditions for the vorticity are avoided. The disadvantage is that the solution of a nonlinear fourth-order partial differential equation is required. By recasting this partial differential equation as an integral equation, we avoid the ill-conditioning which hampers finite difference and finite element methods in this environment. By using fast algorithms for the evaluation of volume integrals, we are able to solve the equations using O(M) or O(M log M) operations, where M is the number of points in the discretization of the domain.
A Secure Agent-based Framework for Internet Trading in Mobile Computing Environments
Authors: Xun Yi, Chee Kheong Siew, Xiao Feng Wang, Eiji Okamoto
Venue: Distributed and Parallel Databases (2000)

Most of the current Internet trading frameworks, in particular their negotiation and payment phases, are intended for customers frequently connected to the Internet during an entire transaction. This requirement cannot be easily met in the high communication cost and/or low bandwidth settings, typically found in mobile computing environments. Based on the software agent paradigm, a new secure agent-based framework for Internet trading in mobile computing environments is proposed in this paper. The framework is composed of two new protocols. One is the agent-based auction-like negotiation protocol, another is the agent-based payment protocol. Both of them are dedicated to solve the trade problems of Internet trading in mobile computing environments and ensured to be safe by cryptographic technologies. The combination of the two secure protocols constitutes an integrative solution for Internet trading in mobile computing environments.
Computing challenges of the cosmic microwave background
Authors: J. Richard Bond, Robert G. Crittenden, andreq H. Jaffe, Lloyd Knox
Venue: Computing in Science and Engineering (1999)

The authors address the challenge of extracting high-precision measurements of cosmological parameters from upcoming megapixel cosmic-microwave data sets.
A Network Time Interface M-Module for Distributing GPS-Timeover LANs
Authors: Ulrich Schmid, Johann Klasek, Thomas Mandl, Herbert Nachtnebel, Gerhard Cadek, Nikolaus Kerö
Venue: Real-Time Systems (2000)

This paper provides a comprehensive overview of our Network Time Interface (NTI) M-Module, which facilitates high-accuracy time distribution in LAN-based distributed real-time systems. Built around our custom UTCSU VLSI chip, it hosts all the hardware support required for interval-based external clock synchronization: A high-resolution state- and rate-adjustable clock, local accuracy intervals, interfaces to GPS receivers, and various timestamping features. Maximum network controller and CPU independence ensures that the available NTI prototype can be employed in virtually any COTS-based system with MA-Module interface. Our experimental evaluation shows that time distribution with \mus-accuracy is possible even in Ethernet-based system architectures, provided that the available configuration parameters are suitably chosen to cope with the various hidden sources of timing uncertainty.
Toolbook multimedia demonstrations for Java programming
Authors: Ainslie Ellis
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

This paper describes a set of multimedia demonstrations built to facilitate the learning of introductory Java programming. They provide demonstrations of complex processes and concepts that are difficult, if not impossible, to present using more traditional media used in lectures.
Theory and models for creating engaging and immersive ecommerce Websites
Authors: Morgan Jennings
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

The purpose of this paper is to describe theory and research from several disciplines, not generally understood by web developers, which the author believes are applicable to creating engaging and immersive ecommerce environments. These disciplines include aesthetic experience (AE), Flow, landscape assessment, and a proposed aesthetic framework. The link between these different areas is aesthetics, specifically aesthetic experience. Developing ecommerce sites based on models related to aesthetics can provide an organized means of designing engaging and immersive sites which are more likely to lead to positive user experience. IT personnel commonly understand the psychological aspects of human-computer interaction (HCI). Similarly, the toolbox of every web designer and Internet system architect should include knowledge of the concepts related to engaging and immersive environments.
Multigrid Solution of Automatically Generated High-Order Discretizations for the Biharmonic Equation
Authors: Irfan Altas, Jonathan Dym, Murli M. Gupta, Ram P. Manohar
Venue: SIAM Journal on Scientific Computing (1998)

In this work, we use a symbolic algebra package to derive a family of finite difference approximations for the biharmonic equation on a 9-point compact stencil. The solution and its first derivatives are carried as unknowns at the grid points. Dirichlet boundary conditions are thus incorporated naturally. Since the approximations use the 9-point compact stencil, no special formulas are needed near the boundaries. Both second-order and fourth-order discretizations are derived.The fourth-order approximation produce more accurate results than the 13-point classical stencil or the commonly used system of two second-order equations coupled with the boundary condition.The method suffers from slow convergence when classical iteration methods such as Gauss--Seidel or SOR are employed. In order to alleviate this problem we propose several multigrid techniques that exhibit grid-independent convergence and solve the biharmonic equation in a small amount of computer time. Test results from three different problems, including Stokes flow in a driven cavity, are reported.
Reachability and connectivity queries in constraint databases
Authors: Michael Benedikt, Martin Grohe, Leonid Libkin, Luc Segoufin
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

It is known that standard query languages for constraint databases lack the power to express connectivity properties. Such properties are important in the context of geographical databases, where one naturally wishes to ask queries about connectivity (what are the connected components of a given set?) or reachability (is there a path from A to B that lies entirely in a given region?). No existing constraint query languages that allow closed form evaluation can express these properties.In the first part of the paper, we show that in principle there is no obstacle to getting closed languages that can express connectivity and reachability queries. In fact, we show that adding any topological property to standard languages like FO + LIN and FO+POLY results in a closed language. In the second part of the paper, we look for tractable closed languages for expressing reachability and connectivity queries. We introduce path logic, which allows one to state properties of paths with respect to given regions. We show that it is closed, has polynomial time data complexity for linear and polynomial constraints, and can express a large number of reachability properties beyond simple connectivity. Query evaluation in the logic involves obtaining a discrete abstraction of a continuous path, and model-checking of temporal formulae on the discrete structure.
A Fuzzy Neuron with Binary Input and its Training Algorithm
Authors: Roelof K. Brouwer
Venue: Neural Processing Letters (1999)

This paper is concerned with a proposal for a fuzzy artificial neuron with bi-nary input. The fuzzy neuron is based on fuzzy logic in that each component of the input vector is compared to a number which represent the membership value for a 0 in that position. The results of the comparisons are then combined using a generalized mean function to produce a single number which is compared to a threshold as in the case of a perceptron consisting of a linear combiner with hard limiting function. A training algorithm is developed based on an algorithm for linear inequalities described by Ho and Kashyap in a paper titled &rsquo;An Algorithm for Linear Inequalities and its Applications&lsquo;. The results obtained by simulation look promising.
A Classical Construction for the Digital Fundamental Group
Authors: Laurence Boxer
Venue: Journal of Mathematical Imaging and Vision (1999)

A version of topology&lsquo;s fundamental group is developed for digital images in dimension at most 3 in [7] and [8]. In the latter paper, it is shown that such a digital image X &sub; {\cal Z}k, k &le; 3, has a continuous analog C(X) &sub; Rk such that X has digital fundamental group isomorphic to &Pi;1(C(X)). However, the construction of the digital fundamental group in [7] and [8] does not greatly resemble the classical construction of the fundamental group of a topological space. In the current paper, we show how classical methods of algebraic topology may be used to construct the digital fundamental group. We construct the digital fundamental group based on the notions of digitally continuous functions presented in [10] and digital homotopy [3]. Our methods are very similar to those of [6], which uses different notions of digital topology. We show that the resulting theory of digital fundamental groups is related to that of [7] and [8] in that it yields isomorphic fundamental groups for the digital images considered in the latter papers (for certain connectedness types).
Convergence Analysis of a Numerical Method for a Mean Field Model of Superconducting Vortices
Authors: Qiang Du
Venue: SIAM Journal on Numerical Analysis (2000)

In the mean field models of superconductivity, the individual vortex-like structures occurring in practical type-II superconductors are averaged and a vortex density is solved for them. The numerical solution of the mean field models makes large-scale simulations of vortex phenomena possible. In this paper, we present a simple convergence analysis for a numerical method based on hybrid finite element/finite volume/finite difference approximations in the two-dimensional case, by providing various different interpretations to the discretization scheme.
Displaying search results in textual databases
Authors: Offer Drori
Venue: ACM SIGCHI Bulletin (2000)

This article presents the preliminary results of a study currently in progress on the display of search results from textual databases. The study deals with information that should be displayed in a list of documents that match the user's search criteria.
Timed Communicating Object Z
Authors: Brendan Mahony, Jin Song Dong
Venue: IEEE Transactions on Software Engineering (2000)

This paper describes a timed, multithreaded object modeling notation for specifying real-time, concurrent, and reactive systems. The notation Timed Communicating Object Z (TCOZ) builds on Object Z's strengths in modeling complex data and algorithms, and on Timed CSP's strengths in modeling process control and real-time interactions. TCOZ is novel in that it includes timing primitives, properly separates process control and data/algorithm issues and supports the modeling of true multithreaded concurrency. TCOZ is particularly well-suited for specifying complex systems whose components have their own thread of control. The expressiveness of the notation is demonstrated by a case study in specifying a multilift system that operates in real-time.
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
Authors: Wen-Lian Hsu, Tze-Heng Ma
Venue: SIAM Journal on Computing (1999)

In this paper, we present a linear-time algorithm for substitution decomposition on chordal graphs. Based on this result, we develop a linear-time algorithm for transitive orientation on chordal comparability graphs, which reduces the complexity of chordal comparability recognition from O(n2) to O(n+m). We also devise a simple linear-time algorithm for interval graph recognition where no complicated data structure is involved.
Formal verification meets simulation (embedded tutorial) (abstract only)
Authors: David L. Dill, Serdar Tasiran
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This embedded tutorial explores some of the options for verification in the territory between current methods based simulation and emulation, and formal verification, Topics covered will include: coverage metrics and their effectiveness at uncovering bugs, symbolic simulation for partial formal verification, and directed search of a design. criterion, examples demonstrate that accurate approximations are possible well into the RF frequency range even with expansions about s=0.
Transversing itemset lattices with statistical metric pruning
Authors: Shinichi Morishita, Jun Sese
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

We study how to efficiently compute significant association rules according to common statistical measures such as a chi-squared value or correlation coefficient. For this purpose, one might consider to use of the Apriori algorithm, but the algorithm needs major conversion, because none of these statistical metrics are anti-monotone, and the use of higher support for reducing the search space cannot guarantee solutions in its the search space. We here present a method of estimating a tight upper bound on the statistical metric associated with any superset of an itemset, as well as the novel use of the resulting information of upper bounds to prune unproductive supersets while traversing itemset lattices. Experimental tests demonstrate the efficiency of this method.
Tree-Based Parallel Load-Balancing Methods for Solution-Adaptive Finite Element Graphs on Distributed Memory Multicomputers
Authors: Ching-Jung Liao, Yeh-Ching Chung
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

To solve the load imbalance problem of a solution-adaptive finite element application program on a distributed memory multicomputer, nodes of a refined finite element graph can be remapped to processors or load of a refined finite element graph can be redistributed based on the current load of each processor. For the former case, remapping can be performed by some fast mapping algorithms. For the latter case, a load-balancing algorithm can be applied to balance the computational load of each processor. In this paper, three tree-based parallel load-balancing methods, the MCSTLB method, the BTLB method, and the CBTLB method, were proposed to deal with the load imbalance problems of solution-adaptive finite element application programs. To evaluate the performance of the proposed methods, we have implemented those methods along with three mapping methods, the AE/ORB method, the AE/MC method, and the MLkP method, on an SP2 parallel machine. Three criteria, the execution time of mapping/load-balancing methods, the execution time of a solution-adaptive finite element application program under different mapping/load-balancing methods, and the speedups achieved by mapping/load-balancing methods for a solution-adaptive finite element application program, are used for the performance evaluation. The experimental results show that 1) if the initial mapping is performed by a mapping method and the same mapping method and load-balancing methods were used in each refinement to balance the load of processors, the execution time of an application program under a load-balancing method is always shorter than that of the mapping method, and 2) the execution time of an application program under the CBTLB method is shorter than that of the BTLB method and the MCSTLB method.
Incremental Testability Analysis for Partial Scan Selection and Design Transformations
Authors: Tianruo Yang, Zebo Peng
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper presents an efficient estimation method for incremental testability analysis, which is based partially on explicit testability re-calculation and partially on gradient techniques. The analysis results have been used successfully to guide design transformations and partial scan selection. Experimental results on a variety of benchmarks show that the quality of our incremental testability analysis is similar to those of the conventional explicit testability re-calculation methods and the technique can be used efficiently for improving the testability of a design during the high-level test synthesis and partial scan selection processes.
Electronic Data Processing Security&mdash;An Overview
Authors: Robert V. Jacobson
Venue: International Journal of Network Management (1996)

This article describes the design and implementation of a hypothetical data processing application, a stolen vehicles information system, in order to identify and describe the threats to EDP security.
On Rearrangeability of Multirate Clos Networks
Authors: Guo-Hui Lin, Ding-Zhu Du, Xiao-Dong Hu, Guoliang Xue
Venue: SIAM Journal on Computing (1999)

Chung and Ross [SIAM J. Comput., 20 (1991), pp. 726--736] conjectured that the multirate three-stage Clos network C(n,2n-1,r) is rearrangeable in the general discrete bandwidth case; i.e., each connection has a weight chosen from a given finite set {p1, p2,. . .,pk} where $1 \geq p_1 > p_2 > \cdots > p_k > 0$ and pi is an integer multiple of pi, denoted by $p_k \mid p_i$, for $1 \leq i \leq k-1$. In this paper, we prove that multirate three-stage Clos network C(n,2n-1,r) is rearrangeable when each connection has a weight chosen from a given finite set {p1, p2,. . .,pk} where $1 \geq p_1 > p_2 > \cdots > p_{h} > 1/2 \geq p_{h+1} > \cdots > p_k > 0$ and ph+2 | ph+1,ph+3 |ph+2,. . . ,pk | ph+1. We also prove that C(n,2n-1,r) is two-rate rearrangeable and $C(n, \lceil \frac{7n}{3} \rceil, r)$ is three-rate rearrangeable.