ppxscal/embedding_network huggingface dataset:
Dynamic Storage Resource Management Framework for the Grid
Authors: Wong Han Min, Wang Yonghong Wilson, Yeo Heng Ngi, Wang Donghong, Li Zhixiang, Leong Kok Hong, Yong Khai Leong
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

In this paper, we consider the design of a dynamic storage resource management framework for the Grid. The framework is service-oriented and conforms to the Open Grid Service Infrastructure (OGSI) specifications. The higher-level framework design is inspired by the Grid and the Peer-to-Peer network architecture, which have been proven to be very effective in distributed environments. The design guarantees a robust way of maintaining the storage resources as it does not rely on any supporting infrastructure. In our design, we included QoS performance metrics as part of our service interface to cater for high-performance Grid applications. At the lower level, we consider the usage of Storage Management Initiative Specifications (SMI-S), which enhance the flexibility and management of heterogeneous storage systems/devices, of various vendors.
Extensions of the Kuhn--Tucker Constraint Qualification to Generalized Semi-infinite Programming
Authors: Francisco Guerra Vázquez, Jan-J. Rückmann
Venue: SIAM Journal on Optimization (2005)

This paper deals with the class of generalized semi-infinite programming problems (GSIPs) in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be continuously differentiable. We introduce two extensions of the Kuhn--Tucker constraint qualification (which is based on the existence of a tangential continuously differentiable arc) to the class of GSIPs, prove a corresponding Karush--Kuhn--Tucker theorem, and discuss its assumptions. Finally, we present several examples which illustrate for the class of GSIPs some interrelations between the considered extensions of the Mangasarian--Fromovitz constraint qualification, the Abadie constraint qualification, and the Kuhn--Tucker constraint qualification.
Thermodynamical cost of reversible computing
Authors: Lev B. Levitin, Tommaso Toffoli
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Since reversible computing requires preservation of information throughout the entire computational process, it implies that all the errors that appear as a result of the interaction of the information-carrying system with uncontrolled degrees of freedom must be corrected. This can only be done at the expense of an increase in the entropy of the environment corresponding to the dissipation of the "noisy" part of the energy of the system in the form of heat.This paper gives an expression of that energy in terms of the effective noise temperature, and calculates the relationship between the energy dissipation rate and the rate of computation.
Selection of Time Series Forecasting Models based on Performance Information
Authors: Patricia Maforte dos Santos, Teresa Bernarda Ludermir, Ricardo Bastos Cavalcante Prudencio
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this work, we proposed to use the Zoomed Ranking approach to rank and select time series models. Zoomed Ranking, originally proposed to generate a ranking of candidate algorithms, is employed to solve a given classification problem based on performance information from previous problems. The problem of model selection in Zoomed Ranking was solved in two distinct phases. In the first phase, we selected a subset of problems from the instances base that were similar to the new problem at hand. This selection is made using the k-Nearest Neighbor algorithm, whose distance function uses the characteristics of the series. In the second phase, the ranking of candidate models was generated based on performance information (accuracy and execution time) of the models in the series selected from the previous phase. Our experiments using the Zoomed Ranking revealed encouraging results.
Searching the web: operator assistance required
Authors: Heikki Topi, Wendy Lucas
Venue: Information Processing and Management: an International Journal (2005)

This study examines the effects of the search interface and Boolean logic training on user search performance and satisfaction. We compared the use of an assisted search tool to that of a simple search interface like those typically found at commercial search engine sites. We found that the assisted search tool had a significant, positive effect on performance, satisfaction, and confidence. Promoting the use of advanced search features is therefore in the best interest of both Web search providers and users. In the absence of an assisted interface, a simple interface coupled with Boolean logic training was also an effective means for improving user performance. Given that most searchers choose to use the simple search box, it is important to provide them with applicable training to promote the effective use of the search tool. Interestingly, coupling the assisted interface with Boolean training was no more effective than either treatment alone.
Personal TV viewing by using live chat as metadata
Authors: Hisashi Miyamori, Satoshi Nakamura, Katsumi Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We propose a new TV viewing method by personalizing TV programs with live chat information on the Web. It enables a new way of viewing TV content from different perspectives reflecting viewers' viewpoints.
Battery-Efficient Task Execution on Reconfigurable Computing Platforms with Multiple Processing Units
Authors: Jawad Khan, Ranga Vemuri
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper presents a battery-efficient task execution methodology on Reconfigurable Computing (RC) Platforms which have multiple processing units. These processing units can be on-chip in the form of soft-processors, embedded processors or "Reconfigurable Tiles" where the reconfigurable area of an Field Programmable Gate Array (FPGA) is divided into fixed reconfigurable slots. Processing units can also be off-chip in the form of individual FPGAs and voltage-scalable processors. An application is modeled in the form of a precedence task graph. We assume that for each task in the task graph several different design-points are available which correspond to different voltage-frequency combinations for processors and different hardware implementations for FPGAs and "Reconfigurable Tiles". It is assumed that performance and total power consumption estimates for each design-point are available for any given implementation, including the peripheral components such as memory and display power usage. First we present an iterative heuristic algorithm for a single processing unit, which finds a sequence of tasks along with an appropriate design-point for each task, such that a deadline is met and the amount of battery energy used is as small as possible. Next, we extend this algorithm to multiple processing units in an RC platform. We used several real-world benchmarks to test the effectiveness of this methodology. Each benchmark was executed on one, two, three and four processing units and its power utilization was characterized by implementing it on a portable RC Platform called iPACE-V1. We present the results which show that choosing an appropriate execution mode is crucial for battery-efficient execution. We also show that parallel execution on multiple-processing units can actually be more battery-efficient than sequential execution on a single processing unit under certain circumstances.
The power-aware cord: energy awareness through ambient information display
Authors: Anton Gustafsson, Magnus Gyllenswärd
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In order to support increased consumer awareness regarding energy consumption, we have been developing new ways of representing and interacting with energy in electric products intended for domestic environments. The 'Power-Aware Cord' is a re-design of a common electrical power strip that displays the amount of energy passing through it at any given moment. This is done by dynamic glowing patterns produced by electroluminescent wires molded into the transparent electrical cord. Using this fully functional prototype, we have been investigating how such ambient displays can be used to increase energy awareness. An initial user study indicates that the Power-Aware Cord is a very accessible and intuitive mean for better understanding energy consumption. Future work includes further development of the mapping between load and visual pattern and in-depth studies of user perception and learning over time.
A minicomputer-based logic circuit fault simulator
Authors: Mark J. Flomenhoft, Brenda M. Csencsits
Venue: ACM SIGDA Newsletter (1974)

A logic circuit simulator implemented on a mini-computer with 16K core handles 1000 zero- and unit-delay gates. Single "stuck-at-0", "stuck-at-1", and "short-circuit" faults are simulated in parallel seven at a time using a table-driven selective-trace fault-injection algorithm. For a typical 100-gate circuit the simulation rate for the fault-free circuit or for a group of seven faults is about 800 input patterns per minute, and a complete fault simulation run takes about 5 minutes and costs $1.This paper, aimed at simulator program-designers rather than users, describes technical details of the implementation including minicomputer considerations, the data structure, coding three-valued-logic for efficient parallel simulation, the selective-trace algorithm, the recognition and resolution of critical races in flip-flops, the recognition and resolution of circuit oscillations, implicit fault collapsing, and short-circuit fault simulation.
MISQ: a UML-based analytical modeling methodology for optimizing web service composition
Authors: Seog-Chan Oh, Dongwon Lee, Soundar Kumara
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

A novel UML-based analytical modeling methodology, named MISQ, is presented for optimizing web service composition in Business Service Networks. MISQ enables functional and temporal analyses at a high-level design stage so that web service composition can be systematically optimized. Furthermore, MISQ provides an automatic generation of web service implementations for improving productivity and reliability.
NavTracks: Supporting Navigation in Software
Authors: Janice Singer, Robert Elves, Margaret-Anne Storey
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Any modification to a software system involves investigating the source code with the goal of understanding it. In turn, this investigation usually requires significant navigation effort. However, relatively little research has been conducted on software developer navigation patterns and tool support for improving navigation. Our research addresses this issue. We present Navtracks, a tool that supports browsing through software. NavTracks keeps track of the navigation history of software developers, forming associations between related files. These associations are then used as the basis for recommending potentially related files as a developer browses the software system.
Filemaker Pro 7: The Missing Manual
Authors: Geoff Coffey
Venue:  (2005)

Used by millions worldwide, FileMaker Pro is an award-winning database program for managing people, projects, images, assets, and other information. It's easy to use and totally customizable--so long as you know what you're doing. But FileMaker Pro doesn't come with a printed manual, so FileMaker Pro: The Missing Manual is the authoritative, jargon-free book that should have been in the box. FileMaker Pro: The Missing Manual approaches FileMaker the way FileMaker approaches you: it's user-friendly and seemingly straightforward enough, but it offers plenty of substance worthy of deeper exploration. Packed with practical information as well as countless expert tips and invaluable guidance, it's an in-depth guide to designing and building useful databases with the powerful and pliable FileMaker Pro.Covering FileMaker for both Windows and Macintosh, FileMaker Pro: The Missing Manual is ideal for small business users, home users, school teachers, developers--anyone who wants to organize information efficiently and effectively. Whether you want to run a business, publish a shopping cart on the Web, plan a wedding, manage a student information system at your school, or program databases for clients, this book delivers.Author Geoff Coffey has many years of experience using FileMaker Pro (he was, in fact, an early beta tester for the product). Author Susan Prosser is a FileMaker Certified Developer who trains other developers. Together, Coffey and Prosser show you how to:Get FileMaker up and running quickly and smoothlyImport and organize information with easeDesign relational databases that are simple to use, yet powerfulTake advantage of FileMaker Pro calculation capabilitiesAutomate processes with scriptingCustomize FileMaker Pro to your needs and preferencesShare information with other people (coworkers, clients, and customers) and other programsUnderstand and select the best security optionsWhat could easily come across as dry and intimidating--things like relational theory, calculations, and scripting--are presented in a way that is interesting and intuitive to mainstream users. In no time, you'll be working more productively and efficiently using FileMaker Pro.
Cross Layer Considerations for an Adaptive OFDM-Based Wireless Communication System
Authors: Hermann Rohling, Rainer Grünheid
Venue: Wireless Personal Communications: An International Journal (2005)

Future applications require high, but variable data rates and different quality of services (QoS) which is a real challenge for the communication system design. Additionally, the broadband radio channel can be assumed to be frequency selective and time variant, which means the transmission performance varies over time and frequency. The OFDM transmission technique is very flexible in adapting the transmission parameters to the current channel situation and to the application-specific requirements. This kind of flexibility will be applied to solve the technical tasks in the design procedures of future communication systems.
Network Simulation of the Electronic Battlefield
Authors: Richard A. Meyer, Steve Boyle, Bob Ollerton, Doug McKeon
Venue: Proceedings of the 2004 Users Group Conference (2004)

While many existing tools can simulate specific parts of wireless communication systems in detail, no single software tool, or integrated framework has been proposed to simulate the complete wireless systems including highly detailed RF propagation and radio and networking protocols. It has been shown that results from network simulation can be simply wrong and misleading when underlying devices and operating environments are not modeled appropriately. The primary reason for a lack of such integrated tools is the major computational challenge that is imposed by the combined model. This project proposes to build such an environment using HPC resources to overcome the computational challenge.
Lane recognition system based on the high-speed pattern matching method
Authors: Yoshiki Ninomiya, Arata Takahashi, Mitsuhiko Ohta
Venue: Systems and Computers in Japan (2004)

Applications of lane recognition using an on-board camera in the real world require image recognition technology that is both fast and robust. The authors propose a method that takes structure matching as a search problem for optimal patterns and then uses a voting approach for discrete template patterns as a method for pattern matching in this kind of image recognition technology. The authors implement their proposed method as an on-board device for lane recognition, then set it up in pipelined hardware, and confirm that it can work in real time. In addition, the results of comparing their method with a conventional lane recognition method using 1000 scenes of images of highways in the rain, a subject used for lane recognition, confirm that their method makes few errors and is robust. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(8): 45&ndash;53, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10591
Book review: Competitively Inhibited Neural Networks for Adaptive Parameter Estimation by Michael Lemmon (Kluwer Academic Publishers, 1991)
Venue: ACM SIGART Bulletin (1992)

Rigorous, formal treatments of neural network fundamentals (i.e., treatments whose arguments consist primarily of theorems and proofs) have by now focused on a number of aspects. The convergence properties (stability) and capacity of neural nets of various types have been analyzed in this manner to one degree or another (e.g., [1-3]), and their expressive power has also been the subject of a number of formal analyses (e.g.,[4]). Though not necessarily perfectly rigorous in the sense just mentioned, formal treatments of network dynamics also exist. For reasons which will become clear below, the remarkable paper of Amari and Maginu [5] is especially worthy of note. In this paper, the authors demonstrate that the size of the "basin" of an equilibrium (learned, if you will) state in an autocorrelation associative memory stands in a complex (but predictable) relationship with the distance between the state and the input vector. This paper, along with others by Amari and his coworkers, illustrates clearly that an indepth analysis of somewhat mundane properties of neural networks may yield surprising results of considerable significance.
Blind sales in electronic commerce
Authors: E. Aïmeur, G. Brassard, F. S. Mani Onana
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

We start with the usual paradigm in electronic commerce: a consumer who wants to buy from a merchant. However, both parties wish to enjoy maximal privacy. In addition to remaining anonymous, the consumer wants to hide her browsing pattern and even the identification of the product she may decide to buy. Nevertheless, she wants to be able to negotiate the price, pay, receive the product and even enjoy maintenance on it. On the other hand, the merchant wants to leak as little information as possible on his catalogue for fear that he might in fact be dealing with a hostile competitor. For this purpose, we introduce the Blind Customer Buying Behaviour model, which adds confidentiality to the standard Customer Buying Behaviour model. In this paper, we concentrate on blind catalogue browsing.
Multi-step media adaptation: implementation of a knowledge-based engine
Authors: Peter Soetens, Matthias De Geyter
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Continuing changes in the domains of consumer devices and multimedia formats demand for a new approach to media adaptation. The publication of customized content on a device requires an automatic adaptation engine that takes into account the specifications of both the device and the material to be published. These specifications can be expressed using a single domain ontology that describes the concepts of the media adaptation domain. In this document, we provide insight into the implementation of an adaptation engine that exploits this domain knowledge. We explain how this engine, through the use of description matching and Semantic Web Services, composes a chain of adaptation services which will alter the original content to the needs of the target device.
Over-Approximate Model of Multitasking Application Based on Timed Automata Using Only One Clock
Authors: Libor Waszniowski, Zdenek Hanzalek
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

The aim of this article is to show, how a multitasking application running under real-time operating system compliant with OSEK/VDX standard can be modeled by timed automata. The application under consideration consists of several tasks, it includes resource sharing and synchronization by events. For such system, we use model checking theory based on timed automata and we verify time and logical properties of proposed model by existing model checking tools. Since a complexity of the model-checking verification exponentially grows with the number of clocks used in a model, the proposed model uses only one clock for measuring execution time of all modeled tasks.
3-Coloring and 3-clique-ordering of locally connected graphs
Authors: Martin Kochol
Venue: Journal of Algorithms (2005)

We present a linear algorithm for 3-coloring of locally connected graphs.
Statistical geometry representation for efficient transmission and rendering
Authors: Aravind Kalaiah, Amitabh Varshney
Venue: ACM Transactions on Graphics (TOG) (2005)

Traditional geometry representations have focused on representing the details of the geometry in a deterministic fashion. In this article we propose a statistical representation of the geometry that leverages local coherence for very large datasets. We show how the statistical analysis of a densely sampled point model can be used to improve the geometry bandwidth bottleneck, both on the system bus and over the network as well as for randomized rendering, without sacrificing visual realism. Our statistical representation is built using a clustering-based hierarchical principal component analysis (PCA) of the point geometry. It gives us a hierarchical partitioning of the geometry into compact local nodes representing attributes such as spatial coordinates, normal, and color. We pack this information into a few bytes using classification and quantization. This allows our representation to directly render from compressed format for efficient remote as well as local rendering. Our representation supports both view-dependent and on-demand rendering. Our approach renders each node using quasi-random sampling utilizing the probability distribution derived from the PCA analysis. We show many benefits of our approach: (1) several-fold improvement in the storage and transmission complexity of point geometry; (2) direct rendering from compressed data; and (3) support for local and remote rendering on a variety of rendering platforms such as CPUs, GPUs, and PDAs.