ppxscal/embedding_network huggingface dataset:
Virtual Cellular Network: A New Wireless Communications Architecture with Multiple Access Ports
Authors: Hwa Jong Kim, Jean-Paul Linnartz
Venue: Wireless Personal Communications: An International Journal (1999)

A &rsquo;&rsquo;virtual cellular network&lsquo;&lsquo; (VCN) is proposed to provide wireless random access for bursty multimedia traffic to a fixed backbone infrastructure. A VCN does not use a conventional cellular frequency reuse concept. In a VCN, each terminal sends packets using the entire system bandwidth while any nearby port can pick up the signal. Then, the ports relay the packets to the port server (PS) over a fixed (wired) network. Ports can be simple radio receivers as they do not have to support the same functionality as conventional cellular base stations. The performance is investigated in terms of probability of capture, throughput and delay. Both our analysis and simulation show that despite its simplicity this network has a larger user capacity than conventional cellular reuse patterns.
Efficient processing of relational calculus expressions using range query theory
Authors: Dan E Willard
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

In this paper we define a language based on a broad subset of the relational calculus and show all expressions in this language can be evaluated in space O(N) and time O(N logdN), where d is a small constant whose value depends on the particular predicate and where N is the number of records stored in the data base. We currently have no hard statistics, but a reasonable guess seems to be that a standard sequential random access machine can handle 95% or more of commercial requests in time O(N log N) and memory O(N) using this technique.
Enabling Concept-Based Relevance Feedback for Information Retrieval on the WWW
Authors: Chia-Hui Chang, Ching-Chi Hsu
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

The World Wide Web is a world of great richness, but finding information on the Web is also a great challenge. Keyword-based querying has been an immediate and efficient way to specify and retrieve related information that the user inquires. However, conventional document ranking based on an automatic assessment ofdocument relevance to the query may not be the best approach when little information is given, as in most cases. In order to clarify the ambiguity of the short queries given by users, we propose the idea of concept-based relevance feedback for Web information retrieval. The idea is to have users give two to three times more feedback in the same amount of time that would be required to give feedback for conventional feedback mechanisms. Under this design principle, we apply clustering techniques to the initial search results to provide concept-based browsing. We show the performances of various feedback interface designs and compare their pros and cons. We shall measure precision and relative recall to show how clustering improves performance over conventional similarity ranking and, most importantly, we shall show how the assistance of concept-based presentation reduces browsing labor.
Error-correcting codes from graphs
Authors: Vladimir D. Tonchev
Venue: Discrete Mathematics (2002)

The paper surveys some constructions of linear binary codes defined by the adjacency matrices of undirected graphs. It is shown that the class of all graphs with n vertices leads to codes that for large n meet the Gilbert-Varshamov bound. Some interesting codes are obtainable from graphs with high degree of symmetry, such as strongly regular graphs. A relation between the linear binary codes derived from graphs and a class of quantum error-correcting codes is also discussed.
A Fault-Tolerant Communication Scheme for Hypercube Computers
Authors: T. C. Lee, J. P. Hayes
Venue: IEEE Transactions on Computers (1992)

A fault-tolerant communication scheme that facilitates near-optimal routing and broadcasting in hypercube computers subject to node failures is described. The concept of an unsafe node is introduced to identify fault-free nodes that may cause communication difficulties. It is shown that by only using 'feasible' paths that try to avoid unsafe nodes, routing and broadcasting can be substantially simplified. A computationally efficient routing algorithm that uses local information is presented. It can route a message via a path of length no greater than p+2, where p is the minimum distance from the source to the destination, provided that not all nonfaulty nodes in the hypercube are unsafe. Broadcasting can be achieved under the same fault conditions with only one more time unit than the fault-free case. The problems posed by deadlock in faulty hypercubes are discussed, and deadlock-free implementations of the proposed communication schemes are presented.
High-Performance MCM Routing
Authors: Jun-Dong Cho, Majid Sarrafzadeh, Mysore Sriram, Sung-Mo Kang
Venue: IEEE Design Test (1993)

The authors describe the multilayer MCM (multichip module) routing problem, and propose an approach for routing high-performance MCMs with the objective of minimizing interconnect delays and crosstalk. They first introduce an approach for rapidly estimating the time-domain response of lossy transmission line trees, and propose a realistic second-order delay model for MCM interconnects. The delay model is used to guide a performance-driven global routing algorithm. Given the 2-D global paths, the next stage is layer assignment. An effective algorithm for constrained layer assignment is developed. Based on the best-known maxcut approximation algorithm (which performs well in practice), a maximal k-color ordering is formulated for minimizing both interlayer and intralayer crosstalk as well as crossings in 3-D MCM substrates. The authors also propose a strategy that exhibits a good tradeoff between circuit performance and design cost, instead of concentrating exclusively on a single objective such as area minimization.
Multicast Communication in Multicomputer Networks
Authors: X. Lin, L. M. Ni
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Efficient routing of messages is a key to the performance of multicomputers. Multicastcommunication refers to the delivery of the same message from a source node to anarbitrary number of destination nodes. While multicast communication is highly demanded in many applications, most of the existing multicomputers do not directly support this service; rather it is indirectly supported by multiple one-to-one or broadcastcommunications, which result in more network traffic and a waste of system resources.The authors study routing evaluation criteria for multicast communication under differentswitching technologies. Multicast communication in multicomputers is formulated as agraph theoretical problem. Depending on the evaluation criteria and switchingtechnologies, they study three optimal multicast communication problems, which areequivalent to the finding of the following three subgraphs: optimal multicast path, optimal multicast cycle, and minimal Steiner tree, where the interconnection of a multicomputer defines a host graph. They show that all these optimization problems are NP-complete for the popular 2D-mesh and hypercube host graphs. Heuristic multicast algorithms for these routing problems are proposed.
Safe-for-Space Threads in Standard ML
Authors: Edoardo Biagioni, Ken Cline, Peter Lee, Chris Okasaki, Chris Stone
Venue: Higher-Order and Symbolic Computation (1998)

Threads can easily be implemented using first-class continuations, but the straightforward approaches for doing so lead to space leaks, especially in a language with exceptions like Standard ML. We show how these space leaks arise and give a new implementation for threads that is safe for space.
JN: OS for an Embedded Java Network Computer
Authors: Bruce R. Montague
Venue: IEEE Micro (1997)

This paper describes the implementation of an embedded operating system explicitly designed to support the Java Virtual Machine on the National Semiconductor NS486 embedded PC. This system, the Java Nanokernel (JN), supports an Internet web server written in Java and a web camera that can be controlled from a remote web browser. JN in principle can currently run any Java program that uses the standard Java classes with the exception of AWT, the windowing toolkit. This paper briefly describes the development of the system, provides an overview of the system's kernel architecture, and presents a summary of lessons learned.
Designing UltraSparc for Testability
Authors: Marc E. Levitt
Venue: IEEE Design Test (1997)

This article describes the testability, debuggability, and manufacturability features of the UltraSPARC family of microprocessors. Due to the aggressive nature of this high-performance design, these three areas needed to be addressed at the beginning of the project to ensure success.We present the goals and analysis that led to our decisions as well as the actual features that were implemented. The features described here have helped enormously in achieving the time-to-volume goals and hence the overall success of the product.
Dynamic response time optimization for SDF graphs
Authors: Dirk Ziegenbein, Jan Uerpmann, Rolf Ernst
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Synchronous Data Flow (SDF) is a well-known model of computation that is widely used in the control engineering and digital signal processing domains. Existing scheduling methods are mainly static approaches that assume full knowledge of the environment, e.g. data arrival times. In a growing number of practical cases like internet multimedia applications there exists only partial knowledge of the environment, e.g. average data rates. Here, only dynamic scheduling can yield optimal results. In this paper, we propose a new dynamic scheduling method that minimizes the maximal response time of the system. It is a generalization of a deadline revision method to allow treatment of data-dependent tasks using EDF scheduling. The applicability and benefit of the new approach is shown using a real-world example.
A note on the consecutive ones submatrix problem
Authors: Mohammad Taghi Hajiaghayi, Yashar Ganjali
Venue: Information Processing Letters (2002)

A binary matrix has the Consecutive Ones Property (C1P) for columns if there exists a permutation of its rows that leaves the 1's consecutive in every column. The problem of Consecutive Ones Property for a matrix is a special variant of Consecutive Ones Submatrix problem in which a positive integer K is given and we want to know if there exists a submatrix B of A consisting of K columns of A with C1P property. This paper presents an error in the proof of NP-completeness for this problem in the reference cited in text by Garey and Johnson [Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979].
A Euclidean Distance Transform Using Grayscale Morphology Decomposition
Authors: C. T. Huang, O. R. Mitchell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A fast and exact Euclidean distance transformation using decomposed grayscale morphological operators is presented. Applied on a binary image, a distance transformation assigns each object pixel a value that corresponds to the shortest distance between the object pixel and the background pixels. It is shown that the large structuring element required for the Euclidean distance transformation can be easily decomposed into 3/spl times/3 windows. This is possible because the square of the Euclidean distance matrix changes uniformly both in the vertical and horizontal directions. A simple extension for a 3D Euclidean distance transformation is discussed. A fast distance transform for serial computers is also presented. Acting like thinning algorithms, the version for serial computers focuses operations only on the potential changing pixels and propagates from the boundary of objects, significantly reducing execution time. Nonsquare pixels can also be used in this algorithm. An example application, shape filtering using arbitrary sized circular dilation and erosion, is discussed. Rotation-invariant basic morphological operations can be done using this example application.
Stereo Matching in the Presence of Narrow Occluding Objects Using Dynamic Disparity Search
Authors: Umesh R. Dhond, J. K. Aggarwal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Most contemporary stereo correspondence algorithms impose global consistency among candidate match-points using Spatial Hierarchy Mechanism- (SHM) based techniques that rely on either the local support within a 2D neighborhood in the image plane and/or cooperative processes between multiple levels of a pixel-resolution or structural-description hierarchy. We analyze the stereo matching failures in SHM-based techniques in the presence of narrow occluding objects and propose the Dynamic Disparity Search (DDS) framework to reduce false-positive matches. Experiments with indoor and outdoor scenes demonstrate a significant reduction in the false-positive match rates of a DDS-based stereo algorithm as compared to those of two existing algorithms.
Rough Sets and Multivariate Statistical Classification: A Simulation Study
Authors: Michael Doumpos, Constantin Zopounidis
Venue: Computational Economics (2002)

The classification of a set of objects into predefined homogenous groups is a problem with major practical interest in many fields. Over the past two decades several non-parametric approaches have been developed to address the classification problem, originating from several scientific fields. This paper is focused on the rough sets approach and the investigation of its performance as opposed to traditional multivariate statistical classification procedures, namely the linear discriminant analysis, the quadratic discriminant analysis and the logit analysis. For this purpose an extensive Monte Carlo simulation is conducted to examine the performance of these methods under different data conditions.
Analog Circuit Fault Diagnosis Based on Sensitivity Computation and Functional Testing
Authors: Mustapha Slamani, Bozena Kaminska
Venue: IEEE Design Test (1992)

An approach based on functional testing and on sensitivity calculation of many output parameters for diagnosis of defective elements in analog circuits is presented. A sensitivity matrix that gives the relation between the deviation of output parameters and the deviation of defective components in a circuit forms the basis of the test equations. Diverse types of measurement help improve the diagnostic resolution. Experimental results are presented to clarify the algorithm and prove its efficiency in a practical case.
A Lattice BGK Scheme with General Propagation
Authors: Zhaoli Guo, Chuguang Zheng, T. S. Zhao
Venue: Journal of Scientific Computing (2002)

The standard Lattice BGK (LBGK) scheme often encounters numerical instability in simulation of fluid flow with small kinematic viscosity or as the nondimensional relaxation time &tau; is close to 0.5. In this paper, based on a time-splitting scheme for the Boltzmann equation with discrete velocities, a new LBGK scheme with general propagation step is proposed to address this problem. In this model, two free parameters are introduced into the propagation step, which can be adjusted to obtain a small kinematic viscosity and improved numerical stability as well. Numerical simulations of the two-dimensional Taylor vortex and the unsteady Womersley flow are carried out to test the kinematic viscosity, numerical diffusion, and numerical stability of the proposed scheme.
Interconnect resource-aware placement for hierarchical FPGAs
Authors: Amit Singh, Ganapathy Parthasarathy, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper, we utilize Rent's rule as an empirical measure for efficient clustering and placement of circuits on hierarchical FPGAs. We show that careful matching of design complexity and architecture resources of hierarchical FPGAs can have a positive impact on the overall device area. We propose a circuit placement algorithm based on Rent's parameter and show that our clustering and placement techniques can improve the overall device routing area by as much as 21% for the same array size, when compared to a state-of-art FPGA placement and routing tool.
Hamiltonian cycles in 3-connected claw-free graphs
Authors: Guojun Li, M. Lu, Z. Liu
Venue: Discrete Mathematics (2002)

It is shown that every 3-connected claw-free graph having at most 6δ - 7 vertices is hamiltonian, where δ is the minimum degree.
Modifications of CVD-RuOx films induced by various processes
Authors: P. Gopal Ganesan, M. Eizenberg
Venue: Microelectronic Engineering (2002)

A wide variety of post deposition thermal treatments was carried out on Ru and RuO2 films prepared by chemical vapor deposition on a 50 Å thick sputter deposited Ru seed. These treatments lead to identify three different routes with respect to modifications in the film microstructure: (1) nitrogen and forming gas annealing and Rapid Thermal annealing in Nitrogen ambient (RTN) on Ru films as well as nitrogen gas annealing, RTN treatment at 600°C, and Rapid Thermal annealing in Oxygen ambient (RTO) on RuO2 films, do not change the film phase, but lead to grain growth and reduction in the electrical resistivity of the film. (2) Forming gas annealing and RTN treatment at 750°C for 60 s result in reduction of RuO2to Ru, leading to formation of cracks and increase of surface roughness in the film, respectively. (3) An RTO treatment oxidizes Ru films with some protrusion formation in the resultant oxide.
A Framework for Hardware/Software Codesign
Authors: Sanjaya Kuman, James H. Aylor, Barry W. Johnson, Wm. A. Wulf
Venue: Computer (1993)

It is argued that a hardware/software codesign methodology should support the following capabilities: integration of the hardware and software design processes; exploration of hardware/software tradeoffs and evaluation of hardware/software alternatives; and model continuity. A codesign methodology that supports many of these capabilities is outlined. The methodology is iterative in nature and serves to guide codesign exploration with the uninterpreted/interpreted modeling approach. It integrates performance (uninterpreted) models and functional (interpreted) models in a common simulation environment.
An Empirical Study of Fortran Programs for Parallelizing Compilers
Authors: Z. Shen, Z. Li, P. C. Yew
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

Some results are reported from an empirical study of program characteristics, that are important in parallelizing compiler writers, especially in the area of data dependence analysis and program transformations. The state of the art in data dependence analysis and some parallel execution techniques are examined. The major findings are included. Many subscripts contain symbolic terms with unknown values. A few methods of determining their values at compile time are evaluated. Array references with coupled subscripts appear quite frequently; these subscripts must be handled simultaneously in a dependence test, rather than being handled separately as in current test algorithms. Nonzero coefficients of loop indexes in most subscripts are found to be simple: they are either 1 or -1. This allows an exact real-valued test to be as accurate as an exact integer-valued test for one-dimensional or two-dimensional arrays. Dependencies with uncertain distance are found to be rather common, and one of the main reasons is the frequent appearance of symbolic terms with unknown values.
A formal model for an expressive fragment of XSLT
Authors: Geert Jan Bex, Sebastian Maneth, Frank Neven
Venue: Information Systems (2002)

The extension of the eXtensible Style sheet Language (XSL) by variables and passing of data values between template rules has generated a powerful XML query language: eXtensible Style sheet Language Transformations (XSLT). An informal introduction to XSTL is given, on the bases of which a formal model of a fragment of XSLT is defined. This formal model is in the spirit of tree transducers, and its semantics is defined by rewrite relations. It is shown that the expressive power of the fragment is already beyond that of most other XML query languages. Finally, important properties such as termination and closure under composition are considered.
Towards a Descriptive Model of Agent Strategy Search
Authors: Bruce Edmonds
Venue: Computational Economics (2001)

It is argued that, due to the complexity of most economic phenomena, the chances of deriving correct models from a priori principles are very small. Instead, a more descriptive approach to modelling should be pursued. Agent-based modelling is characterised as a step in this direction. However many agent-based models use off-theshelf algorithms from computer science without regard to their descriptive accuracy. This paper attempts an agent model that describes as accurately as possible the behaviour of subjects reported in Sonnemans (1998). It takes a framework for learning that is compatible with thinking in cognitive science within this framework attempts to identify the specific process that matchs the behaviour of the subjects. This suggests further modelling improvements and experiments.
Self-Organization in Biological Systems
Authors: Scott Camazine, Nigel R. Franks, James Sneyd, Eric Bonabeau, Jean-Louis Deneubourg, Guy Theraula
Venue:  (2001)

:"Broad in scope, thorough yet accessible, this book is a self-contained introduction to self-organization and complexity in biology - a field of study at the forefront of life sciences research."--BOOK JACKET.
Nonparametric Segmentation of Curves into Various Representations
Authors: Paul L. Rosin, Geoff A. W. West
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper describes and demonstrates the operation and performance of an algorithm for segmenting connected points into a combination of representations such as lines, circular, elliptical and superelliptical arcs, and polynomials. The algorithm has a number of interesting properties including being scale invariant, nonparametric, general purpose, and efficient.
User-Interface Tools: Introduction and Survey
Authors: Brad A. Myers
Venue: IEEE Software (1989)

An overview is given of user-interface development systems (UIDS). Systems are classified by how they let the programmer specify the interfaces, and examples of each type are given. The three types are language-based, graphical, and automatic creation interfaces. Shortcomings of UIDS and user-interface toolkits are discussed.
Quatitative IT portolio management
Authors: C. Verhoef
Venue: Science of Computer Programming (2002)

We present a quantitative approach for IT portfolio management. This is an approach that CMM level 1 organizations can use to obtain a corporate wide impression of the state of their total IT portfolio, how IT costs spent today project into the budgets of tomorrow, how to assess important risks residing in an IT portfolio, and to explore what-if scenarios for future IT investments. Our quantitative approach enables assessments of proposals from business units, risk calculations, cost comparisons, estimations of TCO of entire IT portfolios, and more. Our approach has been applied to several organizations with annual multibillion dollar IT budgets each, and has been instrumental for executives in coming to grips with the largest production factor in their organizations: information technology.