ppxscal/embedding_network huggingface dataset:
Horn Minimization by Iterative Decomposition
Authors: Endre Boros, Ondrej Cepek, Alexander Kogan
Venue:  (1997)

The problem of Horn minimization can be stated as follows: given a Horn CNF representing a Boolean function $f$, find a CNF representation of $f$ which consists of a minimum possible number of clauses. This problem is the formalization of the problem of knowledge compression for speeding up queries to propositional Horn expert systems, and it is known to be NP-hard. In this paper we present a linear time algorithm which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimization problem on a ``shorter" CNF. The correctness of this decomposition algorithm rests on several interesting properties of Horn functions which, as we prove here, turn out to be independent of the particular CNF representations.
Payoff-Based Communication Adaptation Based on Network Service Availability
Authors: Robin Kravets, Ken Calvert, Karsten Schwan
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Interactive applications will continue to push the limits of available network bandwidths, processing speeds, and other computing resources. These applications present challenges concerning the specification of service requirements for their multiple types of data transfer and the online management of service quality. In this paper, we present a cooperative solution in which a configurable communication layer is used to adapt communication in response to both application requirements and network resource availability. Adaptation decisions are based on (1) {\em payoff functions} which capture the requirements of the application in a functional form, and (2) {\em service availability curves} which represent network resource availability. Experimentation with representative multimedia applications demonstrates the benefit of using such payoff-based adaptation.
ZYGLOTRON - The Software Behavioral Simulator for BLITZEN
Authors: B J Rosenberg, D J Becher, F N Hooke
Venue:  (1987)

This document is intended for those involved in development and maintenance of the simulator and those interested in using it. Intimate knowledge of the NASA/MCNC {\em BLITZEN} architecture is assumed. Readers are directed to the document {\em Processing Element and Custom Chip Architecture for BLITZEN - The MCNC Massively Parallel Processor}, by Edward Davis, for this information.
Homeomorphic embedding for online termination of symbolic methods
Authors: Michael Leuschel
Venue: The essence of computation: complexity, analysis, transformation (2002)

Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of techniques for program analysis, specialisation, transformation, and verification. In this paper we survey and discuss this use of homeomorphic embedding and clarify the advantages of such an approach over one using well-founded orders. We also discuss various extensions of the homeomorphic embedding relation. We conclude with a study of homeomorphic embedding in the context of metaprogramming, presenting some new (positive and negative) results and open problems.
On the Economics of Multicasting
Authors: Shavitt Yuval, Winkler Peter, Wool Avishai
Venue:  (2000)

A supplier of multicast information services will often be faced with the following problem: Broadcasting to the whole customer base (including non-paying customers) is cheaper than multicasting only to the paying customers. However, broadcasting discourages potential customers from paying. The result is an economic game in which the supplier tries to maximize profit in the face of rational, but not omniscient, behavior by customers. In this work we build a model for such environments, which we believe is both reasonably realistic and amenable to mathematical analysis. The supplier''s basic strategy is to broadcast every service for which the fraction of subscribed customers exceeds some threshold. We then model the customers'' behavior, taking into account the possibility of customers receiving services for free. From this model, coupled with some mild assumptions on the supplier''s cost structure, we can find the optimal setting of the supplier''s broadcast threshold. The solution necessarily depends on choosing functions which describe the customers'' utility for the offered services; we study in detail several such choices. In all the examples we studied, our model predicts that the supplier''s profits will be maximized if the supplier''s broadcast threshold is set below 100%: The loss in revenue due to customers subscribing to fewer services is offset by the cost savings made possible by broadcasting the most popular services to all customers. We found our model to be fairly robust with respect to parameter choices. As such, we believe it can be of value to a supplier in devising a multicast/broadcast strategy, and that broadcasting when subscriptions are sufficiently high is likely to be the approach of choice in maximizing profits.
ClawZ: Control Laws in Z
Authors: R. Arthan, P. Caseley, C. O'Halloran, A. Smith
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

ClawZ is a prototype tool whose objective is to link the Simulink R control-engineering tool, from MathWorks, with the ProofPower R dialect of Z. It provides a bridge between the use of Simulink to define control law diagrams and a tool to formally prove compliance between Ada and Z. The tool has been used as part of the formal proof of a Non-linear Dynamic Inversion flight control system comprising 37 pages of diagrams, 45 pages of Z and 1200 lines of non-comment Ada.
Blinx: Prima's Official Strategy Guide
Authors: Elizabeth Hollinger
Venue:  (2002)

:Time is on Your Side! ·Maps of every time-warping level ·Locations of all hidden Cat Medals ·Expert strategies for defeating every Time Monster ·Tips and tactics to master the Time Sweepers ·Essential strategies for saving the Time Factory and the princess!
Monte Carlo Optimization of Trial Wave Functions in Quantum Mechanics and Statistical Mechanics
Authors: M. P. Nightingale, C. J. Umrigar
Venue:  (1996)

This review covers applications of quantum Monte Carlo methods to quantum mechanical problems in the study of electronic and atomic structure, as well as applications to statistical mechanical problems both of static and dynamic nature. The common thread in all these applications is optimization of many-parameter trial states, which is done by minimization of the variance of the local energy or, more generally for arbitrary eigenvalue problems, minimization of the variance of the configurational eigenvalue.
Client-Based Logging: A New Paradigm For Distributed Transaction Management
Authors: Euthimios Panagos
Venue:  (1996)

Abstract The proliferation of inexpensive workstations and networks has created a new era in distributed computing. At the same time, non-traditional applications such as computer-aided design (CAD), computer-aided software engineering (CASE), geographic- information systems (GIS), and office-information systems (OIS) have placed increased demands for high-performance transaction processing on database systems. The combination of these factors gives rise to significant challenges in the design of modern database systems. In this thesis, we propose novel techniques whose aim is to improve the performance and scalability of these new database systems. These techniques exploit client resources through client-based transaction management. Client-based transaction management is realized by providing logging facilities locally even when data is shared in a global environment. This thesis presents several recovery algorithms which utilize client disks for storing recovery related information (i.e., log records). Our algorithms work with both coarse and fine-granularity locking and they do not require the merging of client logs at any time. Moreover, our algorithms support fine-granularity locking with multiple clients permitted to concurrently update different portions of the same database page. The database state is recovered correctly when there is a complex crash as well as when the updates performed by different clients on a page are not present on the disk version of the page, even though some of the updating transactions have committed. This thesis also presents the implementation of the proposed algorithms in a memory-mapped storage manager as well as a detailed performance study of these algorithms using the OO1 database benchmark. The performance results show that client- based logging is superior to traditional server-based logging. This is because client-based logging is an effective way to reduce dependencies on server CPU and disk resources and, thus, prevents the server from becoming a performance bottleneck as quickly when the number of clients accessing the database increases.
Trial Results from a Custom Distance Learning System Based on Hybridization of CD-ROM, Web, and Active-X Component Technology
Authors: Carlos R. Morales
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper provides results from the first trial of the implementation of a distance learning system developed by the authors. A short instructional lesson was delivered to twenty-eight geographically dispersed students through a variety of connection speeds ranging from dial-up 56Kbs to dedicated T1 1.45 Megabit connection. The system strives to provide the same media delivery capabilities available in a traditional classroom by integrating CD-ROM, Web, and Active-X technologies. Using embedded ActiveX objects within a Macromedia Director shell, the system renders web content within the Director interface, interfaces with ASP databases, delivers MPEG-I full-screen full-motion video on demand, automatically transcribe lectures, and multicast live video. The system provides mechanisms for homework, tests, live lectures, video on demand lectures, and software demos. Macromedia Director is used as the anchor application, Macromedia Multiuser Server for TCP/IP calls, Microsoft Media Services for live video streaming, Microsoft's Web rendering Active-X component for web access, and Microsoft's NetMeeting Active-X component for application sharing. 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
Soft resource reservation: A flexible guarantee of QoS
Authors: G. Chakraborty, N. Shiratori
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Much research efforts are presently involved in developing network protocols suitable for multimedia services through LAN and even Internet. Due to large size and time sensitiveness of data, it is usually a hard task to deliver the services up to the expectations of the users. But the basic intention of the user, for the multimedia services, usually have a wide scope for tolerance and flexibility. If that flexibility is explored and exploited, it is possible to basically satisfy the user even with marginal resources. It is important to intelligently interpret user's request as well as distribute the system and network resources optimally. In this paper we are proposing an Intelligent Soft Resource Reservation Protocol (ISORRP) for realizing acceptable running quality of application by intelligent interpretation of users' requests and optimum distribution of available resources among them. In this architecture QoS to a session is only flexibly guaranteed but always to a level acceptable to the user.
Retrieve of images by content
Authors: C. Djeraba, I. Savory, H. Briand
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In this paper, we present an approach of image retrieval by content in an object oriented database. The content of image includes automatically extracted features such as colors, textures, and manually extracted features such as relevant regions, shapes, key words and texts. All these features and their behaviors are represented in an object-oriented database. Finally a KD-tree is used to model the inner of features, and to support efficiently the match engine.
A Simple near-Horn Prolog Interpreter
Authors: T B Smith, W D Loveland
Venue:  (1988)

We describe a simple interpreter for {\em near-Horn Prolog (nH-Prolog)}, an extension of Prolog that allows multiple-head clauses and negated facts. Our interpreter demonstrates that the operational semantics of nH-Prolog is as simple as originally promised - indeed, quite close to Prolog. We present the inner loop of our interpreter in the form of a Prolog meta-interpreter. The performance of this simple interpreter (within a factor of 4 of the underlying Prolog system on interpreting definite clause programs) is sufficient to experiment with nH-Prolog programming. The design of the interpreter suggests that inner loop speed close to Prolog''s is possible.
Statistical Rate Monotonic Scheduling
Authors: Alia Atlas, Azer Bestavros
Venue:  (1998)

Abstract In this paper we present Statistical Rate Monotonic Scheduling (SRMS), a generalization of the classical RMS results of Liu and Layland that allows scheduling periodic tasks with highly variable execution times and statistical QoS requirements. Similar to RMS, SRMS has two components: a feasibility test and a scheduling algorithm. The feasibility test for SRMS ensures that using SRMS'' scheduling algorithms, it is possible for a given periodic task set to share a given resource (e.g. a processor, communication medium, switching device, etc.) in such a way that such sharing does not result in the violation of any of the periodic tasks QoS constraints. The SRMS scheduling algorithm incorporates a number of unique features. First, it allows for fixed priority scheduling that keeps the tasks'' value (or importance) independent of their periods. Second, it allows for job admission control, which allows the rejection of jobs that are not guaranteed to finish by their deadlines as soon as they are released, thus enabling the system to take necessary compensating actions. Also, admission control allows the preservation of resources since no time is spent on jobs that will miss their deadlines anyway. Third, SRMS integrates reservation-based and best-effort resource scheduling seamlessly. Reservation-based scheduling ensures the delivery of the minimal requested QoS; best-effort scheduling ensures that unused, reserved bandwidth is not wasted, but rather used to improve QoS further. Fourth, SRMS allows a system to deal gracefully with overload conditions by ensuring a fair deterioration in QoS across all tasks---as opposed to penalizing tasks with longer periods, for example. Finally, SRMS has the added advantage that its schedulability test is simple and its scheduling algorithm has a constant overhead in the sense that the complexity of the scheduler is not dependent on the number of the tasks in the system. We have evaluated SRMS against a number of alternative scheduling algorithms suggested in the literature (e.g. RMS and slack stealing), as well as refinements thereof, which we describe in this paper. Consistently throughout our experiments, SRMS provided the best performance. In addition, to evaluate the optimality of SRMS, we have compared it to an inefficient, yet optimal scheduler for task sets with harmonic periods.
A control problem for affine dynamical systems on a full-dimensional simplex
Authors: L. C.G.J.M. Habets, Jan H. Schuppen
Venue:  (2000)

Given an affine system on a simplex, the problem of reaching a particular facet of the simplex, using affine state feedback is studied. Necessary and sufficient conditions for the existence of a solution are derived in terms of linear inequalities on the input vectors at the vertices of the simplex. If these conditions are met, a constructive procedure yields an affine feedback control law, that solves this reachability problem.
Extended quadrature rules for oscillatory integrands
Authors: KyungJoong Kim, Ronald Cools, L. Gr. Ixaru
Venue: Applied Numerical Mathematics (2003)

We consider the integral of a function y(x), I[y] = ∫-11y(x)dx and its approximation by a quadrature rule of the form QN[Y] = Σk=1N(wk(0)y(xk) + wk(1)y(1)(xk)+...+wk(p)y(p)(xk)), i.e., by a rule which uses the values of both y and its derivatives up to p-th order at the nodes of the quadrature rule. We focus only on the case when the nodes are assumed known and present the procedure to calculate the weights. Two cases are actually examined: (i) y(x) is a polynomial and (ii) y(x) is an ω dependent function of the form y(x) = f1 (x) sin(ωx) + f2(x) cos(ωx) with smoothly varying f1 and f2. For the latter case, the weights wkj (j = 0, 1 ....., p) are ω dependent. A series of specific properties for this case is established and a numerical illustration is given.
Dynamic Multicast Routing in Advance Resource Reservation Environment
Authors: Chotipat Pornavalai, Debasish Chakraborty, Norio Shiratori, Goutam Chakraborty
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Since usually the network resource is limited, the abilities to do resource reservation in advance, as well as efficient dynamic multicasting when destination nodes can join and leave the group during the communication period, are essential in all distributed multi-party applications. Total or partial rerouting of multicast tree for dynamic multicast groups can optimize the tree cost to some extent but they are complex. Furthermore, optimal multicast r outing has been proved an NP-complete problem. In this paper, we propose an efficient dynamic multicast routing algorithm, which optimize the total cost of the Steiner tree over the whole session period in advance resource reservation environment, where information about the resource reservation (i.e. leaving times of participants at the time of joining) are available. The efficiency of our algorithm over other existing algorithms is shown by various simulation results.
Cardinality Analysis of Prolog
Authors: C. Braem, B. L Charlier, S. Modart, P. Van Hentenryck
Venue:  (1994)

This paper proposes a novel analysis called cardinality analysis to approximate the number of solutions to a goal. The analysis is an instantiation of a new abstract interpretation framework for full Prolog (without dynamic predicates) based on sequences of substitutions. The abstract domain captures not only modes and types but also lower and upper bounds on the number of solutions and information about arithmetic and meta predicates, the cut, and termination. Experimental results show that the approach has a number of desirable properties wrt efficiency, accuracy, and simplicity not available in previous work. In particular, all aspects of the analysis are captured in a single framework, the mode/type analysis and the cardinality analysis are performed simultaneously and improve each other''s accuracy, input/output patterns, cut, termination, and abstractions of arithmetic and meta-predicates are used to achieve great precision, and the overhead of the approach is small compared to traditional mode/type analyses.
Acceleration of DAB Chipset Development by Deployment of a Real-time Rapid Prototyping Approach based on Behavioral Synthesis
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The development of a new digital communication system has the twofold goal to achieve all traditional requirements from the end user prospective and to offer a huge potential of additional services compared with existing analog systems. The extremely demanding time frame for the introduction of such a system requires a development approach reducing the design risk to a minimum especially for the end user receivers. As integral parts of the terminal the digital baseband processor is one of the most challenging receiver components in terms of development and validation effort. The complexity of the ASIC design with initially estimated 500,000 to 1,000,000 gate equivalents has driven the deployment of a real-time prototyping system. To assure real-time and identical functionality on both FPGA prototype and ASIC behavioral synthesis was used for timing-critical and computationally intensive building blocks. The design and validation methodology was successfully implemented. The ASIC will be introduced in the first generation of mobile radio receivers for digital audio broadcasting in the United States.
A distributed control architecture for a purposive computer vision system
Authors: R. A. C. Bianchi, A. H. R. C. Rillo
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In this paper we present a distributed control architecture engaged in purposive computer vision tasks. In this context, the vision system's purpose is translated into a set of behaviors, which are decomposed in specific tasks. A multi-agent approach is used to model purpose, behaviors, tasks and the relationship among them. Purpose is modeled by a society of autonomous agents, each one responsible for a specific visually guided behavior. Tasks are represented by basic agents, organized in a hierarchical structure with autonomous agents on the top. As a testbed, the architecture of a specific system for visually guided assembly is presented and a distributed implementation is described.
Query Reification Based Approach for Object-Oriented Query Formulation Aid
Authors: Abdelhak Seriai, Mourad Oussalah
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this article we propose an approach facilitating query formulation for users sharing a common database. Our approach is based on two considerations. On the one hand, query formulation can be considered as a skill which can be shared entirely or partly between users. Accordingly we propose a model for storing and making available this skill to help users formulate their new queries. On the other hand we base our design on custom construction of a database adapted to each business group of users in question. In using it, the users of a given business cooperate transparently through their queries to design databases specific to their business. Thus, they take part cooperatively if indirectly in reducing the difficulty of queries formulation.
CORBA Based Architecture for Large Scale Workflow
Authors: R. Filho, J. Wainer, E. Madeira, C. Ellis
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Standard client-server workflow management systems have an intrinsic scalability limitation: the central server is a bottleneck for large scale applications. It is also a single fault point that may disable the whole system. We propose a fully distributed architecture for workflow management systems. It is based on the idea that the case (an instance of the process) migrates from host to host, according to the process definition specification, as the corresponding activities are executed. This basic architecture is improved so that other requirements for Workflow Management Systems, besides scalability, are also contemplated. A CORBA-based implementation of such architecture is discussed, with both its limitations and positive points described.