ppxscal/embedding_network huggingface dataset:
A Performance Comparison of Tree and Ring Topologies in Distributed Systems
Authors: Min Huang, Brett Bode
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

A distributed system is a collection of computers that are connected via a communication network. Distributed systems have become commonplace due to the wide availability of low-cost, high performance computers and network devices. However, the management infrastructure often does not scale well when distributed systems get very large. The considerations in building a distributed system are the choice of the network topology and the method used to construct the distributed system so as to optimize the scalability and reliability of the system, lower the cost of linking nodes together and minimize the message delay in transmission, and simplify system resource management. We have developed a new distributed management system that is able to handle the dynamic increase of system size, detect and recover the unexpected failure of system services, and manage system resources. The topologies used in the system are the tree-structured network and the ring-structured network.
Book review: Three-Dimensional Machine Vision by Takeo Kanade (Kluwer Academic Publishers)
Venue: Issue 103 (Jan., 1988) (1988)

Three-Dimensional Machine Vision edited by Takeo Kanade brings together fourteen papers dealing with three-dimensional range data and written by various researchers in the field. Major topics include 3-D sensors, feature extraction, recognition and complete systems, which are the four sections of the book. Though some of the papers are similar to others by the authors, the papers were generally written for this book. Sensors and recognition algorithms each have 4 papers and each are approximately one-third of the book. Feature extraction and systems each have 3 papers and split the remaining one-third. 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
Sparse distributed memory using N-of-M codes
Authors: Steve B. Furber, W. John Bainbridge, J. Mike Cumpstey, Steve Temple
Venue: Neural Networks (2004)

An analysis is presented of a sparse distributed memory (SDM) inspired by that described by Kanerva | Kanerva, P. (1988). Sparse distributed memory. Cambridge, MA: MIT Press | but modified to facilitate an implementation based on spiking neurons. The memory presented here employs sparse binary N-of-M codes, unipolar binary synaptic weights and a simple Hebbian learning rule. It is a two-layer network, the first (fixed) layer being similar to the 'address decoder' in Jaeckel's |Jaeckel, L.A. (1989). A class of designs for a sparse distributed memory. RIACS Technical Report 89.30, NASA Ames Research Centre| 'hyperplane' variant of Kanerva's SDM and the second (writeable) 'data store' layer being a correlation matrix memory as first proposed by Willshaw et al. | Willshaw, D. J., Buneman, O.P., & Longuet-Higgins, H.C. (1969). Non-holographic associative memory. Nature, 222, 960-962|. The resulting network is shown to have good storage efficiency and is scalable. The analysis is supported by numerical simulations and gives results that enable the configuration of the memory to be optimised for a range of noiseless and noisy environments.
Heuristics for the Maximum Outerplanar Subgraph Problem
Authors: Timo Poranen
Venue: Journal of Heuristics (2005)

Determining the maximum outerplanar subgraph of a given graph is known to be an NP-complete problem. In the literature there are no earlier experiment on approximating the maximum outerplanar subgraph problem. In this paper we compare solution quality and running times of different heuristics for finding maximum outerplanar subgraphs. We compare a greedy heuristic against a triangular cactus heuristic and its greedy variation. We also use the solutions from the greedy heuristics as initial solutions for a simulated annealing algorithm.The main experimental result is that simulated annealing with initial solution taken from the greedy triangular cactus heuristic yields the best known approximations for the maximum outerplanar subgraph problem.
The Design of VisFlowConnect-IP: A Link Analysis System for IP Security Situational Awareness
Authors: Xiaoxin Yin, William Yurcik, Adam Slagell
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Visualization of IP-based traffic dynamics on networks is a challenging task due to large data volume and the complex, temporal relationships between hosts. We present the architecture of VisFlowConnect-IP, a powerful new tool to visualize IP network traffic flow dynamics for security situational awareness. VisFlowConnect-IP allows an operator to visually assess the connectivity of large and complex networks on a single screen. It provides an overall view of the entire network and filter/drill-down features that allow operators to request more detailed information. Preliminary reports from several organizations using this tool report increased responsiveness to security events as well as new insights into understanding the security dynamics of their networks. In this paper we focus specifically on the design decisions made during the VisFlowConnect development process so that others may learn from our experience. The current VisFlowConnect architecture ¿ the result of these design decisions ¿ is extensible to processing other high-volume multi-dimensional data streams where linkconnectivity/activity is a focus of study. We report experimental results quantifying the scalability of the underlying algorithms for representing link analysis given continuous high-volume traffic flows as input.
Mining positive and negative association rules: an approach for confined rules
Authors: Maria-Luiza Antonie, Osmar R. Zaïane
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative association rules are useful in market-basket analysis to identify products that conflict with each other or products that complement each other. They are also very convenient for associative classifiers, classifiers that build their classification model based on association rules. Many other applications would benefit from negative association rules if it was not for the expensive process to discover them. Indeed, mining for such rules necessitates the examination of an exponentially large search space. Despite their usefulness, and while they were referred to in many publications, very few algorithms to mine them have been proposed to date. In this paper we propose an algorithm that extends the support-confidence framework with sliding correlation coefficient threshold. In addition to finding confident positive rules that have a strong correlation, the algorithm discovers negative association rules with strong negative correlation between the antecedents and consequents.
On a proposed floating-point standard
Authors: W. Kahan, J. Palmer
Venue: ACM SIGNUM Newsletter (1979)

A standard for binary floating-point arithmetic is being proposed and there is a very real possibility that it will be adopted by many manufacturers and implemented on a wide range of computers. This development matters to all of us concerned with numerical software. One of the principal motivations for the standard is to distribute more evenly the burden of portability between hardware and software. At present, any program intended to be portable must be designed for a mythical computer that enjoys no capability not supported by every computer on which the program will be run. That mythical computer is so much grubbier than almost any real computer that a portable program will frequently be denigrated as "suboptimal" and then supplanted by another program supposedly "optimal" for the real computer in question but often inferior in critical respects like reliability. A standard --- almost any reasonable standard --- will surely improve the situation. A standard environment for numerical programs will promote fair comparisons and sharing of numerical codes, thereby lowering costs and prices. Furthermore, we have chosen repeatedly to enrich that environment in order that applications programs be simpler and more reliable. Thus will the onus of portability be shared among hardware manufacturers and software producers.
Bulletproof Web Design: Creating Flexibility with XHTML and CSS
Authors: Dan Cederholm
Venue:  (2005)

No matter how visually appealing or packed with content your Web site is, it isn't succeeding if it's not reaching the widest possible audience. If you get this guide, you can be assured it will! By deconstructing a series of real-world Web sites, author and Web designer extraordinaire Dan Cederholm outlines 10 strategies for creating standards-based designs that provide flexibility, readability, and user control-key components of every successful Web site. Each chapter starts out with an example of what Dan refers to as an “unbulletproof” concept-an existing site that employs a traditional approach and its associated pitfalls. Dan then deconstructs that approach, noting its downsides and then making the site over using Cascading Style Sheets (CSS). By the end of each chapter, you'll have replaced traditional, bloated, inaccessible page components with lean markup and CSS. The guide culminates with a chapter that pieces together all of the page components discussed in prior chapters into a single page template.
An iteration formulation for normalized diode characteristics: Letters to the Editor
Authors: Ji-Huan He, Yu-Qin Wan, Qian Guo
Venue: International Journal of Circuit Theory and Applications (2004)

By a general Lagrange multiplier, an iteration approach is proposed to solve the generalized normalized diode equation, by suitable choice of the initial trial-function, one-step iteration leads to a high accurate solution, which is valid for the whole solution domain. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An adaptive, fast, and safe XML parser based on byte sequences memorization
Authors: Toshiro Takase, Hisashi MIYASHITA, Toyotaro Suzumura, Michiaki Tatsubori
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

XML (Extensible Markup Language) processing can incur significant runtime overhead in XML-based infrastructural middleware such as Web service application servers. This paper proposes a novel mechanism for efficiently processing similar XML documents. Given a new XML document as a byte sequence, the XML parser proposed in this paper normally avoids syntactic analysis but simply matches the document with previously processed ones, reusing those results. Our parser is adaptive since it partially parses and then remembers XML document fragments that it has not met before. Moreover, it processes safely since its partial parsing correctly checks the well-formedness of documents. Our implementation of the proposed parser complies with the JSR 63 standard of the Java API for XML Processing (JAXP) 1.1 specification. We evaluated Deltarser performance with messages using Google Web services. Comparing to Piccolo (and Apache Xerces), it effectively parses 35% (106%) faster in a server-side use-case scenario, and 73% (126%) faster in a client-side use-case scenario.
Serious Games: Games That Educate, Train, and Inform
Authors: David R. Michael, Sandra L. Chen
Venue:  (2005)

Coverage includes- David "RM" Michael has been a successful independent software developer for over 10 years, working in a variety of industries, including video games. He is the owner of DavidRM Software (www.davidrm.com) and co-owner of Samu Games (www.samugames.com). Michael is the author of The Indie Game Development Survival Guide, and his articles about game design, development, and the game development industry have appeared on GameDev.net (www.gamedev.net) and in the book Game Design Perspectives. His blog about independent games, serious games, and independent software is Joe Indie (www.joeindie.com). Sande Chen has been active in the gaming industry for over five years. She has written for mainstream and industry publications, including Secrets of the Game Business, and was a speaker at the 2005 Game Developers Conference. Her past game credits include Independent Games Festival winner Terminus, Scooby-Doo, and JamDat Scrabble. Chen holds dual degrees in economics and in writing and humanistic studies from the Massachusetts Institute of Technology, an M.Sc. in economics from the London School of Economics, and an M.F.A. in cinema-television from the University of Southern California. In 1996, she was nominated for a Grammy in music video direction. She currently works as a freelance writer/game designer. Covers techniques to make entertainment-oriented games richer and provide a deeper experience. The focus on serious games continues to grow--from coverage in the media to conferences and buzz within the game development community. Provides an overview of the major markets for serious games, including current examples and future anticipation.
Bioinformatics on a Heterogeneous Java Distributed System
Authors: Andrew J. Page, Thomas M. Keane, Thomas J. Naughton
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

A programmable Java distributed system, which utilises the free resources of a heterogeneous set of computers linked together by a network, has been developed. The system has been successfully deployed on over 200 computers, which were distributed over a number of locations, and has been successfully used to process bioinformatics, biomedical engineering, and cryptography applications.We present two bioinformatics applications, DSEARCH, which performs sensitive database and DPRml which performs distributed phylogeny reconstruction by maximum likelihood.
Design mentoring based on design evolution analysis
Authors: Zhenchang Xing
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
FPGA Implementations of the ICEBERG Block Cipher
Authors: Francois-Xavier Standaert, Gilles Piret, Gael Rouvroy, Jean-Jacques Quisquater
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper presents FPGA (Field Programmable Gate Array) implementations of ICEBERG, a block cipher designed for reconfigurable hardware implementations and presented at FSE 2004. All its components are involutional and allow very efficient combinations of encryption/decryption. The implementations proposed also allow changing the key and Encrypt/Decrypt (E/D) mode for every plaintext, without any performance loss. In comparison with other recent block ciphers, the implementation results of ICEBERG show a significant improvement of hardware efficiency. Moreover, the key and E/D agility allows considering new encryption modes to counteract certain side-channel attacks.
Software Architecture to Support Domain Semantics Representation
Authors: Eran Rubin, Yair Wand
Venue: Proceedings of the IEEE International Conference on Software - Science, Technology & Engineering (2005)

This study incorporates the development of a framework and software architecture aimed to improve the integration of software implementation with the general system analysis and design (SAD) process by assuring that conceptual knowledge is effectively preserved in software code. As software systems become more powerful, they are expected to handle a wider range of situations without losing functionality. However, such expectations are often materialized by increasing levels of knowledge about the system domain. It is already well recognized that the process of system implementation, analysis and design requires much knowledge about the modeled domain. However, as the process approaches the implementation phase, many conceptual ideas are lost due to physical concerns. The software architecture developed in this study addresses this situation. It also provides a general conceptual approach for the development of a new generation of semantically rich software architectures.
Examination of the Effects of Degeneration on Vertebral Artery by Using Neural Network in Cases With Cervical Spondylosis
Authors: Hüseyin Özdemir, M. Said Berilgen, Selami Serhatlzoğlu, Hüseyin Polat, Uçman Ergün, Necaattin Barzşçi, Fzrat Hardalaç
Venue: Journal of Medical Systems (2005)

The scope of this study is to diagnose vertebral arterial inefficiency by using Doppler measurements from both right and left vertebral arterials. Total of 96 patients' Doppler measurements, consisting of 42 of healthy, 30 of spondylosis, and 24 of clinically proven vertebrobasillary insufficiency (VBI), were examined. Patients' age and sex information as well as RPSN, RPSVN, LPSN, LPSVN, and TOTALVOL medical parameters obtained from vertebral arterials were classified by neural networks, and the performance of said classification reached up to 93.75% in healthy, 83.33% in spondylosis, and 97.22% in VBI cases. The area under ROC curve, which is a direct indication of repeating success ratio, is calculated as 92.3%, and the correlation coefficient of the classification groups is 0.9234. It is also demonstrated that those medical parameters of age and systolic velocity, which were applied into the neural networks, were more effective in developing vertebral deficiency.
Recognition and Extraction High Precision Digital Road Map
Authors: Mang Chen, Yuncai Liu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper presents a system of high precision road navigation map generation from CAD geographical map. First, get road curb line; Then, pairing two road curb line built road, and computing road central line built road navigation vector; Last, detecting intersection create intersection vector. By extensive experiments, the system has shown good efficiency and robustness.
An Energy-Efficient Middleware for Supporting Multimedia Services in Mobile Grid Environments
Authors: Yun Huang, Shivajit Mohapatra, Nalini Venkatasubramanian
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, we present techniques for exploiting intermittently available resources in grid infrastructures to support QoS-based multimedia applications on mobile devices. Specifically, we integrate power aware admission control, grid resource discovery, dynamic load-balancing and energy adaptation techniques to enable power deficient devices such as PDAs to run distributed multimedia applications. Our integrated solution adapts to dynamic changes in device energy consumption and unpredictable grid resource availabilities without compromising application Quality of Service (QoS). Our simulation results indicate that our power-aware grid-based approaches, not only improve QoS of mobile multimedia services, but also efficiently load-balance the grid resources.
Improving Preemptive Prioritization via Statistical Characterization of OLTP Locking
Authors: David T. McWherter, Bianca Schroeder, Anastassia Ailamaki, Mor Harchol-Balter
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

OLTP and transactional workloads are increasingly common in computer systems, ranging from e-commerce to warehousing to inventory management. It is valuable to provide priority scheduling in these systems, to reduce the response time for the most important clients, e.g. the "big spenders". Two-phase locking, commonly used in DBMS, makes prioritization difficult, as transactions wait for locks held by others regardless of priority. Common lock scheduling solutions, including non-preemptive priority inheritance and preemptive abort, have performance drawbacks for TPC-C type workloads. The contributions of this paper are two-fold: (i) We provide a detailed statistical analysis of locking in TPC-C workloads with priorities under several common preemptive and non-preemptive lock prioritization policies. We determine why non-preemptive policies fail tosufficiently help high-priority transactions, and why pre-emptive policies excessively hurt low-priority transactions. (ii) We propose and implement a policy, POW, that provides all the benefits of preemptive prioritization without its penalties.
Haptic-Assisted Guidance System for Navigating Volumetric Data Sets
Authors: Erick Mendez, Shunsuke Yoshida, Haruo Noma, Robert W. Lindeman, Yasuyuki Yanagida, Shinobu Masaki, Kenichi Hosaka
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper, a new approach for navigation assistance through sets of volumetric data is presented. This innovative method uses force feedback in two dimensions to guide the user to a region of interest. The haptic feedback is calculated under two methods and we explain the implementation of both approaches. The output is displayed by the Proactive Desk, a two dimensional force feedback device developed at the Advanced Telecommunications Research Institute. This new approach is targeted to scientists who work with sets of volumetric data and who wish to find information using visual scanning enhanced with haptics. Our system is designed for Magnetic Resonance Images (MRI) overlaid with functional MRI.
A polynomial-time Nash equilibrium algorithm for repeated games
Authors: Michael L. Littman, Peter Stone
Venue: Decision Support Systems (2005)

With the increasing reliance on game theory as a foundation for auctions and electronic commerce, efficient algorithms for computing equilibria in multiplayer general-sum games are of great theoretical and practical interest. The computational complexity of finding a Nash equilibrium for a one-shot bimatrix game is a well-known open problem. This paper treats a related but distinct problem--that of finding a Nash equilibrium for an average-payoff repeated bimatrix game, and presents a polynomial-time algorithm. Our approach draws on the well-known "folk theorem" from game theory and shows how finite-state equilibrium strategies can be found efficiently and expressed succinctly.