ppxscal/embedding_network huggingface dataset:
Building agents for service provisioning out of components
Authors: Ralf Sesseler
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

CASA is an open, scalable agent architecture for service provisioning. Its interaction scheme between agents is based on a formalised concept of services to allow dynamic and flexible selection and combination of services and their providers.
Java: Hercules or Godzilla
Authors: Ed Epp
Venue: Journal of Computing Sciences in Colleges (2001)

This workshop will provide an overview of Java sufficient to cover the first half semester of a beginning course. We will focus on using and defining Java objects, Java's control constructs, using it graphics capabilities, and responding to events. Each topic will incorporate, a hands-on component using graphics to reinforce ideas. It will be assumed that all participants have, experience with a programming language. The principles of object-oriented programming will be introduced, thus, knowledge of an object-oriented language is not required. However, the pace may seem quick for those with little object experience.
Spatial operators
Authors: Eliseo Clementini, Paolino Di Felice
Venue: ACM SIGMOD Record (2000)

This paper discusses issues related to the integration of spatial operators into the new generation of SQL-like query languages. Starting from spatial data models, current spatial extensions of query languages are briefly reviewed and research directions are highlighted. A taxonomy of requirements to be satisfied by spatial operators is proposed with emphasis on users' needs and on the introduction of data uncertainty support. Further, spatial operators are classified into the three important categories of topological, projective, and metric operators and for each of them the state of the art is outlined.
A new approach to sequence comparison: normalized sequence alignment
Authors: Abdullah N. Arslan, Ömer Eğecioğlu, Pavel A. Pevzner
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach was designed to reveal the highly conserved fragments by discarding poorly conserved initial and terminal segments. However, the existing notion of local similarity has a serious flaw: it does not discard poorly conserved intermediate segments. The Smith-Waterman algorithm finds the local alignment with maximal score but it is unable to find local alignment with maximum degree of similarity (e.g., maximal percent of matches). Moreover, there is still no efficient algorithm that answers the following natural question: do two sequences share a (sufficiently long) fragment with more than 70% of similarity? As a result, the local alignment sometimes produces a mosaic of well-conserved fragments artificially connected by poorly-conserved or even unrelated fragments. This may lead to problems in comparison of long genomic sequences and comparative gene prediction as recently pointed out by Zhang et al., 1999 [33]. In this paper we propose a new sequence comparison algorithm (normalized local alignment) that reports the regions with maximum degree of similarity. The algorithm is based on fractional programming and its running time is &Ogr;(n2 log n). In practice, normalized local alignment is only 3-5 times slower than the standard Smith-Waterman algorithm.
All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks
Authors: Young-Joo Suh, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

All-to-all personalized communication commonly occurs in many important parallel algorithms, such as FFT and matrix transpose. This paper presents new algorithms for all-to-all personalized communication or complete exchange in multidimensional torus- or mesh-connected multiprocessors. For an $R \times C$ torus or mesh where $R \leq C$, the proposed algorithms have time complexities of $O(C)$ message startups and $O(RC^2)$ message transmissions. The algorithms for three- or higher-dimensional tori or meshes follow a similar structure. Unlike other existing message-combining algorithms in which the number of nodes in each dimension should be a power-of-two and square, the proposed algorithms accommodate non-power-of-two tori or meshes where the number of nodes in each dimension need not be power-of-two and square. In addition, destinations remain fixed over a larger number of steps in the proposed algorithms, thus making them amenable to optimizations. Finally, the data structures used are simple, hence making substantial savings of message-rearrangement time.
Using motion planning to study protein folding pathways
Authors: Guang Song, Nancy M. Amato
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

We present a framework for studying protein folding pathways and potential landscapes which is based on techniques recently developed in the robotics motion planning community. In particular, our work uses Probabilistic Roadmap (PRM) motion planning techniques which have proven to be very successful for problems involving high-dimensional configuration spaces. Our results applying PRM techniques to several small proteins (60 residues) are very encouraging. The framework enables one to easily and efficiently compute folding pathways from any denatured starting state to the native fold. This aspect makes our approach ideal for studying global properties of the protein's potential landscape. For example, our results show that folding pathways from different starting denatured states sometimes share some common `gullies', mainly when they are close to the native fold. Such global issues are difficult to simulate and study with other methods. Our focus in this work is to study the protein folding mechanism assuming we know the native fold. Therefore, instead of performing fold prediction, we aim to study issues related to the folding process, such as the formation of secondary and tertiary structure, and the dependence on the initial conformation. Our results indicate that for some proteins, secondary structure clearly forms first while for others the tertiary structure is obtained more directly, and moreover, these situations seem to be differentiated in the distributions of the conformations sampled by our technique. We also find that the formation order is independent of the starting denatured conformation. We validate our results by comparing the secondary structure formation order on our paths to known pulse-labeling experimental results. This indicates the promise of our approach for studying proteins for which experimental results are not available.
Topic segmentation with an aspect hidden Markov model
Authors: David M. Blei, Pedro J. Moreno
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We present a novel probabilistic method for topic segmentation on unstructured text. One previous approach to this problem utilizes the hidden Markov model (HMM) method for probabilistically modeling sequence data [7]. The HMM treats a document as mutually independent sets of words generated by a latent topic variable in a time series. We extend this idea by embedding Hofmann's aspect model for text [5] into the segmenting HMM to form an aspect HMM (AHMM). In doing so, we provide an intuitive topical dependency between words and a cohesive segmentation model. We apply this method to segment unbroken streams of New York Times articles as well as noisy transcripts of radio programs on SpeechBot, an online audio archive indexed by an automatic speech recognition engine. We provide experimental comparisons which show that the AHMM outperforms the HMM for this task.
Java power tools: model software for teaching object-oriented design
Authors: Richard Rasala, Jeff Raab, Viera K. Proulx
Venue: ACM SIGCSE Bulletin (2001)

The Java Power Tools or JPT is a Java toolkit designed to enable students to rapidly develop graphical user interfaces in freshman computer science programming projects. Because it is simple to create GUIs using JPT, students can focus on the more fundamental issues of computer science rather than on widget management. In a separate article[4], we will discuss with examples how the JPT can help freshman students to learn about the basics of algorithms, data structures, classes, and interface design. In this article, we will focus on how the JPT itself can be used as an extended case study of object-oriented design principles in a more advanced course.The fundamental design principles of the JPT are that the elements of a graphical user interface should be able to be combined recursively as nested views and that the communication between these views and the internal data models should be as automatic as possible. In particular, in JPT, the totality of user input from a complex view can be easily converted into a corresponding data model and any input errors will be detected and corrected along the way. This ease of communication is achieved by using string objects as a lingua franca for views and models and by using parsing when appropriate to automatically check for errors and trigger recovery. The JPT achieves its power by a combination of computer science and software design principles. Recursion, abstraction, and encapsulation are systematically used to create GUI tools of great flexibility. It should be noted that a much simpler pedagogical package for Java IO was recently presented in [9].
Exploring Hypermedia Processor Design Space
Authors: Chunho Lee, Johnson Kin, Miodrag Potkonjak, William H. Mangione-Smith
Venue: Journal of VLSI Signal Processing Systems (2001)

Distributed hypermedia systems that support collaboration are important emerging tools for creation, discovery, management and delivery of information. These systems are becoming increasingly desired and practical as other areas of information technologies advance. A framework is developed for efficiently exploring the hypermedia design space while intelligently capitalizing on tradeoffs between performance and area. We focus on a category of processors that are programmable yet optimized to a hypermedia application.The key components of the framework presented in this paper are a retargetable instruction-level parallelism compiler, instruction level simulators, a set of complete media applications written in a high level language, and a media processor synthesis algorithm. The framework addresses the need for efficient use of silicon by exploiting the instruction-level parallelism found in media applications by compilers that target multiple-instruction-issue processors.Using the developed framework we conduct an extensive exploration of the design space for a hypermedia application. We find that there is enough instruction-level parallelism in the typical media and communication applications to achieve highly concurrent execution when throughput requirements are high. On the other hand, when throughput requirements are low, there is little value in multiple-instruction-issue processors. Increased area does not improve performance enough to justify the use of multiple-instruction-issue processors when throughput requirements are low.The framework introduced in this paper is valuable in making early architecture design decisions such as cache and issue width trade-off when area is constrained, and the number of branch units and instruction issue width.
Efficient transmission of stored video for improved management of network bandwidth
Authors: Arun W. Solleti, Kenneth J. Christensen
Venue: International Journal of Network Management (2000)

Emerging applications that use stored video complicate the management of network resources due to the bit rate variability of the video. This paper develops a new, more efficient and less complex algorithm for transmission of stored video. Copyright &copy; 2000 John Wiley Sons, Ltd.
Comment on the working set model for program behavior
Authors: Arthur Bernstein
Venue: Communications of the ACM (1970)

In the paper &ldquo;The Working Set Model for Program Behavior&rdquo; by Peter Denning [Comm. ACM 11, 5 (May 1968), 323-333], an algorithm is described for the management of a paged memory under demand paging. In the process of analyzing this model, the author presents what appears to be an incorrect expression for &PHgr;(&tgr;), the real-time rate at which page faults occur in the system [eq. (13)]. Under the assumptions made in the article it appears that the best one can do in this area is to place an upper and lower bound on &PHgr;(&tgr;). These bounds are given below.
A scalable SNMP-based distibuted monitoring system for heterogeneous network computing
Authors: Rajesh Subramanyan, José Miguel-Alonso, José A. B. Fortes
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Traditional centralized monitoring systems do not scale to present-day large, complex, network-computing systems. Based on recent SNMP standards for distributed management, this paper addresses the scalability problem through distribution of monitoring tasks, applicable for tools such as SIMONE (SNMP-based monitoring prototype implemented by the authors). Distribution is achieved by introducing one or more levels of a dual entity called the Intermediate Level Manager (ILM) between a manager and the agents. The ILM accepts monitoring tasks described in the form of scripts and delegated by the next higher entity. The solution is flexible and integratable into a SNMP tool without altering other system components. A testbed of up to 1024 monitoring elements is used to assess scalability. Noticeable improvements in the round trip delay (from seconds to less than one tenth of a second) were observed when more than 200 monitoring elements are present and as few as two ILM's are used.
Fast and Globally Convergent Pose Estimation from Video Images
Authors: Chien-Ping Lu, Gregory D. Hager, Eric Mjolsness
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Determining the rigid transformation relating 2D images to known 3D geometry is a classical problem in photogrammetry and computer vision. Heretofore, the best methods for solving the problem have relied on iterative optimization methods which cannot be proven to converge and/or which do not effectively account for the orthonormal structure of rotation matrices. We show that the pose estimation problem can be formulated as that of minimizing an error metric based on collinearity in object (as opposed to image) space. Using object space collinearity error, we derive an iterative algorithm which directly computes orthogonal rotation matrices and which is globally convergent. Experimentally, we show that the method is computationally efficient, that it is no less accurate than the best currently employed optimization methods, and that it outperforms all tested methods in robustness to outliers.
Separation of Partition Inequalities
Authors: Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
Venue: Mathematics of Operations Research (2000)

Given a graphG = ( V,E) with nonnegative weightsx( e) for each edgee, a partition inequality is of the formx(d( S1,...., S p ))= ap+ b. Here d( S1,..., S p ) denotes the multicut defined by a partitionS1,..., S pofV. Partition inequalities arise as valid inequalities for optimization problems related tok-connectivity. We give a polynomial algorithm for the associated separation problem. This is based on an algorithm for finding the minimum ofx(d( S1,..., S p ))-- p that reduces to minimizing a symmetric submodular function. This is handled with the recent algorithm of Queyranne. We also survey some applications of partition inequalities.
Extracting usability information from user interface events
Authors: David M. Hilbert, David F. Redmiles
Venue: ACM Computing Surveys (CSUR) (2000)

Modern window-based user interface systems generate user interface events as natural products of their normal operation. Because such events can be automatically captured and because they indicate user behavior with respect to an application's user interface, they have long been regarded as a potentially fruitful source of information regarding application usage and usability. However, because user interface events are typically voluminos and rich in detail, automated support is generally required to extract information at a level of abstraction that is useful to investigators interested in analyzing application usage or evaluating usability. This survey examines computer-aided techniques used by HCI practitioners and researchers to extract usability-related information from user interface events. A framework is presented to help HCI practitioners and researchers categorize and compare the approaches that have been, or might fruitfully be, applied to this problem. Because many of the techniques in the research literature have not been evaluated in practice, this survey provides a conceptual evaluation to help identify some of the relative merits and drawbacks of the various classes of approaches. Ideas for future research in this area are also presented. This survey addresses the following questions: How might user interface events be used in evaluating usability? How are user interface events related to other forms of usability data? What are the key challenges faced by investigators wishing to exploit this data? What approaches have been brought to bear on this problem and how do they compare to one another? What are some of the important open research questions in this area?
Self-stabilizing systems in spite of distributed control
Authors: Edsger W. Dijkstra
Venue: Communications of the ACM (1974)

The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation &ldquo;the system is in a legitimate state&rdquo; invariant. As a result, each individual process step that could possibly cause violation of that relation has to be preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed. The resulting design is readily&mdash;and quite systematically&mdash;implemented if the different processes can be granted mutually exclusive access to a common store in which &ldquo;the current system state&rdquo; is recorded.
Report on second international workshop on advanced issues of E-commerce and Web-based information systems
Authors: Kun-Lung Wu, Philip S. Yu
Venue: ACM SIGMOD Record (2000)

The Second International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000) was held at the Crowne Plaza San Jose/Silicon Valley in Milpitas, California on June 8-9, 2000. The purpose of this workshop was to bring together leading practitioners, developers and researchers to explore the challenging technical issues and find feasible solutions for advancing the current state of the art in e-commerce and web-based information systems. In particular, the workshop was interested in the infrastructure issues to facilitate e-commerce and Web-based information systems.WECWIS 2000 was successful. There were three invited talks, one industrial panel discussion and six technical sessions. The keynote speech, "The global trading web: A strategic vision for the Internet economy," was delivered by Dr. Jay M. Tenebaum, VP and Chief Scientist, Commerce One, Inc., on June 8 immediately following the opening remarks by the conference chair. The banquet address, "Business issues in e-commerce," was delivered by Mr. Daniel Druker, General Manager, Hyperion e-Business Division. Finally, a lunch address, "B2C, B2B, N2N, N2M: Why 2 is so instrumental?" was delivered by Mr. Mstafa A. Syed, VP of Technology, VertialNet, Inc.The industrial panel was moderated by Dr. L. Mason and Dr. Z. Zhang, both of Blue Martini Software. The panelists included J. Becher, Accrue Software; L. Mellot, Business Objects; A. Srivastava, Blue Martini Software; and C. Zhou, IBM. The panel discussion topic was "Can e-business intelligence survive?" Among the many interesting issues being discussed were: Will privacy concerns stunt e-business intelligence utility? Will integrated e-commerce solutions be able to collect and analyze click steams, contents, products and sales data simultaneously? To what extent can out-of-the-box combined e-commerce and e-business intelligence solutions be useful? Is data mining useful in B2B e-commerce? Both positive and negative responses were hotly debated.There were a total of 30 papers included in the technical presentations, organized into six sessions. They were selected after rigorous reviews by the program committee members. The presented papers cover a wide range of topics, from framework, architecture and protocol issues of e-commerce to various types of e-services to web-based information systems for facilitating e-commerce. The rest of this report provides a brief summary of the technical presentations given in the workshop. The entire workshop proceedings is available from the IEEE Computer Society.
A note on group mutual exclusion
Authors: Vassos Hadzilacos
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Group mutual exclusion is a natural problem, formulated by Joung in 1998, that generalises the classical mutual exclusion problem. In group mutual exclusion a process requests a &ldquo;session&rdquo; before entering its critical section; processes are allowed to be in the critical section simultaneously provided they have requested the same session. To rule out solutions that cause processes to delay each other even when they all request the same session, group mutual exclusion algorithms must satisfy a property called &ldquo;concurrent entering&rdquo;. Joung stated this property only informally. Keane and Moir later gave a precise statement of this property and devised a simple group mutual exclusion algorithm that satisfies it. We argue that Keane and Moir's formulation is not quite as strong as the property Joung described informally. We propose a new precise and simple formulation of concurrent entering that is stronger than Keane and Moir's and properly captures Joung's intention. Keane and Moir's algorithm does not satisfy this stronger property, while Joung's original algorithm does. We present another algorithm that satisfies this stronger property and has some advantages over Joung's.
Evaluating numbers expressed as strings of English words
Authors: Charles J. Swift
Venue: Communications of the ACM (1960)

Integer numbers can be expressed in English by a series of words such as &ldquo;one hundred thirty three million two hundred four.&rdquo; The process indicated by the accompanying flowchart evaluates numbers represented by such a string. To include words up to &ldquo;billion&rdquo; requires four terms &ldquo;Sumi.&rdquo; The multiplications can be done by shifting on a decimal machine.
Using active server pages and simulation techniques to create virtual M M's
Authors: Robin M. Snyder
Venue: Journal of Computing Sciences in Colleges (2001)

The M M problem is an excellent example of a nontrivial yet simple method for summarizing sampled data that are then used in making decisions. Simulating the creation of virtual M M's that can be copied and pasted into a spreadsheet as the raw data for the M M problem provides a way for students to get a unique sample of M M's, thus modeling how, in an information systems environment, sampled raw data can often be captured electronically rather than being entered by hand as would be the case with a physical package of M M's. Previously presented using client-side JavaScript, this paper presents a solution to the same problem using server-side Active Server Pages, thus avoiding compatibility problems of client-side scripting. The paper serves as a short introduction to both programming in Active Server Pages and to simulating discrete events.