ppxscal/embedding_network huggingface dataset:
Analysis of Task Assignment with Cycle Stealing under Central Queue
Authors: Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, Alan Scheller-Wolf, Mark S. Squillante
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We consider the problem of task assignment in a distributedserver system, where short jobs are separated fromlong jobs, but short jobs may be run in the long job partitionif it is idle (cycle stealing). Jobs are assumed to be non-preemptible,where short and long jobs have generally-distributedservice requirements, and arrivals are Poisson.We consider two variants of this problem: a centralqueue model and an immediate dispatch model. This paperpresents the first analysis of cycle stealing under thecentral-queue model. (Cycle stealing under the immediatedispatch model is analyzed in [9]). The analysis usesa technique which we refer to as busy period transitions.Results show that cycle stealing can reduce mean responsetime for short jobs by orders of magnitude, while long jobsare only slightly penalized. Furthermore using a centralqueue yields significant performance improvement over immediatedispatch, both from the perspective of the benefit toshort jobs and the penalty to long jobs.
The Honeynet Project: Trapping the Hackers
Authors: Lance Spitzner
Venue: IEEE Security and Privacy (2003)

One of the greatest challenges we face within the security community is information about the threats we face specifically, who the threats are, how they operate, and why. The Honeynet Project is an organization attempting to change that. Comprised of volunteers from around the world, the Honeynet Project is dedicated to studying the bad guys and sharing the lessons learned. The group gathers information by deploying networks (called honeynets) around the world to be compromised. This article details what a honeynet is, how the Honeynet Project works, gives examples of the information collected, and describes a future plan for distributed honeynet deployment.
An Infinite Pebble Game and Applications
Authors: A. J. Kfoury, A. P. Stolboushkin
Venue:  (1996)

Abstract We generalize the well-known pebble game to infinite dag''s, and we use this generalization to give new and shorter proofs of results in different areas of computer science (as diverse as ``logic of programs'''' and ``formal language theory''''). Our applications here include a proof of a theorem due to Salomaa, asserting the existence of a context-free language with infinite index, and a proof of a theorem due to Tiuryn and Erimbetov, asserting that unbounded memory increases the power of logics of programs. The original proofs by Salomaa, Tiuryn, and Erimbetov, are fairly technical. The proofs by Tiuryn and Erimbetov also involve advanced techniques of model theory, namely, back-and-forth constructions based on a variant of Ehrenfeucht-Fraisse games. By contrast, our proofs are not only shorter, but also elementary. All we need is essentially finite induction and, in the case of the Tiuryn-Erimbetov result, the compactness and completeness of first-order logic.
An O(N)Supply Voltage Assignment Algorithm for Low-Energy Serially Connected CMOS Modules and a Heuristic Extension to Acyclic Data Flow Graphs
Authors: Abdulkadir Utku Diril, Yuvraj Singh Dhillon, Kyu-won Choi, Abhijit Chatterjee
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In this paper, a novel algorithm is proposed for assigningsupply voltages to serially executing functional units(FUs) in a digital system such that the overall dynamicenergy consumption is minimized for a given timingconstraint. Novel closed form expressions for optimumsupply voltage values are presented. The computationtime of the algorithm is O(N)for N FUs in series. Anextension of the O(N) algorithm is proposed foroptimizing the acyclic data flow graph associated withany given task. Given the number of FUs available for thetask, the operations required for the task are scheduled onthe FUs. Voltages are then assigned to the FUs on eachpath of the flow graph using the O(N) algorithm. Energysavings of 10-60% are achieved on DSP filter designsusing the proposed high-level optimization methodologyover single supply voltage designs.
Local quartet splits of a binary tree inferall quartet splits via one dyadic inference rule
Authors: Peter L. Erdos, Michael A. Steel, Laszlo A. Szekely, Tandy J. Warnow
Venue:  (1996)

A significant problem in phylogeny is to reconstruct a \slb\ tree from few valid quartet splits of it. It is well-known that every \slb\ tree is determined by its set of all valid quartet splits. Here we strengthen this result by showing that its local (i.e. small diameter) quartet splits infer by a dyadic inference rule all valid quartet splits, and hence determine the tree. The results of the paper also present a polynomial time algorithm to recover the tree.
An effort estimation model for implementing ISO 9001
Authors: S. Rahhal, N. H. Madhavji
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

A major concern for organizations who are seeking registration to ISO 9000, or seeking the implementation of any quality related process, is the ability to estimate the work/effort required for meeting the stated requirements. This is an a priori requirement in corporate decision making, regardless of the maturity level of the organization (W.S. Humphrey, 1989), the current state of the quality system, or the extent to which the organization complies to the requirements of the ISO 9000 standard. The paper presents a statistical regression model that predicts the effort required for meeting the requirements of ISO 9001. We carried out a survey in February 1995, which was sent to 1190 organizations in North America. We had a 38.8% response (462 responses). The effort estimation model we present is for ISO 9001 (all industries), and is based on the 112 responses we had from ISO 9001 registered organizations. Subsequent models for ISO 9001 (software), ISO 9002 and ISO 9003 are being built using the remaining data.
Numerical solution by energy minimization of hyperelastic membrane in large displacements and finite strains
Authors: R. Bouzidi, A. Le Van
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this work, a numerical approach is presented for solving problems of finitely deformed membrane structures made of quasi-incompressible hyperelastic material and subjected to external pressure loadings. Instead of following the usual finite element procedure that requires computing the geometric stiffness and large displacement matrices, here we solve the membrane structures by directly minimizing the total potential energy, which proves to be a more robust and efficient technique.The numerical computations are performed over two geometries - the circular and the rectangular membranes - with different material behaviors - isotropic linear or orthotropic linear or nonlinear elasticity. Whenever available, analytical or semi-analytic solutions are used to validate the finite element results.
Collision Detection for Interactive Graphics Applications
Authors: Philip M. Hubbard
Venue:  (1995)

Solid objects in the real world do not pass through each other when they collide. Enforcing this property of ``solidness'''' is important in many interactive graphics applications; for example, solidness makes virtual reality more believable, and solidness is essential for the correctness of vehicle simulators. These applications use a collision-detection algorithm to enforce the solidness of objects. Unfortunately, previous collision-detection algorithms do not adequately address the needs of interactive applications. To work in these applications, a collision-detection algorithm must run at real-time rates, even when many objects can collide, and it must tolerate objects whose motion is specified ``on the fly'''' by a user. This dissertation describes a new collision-detection algorithm that meets these criteria through approximation and graceful degradation, elements of ``time-critical computing.'''' The algorithm is not only fast but also interruptible, allowing an application to trade accuracy for speed as needed. The algorithm uses two forms of approximate geometry. The first is a four-dimensional structure called a ``space-time bound.'''' This structure provides a conservative estimate of where an object may be in the immediate future based on estimates of the object''s acceleration. The algorithm uses space-time bounds to focus its attention on objects that are likely to collide. The second form of approximate geometry is a ``sphere-tree.'''' This structure contains a hierarchy of unions of spheres, each union approximating the three-dimensional surface of an object at a different level of detail. Sphere-trees allow the algorithm to quickly find approximate contacts between objects, and they allow the application to interrupt the algorithm in order to meet real-time performance goals. Automatically building sphere-trees is an interesting problem in itself, and this dissertation describes several approaches. The simplest approach is based on octrees, and more sophisticated approaches use simulated annealing and approximate medial-axis surfaces. Several of the steps in these algorithms are themselves significant. One step is a simple algorithm for checking whether a union of two-dimensional shapes covers a polygon. Another step builds Voronoi diagrams for three-dimensional data points, and does so more robustly and accurately than previous algorithms. An implementation of the collision-detection algorithm runs significantly faster than a previous algorithm in empirical tests. In particular, this implementation allows real-time performance in a sample application (a simple flight simulator) that is too slow with the previous algorithm; in some cases, the performance improves by more than two orders of magnitude. Experience with this sample application suggests that time-critical computing is not always simple to apply, but it provides enough benefits that it deserves further exploration in other contexts.
Reasoning About Programs by Exploiting the Environment
Authors: Limor Fix, Fred B. Schneider
Venue:  (1994)

A method for making aspects of a computational model explicit in the formulas of a programming logic is given. The method is based on a new notion of environment -an environment augments the state transitions defined by a program''s atomic actions rather than being interleaved with them. Two simple semantic principles are presented for extending a programming logic in order to reason about executions feasible in various environments. The approach is illustrated by (i) discussing a new way to reason in TLA and Hoare-style programming logics about real-time and by (ii) deriving the first TLA and Hoare-style proof rules for reasoning about schedulers.
Symbolic Model Checking for Sequential Circuit Verification
Authors: Jerry R. Burch, Edmund M. Clarke, David E. Long, Kenneth L. McMillan, David L. Dill
Venue:  (1993)

The temporal logic model checking algorithm of Clarke, Emerson, and Sistla is modified to represent state graphs using binary decision diagrams (BDDs) and partitioned transition relations. Because this representation captures some of the regularity in the state space of circuits with data path logic, we are able to verify circuits with an extremely large number of states. We demonstrate this new technique on a synchronous pipelined design with approximately 5 x 10^120 states. Our model checking algorithm handles full CTL with fairness constraints. Consequently, we are able to express a number of important liveness and fairness properties, which would otherwise not be expressible in CTL. We give empirical results on the performance of the algorithm applied to both synchronous and asynchronous circuits with data path logic.
Generating Efficient Simulators from a Specification Language
Authors: Fredrik Larsson
Venue:  (2001)

A simulator is a powerful tool for hardware as well as software development. However, implementing an efficient simulator by hand is a very labour intensive and error-prone task. This paper describes a tool for automatic generation of efficient instruction set architecture (ISA) simulators. A specification file describing the ISA is used as input to the tool. Besides a simulator, the tool also generates an assembler and a disassembler for the architecture. We present a method where statistics is used to identify frequently used instructions. Special versions of these instructions are then created by the tool in order to speed up the simulator. With this technique we have generated a SPARC V8 simulator which is more efficient than our hand-coded and hand-optimized one.
DFT calculation of the generalized and Drazin inverse of a polynomial matrix
Authors: N. P. Karampetakis, S. Vologiannidis
Venue: Applied Mathematics and Computation (2003)

A new algorithm is presented for the determination of the (a) generalized inverse and (b) Drazin inverse, of a polynomial matrix. The proposed algorithms are based on the discrete Fourier transform and thus are computationally fast in contrast to other known algorithms. The above algorithms are implemented in the Mathematica programming language and illustrated via examples.
Genetic Encoding of Agent Behavioral Strategy
Authors: Stephane Calderoni, Pierre Marcenac, Remy Courdier
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

The general framework tackled in this paper is the automatic generation of intelligent collective behaviors using genetic programming and reinforcement learning. We define a behavior-based system relying on automatic design process using artificial evolution to synthesize high level behaviors for autonomous agents. Behavioral strategies are described by tree-based structures, and manipulated by genetic evolving processes. Each strategy is dynamically evaluated during simulation, and is weighted by an adaptation function as a quality factor that reflects its relevance as good solution for the learning task. It is computed using heterogeneous reinforcement techniques associating immediate reinforcements and delayed reinforcements as dynamic progress estimators.
Criteria for Testing Exception-Handling Constructs in Java Programs
Authors: Saurabh Sinha, Mary Jean Harrold
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Exception-handling constructs provide a mechanism for raising exceptions and a facility for designating protected code by attaching exception handlers to blocks of code. Despite the frequency of their occurrences, the behavior of exception-handling constructs is often the least understood and poorly tested part of a program.The presence of such constructs introduces new structural elements, such as control-flow paths, in a program. To adequately test such programs, these new structural elements must be considered for coverage during structural testing.In this paper, we describe a class of adequacy criteria that can be used to test the behavior of exception-handling constructs. We present a subsumption hierarchy of the criteria, and illustrate the relationship of the criteria to those found in traditional subsumption hierarchies.We describe techniques for generating the testing requirements for the criteria using our control-flow representations. We also describe a methodology for applying the criteria to unit and integration testing of programs that contain exception-handling constructs.
The Software Product Evaluation Data Base? Supporting MEDE-PROS
Authors: M. Martinez, G. Azevedo, S. Lopes, P. Pagliuso, R. Colombo, M. Rodrigues, M. Jino
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The growing demand for services of software product evaluation at the CTI in recent years has sustained the motivation for research and development aimed to build an Environment for Software Product Quality Evaluation AAPQS (Ambiente para Avaliação de Qualidade de Produto de Software). To provide effective support to the application of an evaluation method, the AAPQS is based on the Evaluation Data Base which stores all data concerning software product evaluations. The Evaluation Data Base is described and examples of its utilization are presented.
Systems and Policies for the Global Learning Economy
Authors: David V. Gibson, Chandler Stolp, Pedro Conceicao, Manuel V. Heitor
Venue:  (2003)

:The 21st century is widely considered a time when value will be based on knowledge and human capital. This book explores the "new economy" in essays by scholars and researchers from around the world who look at local, regional, national, and transnational patterns that might be successfully employed elsewhere.
Computing approximate blocking probabilities for a class of all-optical networks
Authors: A. Birman
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Studies a class of all-optical networks using wavelength division multiplexing and wavelength routing in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path. Moreover, on the links of that path no other connection can share the assigned wavelength. Using a generalized reduced load approximation scheme the authors calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing.
Low-Delay Heuristic Algorithms for Wavelength Assignments in WDM Networks
Authors: Gangxiang Shen, Sanjay K. Bose, Cheng Tee Hiang
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In order to decrease the overall wavelength number required in a Wavelength Division Multiplexed (WDM) network, new heuristic algorithms for wavelength assignment are proposed in this paper. We also define a new parameter called one-wavelength-decrease cost, which may be used to evaluate the efficiency of these algorithms. Comparative simulation studies have been carried out to investigate the effectiveness of the proposed algorithms.
Application of default reasoning to semantic processing under
Authors: Ourioupina Olga, Galitsky Boris
Venue:  (2001)

We build the natural language question-answering system, where the query representation formula is subject to transformation in accordance to the set of default rules. This transformation is required to disambiguate entities in a vertical domain, where they usually have a principle meaning and a set of foreign ones. Default reasoning is discussed to be applicable to a variety of semantic processing algorithms, including the semantic header approach. Using default rules can be referred as pragmatic machinery, complementary to syntactic and semantic processing of complex queries in a vertical domain. The methodology of building the set of default rules is developed, capable of adding the essential entities or eliminating misleading ones to the representation of input query. Implementation of operational semantics for default reasoning is suggested to transform the query representation by means of conflicting default rules. Technique of the keyword-based question answering is developed, where default rules link the set of potential queries with the initially coded canonical ones. The task of automatic annotation is then posed as building the set of keywords semantic headers and the set of canonical semantic headers for an answer. Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/2001/2001-16.ps.gz
A Comprehensive Dynamic Processor Allocation Scheme for Multiprogrammed Multiprocessor Systems
Authors: Iffat H. Kazi, David J. Lilja
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Parallel execution of application programs on a multiprocessor system may lead to performance degradation if the workload of a parallel region is not large enough to amortize the overheads associated with the parallel execution. Furthermore, if too many processes are running on the system in a multiprogrammed environment, the performance of the parallel application may degrade due to resource contention. We propose a comprehensive dynamic processor allocation scheme that takes both program behavior and system load into consideration when dynamically allocating processors. We implemented this mechanism in the Java run-time system on Solaris to dynamically control the execution of parallel Java application programs. Performance results show the effectiveness of this scheme in dynamically adapting to the current execution environment and that it outperforms a conventional time-shared system.
The Organization of Information, 2 edition
Authors: Arlene G. Taylor
Venue:  (2003)

:After tracing the development of the organization of recorded information in Western civilization from 2000 B.C.E. to the present, the author addresses topics that include encoding standards (MARC, SGML, and various DTDs), metadata (description, access, and access control), verbal subject analysis including controlled vocabularies and ontologies, classification theory and methodology, arrangement and display, and system design. This work provides a solid introduction to information organization in all types of environments. 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
Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling
Authors: Akihiro Kishimoto, Jonathan Schaeffer
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The aβ algorithm for two-player game-tree search has a notorious reputation as being a challenging algorithm for achieving reasonable parallel performance. MTD(f), a new aβ variant, has become the sequential algorithm of choice for practitioners. Unfortunately, MTD(f) inherits most of the parallel obstacles of aβ, as well as creating new performance hurdles. Transposition-table-driven scheduling (TDS) is a new parallel search algorithm that has proven to be effective in the single-agent (one-player) domain. This paper presents TDSAB, the first time TDS parallelism has been applied to two-player search (the MTD(f) algorithm). Results show that TDSAB gives comparable speedups to that achieved by conventional parallel aβ algorithms. However, since this is a parallelization of a superior sequential algorithm, the results in fact are better. This paper shows that the TDS idea can be extended to more challenging search domains.