ppxscal/embedding_network huggingface dataset:
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
Authors: Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We give O(√log n)-approximation algorithms for the MIN UNCUT, MIN 2CNF DELETION, DIRECTED BALANCED SEPERATOR, and DIRECTED SPARSEST CUT problems. The previously best known algorithms give an O(log n)-approximation for MIN UNCUT [9], DIRECTED BALANCED SEPERATOR [17], DIRECTED SPARSEST CUT [17], and an O(log n log log n)-approximation for MIN 2CNF DELETION [14].We also show that the integrality gap of an SDP relaxation of the MINIMUM MULTICUT problem is Ω(log n).
Solution Envisioning with Capability Cases
Authors: Ralph Hodgson, Irene Polikoff, Robert Coyne, Dean Allemang
Venue:  (2005)

"In this innovative book, Irene Polikoff, Robert Coyne, and Ralph Hodgson have captured deep insights from many years of studying how to get across the 'Business-IT Gap.' Capability Cases are an invaluable tool for bridging from envisioning to design."-Steve Cook, software architect, Microsoft Corporation"Capability Cases offers hope that mere mortals can rise above the daunting challenge of blending technology and process. Executives hoping to adopt high-performing business models will want to learn this step-by-step approach to designing and implementing IT-enabled organizational change."-Dr. Jeanne W. Ross, principal research scientist, MIT Center for InformationBRIDGE THE GAP BETWEEN BUSINESS VISION AND SOFTWARE SOLUTIONBoth IT organizations and business leaders recognize the urgent importance of aligning technology solutions with enterprise strategy. But they've struggled to do so... until now. Capability Cases represents a breakthrough: a powerful, systematic way to translate business vision into effective plans and system designs.The authors' Solution Envisioning methodology addresses the crucial "front end" of software development, where you decide what to build and how you're going to build it. Using realistic examples, they walk you through exploring the capabilities you need, capturing business best practices, identifying optimal solutions, and crafting software systems that deliver them.Solution Envisioning enables you to specify better solutions in less time, build systems that more fully reflect your true needs, and dramatically reduce risk and cost throughout the entire development process. Understand Solution Envisioning-from vision to plan-in three phases: Use Business Capability Exploration (BCE) to build a shared understanding of what is needed in a solution-model your business situation using business forces, desired results, metrics, and scenarios Run Solution Capability Envisioning (SCE) workshops to facilitate decision-making, collaborative assessment, and consolidation of a solution concept-use Capability Case Galleries to discover alternatives, gain context, promote stakeholder interaction, and stimulate creativity Move from concept to business case to a roadmap for realization with Software Capability Design (SCD)Includes easy-to-use "best of class" templates for developing a business case, concept of operations, architectural decisions, and other key work products.Whether you're an executive, architect, project manager, developer, change agent, or consultant, Capability Cases will help you bridge the gap between vision and solution-so you can finally get what you need from information technology.© Copyright Pearson Education. All rights reserved.
Mandarin-English Information (MEI): investigating translingual speech retrieval
Authors: Helen Meng, Berlin Chen, Sanjeev Khudanpur, Gina-Anne Levow, Wai-Kit Lo, Douglas Oard, Patrick Schone Karen Tang, Hsin-Min Wang, Jianqiang Wang
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes the Mandarin-English Information (MEI) project, where we investigated the problem of cross-language spoken document retrieval (CL-SDR), and developed one of the first English-Chinese CL-SDR systems. Our system accepts an entire English news story (text) as query, and retrieves relevant Chinese broadcast news stories (audio) from the document collection. Hence this is a cross-language and cross-media retrieval task. We applied a multi-scale approach to our problem, which unifies the use of phrases, words and subwords in retrieval. The English queries are translated into Chinese by means of a dictionary-based approach, where we have integrated phrase-based translation with word-by-word translation. Untranslatable named entities are transliterated by a novel subword translation technique. The multi-scale approach can be divided into three subtasks -- multi-scale query formulation, multi-scale audio indexing (by speech recognition) and multi-scale retrieval. Experimental results demonstrate that the use of phrase-based translation and subword translation gave performance gains, and multi-scale retrieval outperforms word-based retrieval.
Exploiting WSRF and WSRF.NET for Remote Job Execution in Grid Environments
Authors: Glenn Wasson, Marty Humphrey
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The Web Service Resource Framework (WSRF) was announced in January 2004 as a new way for manipulating "stateful resources" to perform grid computing tasks using Web Services. This paper discusses, to our knowledge, the most complex application built to date utilizing WSRF concepts. We describe a remote job execution system that handles scheduling, data movement, security and inter-job dependencies. The application is built on top of WSRF.NET, the first publicly-available toolkit for constructing WSRF-compliant Web Services. WSRF.NET is an open-source project that implements both the WSRF and WS-Notification family of specifications and runs on the Microsoft .NET platform. Our explicit goal in the effort reportedin this paper is not to replace the existing tools such as GRAM/GlobusRun, MDS and Condor/Condor-G but rather to evaluate--via a concrete implementation--the new capabilities provided for such Grid operations via WSRF. We find that, in general, WSRF and WS-Notification facilitate far richer client-side and server-side interactions than previously accomplished in the state of the art in Grid computing.
Inside PageRank
Authors: Monica Bianchini, Marco Gori, Franco Scarselli
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

Although the interest of a Web page is strictly related to its content and to the subjective readers' cultural background, a measure of the page authority can be provided that only depends on the topological structure of the Web. PageRank is a noticeable way to attach a score to Web pages on the basis of the Web connectivity. In this article, we look inside PageRank to disclose its fundamental properties concerning stability, complexity of computational scheme, and critical role of parameters involved in the computation. Moreover, we introduce a circuit analysis that allows us to understand the distribution of the page score, the way different Web communities interact each other, the role of dangling pages (pages with no outlinks), and the secrets for promotion of Web pages.
Scalable Request Routing with Next-Neighbor Load Sharing in Multi-Server Environments
Authors: Chung-Min Chen, Yibei Ling, Marcus Pang, Wai Chen, Shengwei Cai, Yoshihisa Suwa, Onur Altintas
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Load balancing for distributed servers is a common issue in many applications and has been extensively studied. Several distributed load balancing schemes have been proposed that pro-actively route individual requests to appropriate servers to best balance the load and shorten request response tame. These schemes do not require a centralized load balancer. Instead, each server is responsible for determining, for each request it receives from a client, to which server in the pool the request should be forworded for processing. We propose a new request routing scheme that is more scalable to increasing number of servers and request load than the existing schemes. The method combines random server selection and next-neighbor load sharing techniques that together prevent the staleness of load information from building up when the number of servers increases. Our simulation shows that it outperforms existing schemes under a piggyback-based load update model.
A spoken dialogue system for document information retrieval utilizing topic knowledge
Authors: Shinya Kiriyama, Keikichi Hirose, Nobuaki Minematsu
Venue: Systems and Computers in Japan (2004)

The authors implemented a mechanism for using retrieval field information to promote efficient searching in a spoken dialogue system for document information retrieval tasks. The research focused mainly on the following two points: (1) correctly categorizing the documents in the database into target topics and (2) properly using topic knowledge to promote efficient searching. For point (1), the authors proposed a technique for recursively calculating the relevance score between (retrieval) words and topics (RSW) and the relevance score between documents and topics (RSD). A maximum topic categorization rate of 86.1&percnt; was obtained as a result of experimental investigations. An improvement of 5.0&percnt; from the initial value (81.1&percnt;) due to the recursive calculations showed the effectiveness of the proposed technique. Subjective evaluations were also used to verify the effectiveness of the relevance scores obtained by the proposed technique during practical use. For point (2), the authors compared the proposed system with a system that does not use topic knowledge when the retrieval field was estimated to advance the dialogue. It was apparent that the proposed system could decrease the number of retrieval dialogue interactions and the dialogue interaction period by approximately 20&percnt;, which showed the effectiveness of using topic knowledge for aiding efficient searching. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(5): 67&ndash;82, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10370
Design of a reconfigurable planar parallel manipulator
Authors: R. Fisher, R. P. Podhorodeski, S. B. Nokleby
Venue: Journal of Robotic Systems (2004)

This work presents the design of a reconfigurable planar parallel manipulator (RPPM). The RPPM is designed to act as a testbed manipulator for theories on redundant actuation of parallel manipulators and can reconfigure into three different revolute-jointed mechanism types: a 2-branch 2-DOF (degree-of-freedom) 5-bar mechanism; a 2-branch 3-DOF 6-bar mechanism; and a 3-branch 3-DOF 8-bar mechanism. The design of the RPPM allows for any shoulder or elbow joint to be actuated. In this work, the criteria and constraints of the design are presented. The final design of the RPPM is shown, followed by a discussion of the final design and how it relates to the initial design criteria and constraints. &copy; 2004 Wiley Periodicals, Inc.
Temporal Isolation in Ravenscar-Java
Authors: Hao Cai, Andy Wellings
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

Ravenscar-Java is a subset of Java (augmented by the Real-Time Specification for Java) targeted at high-integrity real-time systems. It has recently been extended to support multiple applications of mixed criticality on the same Java platform. A two level scheduling model is used to achieve temporal isolation between applications. This paper presents the general schedulability analysis for the approach, describes how the approach can be implemented using standard real-time POSIX facilities, illustrates how the analysis can be modified to take into account the implementation, and uses the prototype implementation to evaluate the accuracy of the analysis models.
Loop-dead optimization
Authors: Sachin Shaw, Pawan Kumar
Venue: ACM SIGPLAN Notices (2005)

A loop is a critical part of any program. A loop is normally executed a large number of times, hence if any statement can be moved outside the loop then computation can speed-up. Loop invariant computations have been studied in great detail [1, 2]. Here a computation, which does not change inside the loop (on successive execution of the loop), is done before the loop. Such a computation involves only the loop invariant variables. These are variables, whose value does not change inside the loop.Here we talk about a variable, which changes inside the loop, but only the last value is useful. The computation needed in the definition of this variable can be moved outside the loop (after the loop).Formally a loop-dead variable is that which is defined in the loop but not used in the loop. Later we extend this definition as follows: A loop-dead variable is that which is not used inside the loop except in the definition of the other loop dead variables.
On the Investigation of Stochastic Global Optimization Algorithms
Authors: Bill Baritompa, Eligius M. Hendrix
Venue: Journal of Global Optimization (2005)

This discussion paper for the SGO 2001 Workshop considers the process of investigating stochastic global optimization algorithms. It outlines a general plan for the systematic study of their behavior. It raises questions about performance criteria, characteristics of test cases and classification of algorithms.
Automatic Construction and Evaluation of Performance Skeletons
Authors: Sukhdeep Sodhi, Jaspal Subhlok
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The performance skeleton of an application is a short running program whose execution time in any scenario reflects the estimated execution time of the application it represents. Such a skeleton can be employed to quickly estimate the performance of a large application under existing network and node sharing. This paper presents a framework for automatic construction of performance skeletons of a specified execution time and evaluates their use in performance prediction with CPU and network sharing. The approach is based on capturing the execution behavior of an application and automatically generating a synthetic skeleton program that reflects that execution behavior. The paper demonstrates that performance skeletons running for a few seconds can predict the application execution time fairly accurately. Relationship of skeleton execution time, application characteristics, and nature of resource sharing, to accuracy of skeleton based performance prediction, is analyzed in detail. The goal of this research is accurate performance estimation in heterogeneous and shared computation environments.
Language-Based Generation and Evaluation of NIDS Signatures
Authors: Shai Rubin, Somesh Jha, Barton P. Miller
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

We present a methodology to automatically construct robust signatures whose accuracy is based on formal reasoning so it can be systematically evaluated. Our methodology is based on two formal languages that describe different properties of a given attack. The first language, called a session signature, describes temporal relations between the attack events. The second, called an attack invariant, describes semantic properties that hold in any instance of the attack. For example, an invariant may state that a given FTP attack must include a successful FTP login and can be launched only after the FTP representation mode has been set to ASCII. We iteratively eliminate false positives and negatives from an initial session signature by comparing the signature language to the language of the invariant. We developed GARD, a tool for session-signature construction, and used it to construct session signatures for multi-step attacks. We show that a session signature is more accurate than existing signatures.
The role of digital logic in the computer science curriculum
Authors: Richard Connelly, Michael B. Gousie, Haldun Hadimioglu, Lubomir Ivanov, Mark Hoffman
Venue: Journal of Computing Sciences in Colleges (2004)

This panel is concerned with the diminished representation of digital logic in the undergraduate Computer Science curriculum. The number of core hours allocated to digital logic and digital systems topics has been significantly decreased, and shifted to assembly level architecture topics, and assembly language. Given this situation, it is reasonable to ask: How important is digital logic to future Computer Scientists? The panel begins by taking up this question. For those who maintain, that digital logic is critical, the panel considers how to provide more coverage, the value of digital logic labs, and a balance with assembly language programming.
Selected AI-related dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 88 (April 1984) (1984)

The following are citations selected by title and abstract as being related to Al, resulting from a computer search on the BRS retrieval system of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Qubit neural network and its learning efficiency
Authors: Noriaki Kouda, Nobuyuki Matsui, Haruhiko Nishimura, Ferdinand Peper
Venue: Neural Computing and Applications (2005)

Neural networks have attracted much interest in the last two decades for their potential to realistically describe brain functions, but so far they have failed to provide models that can be simulated in a reasonable time on computers; rather they have been limited to toy models. Quantum computing is a possible candidate for improving the computational efficiency of neural networks. In this framework of quantum computing, the Qubit neuron model, proposed by Matsui and Nishimura, has shown a high efficiency in solving problems such as data compression. Simulations have shown that the Qubit model solves learning problems with significantly improved efficiency as compared to the classical model. In this paper, we confirm our previous results in further detail and investigate what contributes to the efficiency of our model through 4-bit and 6-bit parity check problems, which are known as basic benchmark tests. Our simulations suggest that the improved performance is due to the use of superposition of neural states and the use of probability interpretation in the observation of the output states of the model.
Hpcbench " A Linux-Based Network Benchmark for High Performance Networks
Authors: Ben Huang, Michael Bauer, Michael Katchabaw
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

In recent years, Linux-based clusters have become more prevalent as a basis for High Performance Computing (HPC) systems. Network performance analysis is crucial to the management and administration of such clusters. To assist in this process, we developed Hpcbench [8] to measure UDP, TCP and MPI communications over high performance networks. Hpcbench records and tracks experiment results and system statistics, facilitating detailed analyses of network behaviour. In this paper, we introduce the design and prototype implementation of Hpcbench, and demonstrate Hpcbench in evaluating the network performance of three high performance interconnects in HPC clusters: Gigabit Ethernet, Myrinet, and Quadricsý QsNet.
Limits to list decoding Reed-Solomon codes
Authors: Venkatesan Guruswami, Atri Rudra
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

In this paper, we prove the following two results that expose some combinatorial limitations to list decoding Reed-Solomon codes.Given n distinct elements α1,...,αn from a field F, and n subsets S1,...,Sn of F each of size at most l, the list decoding algorithm of Guruswami and Sudan [7] can in polynomial time output all polynomials p of degree at most k which satisfy p(αi) ∈ Si for every i, as long as l < ⌈ n/k ⌉. We show that the performance of this algorithm is the best possible in a strong sense; specifically, we show that when l = ⌈ n/k ⌉, the list of output polynomials can be super-polynomially large in n. One way to interpret our result is the following. The algorithm in [7] can, when given as input $n'$ distinct pairs (βi,∈i) ∈ F2 (the βi's need not be distinct), find and output all degree k polynomials p such that p(βi) = γi for at least $t$ values of i, provided t > √k n'. By our result, an improvement to the Reed-Solomon list decoder of [7] that works with slightly smaller agreement, say t > √kn' - k/2, can only be obtained by exploiting some property of the βi's (for example, their (near) distinctness).For Reed-Solomon codes of block length $n$ and dimension k where k = nδ for small enough δ, we exhibit an explicit received word r with a super-polynomial number of Reed-Solomon codewords that agree with it on $(2 - ε) k locations, for any desired ε > 0 (we note agreement of k is trivial to achieve). Such a bound was known earlier only for a non-explicit center. We remark that finding explicit bad list decoding configurations is of significant interest --- for example the best known rate vs. distance trade-off is based on a bad list decoding configuration for algebraic-geometric codes [14] which is unfortunately not explicitly known.
Spam Blocking with a Dynamically Updated Firewall Ruleset
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

In this paper, we detail our methods for controlling spam at a small ISP, reducing both resource usage and customer complaints. We will discuss our initial unsuccessful tactics, and the resulting development of our unique spam blocking system. Deny-Spammers classifies hosts as probable spammers and inserts those hosts into a dynamically updated firewall ruleset on our mail server, thereby effectively blocking the host from making an SMTP connection to our mail server. Our analysis demonstrates that this has been effective in reducing the amount of spam that our customers receive, and the burden on our limited resources.
Design of a cell library for asynchronous microengines
Authors: Gaurav Gulati, Erik Brunvand
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Asynchronous microengines are an attractive alternative to globally synchronous systems for the realization of high performance programmable controllers. However, because of the specific demands of asynchronous signaling, it is not always easy to use existing standard cell libraries to implement asynchronous microengines. In this paper we present the design and evaluation of a CMOS cell set that augments a generic cell library with cells specific to the design of asynchronous microengines. These cells encapsulate behavior and timing information critical to the implementation of asynchronous microengine controllers. These special purpose cells result in higher performance circuits, and in a significant reduction in design time over a generic library. To validate the library, the control path of a popular asynchronous controller benchmark has been designed and fabricated through MOSIS.