ppxscal/embedding_network huggingface dataset:
A Probabilistic Framework for Explanation
Authors: Solomon E Shimony
Venue:  (1991)

We present a wish list for a domain-independent theory of explanation under uncertainty, based on the research literature. We examine the prevalent explanation schemes in light of this list, and show why none of the currently used schemes are adequate for domain-independent explanation. In particular, we look at maximum a-posteriori (MAP) explanations (which suffer from the overspecification problem) and posterior probabilities (which may select inconsistent explanations). We also consider one non-probabilistic scheme, cost-based abduction, but relate it to the probabilistic work by providing a probabilistic semantics for it, using Bayesian belief networks. We show that although this is a useful explanation scheme (a similar scheme, least-cost proofs, is used in Hobbs'' and Stickel''s TACITUS natural language understanding program), it makes independence assumptions that are not valid in the general case. We then suggest a new theory, ``irrelevance-based MAPs'''', a scheme where explanations are partial models, such that irrelevant variables are left unassigned. We propose and evaluate four instances of irrelevance-based MAPs: independence-based MAPs, delta independence-based MAPs, generalized delta independence-based MAPs and quasi-independence-based MAPs. We show that these schemes have the advantages of MAP explanations but do not exhibit the overspecification problem. A best-first algorithm that generates explanations for the first two above schemes is presented. Implementations of the algorithm exhibit reasonable run-time behavior over a toy-domain set of problems, despite the fact that the problem of finding explanations is NP-hard. We demonstrate empirically that our independence-based MAP algorithm shows reasonable performance for up to medium-size problems, by experimenting on a set of randomly generated belief networks. Finally, we discuss alternate algorithms for computing irrelevance-based explanations: linear systems of inequalities and stochastic simulation.
Dynamic Splines with Constraints for Animation
Authors: Ravi Ramamoorthi, Cindy Ball, Alan H. Barr
Venue:  (1997)

In this paper, we present a method for fast interpolation between animation keyframes that allows for automatic computer-generated "improvement" of the motion. Our technique is closely related to conventional animation techniques, and can be used easily in conjunction with them for fast improvements of "rough" animations or for interpolation to allow sparser keyframing. We apply our technique to construction of splines in quaternion space where we show 100-fold speed-ups over previous methods. We also discuss our experiences with animation of an articulated human-like figure. Features of the method include: (1) Development of new subdivision techniques based on the Euler-Lagrange differential equations for splines in quaternion space; (2) An intuitive and simple set of coefficients to optimize over which is different from the conventional Bspline coefficients; (3) Widespread use of unconstrained minimization as opposed to constrained optimization needed by many previous methods. This speeds up the algorithm significantly, while still maintaining keyframe constraints accurately.
A Characterization of Graphs With Interval Squares
Authors: J. R Lundgren, Sarah K. Merz, Craig W. Rasmussen
Venue:  (1995)

The competition graph of a symmetric digraph D with a loop at each vertex is the square of the underlying graph of D with loops removed. In the interest of efficiently assigning radio frequencies in a communication network, we would like to determine which graphs have interval squares. Necessary and sufficient conditions on the graph G are given for G^2 to be interval for several large classes of graphs. We first discuss results related to the Fulkerson-Gross characterization of interval graphs. Second, we discuss necessary conditions involving forbidden subgraphs and consider why such an approach does not produce sufficient conditions. Open problems are also considered.
Adaptive Use of Network-Centric Mechanisms in Cyber-Defense
Authors: Michael Atighetchi, Partha Pal, Franklin Webber, Christopher Jones
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Attacks against distributed systems frequently start at the network layer by gathering network related information (such as open TCP ports) and continue on by exhausting resources, or abusing protocols. Defending against network-based attacks is a major focus area in the APOD (Application That Participate in Their Own Defense) project, which set out to develop technologies that increase an application's resilience against cyber attacks. This paper gives an overview of APOD's current set of network-level defenses. Specific network-based defense mechanisms are described first, followed by a discussion on how to use them in localdefensive behavior. Defense strategies, which specify coordinated defensive behavior across a distributed system, are discussed next, followed by results from initial experimental evaluation.
A Novel Clocking Strategy for Dynamic Circuits
Authors: Young Jun Lee, Jong-Jin Lim, Yong-Bin Kim
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

This paper proposes a new clocking strategy for dynamiccircuit. It provides faster performance and smaller areathan conventional clocking scheme. The proposed clockingscheme for dynamic circuits provides the solution of theproblem caused by logic polarity and clock skew problem simultaneously.To demonstrate the proposed clocking strategy,a 32 bit Carry Look Ahead adder (CLA) is designed andsimulated using 0.25um CMOS technology to demonstrate32.7% faster speed than the conventional clocking schemeand 19.4% transistor counter reduction.
Multilevel network management by means of system identification
Authors: M. Takano, K. Fujita
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The paper proposes a new approach to the management of large-scale communication networks. To manage large-scale communication networks effectively, it is essential to get a bird's-eye view of them when they are in their normal conditions. When an indication of faulty state is detected, the focus of the management is narrowed down to the faulty network elements. This management scheme is called multilevel network management. The paper proposes that system identification be used in multilevel network management. The system identification is used to measure transmission delays between two arbitrarily selected nodes in the networks, and multilevel network management is achieved by selecting those two nodes appropriately in accordance with the levels to be managed.
Loop Schemata
Authors: Robert L. Constable
Venue:  (1971)

We define a class of program schemata arising from the subrecursive programming language Loop. In this preliminary report on Loop schemata we show how to assign functional expressions to these schemata (as one aspect of the problem of assigning meaning to these programs), and we outline a solution to the schemata equivalence problem. Schemata equivalence is reduced to questions about formal expressions. Certain subcases of the problem are easily shown solvable, and although we claim that the general problem is solvable, we do not present the complete solution here because of its complexity. Key Words and Phrases: program, program schemata, Algol, universal programming language, Loop language, subrecursive language, computable function, primitive recursive function, functional, general recursive functional, equivalence problem, unsolvability.
A Hypothetical Reasoning Based Framework for NL Processing
Authors: Veronica Dahl, Andrew Fall, Stephen Rochefort, Paul Tarau
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We examine the natural language uses of a new type of logic grammars -Assumption Grammars- particularly suitable for hypothetical reasoning. They are based on intuitionistic and linear implications scoped over the current continuation, which allow us to follow given branches of the computation under hypotheses that disappear when and if backtracking takes place. We show how Assumption Grammars can simplify the treatment of some crucial computational linguistics problems, e.g. long distance dependencies, while simultaneously facilitating more readable grammars.
Design of reliable software via general combination of N-version programming and acceptance testing
Authors: B. Parhami
Venue: Proceedings of the The Seventh International Symposium on Software Reliability Engineering (1996)

N-version programming (NVP) and acceptance testing (AT) are techniques for ensuring reliable computation results from imperfect software. Various symmetric combinations of NVP and AT have also been suggested. We take the view that one can insert an AT at virtually any point in a suitably constructed multi-channel computation graph and that judicious placement of ATs will lead to cost-effective reliability improvement. Hence, as a general framework for the creation, representation, and analysis of combined NVP-AT schemes, we introduce MTV graphs, and their simplified data-driven version called DD-MTV graphs, composed of computation module (M), acceptance test (T), and voter (V) building blocks. Previous NVP-AT schemes, such as consensus recovery blocks, recoverable N-version blocks, and N-self-checking programs can be viewed as special cases of our general combining scheme. Results on the design and analysis of new NVP-AT schemes are presented and the reliability improvements are quantified. We show, e.g., that certain, somewhat asymmetric, combinations of M, T, and V building blocks can lead to higher reliabilities than previously proposed symmetric arrangements having comparable or higher complexities.
LEOPARD: a .net based agent architecture
Authors: Annya Réquilé-Romanczuk, Christine Mingins, Brian Yap, Olivier Constant
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Motivated by recent developments in Category theory and Web Community Discovery, we have developed an experimental platform to design Agent-based Systems. This paper describes why and how the architecture was developed under the Microsoft .Net environment with the Object-Oriented Language C#. The proposed architecture is based on three layers. The .Net C# Agent Infrastructure, that enables agents to live and interact, supporting the distribution of agents and the use of .Net remoting and MSMQ (Microsoft Message Queuing) service. The .Net C# Agent Framework, that provides an agent design and tools for implementing agents and making them interoperate. The third layer is the LEOPARD application http://www.csse.monash.edu.au/~arequile/leopard.html for which this experimental platform was built, where Learning Object repository nodes and users are considered as agents that observe traversals from both the repositories and the user perspective, and support the inference of dynamic semantics based on actual usage.
Upward and Downward Diagonalization over Axiomatic Complexity Classes
Authors: Robert L. Constable
Venue:  (1969)

This report considers special cases of the question ``What conditions on u() and t() guarantees that $R^{\Phi}_{t}() \neq $R^{\Phi}_{u}()$?'''' where $R^{\Phi}_{t}()$ is the class of recursive functions whose $\Phi$ complexity is bounded by t(). In particular the condition $\stackrel{inf}{n\rightarrow\infty} \frac{t(n)}{u(n)} = 0$ and $\stackrel{lim}{n\rightarrow\infty} \frac{t(n)}{u(n)} = 0$ are examined, and it is shown that certain results of Hartmanis, Stearns and Hennis are in one sense the best possible. It is then shown that the diagonalization techniques used in results of this type are of two different sorts, upward and downward. The differences are made precise and very general conditions are found under which each type applies. These conditions widely generalize several well-known results for time and tape complexity measures. In the final section, the report considers some properties of a special class of names for complexity classes. The techniques used in Lemma 3.3 and Theorems 5.1 and 7.1 are new and promise wider application. Also, new results of Borodin and McCreight and Meyer are used, but otherwise the methods are those of Blum.
Microsoft SQL Server 2000 Unleashed, 2nd Edition, 2 edition
Authors: Ray Rankins, Paul Bertucci, Paul Jensen
Venue:  (2002)

:Microsoft SQL Server 2000 Unleashed, 2E offers a variety of topics for system and database administrators to help them learn new features of the product and to solve problems they face on a daily basis. It shows them how to build upon their working knowledge of the product and take their experience and knowledge to a higher level. This new edition of Microsoft SQL Server 2000 Unleashed covers the latest updates and service packs to SQL Server 2000, including full support for XML, notification services, and SQL Server CE.
Parallel Media Processors for the Billion-Transistor Era
Authors: Jason Fritts, Zhao Wu, Wayne Wolf
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper describes the challenges presented by single-chip parallel media processors (PMPs). These machines integrate multiple parallel function units, instruction execution, and memory hierarchies on a single chip. The combination of programmability and high performance on data parallelism is necessary to meet the demands of next-generation multimedia applications. Many research issues must be solved to realize the full potential of programmable media processors. This paper provides both a survey of research trends and issues in architecture and compiler design for programmable media processors, and an exploration of the potential performance of media processors over the next decade.
Open ended group projects a 'tool' for more effective teaching
Authors: Ian Newman, Mats Daniels, Xristine Faulkner
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

Open Ended Group Projects [OEGP] offer an educational 'model', or tool, that has many benefits in terms of how and what students learn. This paper contains an explanation of the ideas that underlie OEGP and relates them to the concepts of problem based learning and educational constructivism. It shows how OEGPs can be used to encourage reflection on and application of the fundamental, subject specific, principles the students have learned and can contribute to the development of professional and 'social' skills which will be essential for their future careers. The holistic approach promoted by OEGP is argued to reduce the 'techie' flavor of CS education and thus help in attracting and keeping female students.The paper discusses the role of OEGP in increasing student motivation, reinforcing other educational approaches and allowing new 'fast breaking' topics to be explored in some depth without changing the curriculum. Finally the issue of fairly assessing group projects is considered with particular emphasis on the social skills aspects.The ideas are based on the experiences of the authors working in different institutions. They are illustrated using one course (IT in Society), which will be given for the fifth time this fall. This course is based on the idea that to make efficient use of Computer Science knowledge and skills in real life also requires the use of soft skills. Teachers from different disciplines supervise student groups solving real world problems with an emphasis on communication and group working and the application of acquired CS knowledge.
The Power of Local Optimizations: Approximation Algorithms for Maximun-leaf Spanning Tree (DRAFT)*
Authors: Hsueh Lu, R. Ravi
Venue:  (1996)

Given an undirected graph $G$, finding a spanning tree of $G$ with maximum number of leaves is NP-complete. We use the simple technique of local optimization to provide the first approximation algorithms for this problem. Our algorithms run in polynomial time to produce locally optimal solutions. We prove that locally optimal solutions to this problem are globally near-optimal. In particular, we prove that two such algorithms have performance ratios of 5 and 3. The latter algorithm employs more powerful local-improvement steps than the former and hence has higher running time. This may indicate an interesting trade-off between the performance ratios and the running times of the series of algorithms we describe.
Cellular gravity
Authors: Frederic Gruau, John T. Tromp
Venue:  (1999)

We consider the problem of establishing gravity in cellular automata. In particular, when cellular automata states can be partitioned into empty, particle, and wall types, with the latter enclosing rectangular areas, we desire rules that will make the particles fall down and pile up on the bottom of each such area. We desire the rules to be both simple and time-efficient. We propose a block rule, and prove that it piles up particles on a grid of height $h$ in time at most $3*h$.
Inside Cisco: The Real Story of Sustained M&A Growth
Authors: Ed Paulson
Venue:  (2002)

:Networking giant Cisco Systems is a dominant technology company with $19 billion in fiscal revenues and 30,000 employees. Yet, despite its size, Cisco retains its entrepreneurial spirit, responding to marketplace demands with remarkable speed using a combination of product innovation and technological advances. Inside Cisco provides a Silicon Valley insider's view of the company's core strategies with emphasis placed on Cisco's "Gold Standard" acquisition practices. Critical to Cisco's historical success has been its powerful commitment to expanding its product line and level of expertise through smart acquisitions. With Inside Cisco, Silicon Valley veteran Ed Paulson delivers the unique M&A philosophy of Cisco Systems and outlines the management and financial procedures used to create these acquisition successes. Beginning with an examination of a corporate culture specifically designed to acquire and assimilate other companies, Inside Cisco explores every aspect of the firm's acquisition and development (A&D) process, refined through Cisco's deals with over seventy corporations. Through extensive research as well as access to current and former Cisco executives, Paulson reveals how Cisco buys companies for their people, technology, products, and intellectual capital and not simply as a financial operation. Inside Cisco gives the business and finance world an inside peek at how Cisco has consistently profited from its acquisition strategy, as have the companies it has purchased. Paulson's detailed examination of Cisco's acquisitions process provides excellent background for business and finance executives intending to use acquisitions as part of their company's growth strategy. Insightful and comprehensive, Inside Cisco reveals one of the most successful acquisition approaches in the business world today and provides an M&A best practices guidebook that can be applied in any industry. 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
MONOLITHIC DC-DC CONVERTER ANALYSIS AND MOSFET GATE VOLTAGE OPTIMIZATION
Authors: Volkan Kursun, Siva G. Narendra, Vivek K. De, Eby G. Friedman
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The design of an efficient monolithic buckconverter is presented in this paper. A low swing MOSFETgate drive technique is proposed that improves the efficiencycharacteristics of a DC-DC converter. A model of the parasitic impedances of a buck converter is developed. With thismodel, a design space is described which characterizes theintegration of both active and passive devices of a buck converter onto the same die based on a 0.18 µm CMOS technology. The optimum gate voltage swing of a power MOSFETthat maximizes efficiency is shown to be lower than a standard full voltage swing. An efficiency of 88% at a switchingfrequency of 102 MHz is achieved for a voltage conversionfrom 1.8 volts to 0.9 volts with a low swing DC-DC converter. The power dissipation of a low swing DC-DC converter is reduced by 24.5%, improving the efficiency by3.9% as compared to a full swing DC-DC converter.
Reducing y″ = F(x, y, y′) to first order
Authors: A. Martín del Rey, J. Muñoz Masqué
Venue: Journal of Computational and Applied Mathematics (2003)

Necessary and sufficient conditions for a second-order ODE to be reducible to first order are given explicitly. The reducible real analytic equations are parameterized in terms of three functions of one variable and two functions of two variables, arbitrarily chosen. Some examples and particular cases are also discussed.
Dynamic Information Allocation through Mobile Agents to Achieve Load Balancing in Evolving Environment
Authors: H. Farooq Ahmad, Hiroki Suguri
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The convergence of computers and telecommunication and the rapid growth of the Internet have redefined business rules and the way people exchange information. Due to emergence of e-commerce users have guaranteed timeliness and reliability requirements for information service utilization in heterogeneous and evolving environment of the Internet. Information systems based on conventional client/server database technology cannot meet these users' requirements.This fosters an urgent need to design an information service system that can meet users' heterogeneous requirements for services, and assure adaptability to cope with ever-changing situations to provide high-assurance. Faded Information Field (FIF) has been proposedas a distributed information service system architecture that is sustained by push/pull mobile agents to bring high-assurance of services through Users' preference-oriented information provision on supply-demand basis. When users' demand changes, the information environment is dynamically restructured to achieve the same responce time for all unspecified users. The major contribution of this paper is the proposition of autonomous information allocation technique through mobile agents to achieve load balancing in the proposed distributed information system to assure equal and improved response time of all users under changing users' preferences. The effectiveness of the proposed technique has been shown through simulation.
Codeguru.com Visual C++ Goodies
Authors: Nigel Quinnin
Venue:  (2002)

:CodeGuru.com, an Internet.com site, is the key source of beginner to advanced Visual C++ information for top professional developers. Members visit the site to find and to leave posts about the most challenging tasks Visual C++ developers run into in practice. In addition, members have access to vast archives of technical articles and industry commentary from leading programmers in the market today. As a service to CodeGuru.com members and the programming public, this book has been pulled together from the top-rated articles and postings to provide easy-to-use and -reference code, commentary and quick fixes. Coverage includes both Visual C++ 6 and .NET, as most programmers are still using the older version of the language for day-to-day work, as well as topics like user interface design, COM, controls, database programming, graphics, DLL, plus much more. The CD-ROM is a valuable resource tool for developers to find the code they need and copy it into their applications, all royalty-free. 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