ppxscal/embedding_network huggingface dataset:
Determining the Cost of a Stop-Test Decision
Authors: Willa Ehrlich, Bala Prasanna, John Stampfel, Jar Wu
Venue: IEEE Software (1993)

An approach to determining the consequences of a stop-test decision that combines software reliability engineering and economic analysis is described. The approach develops a model to quantify the economic consequences associated with terminating testing at a reliability achieved with a specified number of units of test-program execution, collects data on failures and program-execution time during system test, analyzes reliability data by selecting a reliability-growth model and fitting the model to these data at several points during system test, and applies the reliability model's estimated values to the economic model to determine the optimal system-release time. The benefits-to-cost ratio of the approach is shown to be very favorable.
Optimal Configuring of Multiple Scan Chains
Authors: S. Narayanan, R. Gupta, M. A. Breuer
Venue: IEEE Transactions on Computers (1993)

To reduce the high test time for serial scan designs, the use of multiple scan chains has been proposed. In this paper, the authors consider the problem of optimally constructing the multiple scan chains to minimize the overall test time. Rather than follow the traditional practice of using equal length chains, the authors allow the chains to be of different lengths and show that this cap lead to lower test times. The main idea in this approach is to place those scan elements that are more frequently accessed in shorter scan chains as this tends to reduce the overall test time. Given a design with N scan elements and given that if scan chains need to be used for applying tests, the authors present an algorithm of complexity O(kN/sup 2/) for constructing the specified number of chains such that the overall test application time is minimized. By analyzing a range of different circuit topologies, the authors demonstrate test time reductions as large as 40% over equal length chains.
Partially paradoxist Smarandache geometries
Authors: Howard Iseri, Mihály Bencze
Venue: Octogon Mathematical Magazine (2002)

A paradoxist Smarandache geometry combines Euclidean, hyperbolic, and elliptic geometry into one space along with other non-Euclidean behaviors of lines that would seem to require a discrete space. A class of continuous spaces is presented here together with specific examples that exhibit almost all of these phenomena and suggest the prospect of a continuous paradoxist geometry.
The Direction Vector I Test
Authors: K. Psarris, X. Kong, D. Klappholz
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The GCD and Banerjee tests are the standard data dependence tests used to determinewhether a loop may be parallelized/vectorized. In an earlier work, (1991) the authorspresented a new data dependence test, the I test, which extends the accuracy of theGCD and the Banerjee tests. In the original presentation, only the case of generaldependence was considered, i.e., the case of dependence with a direction vector of theform (*,*,...,*). In the present work, the authors generalize the I test to check for datadependence subject to an arbitrary direction vector.
The Impact of Parallel Loop Scheduling Strategies on Prefetching in a Shared Memory Multiprocessor
Authors: D. J. Lilja
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Trace-driven simulations of numerical Fortran programs are used to study the impact ofthe parallel loop scheduling strategy on data prefetching in a shared memorymultiprocessor with private data caches. The simulations indicate that to maximizememory performance, it is important to schedule blocks of consecutive iterations toexecute on each processor, and then to adaptively prefetch single-word cache blocks tomatch the number of iterations scheduled. Prefetching multiple single-word cache blockson a miss reduces the miss ratio by approximately 5% to 30% compared to a system withno prefetching. In addition, the proposed adaptive prefetching scheme further reducesthe miss ratio while significantly reducing the false sharing among cache blocks compared to nonadaptive prefetching strategies. Reducing the false sharing causes fewer coherence invalidations to be generated, and thereby reduces the total network traffic. The impact of the prefetching and scheduling strategies on the temporal distribution ofcoherence invalidations also is examined. It is found that invalidations tend to be evenlydistributed throughout the execution of parallel loops, but tend to be clustered whenexecuting sequential program sections. The distribution of invalidations in both types of program sections is relatively insensitive to the prefetching and scheduling strategy.
Stationary Equilibrium Orbits of Compensated Charged Beams in a Curvilinear Magnetic Field
Authors: Z. Parsa, V. Zadorozhnyi, A. Goncharov, I. Litovko
Venue: Cybernetics and Systems Analysis (2002)

The motion of the charged particle beams in crossed curvilinear electric and magnetic fields are investigated with the use of special coordinate systems. Possibilities to introduce a compensated charged beam into the equilibrium orbit are considered. It is proved that there exist electrical and magnetic fields that provide launching of a beam into stable equilibrium orbits. A configuration of these fields is built up.
Moving Selections into Linear Least Fixpoint Queries
Authors: R. Agrawal, P. Devanbu
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

Efficient least-fixpoint query evaluation is crucial to using logic as the query language for relational databases. The authors present a selection transposition algorithm that allows selections that are conjunctions of the predicates of the form column theta value to be evaluated ahead of the least-fixpoint operator while processing linear recursive queries. It is also shown that the algorithm transposes the strongest possible selection.
System Testability Assessment for Integrated Diagnostics
Authors: William R. Simpson, John W. Sheppard
Venue: IEEE Design Test (1992)

Techniques for analyzing the testability of a system are presented. They are based on an information flow model detailed by the authors previously (see ibid., vol.8, no.4, p.12-25, (1991)). The techniques identify testability problems involving ambiguity, feedback, the test set, and multiple failures. The overall concern is with the ability to diagnose failures as part of an overall maintenance architecture.
Quantum computing and the theorem of bell
Authors: Karl Hess, Walter Philipp
Venue: Microelectronic Engineering (2002)

The claim that the set of objects defining quantum information is of higher cardinality than that of classical information is often based on the theorem of Bell. We show that Bell's theorem excludes time like parameters and time dependencies. Therefore it cannot be used to prove the existence of a more extensive parameter space for quantum information. We also discuss certain classes of quantum computation games that are directly linked to the Bell theorem and may be subject to the same criticism.
Implementation of Tabled Evaluation with Delaying in Prolog
Authors: R. Ramesh, Weidong Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

Unlike SLD resolution as implemented in Prolog, tabled evaluation with delaying guarantees termination for function-free logic programs, avoids repeated computation of identical subqueries, and handles recursion through negation. It is often used in query processing and nonmonotonic reasoning where termination is required. This paper presents a new technique for incorporating tabled evaluation into existing Prolog systems. It requires neither time consuming modifications of a Prolog engine nor metainterpretation that can enormously slow down program execution. Instead, using a program transformation approach, the technique allows effective use of the advanced Prolog technology. The transformed program uses tabling primitives implemented externally in C that provide direct control over the search strategies. This brings efficiency as well as portability across Prolog systems. Experiences with a prototype implementation indicate that the approach results in a flexible and pragmatic method for query processing and nonmonotonic reasoning on top of Prolog. Performance measurements show that the method is efficient for practical applications.
A High-Speed Wireless LAN
Authors: David J. Skellern, L. h. Charles Lee, Tom McDermott, Neil H. E. Weste, John Dalton, Jeffrey Graham, Tan F. Wong, Andrew F. Myles, Terence M. P. Percival, Philip J. Ryan
Venue: IEEE Micro (1997)

Current wireless LANs that are small enough for portable computing devices have transmission rates up to a few Mbit/s, at the lower end of that obtained in IEEE 802-compliant wired LANs. These LANs can provide a useful service when the application demands and number of users are kept low. Much higher performance, from several 10's of Mbit/s to over 100 Mbit/s, is needed to accommodate more users and multimedia traffic. This paper proposes a radio solution at millimetre wavelength frequencies where there is sufficient spectrum to accommodate link speeds of hundreds-of-megabits-per-second. Using a test-bed with a burst-mode transmission capability and experimental 40 GHz radio, we have demonstrated a pico-cellular approach with a range of approximately 10 metres and link rates up to 185 Mbit/s. Additionally, we have built a prototype modem with a raw link rate of 54 Mbit/s for use in a demonstrator high-speed indoor WLAN. This paper presents the architecture of the proposed WLAN and the design and performance of the prototype modem. Section 2 discusses key design decisions that follow from the choice of spectrum and propagation characteristics in the millimetre-wave band. Section 3 describes the overall WLAN system architecture. Section 4 describes the prototype modem implementation and performance.
Matching and Retrieval of Distorted and Occluded Shapes Using Dynamic Programming
Authors: Euripides G. M. Petrakis, Aristeidis Diplaros, Evangelos Milios
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We propose an approach for matching distorted and possibly occluded shapes using Dynamic Programming (DP). We distinguish among various cases of matching such as cases where the shapes are scaled with respect to each other and cases where an open shape matches the whole or only a part of another open or closed shape. Our algorithm treats noise and shape distortions by allowing matching of merged sequences of consecutive small segments in a shape with larger segments of another shape, while being invariant to translation, scale, orientation, and starting point selection. We illustrate the effectiveness of our algorithm in retrieval of shapes on two data sets of two-dimensional open and closed shapes of marine life species. We demonstrate the superiority of our approach over traditional approaches to shape matching and retrieval based on Fourier descriptors and moments. We also compare our method with SQUID, a well-known method which is available on the Internet. Our evaluation is based on human relevance judgments following a well-established methodology from the information retrieval field.
Aspects of discontinuous Galerkin methods for hyperbolic conservation laws
Authors: Joseph E. Flaherty, Lilia Krivodonova, Jean-Francois Remacle, Mark S. Shephard
Venue: Finite Elements in Analysis and Design (2002)

We review several properties of the discontinuous Galerkin method for solving hyperbolic systems of conservation laws including basis construction, flux evaluation, solution limiting, adaptivity, and a posteriori error estimation. Regarding error estimation, we show that the leading term of the spatial discretization error using the discontinuous Galerkin method with degree p piecewise polynomials is proportional to a linear combination of orthogonal polynomials on each element of degrees p and p+1. These are Radau polynomials in one dimension. The discretization errors have a stronger superconvergence of order O(h2p+1), where h is a mesh-spacing parameter, at the outflow boundary of each element. These results are used to construct asymptotically correct a posteriori estimates of spatial discretization errors in regions where solutions are smooth.We present the results of applying the discontinuous Galerkin method to unsteady, two-dimensional, compressible, inviscid flow problems. These include adaptive computations of Mach reflection and mixing-instability problems.
On multi-scale display of geometric objects
Authors: Edward P. F. Chan, Kevin K. W. Chow
Venue: Data Knowledge Engineering (2002)

An important requirement in Geographic Information Systems (GISs) is the ability to display numerous geometric objects swiftly onto the display window. As the screen size is fixed, the scale of a map displayed changes as the user zooms in and out of the map. Spatial indexes like R-tree variants that are particularly efficient for range queries are not adequate to generate large maps that may be displayed at different scales. We propose a generalization for the family of R-trees, called the Multi-scale R-tree, that allows efficient retrieval of geometric objects at different levels of detail. The remedy offered here consists of two generalization techniques is cartography: selection and simplification. Selection means some objects that are relatively unimportant to the user at the current scale will not be retrieved. Simplification means that, given a scale, the display of objects is shown with sufficient but not with unnecessary detail. These two together reduce the time required to generate a map on a screen. A major obstacle to the effectiveness of a Multi-scale R-tree is the proper decomposition of geometric objects required by the simplification technique. To investigate the problem, a Multi-scale Hilbert R-tree is designed and implemented. Extensive experiments are then performed on real-life data and a general and simple design heuristic is found to solve the decomposition problem. We show that, with the proposed design heuristic, the Multi-scale R-tree is a desirable spatial index for both querying and display purposes.
Design Models for Computer-Human Interfaces
Authors: Donald R. Gentner, Jonathan Grudin
Venue: Computer (1996)

Computer-human interfaces are a Rorschach test for their designers-their inner views and biases are unconsciously reflected in the types of user interfaces they construct. There is no "best" way to design a user interface. Interface designers must be aware that a user interface can be based on any of several models, that each model has its advantages, and that their job is to choose the approach most suitable for the project at hand. Two principal approaches are the engineering model and the user-task model. In general, an interface based on the engineering model allows full access to the system's capabilities, whereas an interface based on the user-task model is easier to learn and use but provides access to only a subset of the system capabilities. This article examines the models underlying computer-human interface designs by considering a wide variety of systems, including many from areas outside of computing. These noncomputer examples can be instructive because they are simpler and thus clearer. They also provide some helpful detachment and perspective for those of us who are immersed in computers.
Analog VLSI Neural Networks for Impact Signal Processing
Authors: Jeff Brauch, Simon M. Tam, Mark A. Holler, Arthur L. Shmurun
Venue: IEEE Micro (1992)

The architecture and operation of the 80170NX electrically trainable analog neural network, which recognizes objects in real time, are discussed. The 80170NX uses a discrete Fourier transform (DFT) to preprocess an accelerometer output waveform that is subsequently recognized through a multilayer perceptron neural network. It is shown that neural network hardware operating in a linear mode can perform conventional signal processing functions. The similarity of neural network computations to linear signal processing functions makes it exceedingly straightforward to integrate neural networks and conventional signal processing in the system.
Fast heuristics for large scale covering-location problems
Authors: Luce Brotcorne, Gilbert Laporte, Frédéric Semet
Venue: Computers and Operations Research (2002)

We propose fast heuristics for large-scale covering-location problems in which the set of demand points is discrete and the set of potential location sites is continuous. These heuristics are compared on a set of 152 real-life instances arising in cytological screening.
The Proposed SSBLT Standard Doubles the VME64 Transfer Rate
Authors: Jack Regula
Venue: IEEE Micro (1992)

A revision to the IEEE 1014 VMEbus standard that offers a source synchronous block transfer (SSBLT) protocol which doubles the transfer rate without changing the backplane or electrical interface is discussed. Operating over the 64-b VMEbus, data transfers at 20M transfers/s times 8 bytes per transfer, for a burst transfer rate of 160 Mbytes/s. This performance improvement results purely from protocol improvements. SSBLT allows transfers to make use of standard VMEbus backplanes and driver technology and permits systems employing SSBLT to be backward compatible with present IEEE 1014 VMEbus modules. The faster transfer rate is shown to double the performance/cost ratio of the bus.
Learning-Based Complexity Evaluation of Radial Basis Function Networks
Authors: Kayvan Najarian
Venue: Neural Processing Letters (2002)

Recently, the complexity control of dynamic neural models has gained significant attention. The performance of such a process depends highly on the applied definition of &lsquo;model complexity&rsquo;. On the other hand, the learning theory creates a framework to assess the learning properties of models. These properties include the required size of the training samples as well as the statistical confidence over the model. In this Letter, we apply the learning properties of two families of Radial Basis Function Networks (RBFN's) to introduce new complexity measures that reflect the learning properties of such neural model. Then, based on these complexity terms we define cost functions, which provide a balance between the training and testing performances of the model.
Normal vortex states and their application in mesoscopic semiconductor devices
Authors: John R. Barker
Venue: Microelectronic Engineering (2002)

The occurrence and stability of quantized vortices in mesoscopic semiconductor open quantum dots and waveguides is described and illustrated using numerical simulation. Prospects for engineering persistent vortex states for possible application in quantum computing is discussed.
Using March Tests to Test SRAMs
Authors: Ad J. Van De Goor
Venue: IEEE Design Test (1993)

A unified notation is presented for static random access memory (SRAM) fault models and fault tests for these models. The likelihood that the different types of faults will occur is demonstrated using inductive fault analysis and physical defect analysis. A set of march tests is discussed, together with methods to make composite tests for collections of fault tapes. Empirical results showing the fault coverage of the different test enable SRAM users to choose the fault models of interest as well as the test.
Web-Browsing on stage: using the theatre of work for awareness on the WWW
Authors: Tom Gross, Wolfgang Prinz
Venue: ACM SIGGROUP Bulletin (2000)

In many situations users can benefit from group awareness--information about remote users' presence, availability, activities and other information about the remote environment. In this paper we present the Theatre of Work Enabling Relationships (TOWER) awareness environment. We particularly focus on the presentation of the awareness information in a 3D world and on mobile devices. Furthermore, we introduce awareness contexts for structuring awareness information and exemplify their use in a WWW context.
The V Compiler: Automatic Hardware Design
Authors: Viktors Berstis
Venue: IEEE Design Test (1989)

The V language describes VLSI systems concisely through the use of sequential algorithmic descriptions. Because V includes high-level constructs such as queues, asynchronous calls, and cycle-blocks, designs are more readily described and optimized into efficient hardware implementations. The implementations can then be tuned for space, time, or other objectives using annotations. From the input description, the V compiler generates both a register-transfer-level specification and a software simulator. Thus, a single description is suitable for both functional simulation and input to logic synthesis. The author describes parsing. scheduling, and resource sharing using the V compiler. He discusses synthesis and simulation, annotations, and high-level constructs.
An O(n+k) Algorithm for Ordered Retrieval from an Associative Memory
Authors: D. -L. Lee, W. A. Davis
Venue: IEEE Transactions on Computers (1988)

The problem of retrieving an ordered list of k words that satisfy a given search condition from an associative memory of m words of n bits each is addressed. A fast ordered retrieval algorithm is proposed, along with a logic design for a cellular associative memory which mechanizes the algorithm. The algorithm is of time complexity O(n+k). By contrast, the fastest previously known algorithms, by M.H. Lewis and C.V. Ramamoorthy, J.L. Turner, and B.W. Wah, are of time complexities O(k*log n) and O(k*n), respectively.
Efficient communication algorithms for pipeline multicomputers
Authors: Kok Kin Kee, Salim Hariri
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

In this paper, we study the various communication algorithms on the pipeline multicomputer. We show how the three important communication functions (data distribution, data collection, and data broadcast) can be improved by reducing the propagation delay and using the right message size.
The Fault-Tolerant Extension Problem for Complete Multipartite Networks
Authors: A. Aziz Farrag, R. J. Dawson
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We develop a characterization for m-fault-tolerant extensions, and for optimalm-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows thatthis problem is equivalent to an interesting combinatorial problem on the partitioning ofintegers. This characterization leads to a new procedure for constructing an optimalm-fault-tolerant extension of any complete multipartite graph, for any m/spl ges/0. Theproposed procedure is mainly useful when the size of the graph is relatively small,because the search time required is exponential. This exponential search, however, is notalways necessary. We prove several necessary conditions that help us, in several cases,to identify some optimal m-fault-tolerant extensions without performing any search.