ppxscal/embedding_network huggingface dataset:
Distributed queuing and applications
Authors: Maurice Herlihy
Venue:  (2003)

Distributed Queuing is a fundamental distributed coordination problem, arising in a variety of applications, such as ordered multicast and distributed fetch-and-&phis; data structures. In the distributed queuing problem, processors in a network asynchronously and concurrently request to join a distributed queue. A distributed queuing protocol organizes these requests into a queue, and each request learns the identity of its successor in the queue. In this thesis, we present the first systematic study of distributed queuing and demonstrate its importance as a fundamental building block in building distributed data structures. We focus our attention on the Arrow queuing protocol, which has been observed to perform well in practice. We present the first analysis of the Arrow protocol under concurrent access to the queue, improving on previous work which analyzed the protocol under sequential access. Our analysis shows that the Arrow protocol is competitive to the &ldquo;optimal&rdquo; in the concurrent case. While fault tolerant distributed queuing is impossible in the face of process failures, we show how to make the Arrow queuing protocol self-stabilizing, so that it can automatically recover from failures. Our self-stabilizing queuing protocol is scalable, and stabilizes quickly into a legal state. We show a novel application of distributed queuing to ordered multicast. There is some evidence that ordered multicast using distributed queuing has lower latency than previously studied approaches to ordered multicast which use distributed counting. We present a construction of a general purpose parallel and distributed fetch-and-&phis; data structure based on distributed queuing. Our algorithm takes a sequential implementation of a data structure and converts it into a parallel and distributed implementation. Our algorithm has significant advantages over its only other competitor we know of, the Combining trees.
SCORE: SPICE COmpatible Reluctance Extraction
Authors: Rong Jiang, Charlie Chung-Ping Chen
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Presently, a necessary modi.cation to mainstream analysis tools prevents the direct application of reluctance k. In this paper, we propose a reluctance realization algorithm (RRA) by directly converting reluctances to circuit elements compatible with general simulation engines, suchas SPICE. Reluctance realization is applicable to arbitrary circuit topology and no accuracy penalty is involved in the realization process. Since the stability of the converted circuit largely depends on the stability of the reluctance matrix, we present an efficient Improved Recursive Bisection Cutting Algorithm (IRBCA) to obtain stability-guaranteed reluctance matrices, and integrate IRBCA and RRA into a SPICE compatible reluctance extraction tool, SCORE.
User interface features influencing overall ease of use and personalization
Authors: Ram L. Kumar, Michael Alan Smith, Snehamay Bannerjee
Venue: Information and Management (2004)

This study examines user perceptions of gathering information on, locating, and buying compact discs through Web-based interfaces. A group of part-time MBA students in Hong Kong performed a specific set of tasks using the Web sites of two vendors of compact discs. The tasks were selected to be general enough to apply to a variety of on-line shopping situations. As they performed tasks, they answered questions regarding their perceptions of several user interface features as well as their perceptions of overall ease of use. User interface features associated with a perception of overall ease of use were identified, as were differences based on personal characteristics of respondents. Also, differences in perceptions of interface features that might be due to personal characteristics, such as age and sex, were identified. The methodology and results help identify user interface features that a designer should emphasize and features for which personalization is likely to be beneficial.
Unexpected universality results for three classes of P systems with symport/antiport
Authors: Mihai Ionescu, Carlos Martín-Vide, Andrei Păun, Gheorghe Păun
Venue: Natural Computing: an international journal (2003)

Symport and antiport are biological ways of transporting molecules through membranes in ``collaborating'' pairs; in the case of symport the two molecules pass in the same direction, in the case of antiport the two molecules pass in opposite directions. Here we first survey the results about the computing power of membrane systems (P systems) using only symport/antiport rules (hence these systems compute by communication only), then we consider a recently introduced, way of defining the result of a computation in a membrane system: looking for the trace of certain objects in their movement through membranes. Rather unexpected, in this way we get characterizations of recursively enumerable languages by means of membrane systems with symport/antiport which work with multisets of objects (note the qualitative difference between the data structure used by computations &ndash; multisets: no ordering &ndash; and the data structure of the output &ndash; strings: linear ordering). A similar remark holds true for the case of analysing P systems, which work in an automata-like manner: the sequence of certain distinguished objects taken from the environment during a computation is the string recognized by the computation. We also survey universality results from this area, with sketched proofs. Some open problems are also formulated.
Developing A Web-enabled and Graphics-enhanced Collaborative Environment for Integrated Research of Cardiovascular and Atherosclerotic Clinical Biology
Authors: Y. Y. Cai, L. P. Khoo, Z. W. Xiong, B. F. Lu, Y. Q. Guan, S. Wong, C. R. Cao, T. K. Tan, Kenneth Yu, M. Opas, S. C. Fok
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Coronary Heart Disease (CHD) is one of theleading killers worldwide. Lipoprotein andapolipoprotein play an important role in developingCHDs. To tackle the challenging task of CHDlipoprotein and atherosclerotic research,collaborative work is crucial. With an interdisciplinein nature, such research involves bio-chemistry,cardiovascular biology, lipoprotein structure,fluorescent imaging, 3D modelling, data mining, etc.This project aims to create a webbased andintegrated solution to support a multi-disciplinaryknowledge discovery process for the study ofcardiovascular and atherosclerotic biology. Theemphasis of the project is to address (1) the sharingof cardiovascular clinical data; and (2) the systemintegration for CHD cardiovascular research.The system currently under development is mainlyimplemented on a PC Window platform with anintranet-centric design. An Apache HTTP server, aMySQL SQL server, Perl, and R Language, areemployed for the system development independentto hardware platforms. The system offers easyinformation management and data sharing bymultiple parties across Internet. Major datasetsinclude lipoprotein phenotype/genotype and laserconfocal images. A user-friendly interface isdesigned allowing users to deposit, retrieve,visualize and analyze the CHD information fromdifferent sites.
Object-action association: a HCI design model
Authors: Robert Pastel, Nathan Skalsky
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

While developing the Simple Gesturing User Interface (SGUI) API for incorporating simple gestures into personal digital assistant (PDA) user interfaces, we developed an object-based HCI model and design process. The model assists designing direct manipulation interfaces by proposing that all interface objects are amenable to user manipulation. The model extends object-action interface models by emphasizing the relationship between the interface objects and their actions, object-action associations. We delineate three association properties: directness, localness, and appropriateness. We illustrate the design process and the utility of SGUI by developing Experimental Assistant, a graphing software for high school science experiments on the PDA.
An algebraic characterization of independence of Petri net processes
Authors: Józef Winkowski
Venue: Information Processing Letters (2003)

The paper is concerned with processes of Petri nets. A partial operation on such processes is defined that allows one to concatenate processes whenever one process is a continuation of another. It is shown that for any Petri net as defined in the paper its set of processes equipped with this operation forms a category in which independence of processes can be characterized in a natural, purely algebraic way.
A survey of optimisations for the Java Virtual Machine
Authors: Brian Davis, John Waldron
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

The Java Virtual Machine (JVM) is often realised with an interpreter or just in time (JIT) compiler. JITs easily outperform interpreters, however a large portion of the compiler must be re-engineered for each architecture it is ported to. Interpreters are far easier to develop and to maintain and are much more portable. The weakness of interpreters is that they are much slower than JITs. This survey describes the work in progress on faster Java Interpreters and the new optimisations that are being developed for modern computer architectures to improve Interpreter performance.
Motion Planning for Redundant Manipulators Using a Floating Point Genetic Algorithm
Authors: Lianfang Tian, Curtis Collins
Venue: Journal of Intelligent and Robotic Systems (2003)

This paper deals with the trajectory planning problem for redundant manipulators. A genetic algorithm (GA) using a floating point representation is proposed to search for the optimal end-effector trajectory for a redundant manipulator. An evaluation function is defined based on multiple criteria, including the total displacement of the end-effector, the total angular displacement of all the joints, as well as the uniformity of Cartesian and joint space velocities. These criteria result in minimized, smooth end-effector motions. Simulations are carried out for path planning in free space and in a workspace with obstacles. Results demonstrate the effectiveness and capability of the proposed method in generating optimized collision-free trajectories.
Visual typology in design: A computational view
Authors: Hernan Casakin, Wei Dai
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

This paper investigates the use of typological knowledge in the visual modality through a computer framework that combines multidisciplinary technologies from computer science, that is, artificial intelligence, software engineering, database system, and programming language, to help provide solutions and services to building designers. The solving of design problems frequently involves visual thinking, which has to do with the intensive use of visual knowledge like pictures, images, and other types of visual displays. The recognized power of typological knowledge in design problem solving is applied to support the exploration of a diversity of possible design solutions represented in a pictorial mode. The innovative use of computer science technologies enables a smooth link of visual typological knowledge with the design goals. Within the framework, a core technology was designed to respond to a designer's specific needs through dynamic user viewpoint generation, so that design solutions are associated with relevant (retrieved) visual typologies from the knowledge base. This has been achieved in a two-way process, in which the designer establishes an interactive dialogue with an experimental computerized framework.
Formalizing UML class diagrams
Authors: Ana María Funes, Chris George
Venue: UML and the unified process (2003)

Graphical notations have demonstrated usefulness when interacting with end users, making system validation easier. However, while they can be easily communicated, they lack precision, which consequently can be ambiguous and lead to misunderstanding. It is here where formal specifications can play an important role in overcoming this drawback. In this chapter, we use the RAISE Specification Language (RSL), which is the language of the formal method RAISE (i.e., Rigorous Approach to Industrial Software), as a syntactic and semantic reference for UML. We present the semantics for UML class diagrams by using RSL as a formal basis. An automated tool that implements the translation and the abstract syntax in RSL for the RSL-translatable class diagrams are also presented.
SDPARA: semiDefinite programming algorithm paRAllel version
Authors: M. Yamashita, K. Fujisawa, M. Kojima
Venue: Parallel Computing (2003)

The SDPA (SemidDefinite Programming Algorithm) is known as efficient computer software based on the primal-dual interior-point method for solving SDPs (SemiDefinite Programs). In many applications, however, some SDPs become larger and larger, too large for the SDPA to solve on a single processor. In execution of the SDPA applied to large scale SDPs, the computation of the so-called Schur complement matrix and its Cholesky factorization consume most of the computational time. The SDPARA (SemiDefinite Programming Algorithm paRAllel version) is a parallel version of the SDPA on multiple processors and distributed memory, which replaces these two parts by their parallel implementation using MPI and ScaLAPACK. Through numerical results, we show that the SDPARA on a PC cluster consisting of 64 processors attains high scalability for large scale SDPs without losing the stability of the SDPA.
Performance Analysis of an Modified Time-Based Location Registration Scheme
Authors: Goo Yeon Lee, Yong Lee
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper, we propose a modified time-based registrationmethod and analyze the performance numerically.In the analysis, we assume Poisson call arrival distributionand exponential cell resident time. The performanceof the modified time-based registration method is comparedwith the performance of the original time-based registrationmethod. In the comparisons, we see that in the certainrange of parameters, the modified time-based registrationmethod has better performance.
Relevant query feedback in statistical language modeling
Authors: Ramesh Nallapati, Bruce Croft, James Allan
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

In traditional relevance feedback, researchers have explored relevant document feedback, wherein, the query representation is updated based on a set of relevant documents returned by the user. In this work, we investigate relevant query feedback, in which we update a document's representation based on a set of relevant queries. We propose four statistical models to incorporate relevant query feedback.To validate our models, we considered anchor text of incoming links to a given document as feedback queries and performed experiments on the home-page retrieval task of TREC 2001. Our results show that three of our four models outperform the query-likelihood baseline by at least 35% in MRR score on a test set.
Narratives of space and time: visualization for distributed applications
Authors: Patrick J. Finnigan, Kelly A. Lyons
Venue: Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research (1991)

Programmers of distributed applications face the challenge of building communicating processes (CP) in a complex, heterogeneous network with distributed data and services. The tools necessary to build these systems are emerging, but widespread acceptance will require effective use of visualization and user interface technologies to reduce complexity.In this paper, we outline a plan and describe some initial results for visualizing three aspects of distributed applications&bull; X.500 [25) directory data&bull; Internet network and routing maps [27]&bull; Hermes [42] communicating processesThese are key components of the Consortium for Reliable Distributed Systems (CORDS) research effort described elsewhere in these proceedings [41]. An introductory section describes the CORDS model for distributed processing. The resultant general visualization requirements are summarized. These put the research plan into context.
On Steepest Descent Algorithms for Discrete Convex Functions
Authors: Kazuo Murota
Venue: SIAM Journal on Optimization (2003)

This paper investigates the complexity of steepest descent algorithms for two classes of discrete convex functions: M-convex functions and L-convex functions. Simple tie-breaking rules yield complexity bounds that are polynomials in the dimension of the variables and the size of the effective domain. Combining the present results with a standard scaling approach leads to an efficient algorithm for L-convex function minimization.
Adverse effects of e-commerce
Authors: Sushil K. Sharma, Jatinder N. D. Gupta
Venue: The economic and social impacts of e-commerce (2003)

E-commerce is the fastest growing industry worldwide and is one of the most rapidly evolving areas of national and international trade. The Internet has become an incredibly powerful tool for conducting business electronically. Companies have taken the proactive approach and are jumping on the new way to conduct business. E-commerce enables organizational change and helps organizations to conduct business with improved efficiencies and productivity. E-commerce is credited with empowering employees and knowledge workers, by giving them easy access to virtually unlimited information. E-commerce technologies have helped nations to accelerate their economic growth and to provide more opportunities for the businesses to grow. Meanwhile, it has also created many challenges and adverse effects, such as concerns over privacy, consumer protection, and security of credit card purchases, displacement of workers (especially low-status ones), and is charged with having a negative impact on quality of work life. This chapter describes the various adverse effects that have accompanied the advent of the Internet and e-commerce revolution.
The general inefficiency of batch training for gradient descent learning
Authors: D. Randall Wilson, Tony R. Martinez
Venue: Neural Networks (2003)

Gradient descent training of neural networks can be done in either a batch or on-line manner. A widely held myth in the neural network community is that batch training is as fast or faster and/or more 'correct' than on-line training because it supposedly uses a better approximation of the true gradient for its weight updates. This paper explains why batch training is almost always slower than on-line training--often orders of magnitude slower--especially on large training sets. The main reason is due to the ability of on-line training to follow curves in the error surface throughout each epoch, which allows it to safely use a larger learning rate and thus converge with less iterations through the training data. Empirical results on a large (20,000-instance) speech recognition task and on 26 other learning tasks demonstrate that convergence can be reached significantly faster using on-line training than batch training, with no apparent difference in accuracy.
The PL/EXUS language and virtual machine
Authors: Gary A. Sitton, Thomas A. Kendrick, A. Gil Carrick
Venue: Proceedings of a symposium on High-level-language computer architecture (1973)

This paper describes a high level general purpose language which evolved from another high level systems programming language. As well, the compiler, pseudocode, and virtual machine are discussed in some detail. The new language is a powerful PL/1 dialect, as is its parent language, XPL1. PL/EXUS (<u>P</u>rogramming <u>L</u>anguage/<u>E</u>xtended <u>X</u>PL <u>U</u>sers' <u>S</u>uperset), was created to satisfy a particular set of needs. A highly machine independent, mobile, compact, and powerful programming system was needed for implementation of programs to manipulate medical record data on modestly configured minicomputers. The primary extensions to XPL were semantic and dictated the structure of a host virtual machine. Because of the number of different data types and implicit mixed mode conversion rules, the virtual machine has a tagged data architecture. This results in a small instruction set of under 64 operators and thus enables powerful, implicit, run time instruction interpretation. The PL/EXUS virtual machine has a basic eight bit word size. Its virtual memory capabilities require only a fraction of the program and data to be in real memory at a time. The ability to specify storage space for most data types results in parsimonious space allocation in spite of the presence of tag words (one eight-bit byte per identifier or constant). Some instructions were specifically created to allow the compiler to "peep-hole" (i.e., locally) optimize generated pseudocode programs. The compiler itself is written in XPL, which permits self-compilation and makes possible its execution on the virtual machine or a simulated (interpretive) version of it.
Incorporating memory layout in the modeling of message passing programs
Authors: F. J. Seinstra, D. Koelma
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

One of the most fundamental tasks any automatic parallelization and optimization tool is confronted with is to find an optimal domain decomposition for an application at hand. For regular domain problems (such as simple matrix manipulations) this task may seem trivial. However, communication costs in message passing programs often significantly depend on the capabilities and particular behavior of the applied communication primitives. As a consequence, straightforward domain decompositions may deliver non-optimal performance.In this paper we introduce a new point-to-point communication model (called P-3PC, or the 'Parameterized model based on the Three Paths of Communication') that is specifically designed to overcome this problem. In comparison with related models (e.g., LogGP) P-3PC is similar in complexity, but more accurate in many situations, although the model is aimed at MPI's standard point-to-point operations, it is applicable to similar message passing definitions as well.The effectiveness of the model is tested in a framework for automatic parallelization of image processing applications. Experiments are performed on two Beowulf-type commodity clusters, each having a different interconnection network, and a different MPI implementation. Results show that, where other models frequently fail, P-3PC correctly predicts the communication costs related to any type of domain decomposition.
Components-first approaches to CS1/CS2: principles and practice
Authors: Emily Howe, Matthew Thornton, Bruce W. Weide
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Among the many ways to focus CS1/CS2 content, two have been published that emphasize concepts of component-based software engineering. Courses based on these two instances of a "components-first" approach are remarkably similar in several crucial respects--which is surprising because they were developed independently and with very different objectives. Indeed, the two versions are based on virtually the same principles for content organization, and they share many common features that are unusual for CS1/CS2. Yet, they are notably different in other ways. Detailed analysis of similarities and differences suggests that it might be possible to transfer some of their claimed and documented advantages to other approaches within the programming-first paradigm for CS1/CS2, by rearranging the content of such courses in accord with the underlying principles of the components-first approach.