ppxscal/embedding_network huggingface dataset:
Group Membership and Wide-Area Master-Worker Computations
Authors: Kjetil Jacobsen, Xianan Zhang, Keith Marzullo
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Group communications systems have been designed to provide an infrastructure for fault-tolerance in distributed systems, including wide-area systems. In our work on master-worker computation for GriPhyN, which is a large projectin the area of the computational grid, we asked the question should we build our wide-area master-worker computation using wide-area group communications? This paperexplains why we decided doing so was not a good idea.
Multi-agent simulation of firms and organizational forms
Authors: Z. Guessoum, L. Rejeb, R. Durand
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we present a multi-agent system which models a set of firms in competition with each other within a shared market. We present a firm model and underline the limits of the economic models which represent only firms without considering the organizational forms. We then propose to integrate the organizational forms. We introduce a model of organizational forms and define the various interactions between the firms and the organizational forms.
You Don't Know Jack about Disks
Authors: Dave Anderson
Venue: Queue (2003)

Magnetic disk drives have been at the heart of computer systems since the early 1960s. They brought not only a significant advantage in processing performance, but also a new level of complexity for programmers. The three-dimensional geometry of a disk drive replaced the simple, linear, address spacetape-based programming model.
Synchronous Full-Scan for Asynchronous Handshake Circuits
Authors: Frank Te Beest, Ad Peeters, Kees Van Berkel, Hans Kerkhoff
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Handshake circuits form a special class of asynchronous circuits that has enabled the industrial exploitation of the asynchronous potential such as low power, low electromagnetic emission, and increased cryptographic security. In this paper we present a test solution for handshake circuits that brings synchronous test-quality to asynchronous circuits. We add a synchronous mode of operation to handshake circuits that allows full controllability and observability during test. This technique is demonstrated on some industrial examples and gives over 99% stuck-at fault coverage, using test-pattern generators developed for synchronous circuits. The paper describes how such a full-scan mode can be achieved, including an approach to minimize the number of dummy latches in case latches are used in the data path of the handshake circuit.
Estimating the costs of software maintenance tasks
Authors: H. M. Sneed
Venue: Proceedings of the International Conference on Software Maintenance (1995)

In order to control the maintenance process, it is necessary to be able to accurately predict maintenance costs. This paper proposes ways of extending current cost estimation methods to the estimation of maintenance costs, by means of impact analysis, proportional sizing, quality assessment and productivity adjustment. To illustrate the approach, a practical example from the author's own experience in financial applications is cited.
A Modified TCP Algorithm for Service Differentiation and Minimum Bandwidth Guarantee in the Internet
Authors: Youquan Zheng, Zhenming Feng, Jie Wu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper proposes a modified TCP Reno algorithm to provide differentiated services and assured services in the Internet. We introduce two new parameters, slow-start threshold hopping coefficient and minimum congestion window, to TCP Reno algorithm. The algorithm supports both relative service differentiation among best-effort traffic as well as minimum bandwidth guarantee for assured service connections. Theoretical analysis and simulation results prove the convergence and validity of the algorithm.
Dynamic rate control algorithms for HDR throughput optimization
Authors: Simon C. Borst, P. A. Whiting
Venue:  (2001)

The relative delay tolerance of data applications, together with the bursty traffic characteristics, opens up the possibility for scheduling transmissions so as to optimize throughput. A particularly attractive approach, in fading environments, is to exploit the variations in the channel conditions, and transmit to the user with the currently `best'' channel. We show that the `best'' user may be identified as the maximum-rate user when the feasible rates are weighed with some appropriately determined coefficients. Interpreting the coefficients as shadow prices, or reward values, the optimal strategy may thus be viewed as a revenue-based policy, which always assigns the transmission slot to the user yielding the maximum revenue. Calculating the optimal revenue vector directly is a formidable task, requiring detailed information on the channel statistics. Instead, we present adaptive algorithms for determining the optimal revenue vector on-line in an iterative fashion, without the need for explicit knowledge of the channel behavior. Starting from an arbitrary initial vector, the algorithms iteratively adjust the reward values to compensate for observed deviations from the target throughput ratios. The algorithms are validated through extensive numerical experiments. Besides verifying long-run convergence, we also examine the transient performance, in particular the rate of convergence to the optimal revenue vector. The results show that the target throughput ratios are tightly maintained, and that the algorithms are well able to track sudden changes in the channel conditions or throughput targets.
Automated scientific software scripting with SWIG
Authors: D. M. Beazley
Venue: Future Generation Computer Systems (2003)

Scripting languages such as Python and Tcl are a powerful tool for the construction of flexible scientific software because they provide scientists with an interpreted problem solving environment and they provide a modular framework for controlling software components written in C, C++, and Fortran. However, a common problem faced by the developers of a scripted Scientific application is that of integrating compiled code with an interpreter. To solve this problem, an extensible compiler, simplified wrapper and interface generator (SWIG), has been developed to automate the task of integrating compiled code with scripting language interpreters. SWIG requires no modifications to existing code and uses existing source to create bindings for nine different target languages including Python, Peal, Tcl, Ruby, Guile, and Java. By automating language integration, SWIG enables scientists to use scripting languages at all stages of software development and allows existing software to be more easily integrated into a scripting environment. Although SWIG has been in use for more than 6 years, little has been published on its design and the underlying mechanisms that make it work. Therefore, the primary goal of this paper is to cover these topics.
Balloon Tag: (In)visible Marker Which Tells Who's Who
Authors: Hisashi Aoki, Soichiro Matsushita
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

This paper introduces the Balloon Tag, an infrared LED tag whose ID is detected and read by an ordinary video camera. Different from conventional visual tag systems, signal patterns cannot be seen by human eyes and don't annoy the user while the relative position of the tag from the camera can be recognized as the barcode ID tag. The authors combined the idea of the Balloon Tag with wireless communication over Bluetooth, which would become widely used with wearable computers. With the proposed algorithm, the Balloon Tag receiver chooses the nearest Bluetooth transmitter. Then, a part of the Bluetooth device address (BD_ADDR) is obtained to make a connection. As a result, the receiver can easily select the most important person to communicate with.
Query type classification for web document retrieval
Authors: In-Ho Kang, GilChang Kim
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

The heterogeneous Web exacerbates IR problems and short user queries make them worse. The contents of web documents are not enough to find good answer documents. Link information and URL information compensates for the insufficiencies of content information. However, static combination of multiple evidences may lower the retrieval performance. We need different strategies to find target documents according to a query type. We can classify user queries as three categories, the topic relevance task, the homepage finding task, and the service finding task. In this paper, a user query classification scheme is proposed. This scheme uses the difference of distribution, mutual information, the usage rate as anchor texts, and the POS information for the classification. After we classified a user query, we apply different algorithms and information for the better results. For the topic relevance task, we emphasize the content information, on the other hand, for the homepage finding task, we emphasize the Link information and the URL information. We could get the best performance when our proposed classification method with the OKAPI scoring algorithm was used.
ePASS-a software-based POWER simulator
Authors: A. Goldstein, S. Weiss
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

The latest RISC computer chips provide very high performance though complex pipelined implementations, using independent integer and floating point units, branch prediction mechanisms, multiple instruction dispatch per clock cycle and more. For a chosen hardware configuration to deliver optimized performance, various design aspects, resulting in many possible configurations, need to be thoroughly evaluated. Among these are such issues as synchronization between pipelines, cache organization and access policy, dynamic vs static branch prediction, detecting and handling dependency among instructions in different pipeline states. Addressing the above necessitates the use of simulators that provide the design environment in which to model and evaluate candidate configurations and then fine-tune the chosen implementation. The authors describe ePASS, an experimental software based simulator for the IBM RS/6000 and its POWER architecture. They discuss the three basic modules ePASS consists of, each representing a different view of the system: an Instruction Interpreter and Register Set Simulator, a Functional Simulator and a Memory Simulator. Finally they present a simple test case program to run on the simulator, involving branch prediction and execution as well as making use of the interlock mechanism to guarantee synchronization of the branch unit with the fixed point pipeline.
Newton Waveform Relaxation Techniques for Tightly Coupled Systems
Authors: J D Erdman, J D Rose
Venue:  (1990)

This paper will present a new algorithm, called Newton waveform relaxation (NWR), for solving large differential algebraic systems (DAS) that arise from circuit simulation. Analytical and experimental comparisons will be made to waveform relaxation (WR), waveform relaxation Newton (WRN), and direct methods. This approach has been implemented in a circuit simulator called WCAzM and was found to be as much as three times faster than a direct method and always faster than waveform relaxation Newton for the circuits benchmarked. Improvements to the convergence of the linear inner loop of the NWR algorithm will be discussed.
Evolutionary plantographics
Authors: Alon Gal, Gady Mahal, Moshe Sipper
Venue: Artificial Life (2003)

This letter describes an evolutionary system for creating lifelike three-dimensional plants and flowers, our main goal being the facilitation of producing realistic plant imagery. With these two goals in mind--ease of generation and realism--we designed the plant genotype and the genotype-to-phenotype mapping. Diversity in our system comes about through two distinct processes--evolution and randomization--allowing the creation not only of single plants but of entire gardens and forests. Thus, we are able to readily produce natural-looking artificial scenes.
Intersection Graph Algorithms
Authors: Paul F. Dietz
Venue:  (1984)

An intersection graph for a set of sets $C$ is a graph $G$ together with a bijection from the vertices of $G$ to $C$ such that distinct vertices in $G$ are adjacent if and only if their images under this bijection intersect. Of particular interest have been the classes of chordal graphs, the intersection graphs of sets of subtrees of a tree, and interval graphs, the intersection graphs of sets of intervals of the real line. I examine another class of intersection graphs, the class of directed path graphs: intersection graphs of sets of paths in a directed tree. This class properly contains the class of interval graphs, and is properly contained by the class of chordal graphs. I give a linear time algorithm for recognizing directed path graphs and for constructing intersection representations, and a polynomial time algorithm for deciding directed path graph isomorphism. Both algorithms use a data structure called a partial path tree, which is a kind of skeletal representation of the clique hypergraph of a directed path graph. I present linear time algorithms for finding partial path trees with specific roots and for finding partial path trees with arbitrary roots. I prove that partial path trees with identical roots are identical. Using this fact I develop a polynomial time algorithm for directed path graph isomorphism.
A Hybrid Method for Nonlinear Programming
Authors: Shih Han
Venue:  (1978)

The recently developed quasi-Newton method for nonlinear programming has local and superlinear convergence properties. But global convergences can not be ensured. However, the quasi-Newton version of the multiplier method, though less efficient, shares with the classical penalty methods some global convergence properties. We observe that the difference between these two methods turns out to be merely on their stepsize strategies. Based on this point of view, we present a new method, in which the stepsizes for both primal variable and Lagrange multipliers are strategically determined such that the method behaves like a quasi-Newton version of the multiplier method when our estimates are poor, but it is as efficient as a quasi-Newton method locally. Because of these features, the method converges globally and at the same time superlinearly. 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
Great Jobs for Computer Science Majors
Authors: Jan Goldberg
Venue:  (2002)

:The first step toward the rest of your life starts with that question, and the answer is right here. Get on the right path now for a satisfying and rewarding career in computers by learning to match your skills and interests with exciting employment opportunities.
Software maintenance in distributed computer environments: system complexity versus component simplicity
Authors: S. L. Schneberger
Venue: Proceedings of the International Conference on Software Maintenance (1995)

The paper addresses a new area of research-distributed system software maintenance-focusing on whether and to what extent distributed computing environments directly affect software maintenance difficulty. The issue appears to depend on two diametrics of information system architectures: component simplicity and system complexity. Using a new conceptual model for information systems complexity applied to distributed computing environments, this research sought empirical quantitative and qualitative data from IS professionals to determine whether the complexity of a distributed computer system has a greater effect on software maintenance than component simplicity, and what the explanatory factors are. Results indicate the overall complexity of studied distributed systems overwhelmed the ease-of-use and simplicity of their components-increasing the overall difficulty of software maintenance. Some factors had a greater effect than others; the rate of technological change and the variety of components (particularly processors and system software) far outweighed the effects of component and transaction numbers.
Case Study: Visualizing Sets of Evolutionary Trees
Authors: Nina Amenta, Jeff Klingner
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identify distinct hypotheses about how different species or organisms evolved, which would not have been clear from traditional analyses. Our system integrates a point-set visualization of the distribution of hypothetical trees with detail views of an individual tree, or of a consensus tree summarizinga subset of trees. Efficient algorithms were required for the key tasks of computing distances between trees, finding consensus trees, and laying out the point-set visualization.
An Improved Critical Diagnosis Reasoning Method
Authors: Y. Xu, C. Zhang
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Model-based diagnosis mechanism has the disadvantage of a high computational complexity. One way to overcome this disadvantage is to focus the diagnosis on a reduced diagnostic space. In this paper, we pro-pose an improved critical diagnosis reasoning method based on the method proposed by Raiman, de Kleer and Saraswat. The method proposed here focuses the diagnosis on finding out the kernel diagnoses instead of the whole diagnoses. We give an updated definition of critical cover which we call "critical partition". The conditions satisfied by critical partition are relaxed compared with the conditions for critical cover. Correspondingly, a non-backtracking algorithm called Searching Critical Partition (SCP) to find out the critical partition is also proposed here.
An Efficient Method of Computing Static Single Assignment Form
Authors: Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. K Zadeck
Venue:  (1988)

In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point where advanced optimization features become undesirable. Recently, static single assignment form and the control dependence graph have been proposed to represent data flow and control flow properties of programs. Each of these previously unrelated techniques lends efficiency and power to a useful class of program optimizations. Although both of these structures are attractive, the difficulty of their construction and their potential size have discouraged their use. We present a new algorithm that efficiently computes these data structures for arbitrary control flow graph We also give analytical and experimental evidence that they are usually {\em linear} in the size of the original program. This paper thus presents strong evidence that these structures can be of {\em practical} use in optimization.
A perspective on databases and data mining
Authors: Marcel Holsheimer, Martin L. Kersten, Heikki Mannila, Hannu Toivonen
Venue:  (1995)

We discuss the use of database methods for data mining. Recently impressive results have been achieved for some data mining problems using highly specialized and clever data structures. We study how well one can manage by using general purpose database management systems. We illustrate our ideas by investigating the use of a dbms for a well-researched area: the discovery of association rules. We present a simple algorithm, consisting of only union and intersection operations, and show that it achieves quite good performance on an efficient dbms. Our method can incorporate inheritance hierarchies to the association rule algorithm easily. We also present a technique that effectively reduces the number of database operations when searching large search spaces that contain only few interesting items. Our work shows that database techniques are promising for data mining: general architectures can achieve reasonable results.
A distributed algorithm for implementation of first-order multiparty interactions
Authors: Z. Cheng, T. Huang, N. Shiratori
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

First-order multiparty interactions, a generation of multiparty synchronization, are a powerful communication mechanism that allows a set of processes to enroll into different roles of an interaction and to execute the interaction in a synchronous way, and guarantees conflict interactions to be executed exclusively. It is not a trivial problem to implement first-order multiparty interactions in a network environment. The implementation has to maintain the synchronous and exclusive properties mentioned above, be fair and make progress. In this paper, we propose a new distributed algorithm for implementing first-order multiparty interactions based on a new implementation model, in which a role manager is devised for each role. Our algorithm solves the problem with O(|R|/sup 2/.|P|) messages per interaction as opposed to |P|/sup 2/ messages required in Joung and Smolka (1994), where |R| is the number of roles of the interaction and |P| is the number of processes. Our algorithm is more efficient than that in Joung and Smolka, when |R|/sup 2/
Developing Collaborative Golog Agents by Reinforcement Learning
Authors: Ioan Alfred Letia, Doina Precup
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

We consider applications where agents have to cooper-ate without any communication taking place between them, apart from the fact that they can see part of the environment in which they act. We present a multi-agent system, defined in Golog, that needs to service tasks whose value degrades in time. Initial plans, reflecting prior knowledge about the environment, are expressed as Golog procedures, and are provided to the agents. Then the agents are trained using reinforcement learning, in order to ensure coordination both at the action level and at the plan level. This ensures better scalability and increased performance of the system.
An API for Scalable Reliable Multicast
Authors: Jim Gemmell, Jörg Liebeherr, Dave Bassett
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Most approaches to scalable reliable multicast utilize receiver-oriented retransmissions. Defining an API for receiver-oriented reliable multicast is difficult because it is not clear how to manage the sender's cache and to schedule repairs. We outline an approach to defining an API based on logical cache persistence that addresses these problems.
Optimal Linear Quadratic Tracking Using Genetic Approach
Authors: Naghmeh Mansouri, Hamid Khaloozadeh
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

In this paper a genetic approach has been presented to the Optimal Linear Quadratic Tracking problem. In this problem control law is designed such that a cost function is minimized. The design specifications, depends on choosing weighting matrices Q and R. One must carry out a trial- and- error process to choose the weighting matrices that can satisfy the design specifications. To overcome this difficulty we employ the Genetic Algorithm (GA) to find the proper weighting matrices. A computer simulation is performed to track a desired reference trajectory in a motor-generator set as a multivariable system. This method is compared with the one proposed by Bryson and Ho.