ppxscal/embedding_network huggingface dataset:
Key Grids: A Protocol Family for Assigning Symmetric Keys
Authors: Amitanand Aiyer, Lorenzo Alvisi, Mohamed Gouda
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

We describe a family of protocols for assigning symmetric keys to processes in a network so that each process can use itsassigned keys to communicate securely with every other process. The k-th protocol in our protocol family, where 1 ¿ k ¿ logn, assigns O(k2 k¿n) symmetric keys to each process in the network. (Thus, our (log n)-th protocol assigns O(log2 n) symmetrickeys to each process. This is not far from the lower bound of O(log n) symmetric keys which we show is needed for each processto communicate securely with every other process in the network.) The protocols in our protocol family can be used to assignsymmetric keys to the processes in a sensor network, or ad-hoc or mobile network, where each process has a small memory tostore its assigned keys. We also discuss the vulnerability of our protocols to "collusion". In particular, we show that k¿ncolluding processes can compromise the security of the k-th protocol in our protocol family.
Systematic Scan Reconfiguration
Authors: A. A. Al-Yamani
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We present a new test data compression technique that achieves 10times to 40times compression ratios without requiring any information from the ATPG tool about the unspecified bits. The technique is applied to both single-stuck as well as transition fault test sets. The technique allows aggressive parallelization of scan chains leading to similar reduction in test time. It also reduces tester pins requirements by similar ratios. The technique is implemented using a hardware overhead of a few gates per scan chain.
Applying Preference-Based Fuzzy Clustering Technology to Improve Grid Resources Selection Performance
Authors: Dong Guo, Liang Hu, Shilan Jin, Bingxin Guo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

How to select proper resources for applications is a critical and complex issue which results from applications' multiple requirements and grid resources' features of being distributed, heterogeneous, autonomous, and dynamically available. This paper proposes a preference-based fuzzy clustering method to improve grid resources selection performance. It applies fuzzy clustering technology according to application preference to create resource clusters, then the clusters are evaluated and proper one(s) can be selected. This method can meet applications' requirements and reduce the cost on choosing resources. Furthermore, since resources are classified by different application preferences, this method can also avoid heavy loads' centralizing on only a few resources so as to improve load balance in grid environments.
RTF: a real-time framework for developing scalable multiplayer online games
Authors: Frank Glinka, Alexander Ploß, Jens Müller-lden, Sergei Gorlatch
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

This paper presents a middleware system called RTF (Real-Time Framework) which aims at supporting the development of modern real-time online games. The RTF automatically distributes the game state among participating servers, and supports parallel state update computations, as well as efficient communication and synchronization between game servers and clients. The game developers access the RTF via a comfortable interface that offers a considerably higher level of abstraction than the time-consuming and error-prone programming in C++ with socket-based communication. We describe the structure of the RTF system and its current proof-of-concept implementation which supports the multi-server parallelization concepts of zoning, instancing and replication for real-time online games. The novel feature of the RTF is the combination of these three concepts which allows the developer to create large, seamless virtual worlds and to migrate zones between servers.
Using neighbors to date web documents
Authors: Sérgio Nunes, Cristina Ribeiro, Gabriel David
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

Time has been successfully used as a feature in web information retrieval tasks. In this context, estimating a document's inception date or last update date is a necessary task. Classic approaches have used HTTP header fields to estimate a document's last update time. The main problem with this approach is that it is applicable to a small part of web documents. In this work, we evaluate an alternative strategy based on a document's neighborhood. Using a random sample containing 10,000 URLs from the Yahoo! Directory, we study each document's links and media assets to determine its age. If we only consider isolated documents, we are able to date 52% of them. Including the document's neighborhood, we are able to estimate the date of more than 86% of the same sample. Also, we find that estimates differ significantly according to the type of neighbors used. The most reliable estimates are based on the document's media assets, while the worst estimates are based on incoming links. These results are experimentally evaluated with a real world application using different datasets.
Absorptive and transformative capacities in nanotechnology innovation systems
Authors: Krsto Pandza, Robin Holt
Venue: Journal of Engineering and Technology Management (2007)

We identify managerial challenges offered by an emergent nanotechnology innovation system in which knowledge is dispersed, asymmetric and contested. We argue the proposed models of knowledge absorption and transformation enhance existing theories of knowledge and emergent technology by recognizing how and why knowledge flows among the actors in emergent technology innovation system. We base our argument on combined research evidence from a Delphi study concerning the future of European manufacturing, from which a selected statement has been analyzed, and from analysis of the NanoManufacturing Institute at Leeds University, UK; specifically its work in building ties between different actors associated with nanotechnology. We conclude our paper with suggestions for future research.
Randomized algorithms for data reconciliation in wide area aggregate query processing
Authors: Fei Xu, Christopher Jermaine
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Many aspects of the data integration problem have been considered in the literature: how to match schemas across different data sources, how to decide when different records refer to the same entity, how to efficiently perform the required entity resolution in a batch fashion, and so on. However, what has largely been ignored is a way to efficiently deploy these existing methods in a realistic, distributed enterprise integration environment. The straightforward use of existing methods often requires that all data be shipped to a coordinator for cleaning, which is often unacceptable. We develop a set of randomized algorithms that allow efficient application of existing entity resolution methods to the answering of aggregate queries over data that have been distributed across multiple sites. Using our methods, it is possible to efficiently generate aggregate query results that account for duplicate and inconsistent values scattered across a federated system.
Very Fast Fourier Transform Algorithms Hardware for Implementation
Authors: A. M. Despain
Venue: IEEE Transactions on Computers (1979)

A new method of deriving very fast Fourier transform (FFT) algorithms is described. The resulting algorithms do not employ multiplication and have a form suitable for high performance hardware implementations. The complexity of the algorithms compares favorably to the recent results of Winograd [1].
Contributions of the gate current and channel current variation to the post-breakdown MOSFET performance
Authors: R. Fernández, R. Rodríguez, M. Nafría, X. Aymerich
Venue: Microelectronic Engineering (2008)

A new approach to the modelling of the post-breakdown (BD) performance of MOSFETs for circuit simulation is presented, which separately considers the additional post-BD gate current and the variation of the MOSFET channel current. The post-BD gate current is modelled using an improved equivalent circuit whereas the BSIM4 model is used to describe the MOSFET channel current. This approach has allowed to analyse the contributions of both currents on the post-BD I"D-V"D characteristics. The results show that the gate current increase and the variation of the channel current are determining factors of the MOSFET performance degradation after BD.
Rules and Ontology in Compliance Management
Authors: Frederick Yip, Nandan Parameswaran, Pradeep Ray
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Compliance Management (CM) is the management process that an organization implements to ensure organizational compliance with relevant requirements and expectations. It is a continual, manual and labor intensive process that is proved to be of great challenge for many organizations. CM affects almost every aspect of an organization and is in nature a complex problem due to voluminous knowledge and data involved. In our attempts to automate and simplify compliance, we propose and examine a semantic rule- based approach for modeling compliance knowledge with the use of semantic web rules (SWRL) and web ontology language (OWL). We study the use of exception handling approach to create a more robust rule base to deal with data incompleteness in the semantic web.
Exploration of Relations between Symbolic and Conexionist Techniques of Computational Intelligence
Authors: Fabio Lopes Caversan, Alvaro Roberto Silvestre Fialho
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work addressed a contribution to the Computa- tional Intelligence field, focused on two of its main tech- niques: Fuzzy and Neural Computing. An exploration of the techniques relations was performed. A framework for simulations and data collecting was specified and imple- mented. Computational simulations of transformations be- tween fuzzy and neural models were realized and the results analyzed are presented in this paper.
B73-6 Computing Terminals: International Computer State of the Art Report
Authors: L. C. Hobbs
Venue: IEEE Transactions on Computers (1973)

This publication is not really a book but is similar to a Joint Computer Conference proceedings devoted to a single topic. It includes an analysis section that is a transcript of a discussion between several participating experts. The result is what one would expect from a panel discussion-a somewhat rambling presentation of informed opinions but without adequate supporting justification or rationale. Nonetheless many important points are made by the participants.
Microprocessor Input/Output Architecture
Authors: J. F. Wakerly
Venue: Computer (1977)

There are at least as many different microprocessor input/output organizations, circuit configurations, and device types as there are microprocessor families and manufacturers. Due to the diversity of competing approaches and devices, their similarities and differences are not always evident. The fact that each manufacturer describes his approaches and devices differently, and the relative scarcity of formal text material on microprocessors, do not make the situation any better. In this short space there is no hope of comprehensively surveying all available approaches and devices (nor would I want to, even if space were available!). On the other hand, I can present an overview of basic microprocessor I/O organization and typical circuit configurations and devices. Using these concepts as a basis, one may be able to make comparisons between current and future approaches available commercially.
Generating a Topic Hierarchy from Dialect Texts
Authors: Win De Smet, Marie-Francine Moens
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We built a system for the automatic creation of a textbased topic hierarchy, meant to be used in a geographically defined community. This poses two main problems. First, the appearance of both standard language and a community-related dialect, demanding that dialect words should be as much as possible corrected to standard words, and second, the automatic hierarchic clustering of texts by their topic. The problem of correcting dialect words is dealt with by performing a nearest neighbor search over a dynamic set of known words, using a set of transition rules from dialect to standard words, which are learned from a parallel corpus. We solve the clustering problem by implementing a hierarchical co-clustering algorithm that automatically generates a topic hierarchy of the collection and simultaneously groups documents and words into clusters.
Computer Simulation: a Tutorial
Authors: G. Adkins
Venue: Computer (1977)

Simulation has been described by Shannon1as "the process of designing a computerized model of a system (or process) and conducting experiments with this model for the purpose either of understanding the behavior of the system or of evaluating various strategies for the operation of the system." It follows from this definition that we must concern ourselves with a precise formulation of the system to be studied, translation of this formulation into a computer program, and interpretation and use of the simulation results.
Global Modes in Kernel Density Estimation: RAST Clustering
Authors: Oliver Wirjadi, Thomas Breuel
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The mean shift algorithm is a widely used method for finding local maxima in feature spaces. Mean shift algorithms have been shown in the literature to be equivalent to a gradient ascent optimization of a kernel density estimate. This paper describes a novel, globally optimal optimization method and compares the suboptimal mean shift solutions with the globally optimal solutions derived by the new algorithm. Experimental results on both simulated and real data show that the new algorithm yields solutions that are often significantly better than the suboptimal solutions identified by the mean shift algorithm, and that it scales better to large sample sizes and is more robust to noise levels.
Network Coding With Interleaving
Authors: Zheng Huang, Xin Wang, Xueqing Chen, Haibin Kan
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Interleaving is a scheme of adapting random error-correcting codes to bursty channels in the classical coding theory. Network coding has been first introduced as a new paradigm of improving network throughput by allowing coding of incoming messages at the intermediate nodes. Recently network coding has been implemented in the practical case such as the P2P network. In this paper we investigate to build a connection between interleaving and network coding. This coupling is desirable in the applications such as P2P media streaming where burst-errors could severely reduce the performance (like Mosaic). Analysis shows that it is effective and feasible to implement interleaving at sink and source node without introducing extra delay at the intermediate nodes.
A Production System for Software Product Lines
Authors: Gary J. Chastek, Patrick Donohoe, John D. McGregor
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Companies such as Toyota have achieved significant competitive advantage by treating product production as a system that can be planned and optimized. Software product line organizations can achieve similar advantage when they explicitly coordinate the actions of core asset and product developers. We describe a technique for planning the production system for a software product line organization. The technique encompasses a production strategy, which relates the production goals of the product line to the method of core asset and product development; and a production method, which coordinates the development of core assets with the production of products. The results of the technique are documented in a production plan, which guides the product developers through the steps of production. Data gathered from representatives of SPLC Product Line Hall of Fame [1] members and our experience working with product line organizations are used to illustrate problems and specify solutions.
The scheme of things: standardization at Snowbird
Authors: William Clinger
Venue: ACM SIGPLAN Lisp Pointers (1988)

About fifty Schemers came a day early for the 1988 ACM Conference on Lisp and Functional Programming, which was held in late July at Snowbird, Utah. They devoted the Sunday before the conference to revising once again the Revised Report on the Algorithmic Language Scheme [1], or R3RS for short. Three days later, after the conference, the IEEE/MSC/P1178 Working Group on Scheme met for the first time. A two-day meeting of ISO/IEC JTC1/SC22 WG-16 that followed made it a good week for alphabet soup.
An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers
Authors: Pablo F. Castro, T. S. E. Maibaum
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

In the present paper we use a variation of a well-known example (dining philosophers) to illustrate how deontic logics can be used to specify, and verify, systems with faulttolerant characteristics. Towards this goal, we first introduce our own version of a propositional deontic logic, and then some of its most important metaproperties are described. Our main goal is to show that our deontic formalism is suitable for use in practical examples, and also to prepare the ground for more inclusive formalisms.
Experiments on the use of option policies in reinforcement learning
Authors: Letícia M. M. Friske, Carlos H. C. Ribeiro
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

In many reinforcement learning applications, the use of options based on sequences of low level actions (macro operators) has been reported to produce learning speedup due to a more active exploration of the state space. In this paper we present an evaluation of the use o f two sorts of option policies in a series of contexts: option policies O_{&euro;} (action sequences that depend on the states visited during execution), and option policies O_{S} (fixed sequence of actions, depending exclusively on the state in which the option is initiated). Our goals were a) to analyze O_{S} policies and compare them to O_{&euro;} policies with respect to convergence and learned policy; and b) to study the use of a Termination Improvement technique for O_{S} policies which allows for interruption of option execution if a more promising one is found . Results show that an O_{S} policy can be more effective than an O_{&euro;}policy, unless the latter is designed considering prior domain knowledge. Moreover, Termination Improvement for O_{S} options increases effectiveness of learning due to autonomous adaptation of the size of the action sequence depending on the state where the option is initiated.
Highlights of the Computer Elements Workshop Mesa, Arizona
Authors: W. Rosenbluth
Venue: Computer (1978)

This special issue on the business of applying microelectronic components (commonly lumped under the term "microprocessors") is dedicated to the proposition that the LSI microelectronics generation is now replacing the MSI TTL generation for the vast majority of applications for electronic control and intelligence. With this transition, the skills repertoire formerly attributed to the "systems man" must now be acquired by the "LSI components man." In effect, the systems engineering chore has moved one step closer to the device engineer.
Towards TQM in IT services
Authors: Xian Chen, Paul Sorenson
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

In the past five years, more and more information technology (IT) projects have been adopting service-oriented solutions. In addition, more and more traditional business and government organizations are focused on clearly identifying and monitoring the core IT services they are delivering. The remarkable growth of web service technologies and service-oriented architecture (SOA) solutions yields both challenges and opportunities in improving the quality of IT services and has given rise to a variety of IT service management frameworks like IT Infrastructure Library (ITU) and Capability Maturity Model Integrated (CMMJ). This paper presents the problem of total quality management (TQM) in IT services, followed by a review of quality definitions from four levels of perspectives. Based on the comparison of the different definitions, the necessity of integration of quality measurement and improvement approaches is identified and our preliminary work on TQM in IT services is introduced.
Power-law vs exponential queueing in a network traffic model
Authors: Konstantinos P. Tsoukatos, Armand M. Makowski
Venue: Performance Evaluation (2008)

We examine the impact of network traffic dependencies on queueing performance in the context of a popular stochastic model, namely the infinite capacity discrete-time queue with deterministic service rate and M|G|~ arrival process. We propose approximations to the stationary queue size distribution which are generated by interpolating between heavy and light traffic extremes. This is done under both long- and short-range dependent network traffic. Under long-range dependence, the heavy traffic results can be expressed in terms of Mittag-Leffler special functions which generalize the exponential distribution and yet display power-law decay. Numerical results from exact expressions (when available), approximations and simulations support the following conclusions: Network traffic dependencies need to be carefully accounted for, but whether this is accomplished through a short- or long-range dependent stochastic model bears little impact on queueing performance. The differences between exponential and power-law queueing are negligible at the ''head'' of the distribution, and manifest themselves only for large buffers.