ppxscal/embedding_network huggingface dataset:
Impact of Compiler-based Data-Prefetching Techniques on SPEC OMP Application Performance
Authors: Xinmin Tian, Rakesh Krishnaiyer, Hideki Saito, Milind Girkar, Wei Li
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper, we evaluate the benefits achievable from software data-prefetching techniques for OpenMP* C/C++ and Fortran benchmark programs, using the framework of the Intel production compiler for the Intel® Itanium® 2 processor. Prior work on software data-prefetching study has primarily focused on benchmark performance in the context of a few software data-prefetching schemes developed in research compilers. In contrast, our study is to examine the impact of an extensive set of software data-prefetching schemes on the performance of multi-threaded execution using a full set of SPEC OMPM2001 applications with a product compiler on a commercial multiprocessor system. This paper presents performance results showing that compiler-based software data-prefetching supported in the Intel compiler results in significant performance gain, viz., 11.88% to 99.85% gain for 6 out of 11 applications, 3.83% to 6.96% gain for 4 out of 11 applications, with only one application obtaining less than 1% gain on an IntelR Itanium® 2 processor based SGI Altix* 32-way sharedmemory multiprocessor system.
Non-Monotonic-Offers Bargaining Protocol
Authors: Pinata Winoto, Gordon I. McCalla, Julita Vassileva
Venue: Autonomous Agents and Multi-Agent Systems (2005)

This paper concerns the strengths and weaknesses of non-monotonic-offers in alternating-offer bargaining protocols. It is commonly assumed that bargainers submit monotonic offers over time corresponding to their belief revisions. However, through formal analysis and simulations, we are able to show that a non-monotonic-offers protocol can generate higher average surplus and a lower breakdown rate compared to a monotonic-offers protocol.
A multiagent data warehousing (MADWH) and multiagent data mining (MADM) approach to brain modeling and neurofuzzy control
Authors: Wen-Ran Zhang, Lulu Zhang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Based on the hypothesis that the brain is a society of semiautonomous neural agents and full autonomy is the result of coordination of semiautonomous functionalities, a multiagent data warehousing (MADWH) and multiagent data mining (MADM) approach is presented for brain modeling and illustrated with robot motion control. An algorithm named Neighbor-Miner is proposed for MADWH and MADM. The algorithm is defined in an evolving dynamic environment with semiautonomous neurofuzzy agents. Instead of mining frequent itemsets from customer transactions, the new algorithm discovers new neurofuzzy agents and mines agent associations in first-order logic for coordination that was once considered impossible in traditional data mining. While the Apriori algorithm uses frequency as a priori threshold, Neighbor-Miner uses agent similarity as a priori knowledge. The concept of agent similarity leads to the notions of agent cuboid, orthogonal MADWH, and MADM. Based on agent similarities and action similarities, Neighbor-Miner is presented and illustrated with brain modeling for robot control. The novelty of a multiagent data warehouse lies in its ability to systematically combine neurofuzzy systems, multiagent systems, database systems, machine learning, data mining, information theory, neuroscience, decision, cognition, and control all together into a modern multidimensional information system architecture that is ideal for brain modeling of different animal species with manageable complexity. Although examples in robot control are used to illustrate the basic ideas, the new approach is generally suitable for data mining tasks where knowledge can be discovered collectively by a set of similar semiautonomous or autonomous agents from a geographically, geometrically, or timely distributed environment, especially in high-dimensional scientific and engineering data environments.
Computing scenario from knowledge with preferentially ordered hypotheses
Authors: Ikuo Tahara
Venue: Systems and Computers in Japan (2004)

A method of computing scenario for knowledge including preferentially ordered hypotheses is proposed. Minimum conflict sets are found for competing hypothesis sets, and acceptable hypothesis sets are then found by applying preference relation to the minimum conflict sets; the disjunction of all elements of the acceptable hypothesis set thus obtained can be added to the fact set without contradiction. A fact set combined with all such disjunctions is considered a scenario, and is used for reasoning. Basically, the acceptability of hypothesis subsets for their minimal conflict sets is to be checked in order to obtain a scenario, which requires combinatorial calculations. A method is proposed to simplify such calculations; namely, acceptability is first checked for the single-element hypothesis sets, and then set operations are employed to check the acceptability of an arbitrary hypothesis set. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 19&ndash;26, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10429
Approaches to H.264-Based Stereoscopic Video Coding
Authors: Shiping Li, Mei Yu, Gangyi Jiang, Tae-Young Choi, Yong-Deak Kim
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

H.264 is an advanced video compression standard, absorbing the advantages of the previous standards. In this paper, block-based stereoscopic video coding is studied, and some schemes of using H.264 are discussed. The stereoscopic video coding methods based on H.264 and based on H.263+ are also compared by the experiments, experimental results show that the former is more effective than the latter in compression efficiency and image quality, and the H.264-based stereoscopic video coding scheme with temporal scalability is quite effective.
A reliable return address stack: microarchitectural features to defeat stack smashing
Authors: Dong Ye, David Kaeli
Venue: ACM SIGARCH Computer Architecture News (2005)

Buffer overflow vulnerability is one of the most common security bugs existing in today's software systems. In this paper, we propose a microarchitectural design of a return address stack aiming to detect and stop stack smashing. This approach has been used in other proposals to guard against buffer overflow vulnerabilities. Our contribution is a design that handle multipath execution, speculative execution, abnormal control flow, and extended call depth. Our solution makes no assumption about the presence of architecturally visible calls and returns.
Visual Concepts for News Story Tracking: Analyzing and Exploiting the NIST TRECVID Video Annotation Experiment
Authors: John R. Kender, Milind R. Naphade
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In the summer of 2003, using an interactive intelligent tool, over 100 researchers in video understanding annotated from the NIST TRECVID database over 62 hours of news video spanning six months of 1998. These 47K shots with 433K labels from over 1000 visual concept categories comprise the largest publicly available ground truth for this domain. Our analysis of this data, combining the tools of statistical natural language processing, machine learning, and computer vision, finds significant novel statistical patterns that can be exploited for the accurate tracking of the episodes of a given news story over time, by using semantic labels that are solely visual. We find that the ground "truth" is very muddy, but by using the feature selection tool of information gain, we extract 14 reliable visual concepts with mid-frequency use; all but one are visual concepts that refer to settings, rather than actors, objects, or events. We discover that the probability of another episode of a named story to recur after a gap of d days is proportional to 1/(d + 1). Wedefine a novel similarity measure incorporating both semantic and temporal properties between episodes i and j as: Dice(i, j)/(1+gap(i, j)). We exploit a low-level computer vision technique, normalized cut (Laplacian eigenmaps), for clustering these episodes into stories, and in the process document a weakness of this popular technique. We use these empirical results to make specific recommendations on how better visual semantic ontologies for news stories, and how better video annotation tools, should be designed.
Visual mining of spatial time series data
Authors: Gennady Andrienko, Natalia Andrienko, Peter Gatalsky
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

CommonGIS is a system comprising a number of tools for visual data analysis. In this paper we demonstrate our recent developments for analysis of spatial time series data.
Interceptor Based Constraint Violation Detection
Authors: Qianxiang Wang, Aditya Mathur
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Monitoring critical events such as constraints violations is one of the key issues of Autonomic Systems. This paper presents an interceptor based approach of constraint violation detection. In our approach, the monitor code is independent of functional code, and the monitor code can be generated automatically from XML-based constraint specifications. The experiment shows that our approach is feasible and is especially suitable for interface level constraints.
Low-power circuits using dynamic threshold devices
Authors: Paul Beckett
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We present simulations for ultra-thin body, fully-depleted, double-gate (DG) silicon-on-insulator (SOI) devices that can be readily optimized for both static power loss and performance by dynamically shifting the threshold voltage during operation. A small number of simple circuits are analyzed and it is demonstrated that subthreshold power can be reduced by a factor in excess of 103 for these examples.
Low Complexity Multiple Description Coding Method for Wireless Video
Authors: Yangli Wang, Chengke Wu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we present a new multiple description video coding method. It starts from GOB alternation to create two descriptions for each frame encoded, carriage of motion information in both descriptions helps to improve the quality of single channel reconstruction, and a process called low quality macroblock update helps to not only further improve the quality of single channel reconstruction but also reduce the mismatch between the encoder and decoder. The advantages of the proposed approach include: effectiveness, which has better performance than the well known MDTC video coder both in terms of Redundancy Rate Distortion, and in the packet loss scenario; low complexity, and standard compliant to the extent that each description can be decoded by a standard video decoder.
Competitive Reactions to Advertising and Promotion Attacks
Authors: Jan-Benedict E. M. Steenkamp, Vincent R. Nijs, Dominique M. Hanssens, Marnik G. Dekimpe
Venue: Marketing Science (2005)

How do competitors react to each other's price-promotion and advertising attacks? What are the reasons for the observed reaction behavior? We answer these questions by performing a large-scale empirical study on the short-run and long-run reactions to promotion and advertising shocks in over 400 consumer product categories over a four-year time span.Our results clearly show that the most predominant form of competitive response is passive in nature. When a reaction does occur, it is usually retaliatory in the same instrument, i.e., promotion attacks are countered with promotions, and advertising attacks are countered with advertising. There are very few long-run consequences of any type of reaction behavior. By linking reaction behavior to both cross- and own-effectiveness, we further demonstrate that passive behavior is often a sound strategy, while firms that do opt to retaliate often use ineffective instruments, resulting in "spoiled arms." Accommodating behavior is observed in only a minority of cases, and often results in a missed sales opportunity when promotional support is reduced. The ultimate impact of most promotion and advertising campaigns depends primarily on the nature of consumer response, not the vigilance of competitors.
Directions for AI in the eighties
Authors: Peter E. Hart
Venue: Issue 79 (January 1982) (1982)

The 1980's will be an exciting decade for artificial intelligence, one in which we can expect to see considerable progress on scientific questions, widespread application of Al techniques to problems of practical significance, and major changes in the social, political and economic structure of the field. In this article, I will attempt to identify some of the commercial, scientific and sociological considerations that I think will be important in coming years. In particular, I will introduce the metaphor of deep versus surface systems, and pose some challenges arising from the recognition of this distinction.
An Antisocial Strategy for Scheduling Mechanisms
Authors: Nandan Garg, Daniel Grosu, Vipin Chaudhary
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

Previous work on task scheduling mechanisms assumed that the agent's goal is to maximize its own profit without considering the effect of its strategy on the other agents' profit. This is not always the case, an agent may want to cause loses to the other agents besides maximizing its profit. Such an agent is said to be an antisocial agent. An antisocial agent will try to gain as much profit as possible relative to the other agents. In this paper we consider a mechanism for task scheduling on related machines in which each machine is associated with an agent. We develop an antisocial strategy which can be used by an antisocial agent to inflict losses to the other participating agents. We analyze the effect of different degrees of agent's antisociality on the losses inflicted to the other agents.
The sense lounger: establishing a ubicomp beachhead in elders' homes
Authors: Amy Hurst, John Zimmerman, Chris Atkeson, Jodi Forlizzi
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper we describe the Sense Lounger, a method for simply and cheaply turning a lounge chair into an initial "ubicomp" device in a home; providing a beachhead for transforming the home into a rich ubicomp environment. The Sense Lounger employs fabric sensors sewn into a chair's slipcover and force sensors on each leg to detect both an occupant and their activity. Drawing insights from user needs, we developed the Sense Lounger to (i) fit into the home and lifestyle of elders, (ii) assist and add value to the lives of elders, (iii) provide a platform for expanding assistive devices within the home environment. The current Sense Lounger prototype can be used to detect signs of life, patterns of use, posture, and sitting duration.
Low Power Embedded DRAMs with High Quality Error Correcting Capabilities
Authors: Philipp Ohler, Sybille Hellebrand
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Embedded memories are part of almost any embedded system. To ensure an error free operation, errordetecting/correcting codes or alternative schemes for on-line consistency checking can be used. The trade-offs with respect to error detection capabilities and hardware cost have been investigated in previous work. However, very often embedded systems also have to work with small batteries (e.g. mobile devices), and power consumption becomes a second crucial issue. In this paper a new low power design for on-line consistency checking is proposed. The proposed scheme is analyzed with respect to its power consumption and compared to error detecting/correcting schemes based on error correcting codes. The results show that on-line consistency checking based on the modulo-2 address characteristic can ensure both low error detection latencies and a reduced power consumption in contrast to alternative schemes.
Review of "Structural Mechanics Computer Programs" University Press of Virginia, Charlottesville, Virginia, 1105 pages.
Authors: Jackie Potts
Venue: ACM SIGDA Newsletter (1974)

In June, University Press of Virginia published <u>Structural Mechanics</u> Computer Programs, Surveys, Assessments, and Availability. The book contains most of the papers presented at the International Symposium on Structural Mechanics Computer Software which was held at the University of Maryland from 12 - 14 June. 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
Improving the performance of client web object retrieval
Authors: Alexander P. Pons
Venue: Journal of Systems and Software (2005)

The growth of the Internet has generated Web pages that are rich in media and that incur significant rendering latency when accessed through slow communication channels. The technique of Web-object prefetching can potentially expedite the presentation of Web pages by utilizing the current Web page's view time to acquire the Web objects of likely future Web pages. The performance of the Web object prefetcher is contingent on the predictability of future Web pages and quickly determining which Web objects to prefetch during the limited view time interval of the current Web page. The proposed Markov-Knapsack method uses an approach that combines a Multi-Markov Web-application centric prefetch model with a Knapsack Web object selector to enhance Web page rendering performance. The Markov Web page model ascertains the most likely next Web page set based on the current Web page and the Web object Knapsack selector determines the premium Web objects to request from these Web pages. The results presented in the paper show that the proposed methods can be effective in improving a Web browser cache-hit percentage while significantly lowering Web page rendering latency.
Thresher: automating the unwrapping of semantic content from the World Wide Web
Authors: Andrew Hogue, David Karger
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

We describe Thresher, a system that lets non-technical users teach their browsers how to extract semantic web content from HTML documents on the World Wide Web. Users specify examples of semantic content by highlighting them in a web browser and describing their meaning. We then use the tree edit distance between the DOM subtrees of these examples to create a general pattern, or wrapper, for the content, and allow the user to bind RDF classes and predicates to the nodes of these wrappers. By overlaying matches to these patterns on standard documents inside the Haystack semantic web browser, we enable a rich semantic interaction with existing web pages, "unwrapping" semantic data buried in the pages' HTML. By allowing end-users to create, modify, and utilize their own patterns, we hope to speed adoption and use of the Semantic Web and its applications.
Examining task engagement in sensor-based statistical models of human interruptibility
Authors: James Fogarty, Andrew J. Ko, Htet Htet Aung, Elspeth Golden, Karen P. Tang, Scott E. Hudson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

The computer and communication systems that office workers currently use tend to interrupt at inappropriate times or unduly demand attention because they have no way to determine when an interruption is appropriate. Sensor?based statistical models of human interruptibility offer a potential solution to this problem. Prior work to examine such models has primarily reported results related to social engagement, but it seems that task engagement is also important. Using an approach developed in our prior work on sensor?based statistical models of human interruptibility, we examine task engagement by studying programmers working on a realistic programming task. After examining many potential sensors, we implement a system to log low?level input events in a development environment. We then automatically extract features from these low?level event logs and build a statistical model of interruptibility. By correctly identifying situations in which programmers are non?interruptible and minimizing cases where the model incorrectly estimates that a programmer is non?interruptible, we can support a reduction in costly interruptions while still allowing systems to convey notifications in a timely manner.
RTG: A Scalable SNMP Statistics Architecture for Service Providers
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

SNMP is the standard protocol used to manage IP networks. Service providers often analyze the utilization statistics available from SNMP-enabled devices to make informed engineering decisions, diagnose faults and perform billing. However collecting and efficiently storing large amounts of time-series data quickly, without impacting network or device performance, is challenging in very large installations. We identify three crucial requirements for an SNMP statistical solution: (i) support for hundreds of devices each with thousands of objects; (ii) the ability to retain the data indefinitely; and (iii) an abstract interface to the data. We then compare the applicability of several tools in a service provider environment. Finally, we detail Real Traffic Grabber (RTG), an application currently in use on our national IP backbone which we developed in lieu of existing packages to meet our requirements.
Online learning of a simple perceptron learning with margin
Authors: Kazuyuki Hara, Masato Okada
Venue: Systems and Computers in Japan (2004)

The authors analyze the dynamics of online learning in a simple perceptron using a Gardner-style margin. The proposed method matches the perceptron rules for a margin of &kappa; = 0 and the Hebb rules when &kappa; &rarr; &infin;. The results of analysis show that the generalization error is smaller than that of the perceptron rules and the Hebb rules during initial learning even though the proposed method is in between these two sets of learning rules. In addition, the authors show that the generalization error for the proposed method matches that of the perceptron rules in terms of asymptotic characteristics. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 98&ndash;105, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10473
Energy Minimization for Hybrid BIST in a System-on-Chip Test Environment
Authors: Raimund Ubar, Tatjana Shchenova, Gert Jervan, Zebo Peng
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

This paper addresses the energy minimization problem for system-on-chip testing. We assume a hybrid BIST test architecture where a combination of deterministic and pseudorandom test sequences is used. The objective of our proposed technique is to find the best ratio of these sequences so that the total energy is minimized and the memory requirements for the deterministic test set are met without sacrificing test quality. We propose two different heuristic algorithms and a fast estimation method that enables considerable reduction of the computation time. Experimental results have shown the efficiency of the approach for finding reduced energy solutions with low computational overhead.