ppxscal/embedding_network huggingface dataset:
Performance Improvement of Congestion Avoidance Mechanism for TCP Vegas
Authors: Yi-Cheng Chan, Chia-Tai Chan, Yaw-Chung Chen, Cheng-Yuan Ho
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we propose a router-based congestionavoidance mechanism (RoVegas) for TCP Vegas. TCP Vegasdetects network congestion in the early stage and successfullyprevents periodic packet loss that usually occurs inTCP Reno. It has been demonstrated that TCP Vegas outperformsTCP Reno in many aspects. However, TCP Vegassuffers several problems that inhere in its congestion avoidancemechanism, these include issues of rerouting, persistentcongestion, fairness, and network asymmetry. By performingthe proposed scheme in routers along the round-trippath, RoVegas can solve the problems of rerouting andpersistent congestion, enhance the fairness among the competitiveconnections, and improve the throughput when congestionoccurs on the backward path. Through the resultsof both analysis and simulation, we demonstrate the effectiveness of RoVegas.
Towards Secure Collaboration on the Semantic Web
Authors: Joon S. Park
Venue: ACM SIGCAS Computers and Society (2003)

Web technologies enable collaborative work to be done more efficiently and effectively. A user can share resources with others on the Web and perform his or her job based on a pre-defined policy for collaboration. During the collaboration, the user may need to create new resources, merge, split, exchange, or update resources created by other users. To support these services on the Web, we need machine-understandable as well as machine-readable metadata about the resources. The concept of a Semantic Web has been introduced to satisfy this requirement. Although the Semantic Web will provide more accurate and efficient services on the Web, it also introduces new problems that were not considered before, especially, in regards to security, interoperability, and transparency to users and organizations. In this paper, we discuss the requirements to support secure collaboration on the Semantic Web. We mainly focus on identification and analysis of the security problems associated with the Semantic Web, while suggesting possible solutions to each problem. 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
The Lazy Adversary Conjecture Fails
Authors: Enoch Peserico
Venue: Theory of Computing Systems (2004)

In the context of competitive analysis of online algorithms for the k-server problem, it has been conjectured that every randomized, memoryless online algorithm exhibits the highest competitive ratio against an offline adversary that is lazy, i.e., that will issue requests forcing it to move one of its own servers only when this is strictly necessary to force a move on the part of the online algorithm. We prove that, in general, this lazy adversary conjecture fails. Moreover, it fails in a very strong sense: there are adversaries which perform arbitrarily better than any other adversary which is even slightly &#x201c;lazier.&#x201d;
Exponentially fitted explicit Runge-Kutta-Nyström methods
Authors: J. M. Franco
Venue: Journal of Computational and Applied Mathematics (2004)

Exponentially fitted Runge-Kutta-Nyström (EFRKN) methods for the numerical integration of second-order IVPs with oscillatory solutions are derived. These methods integrate exactly differential systems whose solutions can be expressed as linear combinations of the set of functions {exp(λt), exp(-λt)}, λ ∈ C, or equivalently {sin(ωt), cos(ωt)} when λ = iω, ω ∈ R. Explicit EFRKN methods with two and three stages and algebraic orders 3 and 4 are constructed. In addition, a 4(3) embedded pair of explicit EFRKN methods based on the FSAL technique is obtained, which permits to introduce an error and step length control with a small cost added. Some numerical experiments show the efficiency of our explicit EFRKN methods when they are compared with other exponential fitting type codes proposed in the scientific literature.
An Artificial Intelligence Perspective on Autonomic Computing Policies
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

We introduce a unified framework that interrelatesthree different types of policies that will be used in autonomiccomputing systems: Action, Goal, and Utility Function policies.Our policy framework is based on concepts from artificialintelligence such as states, actions, and rational agents. We showhow the framework can be used to support the use of all threetypes of policies within a single autonomic component or system,and use the framework to discuss the relative merits of each type.
Generation, analysis and comparison of multiple structural design alternatives in an interactive real-time environment
Authors: A. Lindblad, G. Miller
Venue: Engineering with Computers (2004)

Current methods of analyzing multiple design configurations can be labor intensive and typically require engineers to make relatively indirect comparisons between structural models. This paper presents an approach designed to support convenient management and analysis of multiple design configurations, and to provide a high degree of spatial and temporal congruence for model visualization, thereby allowing more direct comparisons to be made. This ultimately can allow for a more thorough evaluation of design alternatives, while decreasing the workload needed to perform these analyses.
Multiple sources of evidence for XML retrieval
Authors: Börkur Sigurbjörnsson, Jaap Kamps, Maarten de Rijke
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Document-centric XML collections contain text-rich documents, marked up with XML tags. The tags add lightweight semantics to the text. Querying such collections calls for a hybrid query language: the text-rich nature of the documents suggest a content-oriented (IR) approach, while the mark-up allows users to add structural constraints to their IR queries. We will show how evidence for relevancy from different sources helps to answer such hybrid queries. We evaluate our methods using the INEX 2003 test set, and show that structural hints in hybrid queries help to improve retrieval effectiveness.
Limitations of Quantum Advice and One-Way Communication
Authors: Scott Aaronson
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only limited advantages over classical ones. First, we show that BQP/qpoly NEITHER A SUBSET OF NOR EQUAL TO PP/poly, where BQP/qpoly is the class of problems solvable in quantum polynomial time, given a polynomial-size "quantum advice state" that depends only on the input length. This resolves a question of Buhrman, and means that we should not hope for an unrelativized separation between quantum and classical advice. Underlying our complexity result is a general new relation between deterministic and quantum one-way communication complexities, which applies to partial as well as total functions. Second, we construct an oracle relative to which NP NOT A SUBSET OF BQP/qpoly. To do so, we use the polynomial method to give the first correct proof of a direct product theorem for quantum search. This theorem has many other applications; for example, it can be used to fix and even improve on a flawed result of Klauck about quantum time-space tradeoffs for sorting. Third, we introduce a new trace distance method for proving lower bounds on quantum one-way communication complexity. Using this method, we obtain optimal quantum lower bounds for two problems of Ambainis, for which no nontrivial lower bounds were previously known even for classical randomized protocols.
A Comprehensive and Automated Approach to Intelligent Business Processes Execution Analysis
Authors: Malu Castellanos, Fabio Casati, Umeshwar Dayal, Ming-Chien Shan
Venue: Distributed and Parallel Databases (2004)

Business process management tools have traditionally focused on supporting the modeling and automation of business processes, with the aim of enabling faster and more cost-effective process executions. As more and more processes become automated, customers become increasingly interested in managing process executions. Specifically, there is a desire for getting more visibility into process executions, to be able to quickly spot problems and areas for improvements. The idea is that, by being able to assess the process execution quality, it is possible to take actions to improve and optimize process execution, thereby leading to processes that have higher quality and lower costs. All this is possible today, but involves the execution of specialized data mining projects that typically last months, costs hundreds of thousands of dollars, and only provide a specialized, narrow solution whose applicability is often relatively short in time, due to the ever changing business and IT environments. Still, the need is such that companies undertake these efforts.To address these needs, this paper presents a set of concepts and architectures that lay the foundation for providing users with intelligent analysis and predictions about business process executions. For example, the tools are able to provide users with information about why the quality of a process execution is low, what will be the outcome of a certain process, or how many processes will be started next week. This information is crucial to gain visibility into the processes, understand or foresee problems and areas of optimization, and quickly identify solutions. Intelligent analysis and predictions are achieved by applying data mining techniques to process execution data. In contrast to traditional approaches, where lengthy projects, considerable efforts, and specialized skills in both business processes and data mining are needed to achieve these objectives, we aim at automating the entire data mining process lifecycle, so that intelligent functionality can be provided by the system while requiring little or no user input. The ambitious end goal of the work presented in this paper is that of laying the foundation for a framework and tool that is capable of providing analysts with key intelligence information about process execution, affecting crucial IT and business decisions, almost literally at the click of a button.
A Sense-and-Respond Approach to Business Transformation
Authors: Paul Huang, Shubir Kapoor, Steve Buckley
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Business process technology has been one of the drivers and enablers of business transformation in the last decade. In essence, a business process represents a specific way of executing and coordinating business activities. Middleware that can help model and execute business processes along with integrating those processes with multiple vendor applications has been used widely in many large enterprises, and is fast gaining momentum in the small and medium business sector. As automated business processes become prevalent, we have seen a new wave of business transformation emerging: enterprises start looking for capabilities to intelligently monitor and control their business operations, and to link the operational performance with their business strategy. This new wave of business transformation is aimed to achieve a higher level of governance, i.e., to support "smart" decision-making and control of business processes. In this paper, we propose a Sense-and-Respond approach to intelligent business process control. A Sense-and-Respond loop typically consists of three steps: sensing, analyzing and decision-making, and execution. In this paper we will focus on the design of a decision-making framework.
Computed Tomography Imaging of Lungs in Mouse Models of Human Disease - Advancing the Computing Interfaces with Physiology
Authors: Lewis L. Hsu, Daniel M. Schimel
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

New research applications for imaging can come from combining advances in anesthetic management and respiratory synchronization with computed tomography (CT) algorithms. CT imaging has the potential to provide lung pathologic details non-invasively, and to facilitate the structural and functional studies in mouse models of human diseases. Examples include atelectasis in lungs of transgenic mice expressing sickle hemoglobin, and bacterial pneumonia. However, human high-resolution CT is typically obtained during a breath-hold, asking the patient to voluntarily hold her breath for several seconds and hold still for a crisp image. Mice cannot cooperate in this manner, so inhalational general anesthesia keeps the animal in position but breathing spontaneously during the 20 to 40 minutes of scans. Mice with pleural effusion and with severe pulmonary fibrosis survived micro CT under anesthesia. Imaging can be gated to obtain one set of images in the expiratory phase of the respiratory cycle, and another in the inspiratory phase. Respiratory gating provides superior image quality, and comparing inspiratory vs expiratory lung volume provides an estimate of tidal volume. Correlating human conditions with patho-physiology in mouse models will permit more translational research.
Interconnect Macromodelling and Approximation of Matrix Exponent
Authors: V. G. Kurbatov, M. N. Oreshina
Venue: Analog Integrated Circuits and Signal Processing (2004)

The simplest interconnection model for an integrated circuit is a discrete RC-circuit governed by a system Ri&prime; + Di &equals; u&prime; of differential equations with positive definite matrices R and D. Such a system usually has a high dimension, so it is natural to solve it approximately. Traditionally it is investigated by means of Krylov subspace methods. In this article a close approach is discussed. This approach admits an effective estimation of accuracy. It is based on the approximation of the main factor eAt (here A &equals; &minus;R&minus;1D) in the impulse response H(t) &equals; eAt R&minus;1 by a polynomial r(A, t) &equals; a0(t)1 + a1(t)A + &middot;&middot;&middot; +an(t)An with the coefficients ak(t) depending on t or by a rational function of a similar form.
A search engine for historical manuscript images
Authors: Toni M. Rath, R. Manmatha, Victor Lavrenko
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Many museum and library archives are digitizing their large collections of handwritten historical manuscripts to enable public access to them. These collections are only available in image formats and require expensive manual annotation work for access to them. Current handwriting recognizers have word error rates in excess of 50% and therefore cannot be used for such material. We describe two statistical models for retrieval in large collections of handwritten manuscripts given a text query. Both use a set of transcribed page images to learn a joint probability distribution between features computed from word images and their transcriptions. The models can then be used to retrieve unlabeled images of handwritten documents given a text query. We show experiments with a training set of 100 transcribed pages and a test set of 987 handwritten page images from the George Washington collection. Experiments show that the precision at 20 documents is about 0.4 to 0.5 depending on the model. To the best of our knowledge, this is the first automatic retrieval system for historical manuscripts using text queries, without manual transcription of the original corpus.
On the inferior and superior k-th power part of a positive integer and divisor function
Authors: Zheng Jianfeng
Venue: Smarandache Notions Journal (2004)

For any positive integer n, let a(n) and b(n) denote the inferior and superior k-th power part of n respectively. That is, a(n) denotes the largest k-th power less than or equal to n, and b(n) denotes the smallest k-th power greater than or equal to n. In this paper, we study the properties of the sequences {a(n)} and {b(n)}, and give two interesting asymptotic formulas.
Pingwin
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A short animated movie about a penguin who wants to fly. Copyright held by creator. 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
CoBFIT: A Component-Based Framework for Intrusion Tolerance
Authors: HariGovind V. Ramasamy, Adnan Agbaria, William H. Sanders
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

In this paper, we present the architecture of CoBFIT, a component-based framework for building intrusion-tolerant distributed systems. The CoBFIT framework, by virtue of its design and implementation principles, can serve as a convenient base for building components that implement intrusion-tolerant protocols and for combining these components in an efficient manner to provide a number of services for dependability. For example, in this paper, we describe the CoBFIT implementation of a prototype intrusion-tolerant group communication system that includes services such as reliable multicast, group membership management, and total ordering of multicast messages.
A prototyping language for text-processing applications
Authors: W. P. Dodd, P. Ramsay, T. H. Axford, D. G. Parkyn
Venue: Proceedings of the workshop on Rapid prototyping (1982)

This paper descibes briefly the facilities required of prototyping languages with particular reference to text-processing applications. A brief overview is given of the language ATOL, and a comparision is made of the facilities offered by ATOL and those required of prototyping languages for text-processing.
Deep hole trapping effects in the degradation mechanisms of 6.5-2 nm thick gate-Oxide PMOSFETs
Authors: A. Bravaix, D. Goguenheim, N. Revil, E. Vincent
Venue: Microelectronic Engineering (2004)

Hot-carrier (HC) degradation in PMOSFETs with thin (Tox = 2 nm) and thick (6.5 nm) gate-oxides are investigated as they show very different damage mechanisms when electrons or holes are involved. It is shown for the first time that hot-hole currents are now directly measured through a thermionic gate-current in Tox = 6.5 nm devices which is limited to hole tunneling currents in high speed (HS) and low leakage (LL) devices with Tox = 2 nm. This is explained by the increase in the surface doping and thinner junction depths which push the HC generation rate shallower to the surface. Results show that injected holes worsen the HC damage in thin and thick gate-oxides PMOSFETs as electrons with a higher mobility quickly tunnel or detrap through a field assisted detrapping mechanism. This is distinguished by the effects of the interface trap generation, the permanent hole trapping and the hole charging discharging on slow traps using alternated stressing. This consequently leads to a significant resistance against HC degradation in 2 nm HS. LL. devices with respect to 6.5 nm devices which is explained by the dominant effect of hole discharge from bulk and slow traps in 2 nm devices at the tunneling distance of the interface leaving the dominant effect of interface traps at long term.
SKRAPPLE: Enabling Media-Based Study Schools, Apprentice Schools, and Samba Schools
Authors: John Voiklis, John Black, Daniel Kaplan
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

SKRAPPLE stands for Sharing Knowledge Representational Artifacts in a Peer-To-Peer Learning Environment. SKRAPPLE combines a Squeak-based, media authoring and programming environment, an implementation of the Symbols and Worlds cognitive architecture, and a pedagogical method based on peer-mentoring. SKRAPPLE is meant to serve as amodel for a new kind of school, both formal and informal, that would function as an open-source/open-content, public service media enterprise. In this model of school, children would be responsible for all authoring/production activities and these activities would allow and enable children to passionately immerse themselves in any content area, both intradisciplinary and interdisciplinary. The authors propose an initial specification and invite collaborators to develop, research, and implement the SKRAPPLE model.
Carl & Ray continued: Tippett Studeio 3D character animation for Blockbuster
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

The continuing adventures of "Carl & Ray", those zany, furry Blockbuster Video characters created by the artists of Tippett Studio. In this year's montage, the Tippett team has further refined and built on the artistic and technical challenges of bringing photo-real house pets into the realm of the fantastic. Whether they be dancing, sliding, juggling, or dripping with water, Carl & Ray continue to entertain audiences worldwide while setting new standards for photo realistic fur and 3D character animation. Copyright held by creator.
Beyond content delivery: applications to the edge
Authors: William Weihl
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

CDNs have evolved beyond caching and delivery of web objects and streams. With services such as Akamai's EdgeComputing Powered by Websphere, distributed computing on a world-wide grid is now a reality for a wide range of business applications, providing subsecond response time to all users wherever they are, unprecedented levels of fault-tolerance, and massive scalability on-demand. Application resources can be provisioned in seconds, responding in real-time to changes in load on a given application. In some cases, an application can be deployed completely on the global platform without any central infrastructure. In other cases, core database and business logic remain in the enterprise data center, while the presentation layer and some database and business logic functionality can move onto the global platform. We will describe the evolution of CDNs and the challenges faced in distributing customer applications.
Sentence completion
Authors: Korinna Grabski, Tobias Scheffer
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

We discuss a retrieval model in which the task is to complete a sentence, given an initial fragment, and given an application specific document collection. This model is motivated by administrative and call center environments, in which users have to write documents with a certain repetitiveness. We formulate the problem setting and discuss appropriate performance metrics. We present an index-based retrieval algorithm and a cluster-based approach, and evaluate our algorithms using collections of emails that have been written by two distinct service centers.