ppxscal/embedding_network huggingface dataset:
Execution History Guided Instruction Prefetching
Authors: Yi Zhang, Steve Haga, Rajeev Barua
Venue: The Journal of Supercomputing (2004)

The increasing gap in performance between processors and main memory has made effective instructions prefetching techniques more important than ever. A major deficiency of existing prefetching methods is that most of them require an extra port to I-cache. A recent study by Rivers et al. [19] shows that this factor alone explains why most modern microprocessors do not use such hardware-based I-cache prefetch schemes. The contribution of this paper is two-fold. First, we present a method that does not require an extra port to I-cache. Second, the performance improvement for our method is greater than the best competing method BHGP [23] even disregarding the improvement from not having an extra port. The three key features of our method that prevent the above deficiencies are as follows. First, late prefetching is prevented by correlating misses to dynamically preceding instructions. For example, if the I-cache miss latency is 12 cycles, then the instruction that was fetched 12 cycles prior to the miss is used as the prefetch trigger. Second, the miss history table is kept to a reasonable size by grouping contiguous cache misses together and associated them with one preceding instruction, and therefore, one table entry. Third, the extra I-cache port is avoided through efficient prefetch filtering methods. Experiments show that for our benchmarks, chosen for their poor I-cache performance, an average improvement of 9.2% in runtime is achieved versus the BHGP methods [23], while the hardware cost is also reduced. The improvement will be greater if the runtime impact of avoiding an extra port is considered. When compared to the original machine without prefetching, our method improves performance by about 35% for our benchmarks.
An Integrated Approach to Scatternet Traffic Management in Bluetooth Ad Hoc Networks
Authors: Liza Lai-Yee Shek, Yu-Kwong Kwok
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Scatternet management remains to be one ofthe most crucial research issues for Bluetooth networks, despitethat Bluetooth devices have proliferated in the commercialmarket. In this paper, we describe our proposedintegrated scheme for effective scatternet management. Ourproposed scheme contains four main mechanisms to addressthe different facets of the problem, namely Compensation-BasedTime-Slot Assignment (CTSA), Traffic DifferentiationQueueing (TDQ), Adaptive Master-Slave Switching(AMSS), and an Enhanced AODV algorithm for ad hoc routing.We have built a comprehensive Bluetooth simulator andperformed extensive simulations to evaluate the proposedIARTSS. We find that our proposed scheme can performwell under a wide variety of practical circumstances, andprovides efficient and high performance intra-piconet andinter-piconet communications.
What difference does it make: measuring returns of knowledge management
Authors: Abdus Sattar Chaudhry
Venue: Knowledge management: current issues and challenges (2003)

This chapter provides an overview of performance measurement in the area of knowledge management. Salient features of main measures have been described and their role in determining the return on knowledge management work highlighted. While Balanced Scorecard and Intangible Assets Monitor provide comprehensive coverage, several other measures are also in use. A recent study and review of applications of main KM performance measures in selected organizations showed several areas of commonality in the objectives of performance measurement and revealed differences in approaches to the application and presentation of various performance measures. Developing a measurement system for knowledge management is considered the key to the competitive success of the organization.
Improving Home Automation by Discovering Regularly Occurring Device Usage Patterns
Authors: Edwin O. Heierman,  III, Diane J. Cook
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The data stream captured by recording inhabitant-deviceinteractions in an environment can be mined todiscover significant patterns, which an intelligent agentcould use to automate device interactions. However, thisknowledge discovery problem is complicated by severalchallenges, such as excessive noise in the data, data thatdoes not naturally exist as transactions, a need tooperate in real time, and a domain where frequency maynot be the best discriminator. In this paper, we propose anovel data mining technique that addresses thesechallenges and discovers regularly-occurringinteractions with a smart home. We also discuss a casestudy that shows the data mining technique can improvethe accuracy of two prediction algorithms, thusdemonstrating multiple uses for a home automationsystem. Finally, we present an analysis of the algorithmand results obtained using inhabitant interactions.
A rigorous model for RAISE specifications reusability
Authors: Laura Felica, Daniel Riesco
Venue: Practicing software engineering in the 21st century (2003)

During the RAISE specification development process, a variety of components and infrastructures are built. All of these components are not independent, but they are related to each other, especially when we specify different systems in the same infrastructure. The RAISE method is based on the idea that software development is a stepwise, evolutionary process of applying semantics-preserving transitions. So, the reuse process is crucial in all stages of the development, but there is not explicit reference to the specification reusability in this development process.This chapter presents a rigorous process for reusability for RAISE Specification Language (RSL) components. We provide the mechanism to select a reusable component in order to guide RAISE developers in software specification and construction.
Propagation delay latency and a datad channel collision avoidance protocol
Authors: Ioannis E. Pountourakis
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

In this paper, we study the effect of the round trip propagation delay on performance measures of wavelength division multiplexing (WDM) networks. Even though the impact of propagation delay is substantial in the optical network's behavior, most of the studies ignore the effect of this time component in throughput evaluation. We consider the same network architecture as it described [J. Lightwave Technol. 8 (1990) 520] and exploit the long propagation delay of WDM networks to develop a simple multiple access algorithm improving the system utilization. We suppose infinite population and adopt the "tell and wait" policy to access to the system.
Algorithms of Solution of Systems of Linear Diophantine Constraints over the Set {0,1}
Authors: S. L. Kryvyi
Venue: Cybernetics and Systems Analysis (2003)

The paper considers two algorithms for solving systems of linear Diophantine constraints over the set {0,1}. Some properties of these algorithms and estimates of their complexity are investigated.
Approximate fairness through differential dropping
Authors: Rong Pan, Lee Breslau, Balaji Prabhakar, Scott Shenker
Venue: ACM SIGCOMM Computer Communication Review (2003)

Many researchers have argued that the Internet architecture would be more robust and more accommodating of heterogeneity if routers allocated bandwidth fairly. However, most of the mechanisms proposed to accomplish this, such as Fair Queueing [16, 6] and its many variants [2, 23, 15], involve complicated packet scheduling algorithms. These algorithms, while increasingly common in router designs, may not be inexpensively implementable at extremely high speeds; thus, finding more easily implementable variants of such algorithms may be of significant practical value. This paper proposes an algorithm called Approximate Fair Dropping (AFD), which bases its dropping decisions on the recent history of packet arrivals. AFD retains a simple forwarding path and requires an amount of additional state that is small compared to current packet buffers. Simulation results, which we describe here, suggest that the design provides a reasonable degree of fairness in a wide variety of operating conditions. The performance of our approach is aided by the fact that the vast majority of Internet flows are slow but the fast flows send the bulk of the bits. This allows a small sample of recent history to provide accurate rate estimates of the fast flows.
Modeling multiple IP traffic streams with rate limits
Authors: Daniel P. Heyman, David Lucantoni
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

We start with the premise, and provide evidence that it is valid, that a Markov-modulated Poisson process (MMPP) is a good model for Internet traffic at the packet/byte level. We present an algorithm to estimate the parameters and size of a discrete MMPP (D-MMPP) from a data trace. This algorithm requires only two passes through the data. In tandem-network queueing models, the input to a downstream queue is the output from an upstream queue, so the arrival rate is limited by the rate of the upstream queue. We show how to modify the MMPP describing the arrivals to the upstream queue to approximate this effect. To extend this idea to networks that are not tandem, we show how to approximate the superposition of MMPPs without encountering the state-space explosion that occurs in exact computations.Numerical examples that demonstrate the accuracy of these methods are given. We also present a method to convert our estimated D-MMPP to a continuous-time MMPP, which is used as the arrival process in a matrix-analytic queueing model.
Genres and techniques of soundscape composition as developed at Simon Fraser University
Authors: Barry Truax
Venue: Organised Sound (2002)

The soundscape composition, as pioneered at Simon Fraser University since the early 1970s, has evolved rapidly to explore a full range of approaches from the &lsquo;found sound&rsquo; representation of acoustic environments through to the incorporation of highly abstracted sonic transformations. The structural approaches similarly range from being analogues of real-world experience, such as listening from a fixed spatial perspective or moving through a connected series of acoustic spaces, to those that mirror both nonlinear mental experiences of memory recall, dreams, and free association, as well as artificial sonic constructs made familiar and possible by modern &lsquo;schizophonic&rsquo; audio techniques of sonic layering and embedding. The octophonic surround-sound playback format as used in contemporary soundscape presentations has achieved a remarkable sense of immersion in a recreated or imaginary sonic environment. Specific works realised at SFU are analysed that illustrate each of these approaches.
Weighted Association Rule Mining using weighted support and significance framework
Authors: Feng Tao, Fionn Murtagh, Mohsen Farid
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

We address the issues of discovering significant binary relationships in transaction datasets in a weighted setting. Traditional model of association rule mining is adapted to handle weighted association rule mining problems where each item is allowed to have a weight. The goal is to steer the mining focus to those significant relationships involving items with significant weights rather than being flooded in the combinatornal explosion of insignificant relationships. We identify the challenge of using weights in the iterative process of generating large itemsets. The problem of invalidation of the "downward closure property" in the weighted setting is solved by using an improved model of weighted support measurements and exploiting a "weighted downward closure property". A new algorithm called WARM (Weighted Association Rule Mining) is developed based on the improved model. The algorithm is both scalable and efficient in discovering significant relationships in weighted settings as illustrated by experiments performed on simulated datasets.
Power efficient encoding techniques for off-chip data buses
Authors: Dinesh C. Suresh, Banit Agrawal, Jun Yang, Walid Najjar, Laxmi Bhuyan
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Reducing the power consumption of computing devices has gained a lot of attention recently. Many research works have focused on reducing power consumption in the off-chip buses as they consume a significant amount of total power. Since the bus power consumption is proportional to the switching activity, reducing the bus switching is an effective way to reduce bus power. While numerous techniques exist for reducing bus power in address buses, only a handful of techniques have been proposed for data-bus power reduction, where Frequent Value Encoding (FVE) is the best existing scheme to reduce the transition activity on the data buses.In this paper, we propose improved frequent value data-bus encoding techniques aimed at reducing more switching activity and hence, more power consumption. We propose three new schemes and five new variations to exploit bit-wise temporal and spatial locality in the data bus values. Our technique does not use additional external control signal and captures bit-wise locality to efficiently encode data values. For all the embedded and SPEC applications we tested, the overall average switching reduction is 53% over unencoded data and 11% more than the conventional FVE scheme.
A new construction for Z-cyclic whist tournaments
Authors: Gennian Ge, Alan C. H. Ling
Venue: Discrete Applied Mathematics (2003)

In this paper, a new construction for Z-cyclic whist tournaments is given. The known existence results for both Z-cyclic whist tournaments and Z-cyclic triplewhist tournaments are extended.
Visualizing flow over curvilinear grid surfaces using line integral convolution
Authors: Lisa K. Forssell
Venue: Proceedings of the conference on Visualization '94 (1994)

Line Integral Convolution (LIC), introduced by Cabral and Leedom in Siggraph '93, is a powerful technique for imaging and animating vector fields. We extend the LIC paradigm in three ways:1. The existing technique is limited to vector fields over a regular Cartesian grid. We extend it to vector fields over parametric surfaces, specifically those found in curvilinear grids, used in computational fluid dynamics simulations.2. Periodic motion filters can be used to animate the flow visualization. When the flow lies on a parametric surface, however, the motion appears misleading. We explain why this problem arises and show how to adjust the LIC algorithm to handle it.3. We introduce a technique to visualize vector magnitude as well as vector direction. Cabral and Leedom have suggested a method for variable-speed animation, which is based on varying the frequency of the filter function. We develop a different technique based on kernel phase shifts which we have found to show substantially better results.Our implementation of these algorithms utilizes texture-mapping hardware to run in real time, which allows them to be included in interactive applications.
Periodic solutions in an inhibitory two-neuron network
Authors: Shangjiang Guo, Lihong Huang
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we consider a delayed network of two neurons with self-feedback and interaction described by an all-or-none threshold function. The discontinuity of signal function makes it difficult to apply directly dynamical system. We show that the dynamics of the network can be understood in terms of the iterations of a one-dimensional map, and we obtain the existence and attractivity of periodic solutions. Moreover, because the network is a limiting case of the corresponding smooth system as the parameter tends to infinity, the above results can act as the guide to the rich dynamics of the smooth system. Therefore, our results have important significance in both theory and applications.
A compositional proof system for real-time systems based on explicit clock temporal logic
Authors: J. Hooman, R. Kuiper, P. Zhou
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

To specify timing properties of real-time systems, we consider Explicit Clock Temporal Logic. Programs are written in an Occam-like real-time language. A proof system is provided to formally verify that a program satisfies a specification expressed in our real-time version of temporal logic. The proof system is compositional, sound, and relatively complete.
Multimedia content processing through cross-modal association
Authors: Dongge Li, Nevenka Dimitrova, Mingkun Li, Ishwar K. Sethi
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Multimodal information processing has received considerable attention in recent years. The focus of existing research in this area has been predominantly on the use of fusion technology. In this paper, we suggest that cross-modal association can provide a new set of powerful solutions in this area. We investigate different cross-modal association methods using the linear correlation model. We also introduce a novel method for cross-modal association called Cross-modal Factor Analysis (CFA). Our earlier work on Latent Semantic Indexing (LSI) is extended for applications that use off-line supervised training. As a promising research direction and practical application of cross-modal association, cross-modal information retrieval where queries from one modality are used to search for content in another modality using low-level features is then discussed in detail. Different association methods are tested and compared using the proposed cross-modal retrieval system. All these methods achieve significant dimensionality reduction. Among them CFA gives the best retrieval performance. Finally, this paper addresses the use of cross-modal association to detect talking heads. The CFA method achieves 91.1% detection accuracy, while LSI and Canonical Correlation Analysis (CCA) achieve 66.1% and 73.9% accuracy, respectively. As shown by experiments, cross-modal association provides many useful benefits, such as robust noise resistance and effective feature selection. Compared to CCA and LSI, the proposed CFA shows several advantages in analysis performance and feature usage. Its capability in feature selection and noise resistance also makes CFA a promising tool for many multimedia analysis applications.
Re-engineering and automation of business processes: criteria for selecting supporting tools
Authors: Aphrodite Tsalgatidou, Mara Nikolaidou
Venue: Effective databases for text & document management (2003)

Re-engineering of business processes and their automation is an activity very common in most organizations in order to keep or create a competitive business advantage in the changing business environment. Business Process Modeling Tools (BPMTs) and Workflow Management Systems (WFMSs) are the most popular tools used for business process transformation and automation of the redesigned business processes within and outside organization's boundaries. This chapter describes a set of criteria for selecting appropriate BPMTs and WFMSs among the diversity of the tools offered in the market in order to assist the interested manager or business process engineer to more successfully manage the business process transformation. While establishing the proposed criteria, we considered currently available technology and standards for visual enterprise support and inter-organizational business process modeling and automation.
A Cluster-Based Web System Providing Differentiated and Guaranteed Services
Authors: Mauro Andreolini, Emiliano Casalicchio, Michele Colajanni, Marco Mambelli
Venue: Cluster Computing (2004)

In a world where many users rely on the Web for up-to-date personal and business information and transactions, it is fundamental to build Web systems that allow service providers to differentiate user expectations with multi-class Service Level Agreements (SLAs). In this paper we focus on the server components of the Web, by implementing QoS principles in a Web-server cluster that is, an architecture composed by multiple servers and one front-end node called Web switch. We first propose a methodology to determine a set of confident SLAs in a real Web cluster for multiple classes of users and services. We then decide to implement at the Web switch level all mechanisms that transform a best-effort Web cluster into a QoS-enhanced system. We also compare three QoS-aware policies through experimental results in a real test-bed system. We show that the policy implementing all QoS principles allows a Web content provider to guarantee the contractual SLA targets also in severe load conditions. Other algorithms lacking some QoS principles cannot be used for respecting SLA constraints although they provide acceptable performance for some load and system conditions.
Animating art history: building a bridge between disciplines
Authors: LiQin Tan, Roberta K. Tarbell, Robert Wuilfe
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

The study of art history is an exciting and rewarding one, but one in which the student frequently encounters complex and difficult to understand concepts. Traditional methodologies for educators presenting these ideas to students have included slides, lectures, textbooks and videos of static works of art. In our technologically driven and media-saturated society, though, high school and early college students in introductory art history courses respond more positively to today's multimedia pedagogical tools.Computer animation offers a new and interdisciplinary paradigm with which to approach the art historical curriculum. With advanced three-dimensional animation technology, the Animating Art History team is creating original and dynamic tools for classroom use. Animating Art History presents complicated concepts in art history within the framework of a fully realized animation segment. Through plot, humor and visual exaggeration, animation captures the imagination of the student and facilitates learning.
Describing parameterized complexity classes
Authors: Jörg Flum, Martin Grohe
Venue: Information and Computation (2003)

We describe parameterized complexity classes by means of classical complexity theory and descriptive complexity theory. For every classical complexity class we introduce a parameterized analogue in a natural way. In particular, the analogue of polynomial time is the class of all fixed-parameter tractable problems. We develop a basic complexity theory for the parameterized analogues of classical complexity classes and give, among other things, complete problems and logical descriptions. We then show that most of the well-known intractable parameterized complexity classes are not analogues of classical classes. Nevertheless, for all these classes we can provide natural logical descriptions.
Modeling and Estimation of Leakage in Sub-90nm Devices
Authors: Arijit Raychowdhury, Saibal Mukhopadhyay, Kaushik Roy
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

CMOS technology has witnessed aggressivescaling over the last couple of decades. This hasresulted in better performance, higherintegration density and increased on-chipfunctionality. The threshold voltage has beenaggressively scaled down, oxides have beendrastically thinned and the MOS transistorchannels have been suitable engineered to meetthe high performance criteria. However, allthese have resulted in an increase in transistorleakage and have posed serious bottlenecks tofurther 'scale' these super-scaled devices. Thispaper explores the various dominant leakagemechanisms in scaled devices and examines theirtrends with scaling. Leakage estimation incircuits has also been presented.