ppxscal/embedding_network huggingface dataset:
Timed mobile agent planning for distributed information retrieval
Authors: Jin-Wook Baek, Gyu-Tae Kim, Heon-Young Yeom
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The most significant performance factors in Mobile Agent Planning (MAP) ARE; (a) the number of mobile agents, (b) the total routing time consumed by the participated agents, and (c) the time constraints, (such as information ready time and deadline triggered unto each nodes to be visited). We propose the Timed Mobile Agent Planning (TMAP), a time constrained mobile agent planning method for finding the minimal number of agents and the best scheduled agents' itineraries for information retrieval from a distributed computing environment processed under the time- constraints while keeping the completion and the total routing time minimal. Experimental results show that this method is required and highly applicable directly to the time- constrained distributed information retrieval environment which has a time window which consists of a &lquo;ready- line&rdquo; (information ready time) and a &ldquo;deadline&rdquo; (the end of the information's lifetime).
Reduced-order modeling of large linear passive multi-terminal circuits using matrix-pad&eacute; approximation
Authors: R. W. Freund, P. Feldmann
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper introduces SyMPVL, an algorithm for the approximation of the symmetric multi-port transfer function of an RLC circuit. The algorithm employs a symmetric block-Lanczos algorithm to reduce the original circuit matrices to a pair of typically much smaller, banded, symmetric matrices. These matrices determine a matrix-Pade approximation of the multi-port transfer function, and can serve as a reduced-order model of the original circuit. They can be ``stamped'' directly into the Jacobian matrix of a SPICE-type circuit simulator, or can be used to synthesize an equivalent smaller circuit. We also prove stability and passivity of the reduced-order models in the RL, RC, and LC special cases, and report numerical results for SyMPVL applied to example circuits.
An Alternative to the Use of Patterns in String Processing
Authors: Ralph E. Griswold, David R. Hanson
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

SNOBOL4 is best known for its string processing facilities, which are based on patterns as data objects. Despite the demonstrated success of patterns, there are many shortcomings associated with their use. The concept of patterns in SNOBOL4 is examined and problem areas are discussed. An alternative method for high-level string processing is described. This method, implemented in the programming language Icon, employs generators, which are capable of producing alternative values. Generators, coupled with a goal-driven method of expression evaluation, provide the string processing facilities of SNOBOL4 without the disadvantages associated with patterns. Comparisons between SNOBOL4 and Icon are included and the broader implications of the new approach are discussed.
The &ldquo;Wolf Fence&rdquo; algorithm for debugging
Authors: Edward J. Gauss
Venue: Communications of the ACM (1982)

The &ldquo;Wolf Fence&rdquo; method of debugging time-sharing programs in higher languages evolved from the &ldquo;Lions in South Africa&rdquo; method that I have taught since the vacuum-tube machine language days. It is a quickly converging iteration that serves to catch run-time errors.
Data filtering applied to information storage and retrieval applications
Authors: Robert P. Larsen
Venue: Communications of the ACM (1966)

Manipulation of data strings is the most complex processing function in information storage and retrieval applications. Data string manipulation is discussed within the context of an interpretive processing environment controlled by the use of procedural directives. The sequence of procedural directives is derived from a job assumed to be expressed in a user-oriented source language. Each data string within the structured data environment (data bank) is explicitly or implicitly related to a format declaration residing in a format library. The processing mechanics associated with data string manipulation is developed in accordance with a generalized data filtering concept. This results in the implementation of a two-port data filter module that satisfies internal processing functions by filtering data strings through format declarations associated with its input and output ports.
The new program of work for the international standard vocabulary in computers and information processing
Authors: J. F. Traub
Venue: Communications of the ACM (1964)

The Vocabulary Subcommittee of the International Standards Organization's Technical Committee on Computers and Information Processing (ISO/TC97/SC1) held its third meeting in New York City in May, 1964. (More precisely, this was the subcommittee's first meeting. Its earlier meetings in Geneva and Paris were as a Working Group.) The program of work agreed upon at the New York meeting marks a sharp reversal of SC1's earlier plans.
Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System
Authors: Sérgio Campos, Edmund M. Clarke, Orna Grumberg
Venue: Formal Methods in System Design (2000)

In this work we propose a verification methodology consisting of selective quantitative timing analysis and interval model checking. Our methods can aid not only in determining if a system works correctly, but also in understanding how well the system works. The selective quantitative algorithms compute minimum and maximum delays over a selected subset of system executions. A linear-time temporal logic (LTL) formula is used to select either infinite paths or finite intervals over which the computation is performed. We show how tableau for LTL formulas can be used for selecting either paths or intervals and also for model checking formulas interpreted over paths or intervals.To demonstrate the usefulness of our methods we have verified a complex and realistic distributed real-time system. Our tool has been able to analyze the system and to compute the response time of the various components. Moreover, we have been able to identify inefficiencies that caused the response time to increase significantly (about 50%). After changing the design we not only verified that the response time was lower, but were also able to determine the causes for the poor performance of the original model using interval model checking.
Partial entity structure: a compact non-manifold boundary representation based on partial topological entities
Authors: Sang Hun Lee
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Non-manifold boundary representations have gained a great deal of popularity in recent years and various representation schemes have been proposed because they allow an even wider range of objects for various applications than conventional manifold representations. However, since these schemes are mainly interested in describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy too much storage space redundantly although they are very efficient in answering queries on topological adjacency relationships. Storage requirement can arise as a crucial problem in models in which topological data is more dominant than geometric data, such as tessellated or mesh models. To solve this problem, in this paper, we propose a compact non-manifold boundary representation, called the partial entity structure, which allows the reduction of the storage size to half that of the radial edge structure, which is known as a time efficient non-manifold data structure, while allowing full topological adjacency relationships to be derived without loss of efficiency. This representation contains not only the conventional primitive entities like the region, face, edge, and vertex, but also the partial topological entities such as the partial-face, partial-edge, and partial-vertex for describing non-manifold conditions at vertices, edges, and faces. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes. Furthermore, a set of the generalized Euler operators and typical high-level modeling capabilities such as Boolean operations are also implemented to confirm that our data structure is sound and easy to be manipulated.
Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches
Authors: Sung-Whan Moon, Kang G. Shin, Jennifer Rexford
Venue: IEEE Transactions on Computers (2000)

With effective packet-scheduling mechanisms, modern integrated networks can support the diverse quality-of-service requirements of emerging applications. However, arbitrating between a large number of small packets on a high-speed link requires an efficient hardware implementation of a priority queue. To highlight the challenges of building scalable priority queue architectures, this paper includes a detailed comparison of four existing approaches: a binary tree of comparators, priority encoder with multiple first-in-first-out lists, shift register, and systolic array. Based on these comparison results, we propose two new architectures that scale to the large number of packets (N) and large number of priority levels (P) necessary in modern switch designs. The first architecture combines the faster clock speed of a systolic array with the lower memory requirements of a shift register, resulting in a hybrid design; a tunable parameter allows switch designers to carefully balance the trade-off between bus loading and chip area. We then extend this architecture to serve multiple output ports in a shared-memory switch. This significantly decreases complexity over the traditional approach of dedicating a separate priority queue to each outgoing link. Using the Verilog hardware description language and the Epoch silicon compiler, we have designed and simulated these two new architectures, as well as the four existing approaches. The simulation experiments compare the designs across a range of priority queue sizes and performance metrics, including enqueue/dequeue speed, chip area, and number of transistors.
General considerations on the design of an interactive system for data analysis
Authors: Robert F. Ling
Venue: Communications of the ACM (1980)

Among the most important criteria in the design and implementation of an interactive system for data analysis are: data structure, control language, user interface, sytem versatility, extensibility, and portability. The design of an interactive system, viewed as a set of constrained decisions based on these criteria, will be discussed. The concepts and considerations discussed in this article about the design of interactive systems are general in nature and are neither problem-specific nor discipline-specific. Specific examples from statistical packages and their designs are cited for illustration purposes only.
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program
Authors: Robert McNaughton
Venue: Communications of the ACM (1968)

A number of courses are listed in the area described as automata, formal languages, abstract switching, and computability, that might be available to a Ph.D. student in computer science. A brief catalog description of each course is supplied and the role of each of the courses in the graduate program is discussed.
Approximating the minimum strongly connected subgraph via a matching lower bound
Authors: Adrian Vetta
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We present a 3/2-approximation algorithm for the problem of finding a minimum strongly connected spanning subgraph in a given directed graph. As a corollary we obtain a 3/2-approximation algorithm for the more general minimum equivalent digraph problem. The performance of our algorithm is measured against a lower bound obtained from a simple matching problem. The performance guarantee is optimal with respect to the lower bound.
Finite Difference Solutions of Incompressible Flow Problems with Corner Singularities
Authors: Huaxiong Huang, Brian R. Seymour
Venue: Journal of Scientific Computing (2000)

Two problems that include corner singularities are considered. The first concerns the flow of a viscous fluid in a channel driven by a constant pressure gradient, when the velocity satisfies a two-dimensional Poisson equation. The second is Stokes flow in a two-dimensional region when the stream-function satisfies the biharmonic equation. For both problems the boundaries of the domains contain corners. For corner angles greater than some critical value, the stress or the vorticity is singular. Using both a formal analysis and numerical results, we show that numerical approximations for the stream-function and velocity, obtained by using standard second-order finite difference methods, still converge to the exact solutions despite the corner singularities. However, the convergence rate is lower than second-order and the deterioration in the accuracy is not local, i.e., not confined to the corner. On the other hand, even though the vorticity solution of the Stokes problem does not converge, it diverges only locally. At a finite distance from the corner, the vorticity converges with the same rate as the stream-function. Adaptive methods for improving the accuracy are also discussed.
Learning Deterministic Finite Automata from Smallest Counterexamples
Authors: Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon
Venue: SIAM Journal on Discrete Mathematics (2000)

We show in this paper (which appeared in a preliminary form as an extended abstract in [Proceedings of the 9th International ACM--SIAM Symposium on Discrete Algorithms, ACM, 1998]) that deterministic finite automata (DFAs) with n states and input alphabet $\Sigma$ can efficiently be learned from less than $|\Sigma|n^2$ smallest counterexamples. This improves on an earlier result of Ibarra and Jiang who required $|\Sigma|n^3$ smallest counterexamples. We present a general strategy which learns a finite concept class ${\cal F}$ from $\lfloor\log{\cal F}\rfloor$ smallest counterexamples (but not necessarily efficiently). An application to DFAs with at most $n$ states shows that $(1+o(1))|\Sigma|n\log n$ smallest counterexamples are sufficient (if efficiency is not an issue). We show next that the special DFAs operating on input words of an arbitrary but fixed length (the so-called leveled DFAs) are efficiently learnable from $(1+o(1))|\Sigma|n\log n$ smallest counterexamples. This improves on an earlier result of Ibarra and Jiang who required $|\Sigma|n^2$ smallest counterexamples. Furthermore, we present a general lower bound on the number of smallest counterexamples (required by any learning algorithm). This bound can be stated in terms of a (new) combinatorial dimension associated with the target class. A computation of this dimension for leveled or arbitrary DFAs leads to a lower bound of the form $(\frac{1}{4}+o(1))|\Sigma|n\log n$. This bound matches the aforementioned upper bounds modulo a constant of approximately 4. Finally, we present a general conversion of algorithms learning from smallest counterexamples into algorithms performing self-directed learning. For the particular classes of leveled or arbitrary DFAs, this conversion leads to self-directed learners making the smallest possible number of mistakes (modulo a constant of approximately 4). A similar remark is valid for the class of multiplicity automata (MAs).
Improvement of vector space information retrieval model based on supervised learning
Authors: Xiaoying Tai, Minoru Sasaki, Yasuhito Tanaka, Kenji Kita
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

This paper proposes and method to improve retrieval performance of the vector space model (VSM) by utilizing user-supplied information of those documents that are relevant to the query in question. In addition to the user's relevance feedback information, incorporated into the retrieval model, which is built by using a sequence of linear transformations, is information such as inter-document similarity values. Then, the high-dimensional and sparse vectors are reduced by SVD (Singular Value Decomposition) and transformed into the low-dimensional vector space, namely the space representing the latent semantic meanings of the words. The method was experimented on through two test collections, Medline collection and Cranfield collection. Improvement of average precision compared with LSI (Latent Semantic Indexing) model were 4.03% (Medline) and 24.87% (Cranfield) for the two training data sets, and 0.01% (Medline) and 4.89% (Cranfield) for the test data, respectively. The proposed method provides an approach that makes it possible to preserve the user-supplied relevance information for a long term in the system and to use the information later.
An empirical study on the usability of an information navigation aid
Authors: David Ribeiro Lamas, Jennifer Jerrams-Smith, David Heathcote, Feliz Ribeiro Gouveia
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

The Computer Aided Information Navigation (CAIN) project provides a method of adaptive navigation support that aims to increase the World Wide Web's value as a pedagogical tool. To examine whether the system's approach improves comprehension under specific conditions, an experiment compared CAIN with conventional web tools on three measures of performance: comprehension scores, task completion times and user satisfaction. Results revealed that comprehension scores were 30% greater with CAIN than with the conventional tools and indicated that task completion times can also be reduced without compromising user satisfaction.
Empirically validated web page design metrics
Authors: Melody Y. Ivory, Rashmi R. Sinha, Marti A. Hearst
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

A quantitative analysis of a large collection of expert-rated web sites reveals that page-level metrics can accurately predict if a site will be highly rated. The analysis also provides empirical evidence that important metrics, including page composition, page formatting, and overall page characteristics, differ among web site categories such as education, community, living, and finance. These results provide an empirical foundation for web site design guidelines and also suggest which metrics can be most important for evaluation via user studies.
A comparison of numerical techniques in Markov modeling
Authors: William J. Stewart
Venue: Communications of the ACM (1978)

This paper presents several numerical methods which may be used to obtain the stationary probability vectors of Markovian models. An example of a nearly decomposable system is considered, and the results obtained by the different methods examined. A post mortem reveals why standard techniques often fail to yield the correct results. Finally, a means of estimating the error inherent in the decomposition of certain models is presented.
Exploiting symbolic techniques for partial scan flip flop selection
Authors: F. Corno, P. Prinetto, M. Sonza Reorda, M. Violante
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Partial Scan techniques have been widely accepted as an effective solution to improve sequential ATPG performance while keeping acceptable area and performance overheads. Several techniques for flip-flop selection based on structural analysis have been presented in the literature. In this paper, we first propose a new testability measure based on the analysis of the circuit State Transition Graph through symbolic techniques. We then describe a scan flip flop selection algorithm exploiting this measure. We resort to the identification of several circuit macros to address large sequential circuits. When compared to other techniques, our approach shows good results, especially when it is used to optimize a set of flip-flops previously selected by means of structural analysis.
Synchronizing processors with memory-content-generated interrupts
Authors: J. Carver Hill
Venue: Communications of the ACM (1973)

Implementations of the &ldquo;Lock-Unlock&rdquo; method of synchronizing processors in a multiprocessor system usually require uninterruptable, memory-pause type instructions. An interlock scheme called read-interlock, which does not require memory-pause instructions, has been developed for a dual DEC PDP-10 system with real-time requirements. The read-interlock method does require a special &ldquo;read-interlock&rdquo; instruction in the repertoire of the processors and a special &ldquo;read-interlock&rdquo; cycle in the repertoire of the memory modules. When a processor examines a &ldquo;lock&rdquo; (a memory location) with a read-interlock instruction, it will be interrupted if the lock was already set; examining a lock immediately sets it if it was not already set (this event sequence is a read-interlock cycle). Writing into a lock clears it. Having the processor interrupted upon encountering a set lock instead of branching is advantageous if the branch would have resulted in an effective interrupt.
A high-speed sorting procedure
Authors: R. M. Frank, R. B. Lazarus
Venue: Communications of the ACM (1960)

In a recent note1, D. L. Shell has described a high-speed sorting procedure for lists contained in internal memory. The method has the great virtues of requiring no additional memory space and being considerably faster than other such methods, which require a time proportional to the square of the list length. The present authors have studied the statistics of Shell's method and have found a minor modification which increases its speed still further.
Exploring the inputs of IS service
Authors: Janette Moody
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The importance of an IS unit's level of service to its internal customers (i.e., end-users) is well recognized (Kettinger and Lee, 1994; Pitt, Watson and Kavan, 1995; Kang and Bradley, 1999). In fact, the level of service provided by the IS unit to its internal customers can ultimately impact the organization's level of service to its external customers, as the IS unit contributes to the overall organizational climate for service (Schneider, White, and Paul, 1998). Much of the research on IS service quality has focused on the gap that exists between end-user expectations for the service and perceptions of the actual service received. Therefore, while these studies have contributed to the measurement of the IS unit's service (i.e., outputs), they have not looked closely at the service providers themselves (i.e., inputs). This research project focuses on the inputs. The research project will test the model depicted in Figure I to investigate the antecedents of, and influences on, the service quality of an IS service encounter (i.e. the service outcome). Using Ajzen and Fishbein's (1977) theory of reasoned action, this model posits that the service orientation (SO) of IS personnel will have a significant impact on end-user ratings of IS service quality (i.e., service outcomes). In addition, the model indicates that the service outcomes may also be influenced by the SO modeled by IS managers and team leaders, and by how (or if) service behavior is rewarded in the IS unit. Therefore, the model looks at the attitudes brought to the job by IS personnel, two facets of the work environment encountered by IS personnel while on the job, and the resulting service encounter as perceived by the end-user.