ppxscal/embedding_network huggingface dataset:
Simulated Annealing: A Proof of Convergence
Authors: V. Granville, M. Krivánek, J. P. Rasson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

We prove the convergence of the simulated annealing procedure when the decision to change the current configuration is blind of the cost of the new configuration. In case of filtering binary images, the proof easily generalizes to other procedures, including that of Metropolis. We show that a function Q associated with the algorithm must be chosen as large as possible to provide a fast rate of convergence. The worst case (Q constant) is associated with the "blind" algorithm. On the other hand, an appropriate Q taking sufficiently high values yields a better rate of convergence than that of Metropolis procedure.
Architecture and algorithms for scalable mobile QoS
Authors: Bahareh Sadeghi, Edward W. Knightly
Venue: Wireless Networks (2003)

Supporting Quality of Service (QoS) is an important objective for future mobile systems, and requires resource reservation and admission control to achieve. In this paper, we introduce an admission control scheme termed Virtual Bottleneck Cell, an approach designed to scale to many users and handoffs, while simultaneously controlling "hot spots". The key technique is to hierarchically control an aggregated virtual system, ensuring QoS objectives are satisfied in the underlying system without per-user resource management such as advanced reservations of bandwidth in a user's predicted future locations. We develop a simple analytical model to study the system and illustrate several key components of the approach, such as balancing the conflicting design objectives of high utilization, scalability, and ensured QoS. We formulate the problem of clustering cells into virtual system as an optimization problem and propose a heuristic adaptive clustering algorithm as a practical solution. Finally, we evaluate the scheme by developing a simple analytical model, devising an optimal off-line algorithm, and performing simulations of a two-dimensional network.
SS-3d: a collaborative tool for shooting-preproduction with Web3D
Authors: Asuka Tohda, Kazuyuki Okada, Masa Inakage
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

In the digital film making process, due to increases in the use of visual effects and CG, the shooting process is getting more and more complicated. In this paper, we describe an on-line collaborative visualization tool, named "SS-3d" for cinema pre-production. This tool is made for the purpose of online pre-production meeting. It helps production members to make decisions on the camera position and angle for the live action plate and computer animation plate. These plates are assumed to be composited with other plates. Since the system is based on Web3D technology, users can access the system via a web browser and share information about the shots, wherever they are. This system is implemented by Macromedia Shockwave3D, the Shockwave3D plug-in is the key technology for this system to set up platform-independent tools.
Dynamic graphic regression
Authors: Alan M. Sykes, Alan D. Mayer
Venue: ACM SIGAPL APL Quote Quad (2002)

Statisticians and data analysts have always used pictorial representations of data (graphs and charts) to discover and explore relationships between variables, and to communicate their results to other people. Developments in computer hardware and software have now brought dynamically interactive graphs to everyone's desktop. Dygress (Dynamic Graphic Regression) is a statistical analysis toolkit which brings together a powerful combination of the new graphic tools and a wide range of regression techniques, and makes them easily accessible to the user.
Improving the proportion of at-speed tests in scan BIST
Authors: Y. Huang, I. Pomeranz, S. M. Reddy, J. Rajski
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

A method to select the lengths of functional sequences in a BIST scheme for scan designs is proposed in this paper. A functional sequence is a sequence of primary input vectors applied when the circuit operates as a sequential circuit, without using scan. These sequences can be applied at-speed, i.e., at the normal circuit clock speed. The objectives set for choosing the lengths of the functional sequences are to increase the number of vectors applied at-speed, and to reduce the number of settings of functional sequence lengths, without compromising the fault coverage achieved. The experimental results presented demonstrate that compared to earlier methods, the proposed method achieves the above objectives while also achieving higher fault coverages for most of the benchmark circuits considered.
IDDQ Test and Diagnosis of CMOS Circuits
Authors: Eugeni Isern, Joan Figueras
Venue: IEEE Design Test (1995)

Realistic faults must be targeted if high-quality test and diagnosis of CMOS circuits are desired. We propose a strategy to generate high-quality IDDQ test patterns for bridging faults (BFs). We used a standard ATPG for stuck-at faults that adequately adapts to target bridging faults by IDDQ testing. The methodology applies to both combinational and sequential circuits using scan-path structures. We discuss the diagnosis capability of IDDQ test sets, as well as the addition of specifically generated vectors to improve diagnosability. Results on both test and diagnosis are provided for benchmark circuits.
An Object-Oriented Fuzzy Data Model for Similarity Detection in Image Databases
Authors: Arun K. Majumdar, Indrajit Bhattacharya, Amit K. Saha
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In this paper, we introduce a fuzzy set theoretic approach for dealing with uncertainty in images in the context of spatial and topological relations existing among the objects in the image. We propose an object-oriented graph theoretic model for representing an image and this model allows us to assess the similarity between images using the concept of (fuzzy) graph matching. Sufficient flexibility has been provided in the similarity algorithm so that different features of an image may be independently focused upon.
Security Constraint Processing in a Multilevel Secure Distributed Database Management System
Authors: Bhavani Thuraisingham, William Ford
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In a multilevel secure distributed database management system, users cleared at different security levels access and share a distributed database consisting of data at different sensitivity levels. An approach to assigning sensitivity levels, also called security levels, to data is one which utilizes constraints or classification rules. Security constraints provide an effective classification policy. They can be used to assign security levels to the data based on content, context, and time. In this paper we extend our previous work on security constraint processing in a centralized multilevel secure database management system by describing techniques for processing security constraints in a distributed environment during query, update, and database design operations.
Refinable Bounds for Large Markov Chains
Authors: Pierre Semal
Venue: IEEE Transactions on Computers (1995)

A method to bound the steady-state solution of large Markov chains is presented. It integrates the concepts of eigenvector polyhedron and of aggregation and is iterative in nature.The bounds are obtained by considering a subset only of the system state space. This makes the method specially attractive for problems which are too large to be dealt with by traditional methods. The quality of the bounds depends on the locality of the system which is studied: when the system spends most of its time in a small subset of states, tight bounds can be obtained by considering this subset only. Finally, the bounds are refinable in the sense that the tightness of the bounds can be improved by enlarging the subset of states which is considered.The method is illustrated on a model of a repairable fault-tolerant system with 16 million states. Tight bounds on its availability are obtained by considering less than 0.1 percent of its state space.
Location Awareness in Ad Hoc Wireless Mobile Networks
Authors: Yu-Chee Tseng, Shih-Lin Wu, Wen-Hwa Liao, Chih-Min Chao
Venue: Computer (2001)

Advances in wireless communications and small, portable computing devices have made mobile computing possible. Networks composed of repositioning mobile hosts require location awareness to provide new geographic services and maximize routing efficiency and quality of service. One mobile computing implementation creates a manet--a mobile ad hoc network that consists of mobile hosts that roam at will and communicate with one another. Manet research focuses on unicast, collective communication, and quality-of-service routing. Operating in a physical geometric space, manets must exploit location information. Thus, each mobile host uses a positioning device to determine its current physical location.Given that wireless networks can operate in a 3D physical environment, it's inevitable that mobile applications will exploit mobile hosts' location information. Developers of emerging geographic services based on manets must learn how to increase positioning accuracy and establish a connection between location information and the vast sea of Web data.
Exploring the Software Development Trilogy
Authors: Daniel Le Métayer, Valérie-Anne Nicolas, Olivier Ridoux
Venue: IEEE Software (1998)

Software development is concerned with more than just generation of code; the program must have the desired properties, and these must be demonstrated via suitable tests and correctness arguments. One way of viewing these aspects is to group them into programs, properties, and data. When represented as vertices in a triangle, the edges represent processes to produce one element from another. The research reported in this article aims at practical methods for automatic test generation by restricting the use of both predicate logic and programming constructs. It promises to eventually result in practical domain- specific programming languages, with a significant boost in both quality and productivity.
Dynamic Linking of Software Components
Authors: Michael Franz
Venue: Computer (1997)

The concepts underlying dynamic linking reached maturity through modular operating systems and are being reintroduced in some of the most popular workstation and PC operating systems. The original idea behind dynamic linking was to factor out common functions so that they could be shared among several applications. As straightforward as dynamic linking may seem, it can nevertheless be implemented through a surprising variety of strategies. This article contrasts three simple dynamic linking schemes with two much more elaborate strategies. As general-purpose operating systems move to embrace dynamic linking, the technologies chosen for linking components will play a pivotal role in the systems' long-term commercial success. The three "lightweight" approaches to dynamic linking-runtime table lookup, load-time code modification, and runtime code modification-vary in the way they employ these tables and handle calls. The two new techniques, although more complex, promise to facilitate cross-platform portability. The first, load-time code generation, capitalizes on the insight that raw processor power is growing much more rapidly than the speed of I/O operations. The second, load-time compliation, uses a highly compact intermediate program representation ("slim binaries") instead of native object files. This speeds up the I/O component of loading dramatically, but it has several drawbacks that make it less attractive than load-time code generation.
The area of the pressure - flow loop for assessment of arterial stenosis: a new index
Authors: Zehava Ovadia-Blechman, Shmuel Einav, Uri Zaretsky, David Castel, Eran Toledo, Michael Eldar
Venue: Technology and Health Care (2002)

This study describes a novel method for assessing stenotic severity, based on simultaneous pressure and flow wave measurements. Pressure and flow measurements were performed in latex and rubber tubes, and in a clinically-used vascular graft. Pressure waves were recorded at several degrees of stenosis and at different distances proximal to the stenosis. Pressure wave versus flow wave was plotted. Internal pressure-flow loop area (PFLA), loop slope and pressure-axis intercept were calculated. Values of these three indices significantly increased with increasing degrees of stenosis (P < 0.001). Similar phenomenon was observed during in-vivo experiments. Polynomial functions were fitted, resulting in an excellent PFLA variable/percent stenosis correlation, independent of distance between sensor and stenosis (R2 > 0.96). In addition, tube compliance was measured and found to correlate with the polynomial coefficients (|R| > 0.9). This innovative approach could significantly contribute to detecting and evaluating arterial stenoses, and to characterize the elasticity of the artery.
In Praise of Practice
Authors: Robert L. Glass
Venue: IEEE Software (1998)

What a variety of issues Ed Yourdon addresses in his "A Tale of Two Futures." In that diverse collection of topics, I'd like to focus on a fairly obscure part of what he has to say: the quality of today's programmers. Not because it's important to Ed, necessarily, but because it's important to me. First, let me tell you where I'm coming from. I like to tell people that my head is in software's academic world, but that my heart is in its practice.What do I mean by this? I have done the academic software thing. I've been a professor of software engineering, the director of a software engineering program, a visiting professor at a university in Sweden, and a member of the Software Engineering Institute's technical staff (which, at the time, was far more academic than practical). I've accumulated more than a decade's worth of academic experience.I have done the industrial software thing. I've worked as a maintainer, then a developer, team leader, acquisition manager, and R&D specialist. I've served as a consultant. All in all, I've accumulated more than three decades of industrial experience.Drawing on this mixed background to mull over the formative experiences of my career, I find that it's the practitioner moments that I come back to. I recall the brilliant, strange, and wonderful developers I worked with and the exciting, challenging, and world-changing applications I worked on. From deep in the trenches, I acquired the gritty, hard-won lessons that let me solve real problems with sheer brainpower, getting the awesomely dumb computer to do awesomely brilliant things by infusing it with just the right software. I still marvel at what we practitioners have accomplished. For these reasons, I take offense when people knock software practice. And Ed has, in spades, with his prediction of software's future.
The Presumed-Either Two-Phase Commit Protocol
Authors: Gopi K. Attaluri, Kenneth Salem
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking occurs, presumed-either combines the performance advantages of presumed-abort and presumed-commit. Otherwise, presumed-either behaves much like the widely-used presumed-abort protocol.
Application-Dependent Dynamic Monitoring of Distributed and Parallel Systems
Authors: D. M. Ogle, K. Schwan, Richard Thomas Snodgrass
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Achieving high performance for parallel or distributed programs often requires substantial amounts of information about the programs themselves, about the systems on which they are executing, and about specific program runs. The monitoring system that collects, analyzes, and makes application-dependent monitoring information available to the programmer and to the executing program is presented. The system may be used foroff-line program analysis, for on-line debugging, and for making on-line, dynamic changes to parallel or distributed programs to enhance their performance. The authors use a high-level, uniform data model for the representation of program information andmonitoring data. They show how this model may be used for the specification of programviews and attributes for monitoring, and demonstrate how such specifications can betranslated into efficient, program-specific monitoring code that uses alternativemechanisms for the distributed analysis and collection to be performed for the specifiedviews. The model's utility has been demonstrated on a wide variety of parallel machines.
Balanced Parallel Sort on Hypercube Multiprocessors
Authors: B. Abali, F. özgü, A. Bataineh
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A parallel sorting algorithm for sorting n elements evenly distributed over 2/sup d/ p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O((n log n)/p+p log 2n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k1,. . ., (p-1)) of the final sorted list in advance. These p-1 keys are used to partition the sorted sublists in each node to redistribute data to the nodes to be merged in parallel. The nodes finish the sort with an equal number of elements (n/p) regardless of the data distribution. A parallel selection algorithm for determining the balanced partition keys in O(p log2n) time is presented. The speed of the sorting algorithm is further enhanced by the distance-d communication capability of the iPSC/2 hypercube computer and a novel conflict-free routing algorithm. Experimental results on a 16-node hypercube computer show that the sorting algorithm is competitive with the previous algorithms and faster for skewed data distributions.
Testing ICs: Getting to the Core of the Problem
Authors: Brian T. Murray, John P. Hayes
Venue: Computer (1996)

Trends in integrated circuit design have made testing ICs more difficult than ever before. Yet test is essential: Although IC design and manufacturing methods obviously contribute to quality, high-quality ICs rely on high-quality test. And testing is a major contributor to the cost of manufacturing and maintaining ICs. The industry does have well-developed fault models and test-generation methods, and these methods are widely supported by design tools. However, their applicability to today's increasingly fast and complex circuits is limited by practical cost considerations. Design-for-test techniques, especially scan design and built-in self-test, can provide a satisfactory solution in many instances. Developments in IC technology continue to pose new testing challenges, however. A noteworthy example is the problem of efficiently testing predesigned, embedded components, or cores. Widespread use of cores is a new phenomenon, and it creates some challenging testing problems. This tutorial examines the market and technology trends affecting the testing of integrated circuits, with emphasis on the role of cores and built-in self-test. The authors explain manufacturing testing, as opposed to design testing, which happens before manufacturing, and on-line testing, which happens after.
On mean value solutions for the Helmholtz equation on square grids
Authors: João B. R. do Val, Marinho G. Andrade
Venue: Applied Numerical Mathematics (2002)

A numerical treatment for the boundary value problem involving the Helmholtz equation Δu - λ2u = f is presented. The method is a five-point formula with an improved accuracy when compared with the usual finite difference method. Besides, the accuracy evaluation is provided in analytical form and the classical difference scheme is seen as a truncated series approximation to the present method. The idea comes from approximations to analytical solutions to the Dirichlet problem inside a ball, based on the Green identity. The homogeneous and the nonhomogeneous parts are evaluated in separate expressions, and the precision error yielded is of order O(h2). Some numerical examples and comparisons are presented.
Efficient adaptive simplification of massive meshes
Authors: Eric Shaffer, Michael Garland
Venue: Proceedings of the conference on Visualization '01 (2001)

The growing availability of massive polygonal models, and the inability of most existing visualization tools to work with such data, has created a pressing need for memory efficient methods capable of simplifying very large meshes. In this paper, we present a method for performing adaptive simplification of polygonal meshes that are too large to fit in-core.Our algorithm performs two passes over an input mesh. In the first pass, the model is quantized using a uniform grid, and surface information is accumulated in the form of quadrics and dual quadrics. This sampling is then used to construct a BSP-Tree in which the partitioning planes are determined by the dual quadrics. In the final pass, the original vertices are clustered using the BSP-Tree, yielding an adaptive approximation of the original mesh. The BSP-Tree describes a natural simplification hierarchy, making it possible to generate a progressive transmission and construct level-of-detail representations. In this way, the algorithm provides some of the features associated with more expensive edge contraction methods while maintaining greater computational efficiency. In addition to performing adaptive simplification, our algorithm exhibits output-sensitive memory requirements and allows fine control over the size of the simplified mesh.
A moving mesh method for the solution of the one-dimensional phase-field equations
Authors: J. A. Mackenzie, M. L. Robertson
Venue: Journal of Computational Physics (2002)

A moving mesh method is developed for the numerical solution of one-dimensional phase-change problems modelled by the phase-field equations. The computational mesh is obtained by equidistribution of a monitor function tailored for the functional variation of the phase field in the interfacial region. Existence and uniqueness of the discretised equations using a moving mesh are also established. Numerical results are given for classical and modified Stefan test problems. The numerical algorithm is relatively simple and is shown to be far more efficient than fixed grid methods.
A Priori Convergence Theory for Reduced-Basis Approximations of Single-Parameter Elliptic Partial Differential Equations
Authors: Yvon Maday, Anthony T. Patera, Gabriel Turinici
Venue: Journal of Scientific Computing (2002)

We consider &ldquo;Lagrangian&rdquo; reduced-basis methods for single-parameter symmetric coercive elliptic partial differential equations. We show that, for a logarithmic-(quasi-)uniform distribution of sample points, the reduced&ndash;basis approximation converges exponentially to the exact solution uniformly in parameter space. Furthermore, the convergence rate depends only weakly on the continuity-coercivity ratio of the operator: thus very low-dimensional approximations yield accurate solutions even for very wide parametric ranges. Numerical tests (reported elsewhere) corroborate the theoretical predictions.