ppxscal/embedding_network huggingface dataset:
Radio Propagation Measurements and Modeling of Indoor Channelsat 1800 MHz
Authors: N. Papadakis, A. Economou, J. Fotinopoulou, P. Constantinou
Venue: Wireless Personal Communications: An International Journal (1999)

Indoor radio communication systems gain increasing interest of cellular network operators. A prerequisite to the design of these systems is the knowledge of indoor radio propagation characteristics. This knowledge should include information, concerning the in-building structure which strongly affects the signal transmission. The results presented in this paper provide a prediction of the signal behavior in indoor corridor environment and dynamic effects of people. Narrowband propagation measurements were conducted within a four storey building at National Technical University of Athens (NTUA). The purpose of the measurement campaign is to derive a path loss model considering site specific information. A description of the measurement environment and experimental set-up is given. Path loss exponents and absolute path loss values are estimated for each measured case. Statistical analysis of the measured data is also presented.
nuSketch battlespace: a demonstration
Authors: Kenneth D. Forbus, Jeffrey Usher, Vernell Chapman
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Sketching provides a natural means of interaction for many spatially-oriented tasks. One task where sketching is used extensively is when military planners are formulating battle plans, called Courses of Action (COAs). This paper describes a system we have built, nuSketch Battlespace (nSB), which provides a sketching interface for creating COAs. The system is described in the paper "Sketching for Military Courses of Action" in these proceedings. The demonstration will highlight:How we engineer around the need for recognition in sketching systems (a key feature of the nuSketch approach to multimodal interfaces), so that we can focus instead on understanding.The use of comic graphs to manipulate multiple states and the relationships between them, for developing and visualizing complex plansThe spatial reasoning carried out by nuSketch Battlespace, including the use of qualitative topology and Voronoi diagrams in computing spatial relationships, and our methods for path-finding and position-findingThe use of analogy to generate enemy intent hypotheses based on previously drawn sketches
Emergent Semantics through Interaction in Image Databases
Authors: Simone Santini, Amarnath Gupta, Ramesh Jain
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

In this paper, we briefly discuss some aspects of image semantics and the role that it plays for the design of image databases. We argue that images don't have an intrinsic meaning, but that they are endowed with a meaning by placing them in the context of other images and by the user interaction. From this observation, we conclude that, in an image, database users should be allowed to manipulate not only the individual images, but also the relation between them. We present an interface model based on the manipulation of configurations of images.
Comparison of techniques to characterise the density, porosity and elastic modulus of porous low-k SiO2 xerogel films
Authors: C. Murray, C. Flannery, I. Streiter, S. E. Schulz, M. R. Baklanov, K. P. Mogilnikov, C. Himcinschi, M. Friedrich, D. R. T. Zahn, T. Gessner
Venue: Microelectronic Engineering (2002)

A range of mesoporous xerogel low-k dielectric films were prepared and characterised using complementary techniques: Laser-generated surface acoustic waves, ellipsometric porosimetry, Rutherford backscattering and nanoindentation. The density, porosity, pore size distribution, cumulative surface area, elastic modulus and hardness of the films were measured as well as their dielectric constants. Dielectric constant values of k = 1.7-2.3 were measured for samples with porosities of 36-55%. Mean pore radii values of 2.2-4.2 nm and surface areas of 280-240 m3 cm-3 were also obtained. Using porosity and mean film density values determined using different techniques, the film skeletal density of these samples were calculated to be ≈ 1.4 g cm-3, almost 40% lower than that of dense SiO2. The elastic moduli of the films were found to be E < 4 GPa.
Fault Modeling and Fault Simulation in Mixed Micro-Fluidic Microelectronic Systems
Authors: Hans G. Kerkhoff, Hans P. A. Hendriks
Venue: Journal of Electronic Testing: Theory and Applications (2001)

Developments in electronic/fluidic microsystems are progressing rapidly. The ultimate goal is to deliver products in the 10,000 fluidic reaction-wells range. Exciting applications include massive parallel DNA analysis and automatic drug synthesis. Until now, only functional testing has been used to &ldquo;guarantee&rdquo; the quality of micro-fluidic systems after manufacturing.In this paper, defect-oriented test approaches developed in analogue fault modeling and simulation have been used to predict for the first time the faulty behavior of micro-electronic fluidic microsystems. The modeling is targeted for use in complex electronic/fluidic microsystems employing commercial microsystem CAD tools. It enables a measure for the quality of these systems based on the performed (functional) tests and can be a guide for future test-stimuli generation and yield prediction.
Boundary-Constrained Morphological Skeleton Minimization and Skeleton Reconstruction
Authors: T. W. Pai, J. H. L. Hansen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A new algorithm for minimizing a morphological skeleton entitled boundary-constrained skeleton minimization (BCSM), as well as a new algorithm for reconstructing an original image from its minimized skeletal structure termed boundary-constrained skeleton reconstruction (BCSR), are proposed. The new algorithms are shown to reduce data storage requirements from (N+1) binary images represented as separate skeleton subsets with their corresponding indices, to 2 binary images composed of a binary morphological skeleton and its corresponding morphological boundary structure. In addition to a reduction in memory storage, BCSM and BCSR result in substantial savings in computational complexity. The proposed algorithms are evaluated in the context of image analysis and coding, and their performance is compared to previous algorithms proposed by Serra (1982, 1988) and by Maragos and Schafer (1986). Sample evaluations indicate a greater than 22-fold savings in computational requirements and 11-fold reduction in memory requirements.
Performance of Barrier Synchronization Methods in a Multiaccess Network
Authors: Shun Yan Cheung, Vaidy S. Sunderam
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

Barrier synchronization is a commonly used primitive in parallel processing. In this paper, we present different algorithms for barrier synchronization on the widely prevalent multiaccess bus network, and derive analytical performance metrics for each of the proposed schemes, which are then compared against simulation results.
Vision-Based Vehicle Guidance
Authors: Massimo Bertozzi, Alberto Broggi
Venue: Computer (1997)

The use of microprocessors to control various automobile operations is now commonplace, and further computerization can be expected as researchers extend their efforts to develop autonomous, self-guided vehicles. One of the most challenging research areas is road following, which requires the two basic functionalities of lane detection and obstacle detection. Thanks to the reduced costs of image acquisition devices and to the increasing computational power of current computer systems, computer vision has recently become a popular method for sensing the surrounding environment. The authors use an approach that extracts and localizes features of interest, thereby limiting the computation-intensive processing of images. A geometrical transform called inverse perspective mapping makes a SIMD (single instruction, multiple data) approach practical for processing data captured in stereo images. Besides contributing to obstacle detection, the left stereo image is used in lane detection. The use of a 3D surface called a horopter, moved onto the road plane by electronic vergence, makes it possible to locate obstacles and establish their distance and exact position in 3D world space. The authors describe the GOLD system, a stereo vision system developed at the University of Parma, Italy, for generic obstacle detection and lane localization. GOLD was first tested on an experimental land vehicle for more than 3,000 kilometers along extra-urban roads and freeways at speeds up to 80 kilometers per hour and is now being ported to the Argo autonomous passenger vehicle.
Approximation, Dimension Reduction, and Nonconvex Optimization Using Linear Superpositions of Gaussians
Authors: A. Saha, Chuan-Lin Wu, Dun-Sung Tang
Venue: IEEE Transactions on Computers (1993)

This paper concerns neural network approaches to function approximation and optimization using linear superposition of Gaussians (or what are popularly known as radial basis function (RBF) networks). The problem of function approximation is one of estimating an underlying function f, given samples of the form ((y/sub i/, x/sub i/); i=1,2,...,n; with y/sub i/=f(x/sub i/)). When the dimension of the input is high and the number of samples small, estimation of the function becomes difficult due to the sparsity of samples in local regions. The authors find that this problem of high dimensionality can be overcome to some extent by using linear transformations of the input in the Gaussian kernels. Such transformations induce intrinsic dimension reduction, and can be exploited for identifying key factors of the input and for the phase space reconstruction of dynamical systems, without explicitly computing the dimension and delay. They present a generalization that uses multiple linear projections onto scalars and successive RBF networks (MLPRBF) that estimate the function based on these scaler values. They derive some key properties of RBF networks that provide suitable grounds for implementing efficient search strategies for nonconvex optimization within the same framework.
Estimating actual distances by norm functions: a comparison between the lk,p,&#x03B8;-norm and the lb1, b2, &#x03B8;-norm and a study about the selection of the data set
Authors: J. Fernández, P. Fernández, B. Pelegrin
Venue: Computers and Operations Research (2002)

The aim of this paper is two-fold. First, the weighted lp-norm, which has proved to be an accurate distance predicting function and has been proposed by several authors as the most suitable predictor of distances, is compared through an empirical study with the l2b-norm, a function with the same number of parameters as the first one. The results show that neither distance function dominates the other. On the contrary, depending on the region considered either norm may be significantly better than the other. The second aim is to investigate how the selection of the data set representing the network of the region affects the ability of the distance predicting function for predicting distances, and to try to deduce how to obtain a suitable data set which adequately represents a given geographical region. Through another empirical study it is shown that the selection of the data set dramatically affects the accuracy of the predictions. To obtain a suitable data set it is important to choose a good sample size, and more importantly, the cities should be chosen so that they are distributed all over the region and represent the density of the cities in the region.
Direct transistor-level layout for digital blocks
Authors: Prakash Gopalakrishnan, Rob A. Rutenbar
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

We present a complete transistor-level layout flow, from logic netlist to final shapes, for blocks of combinational logic up to a few thousand transistors in size. The direct transistor-level attack easily accommodates the demands for careful custom sizing necessary in high-speed design, and is also significantly denser than a comparable cell-based layout. The key algorithmic innovations are (a) early identification of essential diffusion-merged MOS device groups called clusters, but (b) deferred binding of clusters to a specific shape-level layout until the very end of a multi-phase placement strategy. A global placer arranges uncommitted clusters; a detailed placer optimizes clusters at shape level for density and for overall routability. A commercial router completes the flow. Experiments comparing to a commercial standard cell-level layout flow show that, when flattened to transistors, our tool consistently achieves 100% routed layouts that average 23% less area.
Safety Levels-An Efficient Mechanism for Achieving Reliable Broadcasting in Hypercubes
Venue: IEEE Transactions on Computers (1995)

We consider a distributed broadcasting algorithm for injured hypercubes using incomplete spanning binomial trees. An injured hypercube is a connected hypercube with faulty nodes. The incomplete spanning binomial tree proposed in this paper is a useful structure for implementing broadcasting in injured hypercubes. It is defined as a subtree of a regular spanning binomial tree that connects all the nonfaulty nodes. We show that in an injured n-dimensional hypercube with m faulty nodes, there are at least 2n¿ 2m source nodes (called l-nodes), each of which can generate an incomplete spanning binomial tree. A method is proposed to locate a large subset of the l-node set using the concept of safety level. The safety level of each node in an n-dimensional hypercube can be easily calculated through n¿ 1 rounds of information exchange among neighboring nodes. An optimal broadcast initiated from a safe node is proposed. When a nonfaulty source node is unsafe and there are at most n¿ 1 faulty nodes in an injured n-dimensional hypercube, the proposed broadcasting scheme requires at most n+ 1 steps.
Mining System Tests to Aid Software Maintenance
Authors: Hira Agrawal, James L. Alberi, Joseph R. Horgan, J. Jenny Li, Saul London, W. Eric Wong, Sudipto Ghosh, Norman Wilde
Venue: Computer (1998)

Before January 1, 2000, hundreds of millions of lines of legacy code must be understood, modified, and retested to avoid software failures as the year changes from "99" to "00." This Year 2000 crisis is merely an acute phase of a chronic problem. Software engineers in general spend more than half their development time understanding, modifying, and retesting existing code. Software companies have not tapped an important resource in performing these tasks. Most software development projects have a set of regression tests to help find bugs in the next release. But tests can be used for more than just finding errors. Modern test analysis tools can extract from these and other tests a wealth of untapped information that can be useful in later software maintenance projects. In this article, we describe techniques that maintainers can use to enhance program understanding, debugging, and testing-the three most costly tasks in software maintenance. We have incorporated the techniques as part of Bellcore's XSuds tool suite, a software understanding and diagnosis system.
Numerical Simulation of the Sedimentation of Rigid Bodies in an Incompressible Viscous Fluid by Lagrange Multiplier/Fictitious Domain Methods Combined with the Taylor&ndash;Hood Finite Element Approximation
Authors: L. H. Juárez, R. Glowinski, T. W. Pan
Venue: Journal of Scientific Computing (2002)

In this work we discuss an application of a distributed Lagrange multiplier based fictitious domain method, to the numerical simulation of the motion of rigid bodies settling in an incompressible viscous fluid. The solution method combines a third order finite element approximation, and time integration by operator splitting. Convergence results are shown for a simple Stokes flow with a circular rigid body that rotates with constant angular velocity. Results of numerical experiments for two sedimenting cylinders in a two-dimensional channel are presented. We present also results for the sedimentation of 100 and 504 cylinders.
Projective Structure from Uncalibrated Images: Structure From Motion and Recognition
Authors: A. Shashua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Address the problem of reconstructing 3-D space in a projective framework from two or more views, and the problem of artificially generating novel views of the scene from two given views (reprojection). The author describes an invariance relation that provides a new description of structure, which the author calls projective depth, that is captured by a single equation relating image point correspondences across two or more views and the homographics of two arbitrary virtual planes. The framework is based on knowledge of correspondence of features across views, is linear and extremely simple, and the computations of structure readily extend to overdetermination using multiple views. Experimental results demonstrate a high degree of accuracy in both tasks: reconstruction and reprojection.
A five-equation model for the simulation of interfaces between compressible fluids
Authors: Grégoire Allaire, Sébastien Clerc, Samuel Kokh
Venue: Journal of Computational Physics (2002)

A diffuse-interface method is proposed for the simulation of interfaces between compressible fluids with general equations of state, including tabulated laws. The interface is allowed to diffuse on a small number of computational cells and a mixture model is given for this transition region. We write conservation equations for the mass of each fluid and for the total momentum and energy of the mixture and an advection equation for the volume fraction of one of the two fluids. The model needs an additional closure law. We study two different closure laws: isobaric and isothermal. We study the mathematical properties of the resulting models: consistency, hyperbolicity, and existence of a mathematical entropy. We also study the stability of the interfaces with respect to averaging due to the numerical diffusion, a crucial property for the simulation of interface problems by conservative schemes. We show that the isobaric closure is preferable to the isothermal closure with respect to this property. We propose a Roe-type numerical scheme for the simulation of the model and show numerical results for classical test cases.
A Microprogrammable list Processor for Personal Computers
Authors: K. H. Lee, K. S. Leung, S. M. Cheang
Venue: IEEE Micro (1990)

A low-cost alternative to using a full-scale Lisp machine for list processing is proposed. The ASLP, a PC-based, highly pipelined list processor with two memory modules, supplements a procedural programming language to solve the list-manipulation problems in AI programs. This hardware-assisted processor was designed for use on an IBM PC AT to support list-manipulation functions. A discussion of Lisp and its internal structure and a review of existing Lisp machines are included. An estimation of the theoretical execution time for some typical list-manipulation functions, expressed in terms of machine cycles and memory cycles, is presented.
An Equivalence Theorem for Labeled Marked Graphs
Authors: Y. Wolfstahl, M. Yoeli
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Petri nets and their languages are a useful model of systems exhibiting concurrentbehavior. The sequential language associated with a given Petri net S consists of allpossible firing sequences of S, where each element of a firing sequence is a singletransition. The concurrent language associated with S consists of all possible concurrentfiring sequences of S, where each element of a concurrent firing sequence is a set oftransitions. The sequential language and the concurrent language associated with S aredenoted by (L)(S) and (/spl pi/)(S), respectively. In this paper, we consider an importantspecial ease of Petri nets, called labeled marked graphs. The main result derived in thispaper states that if /spl Gammasub 1/ and /spl Gammasub 2/ are two structurallydeterministic labeled marked graphs, then (L)(/spl Gammasub 1/)=L(/spl Gammasub 2/)/spl rlhar2spl pi/(/spl Gammasub 1/)=/spl pi/(/spl Gammasub 2/).
Economic Effects in Design and Test
Authors: I. D. Dear, C. Dislis, A. P. Ambler, J. Dick
Venue: IEEE Design Test (1991)

The authors argue that because of misconceptions and myths about the cost of test, many devices and systems are inadequately tested. Focusing on application-specific integrated circuits (ASICs), the authors discuss the economics of test and show how economic analysis leads to test that pays back. The EVEREST test strategy planner, a design tool that aids in the selection of design-for-testability structures during ASIC design and uses cost as a primary selection parameter, is presented.
An end-user tool for e-commerce debugging
Authors: Earl Wagner, Henry Lieberman
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

We demonstrate Woodstein, a software agent that tracks user interaction with e-commerce Web sites through a browser, and relates the browsing events to high-level models of complex, multi-step processes such as purchases or account transfers. Woodstein explains action steps and data in an understandable form, visualizes action history, and aids the user in exploring the causes of errors.
Hardware Designs for Exactly Rounded Elementary Functions
Authors: M. J. Schulte, E. E. Swartzlander,  Jr.
Venue: IEEE Transactions on Computers (1994)

This paper presents hardware designs that produce exactly rounded results for the functions of reciprocal, square-root, 2/sup x/, and log/sub 2/(x). These designs use polynomial approximation in which the terms in the approximation are generated in parallel, and then summed by using a multi-operand adder. To reduce the number of terms in the approximation, the input interval is partitioned into subintervals of equal size, and different coefficients are used for each subinterval. The coefficients used in the approximation are initially determined based on the Chebyshev series approximation. They are then adjusted to obtain exactly rounded results for all inputs. Hardware designs are presented, and delay and area comparisons are made based on the degree of the approximating polynomial and the accuracy of the final result. For single-precision floating point numbers, a design that produces exactly rounded results for all four functions has an estimated delay of 80 ns and a total chip area of 98 mm/sup 2/ in a 1.0-micron CMOS technology. Allowing the results to have a maximum error of one unit in the last place reduces the computational delay by 5% to 30% and the area requirements by 33% to 77%.
Call for Papers for Transactions on Mobile Computing
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

No abstract available.
Computer-Aided Hardware-Software Codesign
Authors: Giovanni De Micheli
Venue: IEEE Micro (1994)

Most digital systems consist of a hardware component and software programs that execute on the hardware platform. Obviously, a system can deliver higher performance when we tune the hardware to its software applications and vice versa. Today's novel architectures and the possible use of computer-aided design tools have created new opportunities to find solutions to codesign problems. This survey addresses this challenge, considers different architectures and their uses, and reports on the status of CAD codesign tools, with particular reference to simulation and synthesis.