ppxscal/embedding_network huggingface dataset:
Time-Optimal Visibility-Related Algorithms on Meshes with Multiple Broadcasting
Authors: Dharmavani Bhagavathi, Venkata V. Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing, Ivan Stojmenovic, Jingyuan Zhang
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Given a collection of objects in the plane along with a viewpoint ¿, the visibility problem involves determining the portion of each object that is visible to an observer positioned at ¿. The visibility problem is central to various application areas including computer graphics, image processing, VLSI design, and robot navigation, among many others. The main contribution of this work is to provide time-optimal solutions to this problem for several classes of objects, namely ordered line segments, disks, and iso-oriented rectangles in the plane. In addition, our visibility algorithm for line segments is at the heart of time-optimal solutions for determining, for each element in a given sequence of real numbers, the position of the nearest larger element within that sequence, triangulating a set of points in the plane, determining the visibility pairs among a set of vertical line segments, and constructing the dominance and visibility graphs of a set of iso-oriented rectangles in the plane. All the algorithms in this paper involve an input of size n and run in O(log n) time on a mesh with multiple broadcasting of size n×n. This is the first instance of time-optimal solutions for these problems on this architecture.
Tiny Tera: A Packet Switch Core
Authors: Nick McKeown, Martin Izzard, Adisak Mekkittikul, William Ellersick, Mark Horowitz
Venue: IEEE Micro (1997)

Tiny Tera is a small packet switch with an aggregate bandwidth of approximately 1 terabit per second. The CMOS-based, input-queued, fixed-size packet switch suits a wide range of applications such as a high-performance ATM switch, the core of an Internet router, or as a fast multiprocessor interconnect. Using off-the-shelf technology, we plan to demonstrate that a very high bandwidth switch can be built without the need for esoteric optical switching technology. By employing novel scheduling algorithms for both unicast and multicast traffic, the switch will have a maximum throughput close to 100%. Using novel high-speed, chip-to-chip serial link technology, we plan to reduce the physical size and complexity of the switch, as well as the system pin count.
Simple Strategies to Encode Tree Automata in Sigmoid Recursive Neural Networks
Authors: Rafael C. Carrasco, Mikel L. Forcada
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Recently, a number of authors have explored the use of recursive neural nets (RNN) for the adaptive processing of trees or tree-like structures. One of the most important language-theoretical formalizations of the processing of tree-structured data is that of deterministic finite-state tree automata (DFSTA). DFSTA may easily be realized as RNN using discrete-state units, such as the threshold linear unit. A recent result by Síima (Neural Network World7 (1997), pp. 679¿686) shows that any threshold linear unit operating on binary inputs can be implemented in an analog unit using a continuous activation function and bounded real inputs. The constructive proof finds a scaling factor for the weights and reestimates the bias accordingly. In this paper, we explore the application of this result to simulate DFSTA in sigmoid RNN (that is, analog RNN using monotonically growing activation functions) and also present an alternative scheme for one-hot encoding of the input that yields smaller weight values and, therefore, works at a lower saturation level.
Voice: Synergy in Design and Integration
Authors: Milena M. Didic
Venue: IEEE Software (1993)

Validating Open System Architecture in Industrial CIM Environments (Voice) is a series of ESPRIT projects addressing computer-integrated manufacturing systems and environments. Voice I was created to experiment with and validate the concepts, methods, and tools for integrating processes in computer-integrated-manufacturing systems and environments, and for optimizing manufacturing systems. One of its major accomplishments was the development of McCIM, the first online implementation of an open-system architecture, Cimosa, for CIM, McCIM uses Petri nets and an integration strategy based on evolution and incremental development to rapidly prototype actual manufacturing systems. The Cimosa architecture and the use of McCIM to validate the Cimosa modeling framework and integrating infrastructure are discussed.
Orthogonal Graphs for the Construction of a Class of Interconnection Networks
Authors: I. D. Scherson
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A graph theoretical representation for a class of interconnection networks is suggested.The idea is based on a definition of orthogonal binary vectors and leads to a constructionrule for a class of orthogonal graphs. An orthogonal graph is first defined as a set of2/sup m/ nodes, which in turn are linked by 2/sup m-n/ edges for every link model definedin an integer set Q*. The degree and diameter of an orthogonal graph are determined interms of the parameters n, m, and the number of link modes defined in Q*. Routing inorthogonal graphs is shown to reduce to the node covering problem in bipartite graphs.The proposed theory is applied to describe a number of well-known interconnectionnetworks such as the binary m-cube and spanning-bus meshes. Multidimensional access (MDA) memories are also shown as examples of orthogonal shared memory multiprocessingsystems. Finally, orthogonal graphs are applied to the construction of multistageinterconnection networks. Connectivity and placement rules are given and shown to yielda number of well-known networks.
Engineers Don't Build
Authors: Terri Maginnis
Venue: IEEE Software (2000)

Most of us never approach a construction project with a software development methodology. However, construction projects exhibit much higher success rates than software development projects. Maginnis identifies the "master-builder" approach taken by most software development projects where the developers assume the role of architect, engineer, builder, and inspector. Most large-scale construction projects abandoned the approach nearly 100 years ago. Why do we do it for large-scale software projects? Engineers design systems or buildings, and programmers or builders implement them. That approach yields greater success rates in terms of quality, time, and budget.
A Novel Method to Handle Inequality Constraints for Convex Programming Neural Network
Authors: Huang Yuancan
Venue: Neural Processing Letters (2002)

By modifying the multipliers associated with inequality constraints, we can directly solve convex programming problem without nonnegative constraints of the multipliers associated with inequality constraints, hence it is no longer necessary to convert the inequality constraints into the equality constraints by using the &lsquo;slack variables&rsquo;. With this technique, the neural network to solve convex programming problem is constructed, and its stability is analyzed rigorously. Simulation shows that this method is feasible.
Performance Analysis of COFDM for Broadband Transmission on a Fading Multipath Channel
Authors: A. G. Burr
Venue: Wireless Personal Communications: An International Journal (1999)

This paper gives a unified analysis of the effects of multipath dispersion and Doppler spreading due to fast fading in OFDM systems, deriving simple closed-form expressions for intersymbol and interchannel interference in the most important cases. It shows also why sine wave carriers are in general the optimum bearers for the sub-channels. The expressions for interference are used to estimate the BER performance of coded OFDM, showing that the use of forward error correction (FEC) coding and a guard period are both essential for optimum performance. As an example it is shown that a 64 sub- channel OFDM system can achieve a data rate of 6.4 Mbit/s on a typical urban mobile radio channel.
Hierarchical Decomposition and Axial Shape Description
Authors: H. Rom, G. Medioni
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A method for producing a segmented axial description of a given shape together with a hierarchical decomposition of the shape into its parts is presented. The novelty of this approach lies in the combination of several competing approaches and tools into a unified scheme and an efficient implementation producing natural descriptions. Smooth local symmetries are used for the axial description of parts, which are suggested by curvature sign changes. Parallel symmetries are used to provide information on global relationships within the shape. This information is used for parsing shape into a hierarchy of parts. This approach uses both region and contour information, can handle shapes with corners, and addresses the issue of local versus global information, the issue of scale, and the notion of part. The method is computationally efficient, robust, and stable. Results that show that it provides an intuitive shape description are included.
The MAP1000A VLIW Mediaprocessor
Authors: Chris Basoglu, Woobin Lee, John Setel O'Donnell
Venue: IEEE Micro (2000)

This alternate to using custom ASICs for each multimedia-processing task is a single-chip, programmable mediaprocessor that also makes use of general-purpose RISC processing and a VLIW framework.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study
Authors: Bram Verweij, Shabbir Ahmed, Anton J. Kleywegt, George Nemhauser, Alexander Shapiro
Venue: Computational Optimization and Applications (2003)

The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time.
Adapting Object-Communication Methods Dynamically
Authors: Yoshinori Kishimoto, Nobuto Kotaka, Shinichi Honiden
Venue: IEEE Software (1995)

When objects migrate or are reused, they must find suitable existing objects and establish communication with them. The authors describe the first stage of Omega, a model that will eventually let developers dynamically adjust object-communication methods so that new and existing objects can exchange messages.
Transparent Authentication and Confidentiality for Stream Sockets
Authors: André Zúquete, Paulo Guedes
Venue: IEEE Micro (1996)

PES, Privacy Enhanced Sockets, is a user-level subsystem providing network privacy for stream sockets. This document presents its design and implementation in UNIX and Microsoft Windows systems. PES provides secure channels on top of standard stream sockets, allowing existing client-server applications to transparently use secure channels instead of standard remote connections. PES is composed of two entities which can be almost transparently added to existing systems: a dynamic library and a trusted proxy server. All cryptographic details concerning the establishment of secure channels are solely handled by instances of these two entities using the Diffie-Hellman public-key algorithm. Man-in-the-Middle attacks are prevented using asymmetric cryptography for host authentication. Host's public keys are acquired and stored on a per-user basis such as for PGP, which does not require central management but only a reduced user intervention. PES has been tested with several applications -- telnet, ftp, several X11 and WWW applications -- in SunOS, Solaris and Microsoft Windows 3.1. Performance tests run in Sun SPARCstations show a low latency time and an acceptable throughput degradation.
On the refined lecture hall theorem
Authors: Ae Ja Yee
Venue: Discrete Mathematics (2002)

A lecture hall partition of length n is a sequence (λ1,λ2,...,λn) of nonnegative integers satisfying 0 ≤ λ1/≤...,λn/n. M. Bousquet-Mélou and K. Eriksson showed that there is an one to one correspondence between the set of all lecture hall partitions of length n and the set of all partitions with distinct parts between 1 and n, and possibly multiple parts between n + 1 and 2n. In this paper, we construct a bijection which is an identity mapping in the limiting case.
A Particle Method for the KdV Equation
Authors: Alina Chertock, Doron Levy
Venue: Journal of Scientific Computing (2002)

We extend the dispersion-velocity particle method that we recently introduced to advection models in which the velocity does not depend linearly on the solution or its derivatives. An example is the Korteweg de Vries (KdV) equation for which we derive a particle method and demonstrate numerically how it captures soliton&ndash;soliton interactions.
High Resolution Relaxed Upwind Schemes in Gas Dynamics
Authors: H. Joachim Schroll
Venue: Journal of Scientific Computing (2002)

Numerical schemes based on relaxation are typically central difference schemes. In the case of supersonic flows, however, central differences are unphysical approximations. Introducing a shift in the relaxation approximation relaxed upwind schemes are constructed. Similar as central relaxed schemes, the new upwind versions also avoid the nonlinear Riemann problem and staggered grids. In addition, they simulate the physical domain of dependence correctly even in transonic flow regimes. The performance of the methods is illustrated by an acoustic shock interaction in gas dynamics.
Estimating Block Accesses in Database Organizations
Authors: G. Diehr, A. N. Saharia
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

The exact expression for the expected number of disk accesses required to retrieve a given number of records, called the Yao function, requires iterative computations. Several authors have developed approximations to the Yao function, all of which have substantial errors in some situations. We derive and evaluate simple upper and lower bounds that never differ by more than a small fraction of a disk access.
CORDIC Vectoring with Arbitrary Target Value
Authors: Tomás Lang, Elisardo Antelo
Venue: IEEE Transactions on Computers (1998)

The computation of additional functions in the CORDIC module increases its flexibility. We consider here the extension of the vectoring mode (angle calculation) so that the vector is rotated until one of the coordinates (for instance y) attains a target value t (in contrast to the value 0, as in standard vectoring). The main problem in the algorithm is that the modulus of the vector is scaled in each CORDIC iteration so that a direct comparison of y[ j ] with t does not assure convergence. We present a scheme that overcomes this and in which the implementation consists of a standard CORDIC module plus a module to determine the direction of rotation. This improves over a previous proposal in which more complex iterations are introduced as part of the CORDIC algorithm. Moreover, an error analysis is performed to determine the datapath width required for convergence. Since this width is large, we consider also the characteristics of the algorithm for a narrower datapath.
Cell Suppression Methodology: The Importance of Suppressing Marginal Totals
Authors: P. c. Chu
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Safeguarding confidential information is of paramount concern to government agencies in publishing statistical data. Given a set of sensitive cells, the problem is to identify a set of complementary cells to suppress so as to mask the values of the sensitive cells. All of the existing cell suppression methods fail to consider the relationships among cell values and the representation of these relationships in marginal totals. That marginal totals may contain potent information has not been appreciated. This paper employs the theory of nominal data analysis to demonstrate that the disclosure of marginal totals can be very risky. It recommends adding a front-end test to the existing methods. The goal is to identify a list of sensitive marginal totals that have to be suppressed. This increases the sophistication of cell suppression methodology by providing an extra layer of protection.
Information Capacity of the Space Division Multiple Access Mobile Communication System
Authors: Predrag B. Rapajic
Venue: Wireless Personal Communications: An International Journal (1999)

An expression for the Shannon capacity lower bound of the space division multiple access (SDMA) mobile communication channel with interference is shown. The bound is tightly approaching the Shannon capacity of the orthogonal SDMA system over Gaussian channel with no interference. The information capacity of the SDMA system with adaptive MMSE receivers is presented as well. The SDMA system with MMSE receivers achieves at least 50% of the orthogonal SDMA system capacity for the input signal to noise ratio of practical interest in cellular mobile communications (10&ndash;30dB).
Issues in Building Dynamic Real-Time Systems
Authors: Swaminathan Natarajan, Wei Zhao
Venue: IEEE Software (1992)

The issues involved in building dynamic, hard real-time systems, in which resource availability and requirements are not fixed, are discussed. It is shown that the problem of ensuring timing correctness in dynamic real-time systems has three aspects: resource requirements, resource availability, and guarantees. These issues overlap, and a single mechanism or technique may address several issues. The R-Shell, an object-oriented framework that structures resources in a class hierarchy so that they can be selected or substituted dynamically is described.
A Survey of Temporal Knowledge Discovery Paradigms and Methods
Authors: John F. Roddick, Myra Spiliopoulou
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

With the increase in the size of data sets, data mining has recently become an important research topic and is receiving substantial interest from both academia and industry. At the same time, interest in temporal databases has been increasing and a growing number of both prototype and implemented systems are using an enhanced temporal understanding to explain aspects of behavior associated with the implicit time-varying nature of the universe. This paper investigates the confluence of these two areas, surveys the work to date, and explores the issues involved and the outstanding problems in temporal data mining.
Awareness and the WWW: an overview
Authors: Olivier Liechti
Venue: ACM SIGGROUP Bulletin (2000)

The notion of awareness has received a lot of attention in the CSCW literature for quite some time now. Because it cannot be very precisely and uniquely defined, this notion covers a range of issues and is critical in very different situations. This is also true in the particular context of the WWW, where awareness has more than one facet. One objective for this paper is to give an overview of the field, by reviewing different awareness categories and by showing how they relate to Web-based systems. The discussion also gives an overview of the work done by the author in this area. Another goal for the paper is to introduce the papers presented at the CSCW'2000 Workshop on Awareness and the WWW with a short summary.
Walking through the fire: integrating technology to enhance the research skills of minority mental health student researchers
Authors: Philip M. Ouellette, Richard Briscoe
Venue: Journal of Technology in Human Services (2002)

The information technology revolution and the "communication age" have brought many new and challenging imperatives for educators and researchers interested in the enhancement of community-based human service delivery systems in mental health. A technology-supported training environment is described to enhance the development of research skills of undergraduate level multicultural mental health researchers.
Technology for IP Reuse and Portability
Authors: Terry Thomas
Venue: IEEE Design Test (1999)

In a presentation at the System/Chip 99 conference held last September in Boxborough, Massachusetts, Terry Thomas discussed the value of reuse from a system house's point of view and outlined the industry challenges caused by shorter time frames and increased complexities. His keynote talk is included here.
User-interface design and China: a great leap forward
Authors: Aaron Marcus
Venue: interactions (2003)

If user-interface design seeks to encompass human-experience design, then computer-based communication and interaction designers need to keep Asian, specifically Chinese, users in mind. China, with approximately one-fifth of the world's population, an economy that is growing quickly, and a manufacturing system that exports a significant percentage of the goods imported into the world's countries, needs to be considered in revising concepts of user-interface and user-experience design.
The Microprocessor Today
Authors: Michael Slater
Venue: IEEE Micro (1996)

From their humble beginnings 25 years ago, microprocessors have proliferated into an astounding range of chips, powering devices ranging from telephones to supercomputers. Today, microprocessors for personal computers get widespread attention--and have enabled Intel to become the world's largest semiconductor maker. In addition, embedded microprocessors are at the heart of a diverse range of devices that have become staples of affluent consumers worldwide. This article outlines the technology and business issues that shape today's microprocessor industry: the battle for the desktop, Intel's dominance, strategies of the RISC camps, the pursuit of speed, multimedia and media processors, the influence of the Internet, and the quiet proliferation of embedded processors.
An associative architecture for genetic algorithm-based machine learning
Authors: Kirk Twardoswski
Venue: Computer (1994)

Machine-based learning will eventually be applied to solve real-world problems. In this work, an associative architecture teams up with hybrid AI algorithms to solve a letter prediction problem with promising results. This article describes an investigation and simulation of a massively parallel learning classifier system (LCS) that was developed from a specialized associative architecture joined with hybrid AI algorithms. The LCS algorithms were specifically invented to computationally match a massively parallel computer architecture, which was a special-purpose design to support the inferencing and learning components of the LCS. The LCS's computationally intensive functions include rule matching, parent selection, replacement selection and, to a lesser degree, data structure manipulation.