ppxscal/embedding_network huggingface dataset:
Virtual Appliances for Deploying and Maintaining Software
Authors: Constantine Sapuntzakis, David Brumley, Ramesh Chandra, Nickolai Zeldovich, Jim Chow, Monica S. Lam, Mendel Rosenblum
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

This paper attempts to address the complexity of system administration by making the labor of applying software updates independent of the number of computers on which the software is run. Complete networks of machines are packaged up as data; we refer to them as virtual appliances. The publisher of an appliance controls the software installed on the appliance, from the operating system to the applications, and is responsible for keeping the appliance up to date. These appliances can be configured by users to fit their needs; the configuration is captured such that it can be reapplied automatically when the appliance's software is updated. We have developed a compute utility, called the Collective, which assigns virtual appliances to hardware dynamically and automatically. By keeping software up to date, our approach prevents security break-ins due to fixed vulnerabilities.This paper presents the concept of virtual networks of virtual appliances and describes our prototype of the Collective Utility. We demonstrate the feasibility of our approach by creating appliances for groupware servers, Windows desktop environments, and software development environments.
ECEM: an event correlation based event manager for an I/O-intensive application
Authors: Sang Seok Lim, Kyu Ho Park
Venue: Journal of Systems and Software (2005)

In Internet servers that run on general purpose operating systems, network subsystems and disk subsystems cooperate with each other for user requests. Many studies have focused on optimizing the data movement across the subsystems to reduce data copying overhead among kernel buffers, a network send buffer and a disk buffer. When data are moved across the subsystems, events such as read requests and write requests for data movement are also delivered across the subsystems by the servers and the operating system. However, there have been fewer studies on the optimization of event delivery across the subsystems. In conventional operating systems, an event from a disk subsystem is delivered to a network subsystem regardless of the status of the network subsystem. If the network subsystem is not ready for data sending, the execution of the server will be blocked, which causes scheduling and context switching overheads. This non-contiguous execution will incur deficiencies such as avoidable process blocking, context switching, cache pollution and long response time. To alleviate the deficiencies, we have developed inter-subsystem event delivery mechanisms that define event dependencies among the subsystems involved. We define an event correlation based on the happened-before relation. We propose deferred event delivery (DED) and disk-to-network splicing (DNS) to suppress scheduling and context switching during I/O request processing. We performed experiments on Linux 2.4 and the experimental results show that the number of context switching is reduced by up to 20% and server data transmit rate is improved by 4.0-8.1%.
Closed schedulers: a novel technique for analyzing asynchronous protocols
Authors: Ronit Lubitch, Shlomo Moran
Venue: Distributed Computing (1995)

Analyzing distributed protocols in various models often involves a careful analysis of the set of admissible runs, for which the protocols should behave correctly. In particular, the admissible runs assumed by a t-resilient protocol are runs which are fair for all but at most t processors. In this paper we define closed sets of runs, and suggest a technique to prove impossibility results for t-resilient protocols, by restricting the corresponding sets of admissible runs to smaller sets, which are closed, as follows: For each protocol PR and for each initial configuration c, the set of admissible runs of PR which start from c defines a tree in a natural way: the root of the tree is the empty run, and each vertex in it denotes a finite prefix of an admissible run; a vertex u in the tree has a son v iff v is also a prefix of an admissible run, which extends u by one atomic step.The tree of admissible runs described above may contain infinite paths which are not admissible runs. A set of admissible runs is closed if for every possible initial configuration c, each path in the tree of admissible runs starting from c is also an admissible run. Closed sets of runs have the simple combinatorial structure of the set of paths of an infinite tree, which makes them easier to analyze. We introduce a unified method for constructing closed sets of admissible runs by using a model-independent construction of closed schedulers, and then mapping these schedulers to closed sets of runs. We use this construction to provide a unified proof of impossibility of consensus protocols.
Secure agent computation: X.509 proxy certificates in a multi-lingual agent framework
Authors: Subhashini Raghunathan, Armin R. Mikler, Cliff Cozzolino
Venue: Journal of Systems and Software (2005)

Mobile agent technology presents an attractive alternative to the client-server paradigm for several network and real-time applications. However, for most applications, the lack of a viable agent security model has limited the adoption of the agent paradigm. This paper describes how the security infrastructure for computational Grids using X.509 Proxy Certificates can be extended to facilitate security for mobile agents. Proxy Certificates serve as credentials for Grid applications, and their primary purpose is the temporary delegation of authority. We are exploiting the similarities between Grid applications and mobile agent applications, and motivate the use of Proxy Certificates as credentials for mobile agents. Further, we propose extensions for Proxy Certificates to facilitate the characteristics of mobile agent applications, and present mechanisms that achieve agent-to-host authentication, restriction of agent privileges, and secure delegation of authority during spawning of new agents.
Is the Internet Going NUTSS?
Authors: Paul Francis
Venue: IEEE Internet Computing (2003)

The IETF leadership needs to recognize that there is a good chance that IPv6 will never happen. The IAB should no longer be satisfied with simply labeling NAT solutions as UNSAF, because the commercial world just doesnýt care. Rather, it needs to start hedging its bets, and take a serious look at one of these NAT-based approaches as a valid next-generation architecture.
Efficient algorithms for processing XPath queries
Authors: Georg Gottlob, Christoph Koch, Reinhard Pichler
Venue: ACM Transactions on Database Systems (TODS) (2005)

Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in the worst case. We show that XPath can be processed much more efficiently, and propose main-memory algorithms for this problem with polynomial-time combined query evaluation complexity. Moreover, we show how the main ideas of our algorithm can be profitably integrated into existing XPath processors. Finally, we present two fragments of XPath for which linear-time query processing algorithms exist and another fragment with linear-space/quadratic-time query processing.
Reverse Nearest Neighbors in Large Graphs
Authors: Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Yufei Tao
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

A reverse nearest neighbor query returns the data objects that have a query point as their nearest neighbor. Although such queries have been studied quite extensively in Euclidean spaces, there is no previous work in the context of large graphs. In this paper, we propose algorithms and optimization techniques for RNN queries by utilizing some characteristics of networks.
Cyclone: an encyclopedic web search site
Authors: Atsushi Fujii, Katunobu Itou, Tetsuya Ishikawa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose a Web search site called "Cyclone", in which a user can retrieve encyclopedic term descriptions on the Web. Cyclone searches the Web for headwords and page fragments describing the headwords. High-quality page fragments are selected as term descriptions and are classified into domains. The number of current headwords is over 700,000.
Mining thick skylines over large databases
Authors: Wen Jin, Jiawei Han, Martin Ester
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

People recently are interested in a new operator, called skyline [3], which returns the objects that are not dominated by any other objects with regard to certain measures in a multi-dimensional space. Recent work on the skyline operator [3,15,8,13,2] focuses on efficient computation of skylines in large databases. However, such work gives users only thin skylines, i.e., single objects, which may not be desirable in some real applications. In this paper, we propose a novel concept, called thick skyline, which recommends not only skyline objects but also their nearby neighbors within -distance. Efficient computation methods are developed including (1) two efficient algorithms, Sampling-and-Pruning and Indexing-and-Estimating, to find such thick skyline with the help of statistics or indexes in large databases, and (2) a highly efficient Microcluster-based algorithm for mining thick skyline. The Microcluster-based method not only leads to substantial savings in computation but also provides a cocise representation of the thick skyline in the case of high cardinalities. Our experimental performance study shows that the proposed methods are both efficient and effective.
A Morphological Tagger for Korean: Statistical Tagging Combined with Corpus-Based Morphological Rule Application
Authors: Chung-Hye Han, Martha Palmer
Venue: Machine Translation (2004)

This paper describes a novel approach to morphological tagging for Korean, an agglutinative language with a very productive inflectional system. The tagger takes raw text as input and returns a lemmatized and morphologically disambiguated output for each word: the lemma is labeled with a part-of-speech (POS) tag and the inflections are labeled with inflectional tags. Unlike the standard approach to tagging for morphologically complex languages, in our proposed approach the tagging phase precedes the analysis phase. It comprises a trigram-based tagging component followed by a morphological rule application component, obtaining 95% precision and recall on unseen test data.
Addressing mode driven low power data caches for embedded processors
Authors: Ramesh V Peri, John Fernando, Ravi Kolagotla
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

The size and speed of first-level caches and SRAMs of embedded processors continue to increase in response to demands for higher performance. In power-sensitive devices like PDAs and cellular handsets, decreasing power consumption while increasing performance is desirable. Contemporary caches typically exploit locality in memory access patterns but do not exploit locality information encoded in addressing modes used to access memory. We present two schemes that use locality information inherent in memory addressing modes to reduce power consumption of cache or SRAM nearest to the processor. The level-0 data buffer scheme introduces a set of data buffers controlled by the addressing mode to eliminate over a third of all reads to the next level of memory (cache or SRAM). These buffers can also reduce load-use penalty in processors with long load pipelines. The address register tag-buffer scheme exploits the addressing mode to reduce tag array look-up in set associative first-level caches.
A GIS-Based Forest Visual Simulation System
Authors: Qizhi Yu, Chongcheng Chen, Zhigeng Pan, Jianwei Li
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper reports on a visual simulation system that supports GIS-based realistic modeling and real-time rendering of forest scenes. Geometric models of trees are automatically generated according to inventory database and pre-designed template models. A combined image and geometry representation method for 3D tree model is given with a specific level of detail algorithm for ensuring real-time frame rates. We have tested and evaluated the system in applications of walkthrough simulation and forest fire visualization.
Effectiveness of end-user debugging software features: are there gender issues?
Authors: Laura Beckwith, Margaret Burnett, Susan Wiedenbeck, Curtis Cook, Shraddha Sorte, Michelle Hastings
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Although gender differences in a technological world are receiving significant research attention, much of the research and practice has aimed at how society and education can impact the successes and retention of female computer science professionals-but the possibility of gender issues within software has received almost no attention. If gender issues exist with some types of software features, it is possible that accommodating them by changing these features can increase effectiveness, but only if we know what these issues are. In this paper, we empirically investigate gender differences for end users in the context of debugging spreadsheets. Our results uncover significant gender differences in self-efficacy and feature acceptance, with females exhibiting lower self-efficacy and lower feature acceptance. The results also show that these differences can significantly reduce females' effectiveness.
A new classification of path-delay fault testability in terms of stuck-at faults
Authors: Subhashis Majumder, Bhargab B. Bhattacharya, Vishwani D. Agrawal, Michael L. Bushnell
Venue: Journal of Computer Science and Technology (2004)

A new classification of path-delay fault testability in a combinational circuit is presented in terms of testability of stuck-at faults in an equivalent circuit. Earlier results describing correlation of path-delay and stuck-at faults are either incomplete, or use a complex model of equivalent circuit based on timing parameters. It is shown here that a path-delay fault (rising or falling) is testable if and only if certain single or multiple stuck-at fault in the equivalent circuit is testable. Thus, all aspects of path-delay faults related to testability under various classification schemes can be interpreted using the stuck-at fault model alone. The results unify most of the existing concepts and provide a better understanding of path-delay faults in logic circuits.
Embedding fuzzy variables into C++
Authors: Daniela Gotseva
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper introduced applying fuzzy sets theory into programming languages and logic. After short introduction the author present new data type in C++: Fuzzy. This is linguistic variable that help programmers to reduce time and cost estimation for software projects. COCOMO II is used for time and cost calculation. New data type is shown in EBNF and simple example is used for time estimation.
A team teaching approach to inclusion of a security component in IS and CS curricula
Authors: James Harris, Maeve Cummings, Felix Dreher, Kailash Chandra
Venue: Journal of Computing Sciences in Colleges (2004)

Issues related to computer security and information assurance are important to everyone who uses information technology and these issues will have a substantial impact on the careers of students pursuing degrees in computer science and information systems. The onus, therefore, is on universities and colleges to include IT security in computer-related curricula. This presents a challenge especially for small departments where faculty members already have full teaching loads supporting service courses and other aspects of the degree programs. This paper describes a team teaching approach used to provide a course in computer security and information assurance for upper level undergraduate students majoring in computer science or information systems. The course format, lab environment, and lab exercises are described. A survey of students shows that students were very receptive to this approach. The team teaching approach allowed the workload required for preparation of the new course to be distributed among several faculty members and it allowed each faculty member to focus on aspects of the course most closely related to their areas of interest.
Reconfigurable Web wrapper agents for biological information integration: Research Articles
Authors: Chun-Nan Hsu, Chia-Hui Chang, Chang-Huain Hsieh, Jiann-Jyh Lu, Chien-Chi Chang
Venue: Journal of the American Society for Information Science and Technology (2005)

A variety of biological data is transferred and exchanged in overwhelming volumes on the World Wide Web. How to rapidly capture, utilize, and integrate the information on the Internet to discover valuable biological knowledge is one of the most critical issues in bioinformatics. Many information integration systems have been proposed for integrating biological data. These systems usually rely on an intermediate software layer called wrappers to access connected information sources. Wrapper construction for Web data sources is often specially hand coded to accommodate the differences between each Web site. However, programming a Web wrapper requires substantial programming skill, and is time-consuming and hard to maintain. In this article we provide a solution for rapidly building software agents that can serve as Web wrappers for biological information integration. We define an XML-based language called Web Navigation Description Language (WNDL), to model a Web-browsing session. A WNDL script describes how to locate the data, extract the data, and combine the data. By executing different WNDL scripts, we can automate virtually all types of Web-browsing sessions. We also describe IEPAD (Information Extraction Based on Pattern Discovery), a data extractor based on pattern discovery techniques. IEPAD allows our software agents to automatically discover the extraction rules to extract the contents of a structurally formatted Web page. With a programming-by-example authoring tool, a user can generate a complete Web wrapper agent by browsing the target Web sites. We built a variety of biological applications to demonstrate the feasibility of our approach. &copy; 2005 Wiley Periodicals, Inc.
Low distortion embeddings for edit distance
Authors: Rafail Ostrovsky, Yuval Rabani
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We show that 0,1d endowed with edit distance embeds into l1 with distortion 2O(√log dlog log d). We further show efficient implementations of the embedding that yield solutions to various computational problems involving edit distance. These include sketching, communication complexity, nearest neighbor search. For all these problems, we improve upon previous bounds.
Parallel divide and conquer approach for the protein threading problem: Research Articles
Authors: Nicola Yanev, Rumen Andonov
Venue: Concurrency and Computation: Practice Experience (2004)

For the Protein Threading Problem (PTP) we propose a network-flow like formulation. We also show its equivalence with a generalization of the shortest path problem on a graph with a very particular structure. The underlying Mixed Integer Programming (MIP) model proves to be very appropriate for the PTP&mdash;large real-life instances have been solved much faster by using only the MIP solver CPLEX instead of a known special-purpose branch and bound algorithm. The properties of the MIP model permit a decomposition of the main problem into a large number of subproblems (tasks). We show that a branch and cut strategy can be efficiently applied for solving these tasks in a parallel manner, which leads to a significant reduction in the total running time. Computational experiments with large problem instances are presented. Copyright &copy; 2004 John Wiley & Sons, Ltd.This work has been done when R. Andonov was on leave with IRISA&sol;INRIA, Rennes
Dimensions and Principles of Declassification
Authors: Andrei Sabelfeld, David Sands
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

Computing systems often deliberately release (or declassify) sensitive information. A principal security concern for systems permitting information release is whether this release is safe: is it possible that the attacker compromises the information release mechanism and extracts more secret information than intended? While the security community has recognised the importance of the problem, the state-of-theart in information release is, unfortunately, a number of approaches with somewhat unconnected semantic goals. We provide a road map of the main directions of current research, by classifying the basic goals according to what information is released, who releases information, where in the system information is released, and when information can be released. With a general declassification framework as a long-term goal, we identify some prudent principles of declassification. These principles shed light on existingdefinitions and may also serve as useful "sanity checks" for emerging models.
Multiscale Connected Operators
Authors: Ulisses Braga-Neto
Venue: Journal of Mathematical Imaging and Vision (2005)

Among the major developments in Mathematical Morphology in the last two decades are the interrelated subjects of connectivity classes and connected operators. Braga-Neto and Goutsias have proposed an extension of the theory of connectivity classes to a multiscale setting, whereby one can assign connectivity to an object observed at different scales. In this paper, we study connected operators in the context of multiscale connectivity. We propose the notion of a ¿-connected operator, that is, an operator connected at scale ¿. We devote some attention to the study of binary ¿-grain operators. In particular, we show that families of ¿-grain openings and ¿-grain closings, indexed by the connectivity scale parameter, are granulometries and anti-granulometries, respectively. We demonstrate the use of multiscale connected operators with image analysis applications. The first is the scale-space representation of grayscale images using multiscale levelings, where the role of scale is played by the connectivity scale. Then we discuss the application of multiscale connected openings in granulometric analysis, where both size and connectivity information are summarized. Finally, we describe an application of multiscale connected operators to an automatic target recognition problem.