ppxscal/embedding_network huggingface dataset:
Computing in Unpredictable Environments: Semantics, Reduction Strategies, and Program Transformations
Authors: Bjorn Lisper
Venue:  (1995)

We study systems where deterministic computations take place in environments which may behave nondeterministically. We give a simple formalization by unions of abstract reduction systems, on which various semantics can be based in a straightforward manner. We then prove that under a simple condition on the reduction systems, the following holds: reduction strategies which are cofinal for the deterministic reduction system will implement the semantics for the combined system, provided the environment behaves in a "fair" manner, and certain program transformations, such as folding and unfolding, will preserve the semantics. An application is evaluation strategies and program transformations for concurrent languages.
A Game-Theoretic Classification of Interactive Complexity Classes
Authors: J. Feigenbaum, D. Koller, P. Shor
Venue:  (1995)

Game-theoretic characterizations of complexity classes have often proved useful in understanding the power and limitations of these classes. One well-known example tells us that PSPACE can be characterized by two-person, perfect-information games in which the length of a played game is polynomial in the length of the description of the initial position [Chandra et al., Journal of the ACM, 28 (1981), pp.~114-133]. In this paper, we investigate the connection between game theory and interactive computation. We formalize the notion of a "polynomially defineable game system" for the language L, which, informally, consists of two arbitrarily powerful players P1 and PP2 and a polynomial-time referee V with a common input w. Player P1 claims that w is in L, and player P2 claims that w is not in L; the referee''s job is to decide which of these two claims is true. In general, we wish to study the following question: What is the effect of varying the system''s game-theoretic properties on the class of languages recognizable by polynomially definable game systems? There are many possible game-theoretic properties that we could investigate in this context. The focus of this paper is the question of what happens when one or both of the players P1 and P2 have imperfect information or or imperfect recall. We use polynomially definable game systems to derive new charactizations of the complexity classes NEXP and coNEXP. We also derive partial results about other exponential complexity classes and isolate some intriguing open questions about the effects of imperfect information and imperfect recall. These results make use of recent work on complexity-theoretic aspects of games, e.g., [Koller et al., Proc. 26th ACM Symposium on Theory of computing, 1994, pp. 750-759] and [Newman, Information Processing Letters, 39 [1991), pp.~67-71.] These results were presented in preliminary form at the 10th IEEE Structure in Complexity Theory Conference, Minneapolis MN, June 1995.
On time series with randomized unit root and randomized seasonal unit root
Authors: Pak Wing Fong, Wai Keung Li
Venue: Computational Statistics Data Analysis (2003)

A time series model with possibly a randomized unit root and a randomized seasonal unit root is considered. Two statistical tests are developed for the null hypothesis of fixed unit roots against the alternative that the roots are random and fluctuate about the value of one. The testing problem is addressed via the score test approach. The asymptotic representations of the test statistics in terms of Brownian processes are obtained. Simulations are used to tabulate finite sample critical values and to investigate empirical sizes and powers. A Markov chain Monte Carlo approach is proposed for the estimation of model parameters. Both randomized unit root and randomized seasonal unit root are demonstrated to be present in a US money supply data.
An Implementation of a 32-bit ARM Processor Using Dual Power Supplies and Dual Threshold Voltages
Authors: Robert Bai, Sarvesh Kulkarni, Wesley Kwong, Ashish Srivastava, Dennis Sylvester, David Blaauw
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

With the explosion of portable electronic devices,power efficient processors have become increasinglyimportant. In this paper we present a set of circuittechniques to implement a 32-bit low-power ARMprocessor, found commonly in embedded systems, using asix metal layer 0.18 µm TSMC process. Our methodologyis based on Clustered Voltage Scaling (CVS) and dual-Vthtechniques aiming to reduce both dynamic power andstatic power simultaneously.
Investigating Measures for Pairwise Document Similarity
Authors: Jeffrey D. Isaacs, Javed A. Aslam
Venue:  (1999)

The need for a more effective similarity measure is growing as a result of the astonishing amount of information being placed online. Most existing similarity measures are defined by empirically derived formulas and cannot easily be extended to new applications. We present a pairwise document similarity measure based on Information Theory, and present corpus dependent and independent applications of this measure. When ranked with existing similarity measures over TREC FBIS data, our corpus dependent information theoretic similarity measure ranked first.
Assertions: A Personal Perspective
Authors: C. A. R. Hoare
Venue: IEEE Annals of the History of Computing (2003)

Assertions are Boolean formulas placed in program text at places where their evaluation will always be true. If the assertions are strong enough, they express everything that the programmers on either side of an interface need to know about the program on the other side, even before the code is written. Indeed, assertions can serve as the basis of a formal proof of the correctness of a complete program.
A Best Practice Based Approach to CASE-tool Selection
Authors: Maya Daneva
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

Best software practices are adopted and adapted by software organizations to support improvement goals. Traditionally, CASE tools have been considered as one of the most important means for implementing best practices. Today's CASE technology offers much process optimization and increases the options for how and where improvements could be done. However, CASE tool expenses are typically high due to their steep learning curve. The selection of the right CASE tool has, therefore, become more important in ensuring the CASE investment delivers value for the money.This paper introduces a best practice based approach to CASE tool selection so the potentiality of CASE tools to support the development of a process-oriented software organization can be assessed. We derive three sets of CASE attributes pertinent to the best practices addressed in three major reference process architectures: Capability Maturity Model for Software, ISO 9000-3 and Malcolm Baldrige National Quality Award. Our approach has been applied to three case studies dealing with 9 object-oriented and 7 conventional CASE tools. This illustrates the power of the benchmarking approach to capture subtle CASE quality issues. It is a valuable instrument for evaluating and comparing the CASE-tools' fitness for use in a specific improvement context.
Message Ring-based Channel Reallocation Scheme for Cellular Networks
Authors: Kok Yong Lim, Mohan Kumar, Sajal K. Das
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Wireless communication suffers from many restrictions due to the inherent limitations of the wireless media and existing wireless communication protocols. Limited radio frequency spectrum (or bandwidth) is one of the major issues in wireless communication. In order to efficiently share the limited bandwidth, different channel allocation (or channel assignment) schemes have been developed. In this paper, we propose a frequency reallocation scheme, message ring-based channel reallocation (MRCR) to improve channel utilization in wireless communication systems. MRCR uses software agents to circulate and maintain a message ring that carries bandwidth information. We present results of simulation studies to demonstrate the effectiveness of the MRCR scheme.
Practical Code Inspection Techniques for Object-Oriented Systems: An Experimental Comparison
Authors: Alastair Dunsmore, Marc Roper, Murray Wood
Venue: IEEE Software (2003)

Although inspection is an effective mechanism for detecting defects in procedural systems, object-oriented systems have different structural and execution models. This article describes the development and empirical investigation of three different techniques for reading object-oriented code during inspection. Research suggests that reading techniques must specifically address delocalization the distribution of related functionality throughout an object-oriented system and the fact that the static (compile time) and dynamic (run time) views of an object-oriented system are largely distinct. The three techniques that were developed consist of a checklist that specifically focuses on object-oriented issues, an abstraction-driven reading strategy that requires inspectors to reverse engineer specifications and a use-case driven approach that forces the inspector to consider the dynamic model. The investigation provides insights into all three techniques and, while the tailored checklist is found to be the most effective overall, the abstraction-driven strategy seems to deal better with delocalization issues. The significant message is that code inspection should explicitly address the characteristic features of object-orientation.
Visualizing Association Rules for Text Mining
Authors: Pak Chung Wong, Paul Whitney, Jim Thomas
Venue: Proceedings of the 1999 IEEE Symposium on Information Visualization (1999)

An association rule in data mining is an implication of the form X -> Y where X is a set of antecedent items and Y is the consequent item. For years researchers have developed many tools to visualize association rules. However, few of these tools can handle more than dozens of rules, and none of them can effectively manage rules with multiple antecedents. Thus, it is extremely difficult to visualize and understand the association information of a large data set even when all the rules are available. This paper presents a novel visualization technique to tackle many of these problems. We apply the technology to a text mining study on large corpora. The results indicate that our design can easily handle hundreds of multiple antecedent association rules in a three-dimensional display with minimum human interaction, low occlusion percentage, and no screen swapping.
Tight Binding Molecular Dynamics on Parallel Computers
Authors: S. Goedecker, L. Colombo
Venue:  (1994)

With a new and intrinsically parallel algorithm for Tight Binding Molecular Dynamics we obtain a performance of 3.4 Gigaflops per million dollar on a cluster of 8 Hewlett Packard workstations in a simulation of 216 Silicon atoms. One time step with this new algorithm takes as much time for the 216 atom system as one time step with a conventional algorithm on a NEC-SX3 supercomputer. In addition, the linear scaling of new algorithm allows us to calculate systems of unprecendented size which are not any more accessible by the combination of standard algorithms and vector supercomputers.
Physiological responses to different WEB page designs
Authors: R. D. Ward, P. H. Marsden
Venue: International Journal of Human-Computer Studies (2003)

Physiological indicators of arousal have long been known to be sensitive to mental events such as positive and negative emotion, changes in attention and changes in workload. It has therefore been suggested that human physiology might be of use in the evaluation of software usability. To this, there are two main approaches or paradigms: (i) comparisons of physiological readings across periods of time to indicate different arousal levels under different circumstances, and (ii) the detection of short-term (occurring in seconds) physiological changes in response to specific events. Both approaches involve methodological, analytical and interpretational difficulties. Also, the tight experimental controls usually adopted in psychophysiological experimentation can be at odds with the needs of applied usability testing. This paper reports initial investigations of these approaches and difficulties in the evaluation of software interfaces. From exploratory data, a preliminary model is proposed which combines the two paradigms for identifying significant HCI events. Explorations of the model within the context of a web-related task are then discussed. These explorations suggest techniques and procedures for applied usability testing, and the results point to ways in which physiological data may be informative about software usability. However, further investigations involving variations in task and procedure are required.
Cooperative negotiation for soft real-time distributed resource allocation
Authors: Roger Mailler, Victor Lesser, Bryan Horling
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic environment. Two central principles are used in this protocol that allow it to operate in constantly changing conditions. First, we frame the allocation problem as an optimization problem, similar to a Partial Constraint Satisfaction Problem (PCSP), and use relaxation techniques to derive conflict (constraint violation) free solutions. Second, by using overlapping mediated negotiations to conduct the search, we are able to prune large parts of the search space by using a form of arc-consistency. This allows the protocol to both quickly identify situations where the problem is over-constrained and to identify the appropriate fix to the over-constrained problem. From the global perspective, the protocol has a hill climbing behavior and because it was designed to work in dynamic environments, is an approximate one. We describe the domain which inspired the creation of this protocol, as well as discuss experimental results.
Conflict Analysis in Search Algorithms for Satisfiability
Authors: Joao P. Marques Silva, Karem A. Sakallah
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques, some of which are specific to SAT, whereas others find equivalent in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack non-chronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by "recording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances.
A synchronization and compensation protocol for multimedia communication systems
Authors: Chao-Hui Wu, Liang-Seng Koh, M. T. Liu
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Media synchronization and freedom from starvation at destination devices are the two most important problems in a multimedia communication system. In order to solve these problems at the same time, this paper presents a protocol combining the scheduling scheme and the buffering scheme with underflow threshold (SBUF). In this protocol, by controlling the buffer sizes and modifying transmission schedule of the synchronizer synchronization can be achieved without synchronizing clocks during a connection. In this paper the algorithm of the protocol is described. The setting of the system parameters and network QOS to support the proposed protocol are also given in this paper. A simulation is performed for comparison of four synchronization schemes: scheduling schemes (with and without clock synchronization), marker scheme, and the proposed SBUF protocol. The results confirm that the proposed protocol guarantees satisfaction of QOS requirements and also performs better than the other schemes in terms of media synchronization and freedom from starvation at destination devices
PIRANHA A Hunter of Crashed CORBA Objects
Authors: Silvano Maffeis
Venue:  (1996)

No matter how carefully a distributed application has been specified, implemented, and tested, its network objects will crash unexpectedly due to power outages, human lapses, hardware faults, and software bugs. The OMG CORBA standard is becoming popular for interoperability and extensibility. However, fault-tolerance and reliability have not adequately been addressed yet. This paper describes the design and implementation of Piranha --a CORBA-based, graphical availability management and application monitoring tool. Piranha is unique in that it can be used to increase the availability of many CORBA applications, without complicating their development.
Open Software: UNIX, DCE, and Competitors
Authors: Thomas W. Doeppner,  Jr.
Venue:  (1993)

Open software is software contributing to a general goal of systems that do not depend on any one hard ware or software vendor and are easily extensible by adding new software built upon the functionality of existing software. We discuss some of the defining characteristics of open software and frameworks that ease its production. These frameworks include operating systems and software supporting distributed computing. Examples are UNIX, NT, and DCE. We also examine two technological developments that are becoming very important in the development and use of these frameworks. The first is a structuring technique for operating systems -- microkernels. The second is a technique for doing concurrent and parallel computation -- multithreaded programming.
A Subexponential Algorithm for Trivalent Graph Isomorphism
Authors: Merrick Furst, John E. Hopcroft, Eugene Luks
Venue:  (1980)

NO SUPPLIED
Effective XML: 50 Specific Ways to Improve Your XML
Authors: Elliotte Rusty Harold
Venue:  (2003)

:Learning the basic syntax of XML is easy enough, but learning how to use XML effectively could occupy a lifetime. Effective XML makes it possible to become a more effective programmer much sooner. It crystallizes the hard-won expertise of XML pioneers into 50 rules of thumb for the optimal design of XML documents and applications. Other books can show you how to write programs that just compile and produce the expected results. Readers of Effective XML learn when, where, why, and how to use XML to create extensible, legible, and maintainable XML code. Best-selling author Elliotte Rusty Harold provides a straightforward, plain-language guide to the patterns and anti-patterns described by the 50 rules. Each rule is clearly and concisely explained, fully cross-referenced, and illustrated by detailed examples. The book begins with the rules for using XML syntax and then delves into structure and semantics before focusing on the best practices for implementation. A Web site provides an electronic copy of the text, as well as updates and links for further exploration.Highlights include: Pointers on how to author XML documents for ease of editing and processing as well as interoperability Tools and techniques for designing and documenting mappings with namespaces and schemasHints for making sure models are both representative and extensibleDiscussions of the tools and APIs used for processing XML with languages such as C++, C#, Java, Python, and PerlAdvice on accommodating services such as verification, data integrity, compression, authentication, caching, and content managementEffective XML isan invaluable resource for anyone looking to hone their XML programming skills in a matter of days rather than decades.
nPFS: Efficient Management of Multiple QoS Objects
Authors: Yong Jiang, Jianping Wu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Current proposals for the packet scheduling strategy of multiple performance objects in high-speed packet-switched networks attract more and more attention. At the same time, the end-to-end Quality of Service (QoS) requirements need to be satisfied and the network resource should be allocated fair and efficiently. In this paper, we provides nPFS, a network proportional fairness scheduling strategy in packet-switched networks from proportional fairness principle [1], and the nPFS integrates several objects, such as the networkperformance, user's QoS requirement and system fairness. Then it is analyzed and proved in detail. Moreover, the nPFS can be applied to design and improve the scheduling strategy and algorithms in packet-switched networks.
An Intelligent Buffer Management Approach for GFR services in IP/ATM Internetworks
Authors: Pi-Chung Wang, Chia-Tai Chan, Yaw-Chung Chen
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

In ATM networks, the Guaranteed Frame Rate (GFR) service has been designed to accommodate non-real-time applications, such as TCP/IP based traffic. The GFR service not only guarantees a minimum throughput at the frame level, but also supports a fair share of available resources. In this article, we propose a buffering strategy called Intelligent Fair Buffer Allocation (IFBA) that provides MCR (minimum cell rate) guarantees and fair sharing to GFR VCs (virtual circuits). From the simulation results, we demonstrate that IFBA fulfills the requirements of GFR service as well as improves the TCP throughput using the FIFO scheduling.
WebGOP: A Framework for Architecting and Programming Dynamic Distributed Web Applications
Authors: Jiannong Cao, Xiaoxing Ma, Alvin T. S. Chan, Jian Lu
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

This paper presents a novel approach, called WebGOP, for architecture modeling and programming of web-based distributed applications. WebGOP uses the graph-oriented programming (GOP) mode, under which the components of a distributed program are configured as a logical graph and implemented using a set of operations defined over the graph. WebGOP extends the application of GOP to the World Wide Web environmentand provides more powerful architectural support. In WebGOP, the architecture graph is reified as an explicit object which itself is distributed over the network, providing a graph-oriented context for the execution of distributed applications. The programmer can specialize the type of a graph to represent a particular architecture style tailored for an application. WebGOP also has built-in support for flexible and dynamic architectures, including both planed and unplanned dynamic reconfiguration of distributed applications. We describethe WebGOP framework, a prototypical implementation of the framework on top of SOAP, and performance evaluation of the prototype. Results of the performance evaluation showed that the overhead introduced by WebGOP over SOAP is reasonable and acceptable.