ppxscal/embedding_network huggingface dataset:
Distributed Computing Using Autonomous Objects
Authors: Lubomir F. Bic, Munehiro Fukuda, Michael B. Dillencourt
Venue: Computer (1996)

Most existing distributed systems are structured as statically compiled processes communicating with each other via messages. The system's "intelligence" is embodied in the processes, while the messages contain simple, passive pieces of information (the communicating objects paradigm). In the autonomous objects paradigm, a message has its own identity and behavior. It decides at runtime where it wants to propagate and what tasks to perform there; the nodes become simply generic interpreters that enable messages to navigate and compute. In this scenario, an application's "intelligence" is embodied in and carried by messages as they propagate through the network, much as human agent or a robot would move in space, visiting different locales as it performs tasks. The autonomous objects paradigm is more flexible than the communicating objects paradigm because it allows developers to change the program's behavior after it has started to run. We based our system, MESSENGERS, on autonomous objects, and intended it for the composition and coordination of concurrent activities in a distributed environment. It combines powerful navigational capabilities found in other autonomous objects-based systems with efficient dynamic linking mechanisms supported by some new programming languages, like Java. MESSENGERS allows the dynamic construction of arbitrarily complex control sequences, which are carried through the network. The sequences can invoke node-resident computational programs and coordinate their operation by carrying information among them.
Simplicial subdivisions and sampling artifacts
Authors: Hamish Carr, Torsten Möller, Jack Snoeyink
Venue: Proceedings of the conference on Visualization '01 (2001)

We review several schemes for dividing cubical cells into simplices (tetrahedra) in 3-D for interpolating from sampled data to IR3 or for computing isosurfaces by barycentric interpolation. We present test data that reveal the geometric artifacts that these subdivision schemes generate, and discuss how these artifacts relate to the filter kernels that correspond to the subdivision schemes.
Architecture and Implementation of ICs for a DSC-HDTV Video Decoder System
Authors: Obed Duardo, Scott C. Knauer, John N. Mailhot, Kalyan Mondal, Tommy C. Poon
Venue: IEEE Micro (1992)

The architecture and implementation of the very-large-scale integrated (VLSI) video decoder subsystems in digital spectrum compatible high-definition television (DSC-HDTV) systems are discussed. The CMOS deformatter IC, which converts formatted data back to motion vectors, DCT coefficients, and coding parameters, and the motion compensator and inverse discrete transform IC, which reconstructs frames from the deformatter-decoded coefficients, are described.
On auditing audit trails
Authors: Rebecca T. Mercuri
Venue: Communications of the ACM (2003)

It is incumbent upon us to examine our own auditing practices for their intrinsic vulnerabilities.
Cornering the Chimera
Authors: R. Geoff Dromey
Venue: IEEE Software (1996)

Over the past decade, the term "software quality" has been widely used. In many instances the term has been loosely used in relation to process and product. This has created considerable confusion and diverted the industry from its primary goal - improving the quality of the products of the various phases of software development.While some attention has been paid to high-level quality attributes, little has been devoted to the systematic study of tangible product properties and their influence on high-level quality attributes. Today the dominant modus operandi for software development is heavily process-oriented. This rests on the widely held belief that you need a quality process to produce a quality product. The flaw in this approach is that the emphasis on process usually comes at the expense of constructing, refining, and using adequate product quality models. The fundamental axiom of software product quality is: a product's tangible internal characteristics or properties determine its external quality attributes. Developers must build these internal properties into a product in order for it to exhibit the desired external quality attributes. A product quality model, therefore, must comprehensively identify the tangible (measurable and/or assessable) internal product characteristics that have the most significant effect on external quality attributes.I suggest a framework for the construction and use of practical, testable quality models for requirements, design, and implementation. Such information may be used directly to build, compare, and assess better quality software products.
Using Angular Dispersion of Gradient Direction for Detecting Edge Ribbons
Authors: P. H. Gregson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Edges in a scene generally project to smooth continuous curves nearly everywhere in the image, which results in low angular deviation of the intensity gradients in small neighborhoods straddling edges. Angular deviation is shown to be a measure of SNR. A theoretical analysis of angular deviation arising due to independent and identically distributed N(0, sigma /sup 2/) random noise is presented. Angular deviation thresholds for neighborhood sizes from 3*3 to 11*11 pixels are determined both from this analysis and numerical examples. The proposed gradient angular dispersion detection algorithm detects edge elements by comparing the measured angular deviation with values computed for the minimum acceptable SNR. Low values of deviation violate the 'no edge' hypothesis. The algorithm is shown to make good use of the limited dynamic range of the imaging system. The sensitivity and selectivity of the strategy are both shown to be high.
Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
Authors: Frédéric Havet, Janez Zerovnik
Venue: Discrete Mathematics (2002)

A basic problem in the design of mobile telephone networks is to assign sets of radio frequency bands (colours) to transmitters (vertices) to avoid interference. Often the transmitters are laid out like vertices of a triangular lattice in the plane. We investigate the corresponding colouring problem of assigning sets of colours of size p(υ) to each vertex of the triangular lattice so that the sets of colours assigned to adjacent vertices are disjoint. A n-[p]colouring of a graph G is a mapping c from V(G) into the set of the subsets of {1,2,...,n} such that |c(υ)|=p(υ) and for any adjacent vertices u and υ, c(u)∩c(υ)=φ. We give here an alternative proof of the fact that every triangular-free induced subgraph of the triangular lattice is 5-[2]colourable. This proof yields a constant time distributed algorithm that finds a 5-[2]colouring of such a graph. We then give a distributed algorithm that finds a [p]colouring of a triangle-free induced subgraph of the triangular lattice with at most 5ωp(G)/4 + 3 colours.
Decorrelating Detectors for a Dual Rate Synchronous DS/CDMA System
Authors: Mohammad Saquib, Roy Yates, Narayan Mandayam
Venue: Wireless Personal Communications: An International Journal (1999)

This paper addresses the use of decorrelating detectors for a dual rate DS/CDMA system that serves both low bit rate and high bit rate users. We assume that in an interval of duration T_0, a low rate user transmits one bit while a high rate user transmits M bits. Applying a standard decorrelator to the interval of duration T_0 yields an M bit processing delay for high rate users and a computational complexity that grows with M. In this paper, we propose a decorrelator that generates bit decisions for each high rate user in every subinterval of duration T_0/M. To decode a low rate user, a soft decoding rule applies maximal ratio combining on M separate decorrelated outputs of each low rate user. The soft decoding dual rate decorrelator eliminates the bit processing delay for high rate users and also reduces the computational complexity of a standard decorrelator. Further, it is shown that the asymptotic efficiency of the standard decorrelator is greater than or equal to the proposed decorrelator. By evaluation, it is observed that when the signature sequences have good correlation properties, the proposed soft decoding decorrelator is found to perform nearly as well as the standard decorrelator. However, when the signature sequences have high cross-correlation, then the proposed decorrelator suffers in terms of bit error rate while retaining the near-far resistance property.
On Routability for FPGAs under Faulty Conditions
Authors: Sudip Nag, Kaushik Roy
Venue: IEEE Transactions on Computers (1995)

The field programmable gate array (FPGA) routing resources are fixed and their usage is constrained by the location of programmable interconnects (PIs) such as antifuses. The routing or the interconnect delays are determined by the length of segments assigned to the nets of various lengths and the number of PIs programmed for routing of each net. Due to the use of PIs certain unconventional faults may appear. In this paper we model the PI faults and address the design and routability of the FPGA channel architecture to achieve 100% routing with minimum performance penalty in the presence of PI faults. A channel routing algorithm has also been developed which routes nets in the presence of PI faults. Experiments were performed by randomly injecting faults of different types into the routing channel and then using the routing algorithm to determine the routability of the synthesized architecture. Results on a set of industrial designs and MCNC benchmark examples show the feasibility of achieving routability with minimum performance penalty when a large number of faults are present in the channel.
Choosing a User Interface Development Tool
Authors: Laura A. Valaer, Robert G. Babb II
Venue: IEEE Software (1997)

Before you invest in a GUI development tool, you should know its benefits and drawbacks. The authors provide a checklist for choosing a tool that fits your needs. Usability, functionality, flexibility, portability, support, and cost are all part of the picture.
Learning Situation-Specific Coordination in Cooperative Multi-agent Systems
Authors: M. V. Nagendra Prasad, Victor R. Lesser
Venue: Autonomous Agents and Multi-Agent Systems (1999)

Achieving effective cooperation in a multi-agent system is a difficult problem for a number of reasons such as limited and possibly out-dated views of activities of other agents and uncertainty about the outcomes of interacting non-local tasks. In this paper, we present a learning system called COLLAGE, that endows the agents with the capability to learn how to choose the most appropriate coordination strategy from a set of available coordination strategies. COLLAGE relies on meta-level information about agents' problem solving situations to guide them towards a suitable choice for a coordination strategy. We present empirical results that strongly indicate the effectiveness of the learning algorithm.
Training for Information Assurance
Authors: Donald Welch, Daniel Ragsdale, Wayne Schepens
Venue: Computer (2002)

The US is at great risk from terrorist manipulation of the intangible bits and bytes of cyberspace. US military institutions are already preparing for cyberspace terrorism and warfare by educating cadets in information assurance. In January 2000, the US Military Academy at West Point created an information assurance course that centers on a competitive, hands-on defensive project: protect a real network from real attack.This project forced the cadets to pull together what they know theoretically and apply it to a real network under attack without risking the damage that mistakes would cause on a live network.The authors encourage other organizations to follow their lead by conducting similar competitive exercises.
Performance Evaluation of a Hierarchical Cellular System with Mobile Velocity-Based Bidirectional Call-Overflow Scheme
Authors: Wenhao Shan, Pingzhi Fan, Yi Pan
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

With the increase of teletraffic demands in mobile cellular system, hierarchical cellular systems (HCSs) have been adopted extensively for more efficient channel utilization and better GoS (Grade of Services). A practical issue related to HCS is to design a scheme for controlling and allocating call traffic to different layers. There are several strategies to deal with this problem, such as no call-overflow scheme, unidirectional call-overflow scheme and bidirectional call-overflow scheme. The objective of this paper is to investigate a bidirectional call-overflow scheme, based on the velocity of the mobile making the calls. To ensure that hand off calls are given higher priorities, it is assumed that guard channels are assigned in both macrocells and microcells. In order to evaluate the performance of the new scheme and compare the performance of several related schemes, two new models based on a one-dimensional Markov process are developed and analytical results are derived. Theoretical analysis and numerical evaluation show that the proposed scheme outperforms others in terms of average new call blocking and hand off failure probability of the system. In addition, when the teletraffic to the HCS reaches a certain grade, the GoS is insensitive to the maximum velocity and the velocity threshold which is used to assign calls to different layers in our scheme.
Correction to 'The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI'
Authors: M. R. Samatham, D. K. Pradhan
Venue: IEEE Transactions on Computers (1991)

Corrections to the galley proof of the above-titled paper by the authors that were inadvertently omitted from the published paper are given.
A Proximal Bundle Method Based on Approximate Subgradients
Authors: Michael Hintermüller
Venue: Computational Optimization and Applications (2001)

In this paper a proximal bundle method is introduced that is capable to deal with approximate subgradients. No further knowledge of the approximation quality (like explicit knowledge or controllability of error bounds) is required for proving convergence. It is shown that every accumulation point of the sequence of iterates generated by the proposed algorithm is a well-defined approximate solution of the exact minimization problem. In the case of exact subgradients the algorithm behaves like well-established proximal bundle methods. Numerical tests emphasize the theoretical findings.
On identifying don't care inputs of test patterns for combinational circuits
Authors: Seiji Kajihara, Kohei Miyase
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Given a test set for stuck-at faults, some of primary input values may be changed to opposite logic values without losing fault coverage. We can regard such input values as don't care (X). In this paper, we propose a method for identifying X inputs of test vectors in a given test set. While there are many combinations of X inputs in the test set generally, the proposed method finds one including X inputs as many as possible, by using fault simulation and procedures similar to implication and justification of ATPG algorithms. Experimental results for ISCAS benchmark circuits show that approximately 66% of inputs of un-compacted test sets could be X in average. Even for compacted test sets, the method found that approximately 47% of inputs are X. Finally, we discuss how logic values are reassigned to the identified X inputs where several applications exist to make test vectors more desirable.
Project Management: Filling in the Gaps
Authors: Dwayne Phillips
Venue: IEEE Software (1996)

Software configuration management offers a software project manager the one thing he or she desires most: control. It's what I call a "blocking and tackling" issue: It rarely makes headlines, but without it, a software project can be thrown for big losses. Dwayne Phillips argues that managers (like football coaches) ignore "blocking and tackling" at their peril.¿Roger Pressman 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
Expert Focus-Expert System Tools: The Next Generation
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors describe what is wrong with conventional expert system development and consider whether these gaps can be filled by second-generation expert system development tools. They examine decision-tree approaches and knowledge shaping, which utilizes decision-tree power while eliminating problems commonly associated with their use. They conclude that knowledge shaping solves the problems encountered with present tools.
Excel 2000
Authors: Gene Weisskopf
Venue:  (1999)

:Excel 2000; No Experience Required is your step-by-step introduction to Microsoft's popular spreadsheet application. Inside, practical examples and straightforward explanations show you exactly what you need to know to design and use spreadsheets - including improved integration with other Office applications, easier HTML conversion, and more powerful charting and reporting capabilities.
Interpreting Information Requests in Context A Collaborative Web Interface for Distance Learning
Authors: Charles L. Ortiz, Barbara J. Grosz
Venue: Autonomous Agents and Multi-Agent Systems (2002)

We describe the use of theories of agent collaboration and human dialogue processing in providing a principled basis for the design of web interfaces to multimedia information stores. The DIAL system, an implementation in the domain of information support for distance learning by students in an introductory programming class, is used to illustrate the efficacy of this approach. DIAL builds a representation of context that is based on the collaborative plans of the system and its user and uses this contextual information to reduce the communication burden. Context is represented by a structure of intentions that a user is attempting to satisfy. This structure is modified as tasks are completed or task descriptions are refined. DIAL interprets information requests relative to the prevailing context as it is represented by this structure. As a result, requests may be expressed more economically; contextual information is added by the system. Furthermore, DIAL uses information about the intentional context to respond and act collaboratively, rather than in the master-slave style typical of most current human-computer interfaces. DIAL and the access method it supports provide a unique support tool for distance learning environments as well as a demonstration of a general way in which agent models can be used to improve human-computer communication.
The Undergraduate Curriculum in Computer Architecture
Authors: Alan Clements
Venue: IEEE Micro (2000)

The subject matter of computer architecture has grown in breadth and depth, forcing teachers to decide what to include and what to omit¿and even to justify the course itself. The author makes a strong case for including a broad-based course early in every computing student's program.
Optimal reorder decision utilizing centralized stock information in a two-echelon distribution system
Authors: Yongwon Seo, Sungwon Jung, Juho Hahm
Venue: Computers and Operations Research (2002)

The objective of this paper is to develop an optimal reorder policy for a two-echelon distribution system with one central warehouse and multiple retailers. We assume the warehouse has centralized stock information and each facility uses continuous-review batch ordering policy. Since echelon stock policies may show poor performance for distribution systems, we propose a new type of policy that utilizes the centralized stock information more effectively. We define the order risk policy, which decides reorder time based on the order risk which represents the relative cost increase due to immediate order compared to delayed order. We formulate the order risk and prove the optimality of the order risk policy under the system assumption that the warehouse guarantees delivery within the fixed lead time. The order risk is derived from the marginal analysis. Since exact calculation of the order risk is complex, an approximation method is provided. Computational experiment that compares our policy with existing policies shows that a significant cost savings is obtained. The concept of the order risk can be extended to the other models.
Redundant Hash Addressing of Feature Sequences Using the Self-Organizing Map
Authors: Panu Somervuo
Venue: Neural Processing Letters (1999)

Kohonen&lsquo;s Self-Organizing Map (SOM) is combined with the Redundant Hash Addressing (RHA) principle. The SOM encodes the input feature vector sequence into the sequence of best-matching unit (BMU) indices and the RHA principle is then used to associate the BMU index sequence with the dictionary items. This provides a fast alternative for dynamic programming (DP) based methods for comparing and matching temporal sequences. Experiments include music retrieval and speech recognition. The separation of the classes can be improved by error-corrective learning. Comparisons to DP-based methods are presented.
Power Geometry
Authors: A. D. Bruno
Venue: Journal of Dynamical and Control Systems (1997)

All local and asymptotic first approximations of a polynomial, a differential polynomial, and of a system of such polynomials can be selected algorithmically. Here the first approximation of a solution to the system of equations is a solution to the corresponding first approximation of the system of equations. The power transformations induce linear transformations of vector exponents and commute with the operation of selecting first approximations. In the first approximation of a system of equations they allow one to reduce the number of parameters and to reduce the presence of some variables to the form of derivatives of their logarithms. If the first approximation is the linear system, then in many cases the system of equations can be transformed into the normal form by means of the formal change of coordinates. The normal form is reduced to the problem of lower dimension by means of the power transformation. Combining these algorithms, we can resolve a singularity in many problems, find parameters determining the properties of solutions, and obtain the asymptotic expansions of solutions. Some applications from mechanics, celestial mechanics, and hydrodynamics are indicated.
Pareto-optimality of compromise decisions
Authors: Jaroslav Ramik, Milan Vlach
Venue: Fuzzy Sets and Systems (2002)

The questions of the existence of Pareto-optimal decisions and the existence of compromise decisions for decision problems in finite dimensional spaces are investigated. Several conditions for a compromise decision to be Pareto-optimal are derived. The concept of the compromise decision and some of the results are then generalized by allowing in the definition of the compromise solution arbitrary triangular norms instead of the triangular norm defined by the minimum operation only.