ppxscal/embedding_network huggingface dataset:
Experiences Acquired in the Design of RoboCup Teams: A Comparison of Two Fielded Teams
Authors: Stacy Marsella, Milind Tambe, Jafar Adibi, Yaser Al-Onaizan, Gal A. Kaminka, Ion Muslea
Venue: Autonomous Agents and Multi-Agent Systems (2001)

Increasingly, multi-agent systems are being designed for a variety of complex, dynamic domains. Effective agent interactions in such domains raise some of the most fundamental research challenges for agent-based systems, in teamwork, multi-agent learning and agent modelling. The RoboCup research initiative, particularly the simulation league, has been proposed to pursue such multi-agent research challenges, using the common testbed of simulation soccer. Despite the significant popularity of RoboCup within the research community, general lessons have not often been extracted from participation in RoboCup. This is what we attempt to do here. We have fielded two teams, ISIS97 and ISIS98, in RoboCup competitions. These teams have been in the top four teams in these competitions. We compare the teams, and attempt to analyze and generalize the lessons learned. This analysis reveals several surprises, pointing out lessons for teamwork and for multi-agent learning.
Knowledge Acquisition and Interface Design
Venue: IEEE Software (1994)

Describes tools, techniques, and concepts to optimize user interfaces. The best way to ensure that a software system is friendly and works is to base it on the intended users' mental models (how they view the world), knowledge structures (what they know and how they have organized it), and work processes. The author uses a team of engineers to systematically acquire and analyze user and domain knowledge and to translate that knowledge into user-interface design decisions. This front-end analysis method, combined with knowledge-acquisition techniques, lets one build user-centered systems.
Improvements in TiWN barrier technology for devices using Au metallisation
Authors: S.-H. Hong, J. O'Sullivan, M. Jonsoon, N. Rimmer
Venue: Microelectronic Engineering (2002)

Robust barriers are needed to restrict the diffusion of Au into Si. The barrier must have low reaction rates with the diffusing species, good adhesion, mechanical and temperature stability, and acceptable thermal and electrical conductivity. This paper presents an evaluation of such a barrier (TiWN) at elevated temperatures (> 400°C) and investigates the effect of oxygen on the barrier properties. Oxygen will be shown to dramatically improve the strength of the TiWN barrier and to be stable within the barrier.
Continuous-Review Tracking Policies for Dynamic Control of Stochastic Networks
Authors: Constantinos Maglaras
Venue: Queueing Systems: Theory and Applications (2003)

This paper is concerned with dynamic control of stochastic processing networks. Specifically, it follows the so called &ldquo;heavy traffic approach,&rdquo; where a Brownian approximating model is formulated, an associated Brownian optimal control problem is solved, the solution of which is then used to define an implementable policy for the original system. A major challenge is the step of policy translation from the Brownian to the discrete network. This paper addresses this problem by defining a general and easily implementable family of continuous-review tracking policies. Each such policy has the following structure: at each point in time t, the controller observes the current vector of queue lengths q and chooses (i) a target position z(q) of where the system should be at some point in the near future, say at time t+l, and (ii) an allocation vector v(q) that describes how to split the server's processing capacity amongst job classes in order to steer the state from q to z(q). Implementation of such policies involves the enforcement of small safety stocks. In the context of the &ldquo;heavy traffic&rdquo; approach, the solution of the approximating Brownian control problem is used in selecting the target state z(q). The proposed tracking policy is shown to be asymptotically optimal in the heavy traffic limiting regime, where the Brownian model approximation becomes valid, for multiclass queueing networks that admit orthant Brownian optimal controls; this is a form of pathwise, or greedy, optimality. Several extensions are discussed.
C++ Network Programming: Systematic Reuse with ACE and Frameworks, Vol. 2
Authors: Douglas C. Schmidt, Stephen D. Huston
Venue:  (2002)

Do you need to develop flexible software that can be customized quickly? Do you need to add the power and efficiency of frameworks to your software? The ADAPTIVE Communication Environment (ACE) is an open-source toolkit for building high-performance networked applications and next-generation middleware. ACE's power and flexibility arise from object-oriented frameworks, used to achieve the systematic reuse of networked application software. ACE frameworks handle common network programming tasks and can be customized using C++ language features to produce complete distributed applications.C++ Network Programming, Volume 2, focuses on ACE frameworks, providing thorough coverage of the concepts, patterns, and usage rules that form their structure. This book is a practical guide to designing object-oriented frameworks and shows developers how to apply frameworks to concurrent networked applications. C++ Networking, Volume 1, introduced ACE and the wrapper facades, which are basic network computing ingredients. Volume 2 explains how frameworks build on wrapper facades to provide higher-level communication services.Written by two experts in the ACE community, this book contains: An overview of ACE frameworks Design dimensions for networked services Descriptions of the key capabilities of the most important ACE frameworks Numerous C++ code examples that demonstrate how to use ACE frameworksC++ Network Programming, Volume 2, teaches how to use frameworks to write networked applications quickly, reducing development effort and overhead. It will be an invaluable asset to any C++ developer working on networked applications. 0201795256B11152002
4-edge-coloring graphs of maximum degree 3 in linear time
Authors: San Skulrattanakulchai
Venue: Information Processing Letters (2002)

We present a linear time algorithm to properly color the edges of any graph of maximum degree 3 using 4 colors. Our algorithm uses a greedy approach and utilizes a new structure theorem for such graphs.
Channel Borrowing Without Locking for Asynchronous Hybrid FDMA/TDMACellular Communications
Authors: H. Jiang, S. S. Rappaport
Venue: Wireless Personal Communications: An International Journal (1999)

The use of real time channel borrowing in digital cellular asynchronous hybrid FDMA/TDMA systems is considered. These systems, which are exemplified by North American digital cellular (IS-54), are asynchronous in the sense that time slots in different cells are not aligned. CBWL (channel borrowing without locking) techniques can be applied but (without cell-to-cell synchronization) borrowing individual time slots from adjacent cells would violate co-channel interference constraints. Instead, frequency carriers can be borrowed. In IS-54, a carrier supports three TDMA slots. So if only one TDMA slot is needed in the borrowing cell, two TDMA slots are unnecessarily transferred. We devised an appropriate carrier borrowing scheme and an analytical model to determine the traffic performance of TDMA/CBWL. Fast carrier returning is used to increase channel utilization by returning borrowed carriers as soon as possible. An efficient computational method that uses macro-states, decomposition, combinatorial analysis and the convolution algorithm is devised to find blocking probabilities. The results show that in comparison with FCA, the new CBWL scheme can significantly improve system performance of asynchronous TDMA cellular systems that use FDMA/TDMA multiplexing.
MINPRAN: A New Robust Estimator for Computer Vision
Authors: Charles V. Stewart
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

MINPRAN is a new robust estimator capable of finding good fits in data sets containing more than 50% outliers. Unlike other techniques that handle large outlier percentages, MINPRAN does not rely on a known error bound for the good data. Instead, it assumes the bad data are randomly distributed within the dynamic range of the sensor. Based on this, MINPRAN uses random sampling to search for the fit and the inliers to the fit that are least likely to have occurred randomly. It runs in time O(N2+SN log N), where S is the number of random samples and N is the number of data points. We demonstrate analytically that MINPRAN distinguished good fits to random data and MINPRAN finds accurate fits and nearly the correct number of inliers, regardless of the percentage of true inliers. We confirm MINPRAN¿s properties experimentally on synthetic data and show it compares favorably to least median of squares. Finally, we apply MINPRAN to fitting planar surface patches and eliminating outliers in range data taken from complicated scenes.
High-level Mathematical Modeling And Programming
Authors: Peter Fritzson, Lars Viklund, Johan Herber, Dag Fritzson
Venue: IEEE Software (1995)

Scientific computing and advanced mechanical analysis demand high-level support for modeling and solving complex equations. To meet this need, the authors designed ObjectMath and applied it to real problems in machine-element analysis.
P2P Networking: An Information-Sharing Alternative
Authors: Manoj Parameswaran, Anjana Susarla, Andrew B. Whinston
Venue: Computer (2001)

The Internet's phenomenal impact and subsequent growth stemmed primarily from the open, public, worldwide networking it offers. Peer-to-peer computing offers a radically new way of isolating and focusing on the networking aspect as the business model's mainstay. A P2P network distributes information among the member nodes instead of concentrating it at a single server. P2P networking thus offers unique advantages that will make it a more effective alternative to several existing client-server e-commerce applications-if it can mature into a secure and reliable technology. The key to realizing P2P's promise lies in the availability of enhanced services such as structured methods for classifying and listing shared information, verification and certification of information, effective content distribution schemes, and security features. P2P offers a superior alternative to the client-server model for at least a subset of that technology's applications, as evidenced by the phenomenal success of P2P music-sharing networks versus centralized MP3 servers. Even so, it is unlikely that P2P networks will replace the client-server paradigm. Rather, P2P will offer exciting new possibilities in distributed information processing.
When Caches Aren't Enough: Data Prefetching Techniques
Authors: Steven P. VanderWiel, David J. Lilja
Venue: Computer (1997)

For the past few years, CPU performance has outpaced that of dynamic RAM, the primary component of main memory. Developers have had to use increasingly aggressive techniques to reduce or hide delays in accessing main memory. Even so, it is still not uncommon for scientific programs to spend more than half their runtimes stalled on memory requests. This poor performance is partially a result of the policies used to fetch data from main memory: Processors typically request data only when it is needed and then only if it is not first found in the cache. In contrast, data prefetching calls data into the cache before the processor needs it. Ideally, prefetching completes just in time for the processor to access the needed data. Prefetching can nearly double the performance of some scientific applications running on commercial systems. But to achieve this performance, it is critical that the most suitable prefetching technique is used. This article reviews three popular prefetching techniques and examines in which situations they are best used.
Small computers on campus
Authors: Harvey H. Rhodes
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Small computers of all types are appearing on campuses, Many of them are programmed for applications that are not available on the larger UNIVAC or IBM computers.This paper discusses these new minicomputers and the ways they affect or may affect the operation of Computer Services at Arizona State University. 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
Across Disciplines: Risk, Design, Method, Process, and Tools
Authors: Robin Baines
Venue: IEEE Software (1998)

In our search for solutions to make software development more predictable and controllable, we often look for parallels in other disciplines such as architecture, bridge construction, and so on. This article looks at software development from the perspective of the electrical industry. Inspired by their management tradition, ATH techniek b.v. has learned to apply proven management techniques to software development. Simple and commonsense principles yield excellent results; for instance, developers reduced risk by estimating project effort using two different measures and by controlling execution. Comparing your software development processes with what goes on in the rest of your company or another application domain can be instructive.
Enumeration of (p, q)-parking functions
Authors: Robert Cori, Dominique Poulalhon
Venue: Discrete Mathematics (2002)

Parking functions are central in many aspects of combinatorics. We define in this communication a generalization of parking functions which we call (p1,..., pk)-parking functions. We give a characterization of them in terms of parking functions and we show that they can be interpreted as recurrent configurations in the sandpile model for some graphs. We also establish a correspondence with a Lukasiewicz language, which enables to enumerate (p1,..., pk)-parking functions as well as increasing ones.
On the Generalization Ability of Neural Network Classifiers
Authors: M. T. Musavi, K. H. Chan, D. M. Hummels, K. Kalantri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This correspondence presents a method for evaluation of artificial neural network (ANN) classifiers. In order to find the performance of the network over all possible input ranges, a probabilistic input model is defined. The expected error of the output over this input range is taken as a measure of generalization ability. Two essential elements for carrying out the proposed evaluation technique are estimation of the input probability density and numerical integration. A nonparametric method, which depends on the nearest M neighbors, is used to locally estimate the distribution around each training pattern. An orthogonalization procedure is utilized to determine the covariance matrices of local densities. A Monte Carlo method is used to perform the numerical integration. The proposed evaluation technique has been used to investigate the generalization ability of back propagation (BP), radial basis function (RBF) and probabilistic neural network (PNN) classifiers for three test problems.
Guest Editor's Introduction: Processor-Based Designs
Authors: Peter Marwedel
Venue: IEEE Design Test (2002)

Welcome to this special issue on embedded systems, which are information processing systems embedded in larger products, such as cars, airplanes,and fabrication or communicationequipment. In most embedded systems, informationprocessing is invisible to the user. The main reason for buying such a system is not information processing, but the system's overall functionality. Embedded systems must also be efficient in terms of weight, cost, size, and energy consumption. Moreover, they must be dependable and inmany cases must meet real time constraints. The market for embedded systems will grow significantly over the next years. For example, Kontron, one of the leading vendors of embedded computers, expects 40% a annualgrowth over the next four years in the voice traffic network equipment market (http://www.icsadvent.com/applications/ap_convergence.cfm).
The Position-Orientation Masking Approach to Parametric Search for Template Matching
Authors: D. W. Paglieroni, G. E. Ford, E. M. Tsujimoto
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A new search method over (x,y,/spl theta/), called position-orientation masking is introduced. It is applied to vertices that are allowed to be separated into different bands of acuteness. Position-orientation masking yields exactly one /spl theta/ value for each (x,y) that it considers to be the location of a possible occurrence of an object. Detailed matching of edge segments is performed at only these candidate (x,y,/spl theta/) to determine if objects actually do occur there. Template matching is accelerated dramatically since the candidates comprise only a small fraction of all (x,y,/spl theta/). Position-orientation masking eliminates the need for exhaustive search when deriving the candidate (x,y,/spl theta/). Search is guided by correlations between template vertices and distance transforms of image vertices. When a poor correlation is encountered at a particular position and orientation, nearby positions at that orientation and nearby orientations at that position are masked out. Position and orientation traversal are by quadrant and binary decomposition.
Some Observations on Quasi-3 Designs and Hadamard Matrices
Authors: Wayne Broughton, Gary Mcguire
Venue: Designs, Codes and Cryptography (1999)

We consider Hadamard matrices with the quasi-3 property, and their implications for the existence of certain quasi-symmetric designs. We find necessary conditions on the parameters, and show that the quasi-3 property is preserved by the Kronecker product.
A High-Level Petri Nets-Based Approach to Verifying Task Structures
Authors: J. Lee, L. F. Lai
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

As knowledge-based system technology gains wider acceptance, there is an increasing need for verifying knowledge-based systems to improve the reliability and quality. Traditionally, attention has been given on verifying knowledge-based systems at the knowledge level, which only addresses structural errors such as redundancy, conflict, and circularity in rule bases. No semantic error such as inconsistency in the requirements specification level has been checked. In this paper, we propose the use of task structures for modeling user requirements and domain knowledge at the requirements specification level, and the use of high-level Petri nets for expressing and verifying the task structure-based specifications. Issues in mapping task structures into high-level Petri nets are identified, for example, the representation of task decomposition, constraints, and state model; the distinction between follow and immediately follow operators; and the composition operator in task structures. The verification of task structures using high-level Petri nets is performed on model specifications of a task through constraints satisfaction and relaxation techniques and on process specifications of the task based on the reachability property and the notion of specificity.
An Implementation of F-Channels
Authors: M. Ahuja
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

An F-channel can permit as much concurrency as a non-first-in-first-out (FIFO)communication channel and yet retain the properties of a FIFO channel that lead tosimplicity of reasoning in design and proofs of the correctness of distributed algorithms.The author presents an implementation of an F-channel on top of a non-FIFO channelthat derives its non-FIFO nature from a message taking any of the alternate paths fromthe source to the destination in the underlying network in which each channel is either anF-channel implemented using some other implementation or recursively using theimplementation presented or a FIFO channel. The correctness of the implementation isproven.
Wizard: A Database Inference Analysis and Detection System
Authors: Harry S. Delugach, Thomas H. Hinke
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

The database inference problem is a well-known problem in database security and information system security in general. In order to prevent an adversary from inferring classified information from combinations of unclassified information, a database inference analyst must be able to detect and prevent possible inferences. Detecting database inference problems at database design time provides great power in reducing problems over the lifetime of a database. We have developed and constructed a system called Wizard to analyze databases for their inference problems. The system takes as input a database schema, its constituent instances (if available) and additional human-supplied domain information, and provides a set of associations between entities and/or activities that can be grouped by their potential severity of inference vulnerability. A knowledge acquisition process called microanalysis permits semantic knowledge of a database to be incorporated into the analysis using conceptual graphs. These graphs are then analyzed with respect to inference-relevant domains we call facets using tools we have developed. We can determine inference problems within single facets as well as some inference problems between two or more facets. The architecture of the system is meant to be general so that further refinements of inference information subdomains can be easily incorporated into the system.
Analysis and Design of Nonequivalent Multistage Interconnection Networks
Authors: D. P. Agrawal, S. -C. Kim, N. K. Swain
Venue: IEEE Transactions on Computers (1988)

Nonequivalence of multistage interconnection networks is established by obtaining a reduced graph model and then partitioning it into several bipartite subgraphs. This is shown to transform nonequivalence to nonisomorphism, which can be easily determined by examining the intrinsic characteristics of undirected loops. A reverse process allows the design of nonequivalent networks.
A simple efficient algorithm for interpolation between different grids in both 2D and 3D
Authors: Jichun Li, C. S. Chen
Venue: Mathematics and Computers in Simulation (2002)

Considering the importance of data transferring between different grids, we present a simple but powerful interpolation scheme using radial basis functions (RBFs) to accomplish such task in both 2D and 3D. Numerical results are presented for such interpolation between truly unstructured grids.
Teaching Teamwork
Authors: Thomas B. Hilburn, Watts S. Humphrey
Venue: IEEE Software (2002)

The effectiveness of a team software project depends on many issues: the problem, the market, development technology, the corporate environment, team member capabilities, and the software development process. Many, if not most, see the people and process issues as more important to project success than the technology used. This article discusses the methods and techniques for teaching undergraduate and graduate students how to work effectively on software project teams. A team software process, TSPi, has been designed and a course developed to teach student teams effective team working methods. Experiences in using this process are discussed, and data on team performance are presented and analyzed. The article describes various models for conducting a TSPi course and provides suggestions for structuring and teaching such a course. In the conclusion, we summarize the benefits of using the TSPi in a computing curricula and discuss the role of the TSPi in preparing students to work as industrial software engineers.