ppxscal/embedding_network huggingface dataset:
Software architecture in an open source world
Authors: Roy T. Fielding
Venue: Proceedings of the 27th international conference on Software engineering (2005)

In spite of the hype and hysteria surrounding open source software development, there is very little that can be said of open source in general. Open source projects range in scope from the miniscule, such as the thousands of non-maintained code dumps left behind at the end of class projects, dissertations, and failed commercial ventures, to the truly international, with thousands of developers collaborating, directly or indirectly, on a common platform. One characteristic that is shared by the largest and most successful open source projects, however, is a software architecture designed to promote anarchic collaboration through extensions while at the same time preserving centralized control over the interfaces.This talk features a survey of the state-of-the-practice in open source development in regards to software architecture, with particular emphasis on the modular extensibility interfaces within several of the most successful projects, including Apache httpd, Eclipse, Mozilla Firefox, Linux kernel, and the World Wide Web (which few people recognize as an open source project in itself). These projects fall under the general category of collaborative open source software development, which emphasizes community aspects of software engineering in order to compensate for the often-volunteer nature of core developers and take advantage of the scalability obtainable through Internet-based virtual organizations.
Counting unrooted loopless planar maps
Authors: Valery A. Liskovets, Timothy R. Walsh
Venue: European Journal of Combinatorics (2005)

We present a formula for the number of n-edge unrooted loopless planar maps considered up to orientation-preserving isomorphism. The only sum contained in this formula is over the divisors of n.
Nonmanipulatable insurance mechanisms: A design method
Authors: I. A. Ageev, T. I. Ovchinnikova
Venue: Automation and Remote Control (2005)

Nonmanipulatable mechanisms for determining insurance penalty are studied under the assumption that insurance rates and reimbursements nonlinearly depend on the information supplied by insured parties on the probability of occurrence of an insured event. An optimal insurance mechanism by the maximum of the insurer aim function is determined.
Polibox: generating descriptions, comparisons, and recommendations from a database
Authors: Manfred Stede
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

We describe our ongoing work on "Polibox", a web-based text generator producing adaptive hypertext from a product database, currently one of computational linguistics text-books. When given a specification of a desired ideal book, Polibox selects suitable candidates from the database, and presents them one-by-one to the user. Books are described, compared to one another, and, under the right circumstances, actively recommended. This project note concentrates on the stages of content selection, text planning and sentence planning.
Managing distributed shared arrays in a bulk-synchronous parallel programming environment: Research Articles
Authors: Christoph W. Kessler
Venue: Concurrency and Computation: Practice Experience (2004)

NestStep is a parallel programming language for the BSP (bulk-hronous parallel) programming model. In this article we describe the concept of distributed shared arrays in NestStep and its implementation on top of MPI. In particular, we present a novel method for runtime scheduling of irregular, direct remote accesses to sections of distributed shared arrays. Our method, which is fully parallelized, uses conventional two-sided message passing and thus avoids the overhead of a standard implementation of direct remote memory access based on one-sided communication. The main prerequisite is that the given program is structured in a BSP-compliant way. Copyright &copy; 2004 John Wiley & Sons, Ltd.
MoDB: Database System for Synthesizing Human Motion
Authors: Timothy Edmunds, S. Muthukrishnan, Subarna Sadhukhan, Shinjiro Sueda
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Enacting and capturing real motion for all potential scenarios is prohibitively expensive; hence, there is a great demand to synthetically generate realistic human motion. However, it is a central challenge in character animation to synthetically generate a large sequence of smooth human motion. We present a novel, database-centric solution to address this challenge.We demonstrate a method of generating long sequences of motion by performing various similarity-based "joins" on a database of captured motion sequences. This demo illustrates our system (MoDB) and show-cases the process of encoding captured motion into relational data and generating realistic motion by concatenating sub-sequences of the captured data according to feasibility metrics. The demo features an interactive character that moves towards user-specified targets; the characterýs motion is generated by relying on the real time performance of the database for indexing and selection of feasible sub-sequences.
Introducing an active cluster-based information retrieval paradigm: Book Reviews
Authors: Oscar Loureiro, Hava Siegelmann
Venue: Journal of the American Society for Information Science and Technology (2005)

When a client interacts with an expert, e.g., a doctor, it falls upon the expert to ask questions that steer the process towards fulfilling the client's needs. This is most efficient given that the expert has more knowledge and a broader view of possible illnesses and treatments. On the other hand, when faced with an information retrieval (IR) task, most IR systems leave to the client the task of coming up with queries. We propose an information retrieval framework that assumes the responsibility of leading the users to the information, thus increasing efficiency and satisfaction. &copy; 2005 Wiley Periodicals, Inc.
1337 h4x0r h4ndb00k
Venue:  (2005)

This is your ticket into the elusive underworld of the Internet, home to millions of elite computer hackers. 1337 h4x0r h4ndb00k will show you how to walk-the-walk and talk-the-talk of this exclusive community. Soon, you too will be able to go into a chat room and carry on conversations speaking the cryptic 1337 language. 1337 h4x0r h4ndb00k will also review the nature of computer viruses, different practical jokes to play on your desktop and tips on how to live the hacker lifestyle. Join the elite society of computer hackers with 1337 h4x0r h4ndb00k as your guide.
Practical Divisible Load Scheduling on Grid Platforms with APST-DV
Authors: Krijn van der Raadt, Yang Yang, Henri Casanova
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Divisible load applications consist of a load, that is input data and associated computation, that can be divided arbitrarily into independent pieces. Such applications arise in many fields and are ideally suited to a master-worker execution, but they pose several scheduling challenges. While the "Divisible Load Scheduling" (DLS) problem has been studied extensively from a theoretical standpoint, in this paper we focus on practical issues: we extend a production Grid application execution environment, APST, to support divisible load applications; we implement previously proposed DLS algorithms as part of APST; we evaluate and compare these algorithms on a real-world two-cluster platform; we show in a case study how a user can easily and effectively run a real-world divisible load application; and we uncover several issues that are critical for using DLS theory in practice. To the best of our knowledge the software resulting from this work, APST-DV, is the first usable and generic tool for deploying divisible load applications on distributed computing platforms.
Improving Scalability of Network Emulation through Parallelism and Abstraction
Authors: Cameron Kiddle, Rob Simmonds, Brian Unger
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

One approach to network emulation involves simulating a virtual network with a real-time network simulator and providing an I/O interface that enables interaction between real hosts and the virtual network. This allows real protocols and applications to be tested in a controlled and repeatable environment. To reflect conditions of large networks such as the Internet it is important that the emulation environment be scalable. This paper examines improvements in scalability of the virtual network achieved through the use of parallel discrete event simulation and simulation abstraction. Using just parallel simulation techniques, real-time emulation performance of nearly 50 million packet transmissions per second is achieved on 128 processors for a network model consisting of about 20,000 nodes. Using both parallel simulation and abstraction techniques, real-time emulation performance of nearly 500 million packet transmissions per second is achieved on 128 processors for a network model consisting of about 200,000 nodes.
WEESA: Web engineering for semantic Web applications
Authors: Gerald Reif, Harald Gall, Mehdi Jazayeri
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The success of the Semantic Web crucially depends on the existence of Web pages that provide machine-understandable meta-data. This meta-data is typically added in the semantic annotation process which is currently not part of the Web engineering process. Web engineering, however, proposes methodologies to design, implement and maintain Web applications but lack the generation of meta-data. In this paper we introduce a technique to extend existing Web engineering methodologies to develop semantically annotated Web pages. The novelty of this approach is the definition of a mapping from XML Schema to ontologies, called WEESA, that can be used to automatically generate RDF meta-data from XML content documents. We further show how we integrated the WEESA mapping into an Apache Cocoon transformer to easily extend XML based Web applications to semantically annotated Web application.
Signed Mahonians
Authors: Ron M. Adin, Ira M. Gessel, Yuval Roichman
Venue: Journal of Combinatorial Theory Series A (2005)

A classical result of MacMahon gives a simple product formula for the generating function of major index over the symmetric group. A similar factorial-type product formula for the generating function of major index together with sign was given by Gessel and Simion. Several extensions are given in this paper, including a recurrence formula, a specialization at roots of unity and type B analogues.
A middleware service for secure group communication in mobile ad hoc networks
Authors: Stephen S. Yau, Xinyu Zhang
Venue: Journal of Systems and Software (2005)

Secure group communication (SGC) is required in many applications using mobile ad hoc networks (MANETs). Due to the mobility and limited resources of mobile devices used by group members, secure groups in a MANET may be required to be set up and maintained dynamically, and applications requiring SGC may request to change the secure groups according to network and application status. In this paper, a secure group model is presented to describe common characteristics of secure groups based on hierarchical authentication relations among the members in each secure group. Based on this model, a middleware service for SGC is developed to set up and maintain secure groups automatically and support development and runtime of applications using SGC in MANETs. This middleware service is implemented in a context-sensitive middleware RCSM.
Impact of on-chip interconnect frequency-dependent R(f)L(f) on digital and RF design
Authors: Yu Cao, Xuejue Huang, Dennis Sylvester, Tsu-Jae King, Chenming Hu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2005)

On-chip global interconnect exhibits clear frequency dependence in both resistance (R) and inductance (L). In this paper, its impact on modern digital and radio frequency (RF) circuit design is examined. First, a physical and compact ladder circuit model is developed to capture this behavior, which only employs frequency independent R and L elements, and thus, supports transient analysis. Using this new model we demonstrate that the use of dc values for R and L is sufficient for timing analysis (i.e., 50% delay and slew rate) in digital designs. However, RL frequency dependence is critical for the analysis of signal integrity, shield line insertion, power supply stability, and RF inductor performance.
Utilizing don't care states in SAT-based bounded sequential problems
Authors: Sean Safarpour, Görschwin Fey, Andreas Veneris, Rolf Drechsler
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequential equivalence checking rely on fast and robust SAT solvers. In this work, we introduce a technique that improves the performance of the underlying SAT solver for bounded sequential problems by taking advantage of a design's don't care states. We develop cost effective methods of filtering, replicating and applying the don't care states to the original problem thus reducing the search space. Experiments demonstrate the effectiveness of the proposed method on ISCAS'89 benchmarks.
An Automatic Segmentation Combining Mixture Analysis and Adaptive Region Information: A Level Set Approach
Authors: Mohand Said Allili, Djemel Ziou
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper, we propose a novel automatic framework for variational color image segmentation based on unifying adaptive region information and mixture modelling. We consider a formulation of the region information by using the posterior probability of a mixture of General Gaussian (GG) pdfs, where each region is represented by a pdf. The segmentation is formulated by the minimization of an energy functional according to the region contours and all the mixture parameters respectively. Two main objectives are achieved by the approach. A scheme is provided to extend easily the adaptive segmentation to an arbitrary number of regions and to perform it in a fully automatic fashion. Moreover, the segmentation recovers an accurate and representative mixture of pdfs. In the approach, we couple the boundary and region information of the image to steer the segmentation. We validate the method on the segmentation of real world color images.
A Compiler-Enabled Model- and Measurement-Driven Adaptation Environment for Dependability and Performance
Authors: Vikram S. Adve, Adnan Agbaria, Matti A. Hiltunen, Ravi K. Iyer, Kaustubh R. Joshi, Zbigniew Kalbarczyk, Ryan M. Lefever, Raymond Plante, William H. Sanders, Richard D. Schlichting
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

Traditional techniques for building dependable, highperformance distributed systems are too expensive for most non-critical systems, often causing dependability to be sidelined as a design goal. Nevertheless, systems are expected to be dependable, and if dependability could be provided at a lower cost, many applications would stand to benefit. We believe that compiler techniques can be used to create novel and enhance existing dependability mechanisms to create a wider range of cost/dependability tradeoffs than is currently available. Similarly, compilers can assist in the area of error detection by expanding the range of errors that can be detected. New compiler techniques, combined with model-driven adaptation and control mechanisms, can be used to dynamically guide a systemas itmakes choices, with cost, dependability, and performance tradeoffs, in response to the occurrence of faults and changes in the environment. This paper reports on a new project that is exploring the approach. The broad goal of the work is to create a powerful yet flexible runtime environment for dependable and high- performance systems that operate within much lower cost constraints than is currently possible.
Transition aware scheduling: increasing continuous idle-periods in resource units
Authors: K. Ananda Vardhan, Y. N. Srikant
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Static power consumption has become a significant factor of the total power consumption in a system. Circuit level switching techniques reduce static power consumption by exploiting idle periods in processor components and placing them into low power modes or turning them off completely. In this paper, we propose a modified automaton-based list scheduling technique that augments the circuit level techniques by reducing the number of transitions between power modes, thereby increasing the of idle periods in resource units. Our scheduler uses a global resource usage vector and the usage vector of the last issued instruction(s) to select instruction(s) from the ready list such that resource units common to the last issued instruction and the selected instruction(s) are continuously active without creating a transition into low power mode. We estimate the power consumed in resource units using an energy model parameterized by the number of idle cycles, active cycles and transitions. We have implemented our algorithm in gcc and our simulations for different classes of benchmarks using an ARM simulator, with single and multi issue, indicate an average energy savings of 4%-15% in resource units
An example oriented on-line Java tutorial for university students
Authors: Jianna J. Zhang, Huy Nguyen
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

As the number of Internet users grows exponentially all over the world, Java has become one of the most favored computer languages for Web programming. Java application and Web developers are in high demand. Java courses are offered by almost every university, college, and it even has a presence in high schools. To help students learn Java efficiently, educators have created all kinds of tutorials, short and long courses, white papers, Web help pages, menus, and books. Although there are numerous resources to help students learn Java, we find that there is still at least one important part missing: a set of well organized practical examples that correspond to the kernel elements of Java language. This insufficiency slows down the learning speed and brings frustration to students. In this paper, we present a different Java tutorial which is example oriented instead of explanation oriented. We believe that our tutorial can significantly reduce the above insufficiency.
Preservations Of NBUC And NBU(2) Classes Under Mixtures
Authors: Yulin Li
Venue: Probability in the Engineering and Informational Sciences (2005)

New integral inequality characterizations of the NBUC and NBU(2) classes of lifetime distributions are given. These results are then used to prove preservation under mixture results for the NBUC and NBU(2) classes.
Demonstration of JIVE and JOVE: Java as it happens
Authors: Steven P. Reiss, Manos Renieris
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Dynamic software visualization is designed to provide programmers with insights as to what the program is doing. Most current visualizations either use program traces to show information about prior runs, slow the program down substantially, show only minimal information, or force the programmer to indicate when to turn visualizations on or off. We have developed a dynamic Java visualizer that provides a statement-level view of a Java program in action with low enough overhead so that it can be used almost all the time by programmers to understand what their program is doing while it is doing it.
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
Authors: Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Location-aware environments are characterized by a large number of objects and a large number of continuous queries. Both the objects and continuous queries may change their locations over time. In this paper, we focus on continuous k-nearest neighbor queries (CKNN, for short). We present a new algorithm, termed SEA-CNN, for answering continuously a collection of concurrent CKNN queries. SEA-CNN has two important features: incremental evaluation and shared execution. SEA-CNN achieves bothefficiency and scalability in the presence of a set of concurrent queries. Furthermore, SEA-CNN does not make any assumptions about the movement of objects, e.g., the objects velocities and shapes of trajectories, or about the mutability of the objects and/or the queries, i.e., moving or stationary queries issued on moving or stationary objects. We provide theoretical analysis of SEA-CNN with respect to the execution costs, memory requirements and effects of tunable parameters. Comprehensive experimentation shows that SEA-CNN is highly scalable and is more efficient in terms of both I/O and CPU costs in comparison to other R-tree-based CKNN techniques.
Micro-architecture techniques in the intel&reg; E8870 scalable memory controller
Authors: Fayé Briggs, Suresh Chittor, Kai Cheng
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

This paper describes several selected micro-architectural tradeoffs and optimizations for the scalable memory controller of the Intel E8870 chipset architecture. The Intel E8870 chipset architecture supports scalable coherent multiprocessor systems using 2 to 16 processors, and a point-to-point Scalability Port (SP) Protocol. The scalable memory controller micro-architecture applies a number of micro-architecture techniques to reduce the local & remote idle and loaded latencies. The performance optimizations were achieved within the constraints of maintaining functional correctness, while reducing implementation complexity and cost. High bandwidth point-to-point interconnects and distributed memory are expected to be more common in future platforms to support powerful multi-core processors. The selected techniques discussed in this paper will be applicable to scalable memory controllers needed in those platforms. These techniques have been proven for production systems for the Itanium&reg; II Processor platforms.
A Dynamic Conditional Random Field Model for Object Segmentation in Image Sequences
Authors: Yang Wang, Qiang Ji
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents a dynamic conditional random field (DCRF) model to integrate contextual constraints for object segmentation in image sequences. Spatial and temporal dependencies within the segmentation process are unified by a dynamic probabilistic framework based on the conditional random field (CRF). An efficient approximate filtering algorithm is derived for the DCRF model to recursively estimate the segmentation field from the history of video frames. The segmentation method employs both intensity and motion cues, and it combines dynamic information and spatial interaction of the observed data. Experimental results show that the proposed approach effectively fuses contextual constraints in video sequences and improves the accuracy of object segmentation.