ppxscal/embedding_network huggingface dataset:
Disk Scheduling in Video Editing Systems
Authors: W. G. Aref, I. Kamel, S. Ghandeharizadeh
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Modern video servers support both video-on-demand and nonlinear editing applications. Video-on-demand servers enable the user to view video clips or movies from a video database, while nonlinear editing systems enable the user to manipulate the content of the video database. Applications such as video and news editing systems require that the underlying storage server be able to concurrently record live broadcast information, modify prerecorded data, and broadcast an authored presentation. A multimedia storage server that efficiently supports such a diverse group of activities constitutes the focus of this study. A novel real-time disk scheduling algorithm is presented that treats both read and write requests in a homogeneous manner in order to ensure that their deadlines are met. Due to real-time demands of movie viewing, read requests have to be fulfilled within certain deadlines; otherwise, they are considered lost. Since the data to be written into disk is stored in main memory buffers, write requests can be postponed until critical read requests are processed. However, write requests still have to be processed within reasonable delays and without the possibility of indefinite postponement. This is due to the physical constraint of the limited size of the main memory write buffers. The new algorithm schedules both read and write requests appropriately, to minimize the amount of disk reads that do not meet their presentation deadlines, and to avoid indefinite postponement and large buffer sizes in the case of disk writes. Simulation results demonstrate that the proposed algorithm offers low violations of read deadlines, reduces waiting time for lower priority disk requests, and improves the throughput of the storage server by enhancing the utilization of available disk bandwidth.
A Fourier Approach to Camera Orientation
Authors: A. Bani-Hashemi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Recovering camera orientation with respect to a known coordinate system is of great significance to photogrammetry and binocular stereo. In binocular stereo, the relative orientation between a camera pair may be obtained from the orientation of each camera with respect to a common frame. In this paper a Fourier technique is presented to determine the orientation of a camera with respect to a calibration object. This technique is limited to orthographic projection, but has two major strengths of; being very accurate, and the camera orientation being entirely decoupled from translation.
A General Polynomial Sieve
Authors: Shuhong Gao, Jason Howell
Venue: Designs, Codes and Cryptography (1999)

An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve to aid in finding smooth Coppersmith polynomials for use in the index calculus method. We discuss their approach and some of the difficulties they found with their sieve. We present a new sieving method that can be applied to any affine subspace of polynomials over a finite field.
A Fuzzy-Syntactic Approach to Allograph Modeling for Cursive Script Recognition
Authors: Marc Parizeau, Réjean Plamondon
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents an original method for creating allograph models and recognizing them within cursive handwriting. This method concentrates on the morphological aspect of cursive script recognition. It uses fuzzy-shape grammars to define the morphological characteristics of conventional allographs which can be viewed as basic knowledge for developing a writer independent recognition system. The system uses no linguistic knowledge to output character sequences that possibly correspond to an unknown cursive word input.The recognition method is tested using multi-writer cursive random letter sequences. For a test dataset containing a handwritten cursive text 600 characters in length written by ten different writers, average character recognition rates of 84.4% to 91.6% are obtained, depending on whether only the best character sequence output of the system is considered or if the best of the top 10 is accepted. These results are achieved without any writer-dependent tuning. The same dataset is used to evaluate the performance of human readers. An average recognition rate of 96.0% was reached, using ten different readers, presented with randomized samples of each writer. The worst reader-writer performance was 78.3%. Moreover, results show that system performances are highly correlated with human performances.
EXTENT: a portable programming environment for designing and implementing high-performance block recursive algorithms
Authors: D. L. Dai, S. K. S. Gupta, S. D. Kaushik, J. H. Lu, R. V. Singh, C. H. Huang, P. Sadayappan, R. W. Johnson
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

EXTENT is an EXpert system for TENsor product formula Translation. In this paper we present a programming environment for automatic generation of parallel/vector programs from tensor product formulas. A tensor (Kronecker) product based programming methodology is used for designing high performance programs on various architectures. In this programming methodology, block recursive algorithms such as the fast Fourier transform and Strassen's matrix multiplication algorithm are expressed as tensor product formulas involving tensor product and other matrix operations. A tensor product formula can be systematically translated to parallel and/or vector code for various parallel architectures. A prototype system which generates programs for the Cray Y-MP, Cray TSD, and Intel Paragon has been developed. Performance results for some generated programs are presented.
A Reduced-Basis Element Method
Authors: Yvon Maday, Einar M. Rønquist
Venue: Journal of Scientific Computing (2002)

Reduced basis methods are particularly attractive to use in order to diminish the number of degrees of freedom associated with the approximation of a set of partial differential equations. The main idea is to construct ad hoc basis functions with a large information content. In this note, we propose to develop and analyze reduced basis methods for simulating hierarchical flow systems, which is of relevance for studying flows in a network of pipes, an example being a set of arteries or veins. We propose to decompose the geometry into generic parts (e.g., pipes and bifurcations), and to contruct a reduced basis for these generic parts by considering representative geometric snapshots. The global system is constructed by gluing the individual basis solutions together via Lagrange multipliers.
The direct expansion of graphs
Authors: Bostjan Bresar
Venue: Discrete Mathematics (2002)

The concept of expansion of a graph has proved to be an efficient tool in the study of median, quasi-median and partial Hamming graphs. The basic idea of expansion is that given a graph G, we obtain a graph G' by enlarging a subgraph of G according to a certain rule in such a way that G' inherits certain properties of G. Mulder suggested several new rules for such expansions (H.M. Mulder, The expansion procedure for graphs, in: R. Bodendiek (Ed.), Contemporary Methods in Graph Theory, B.I.-Wissenschaftsverlag, Manhaim, 1990, pp. 459-477). In particular he pointed out the case when a direct product in the process of expansion is used, and called it a relational expansion. In this paper we investigate it in further detail, especially, we deal with preservation of connectivity by this expansion.
Logic Complement, a New Method of Checking the Combinational Circuits
Authors: M. Gessel, A. V. Morozov, V. V. Sapozhnikov, Vl. V. Sapozhnikov
Venue: Automation and Remote Control (2003)

A new method of functional checking of combinational circuits by the logic complement of the output function was proposed. A self-testing checker based on the 1-out-of-3 code was described. Results of experimental studies of the standard examples of the MCNC system were presented.
Applying Formal Software Synthesis
Authors: Richard K. Jüllig
Venue: IEEE Software (1993)

A software synthesis method that combines elements of graphical tools, specification writing, and code construction is discussed. Practical applications of the components and efforts to integrate them into a conceptually coherent prototype environment are described. The hallmarks of the approach are the use of formal methods and a general-purpose inference engine, supported by a comprehensive, interactive development environment. The development model is a formal method, but it differs from other formal approaches in that its notations are used primarily to represent programming knowledge and support automated code generation. The performance of the system is also described.
Advanced In-Plane Rotation-Invariant Correlation Filters
Authors: G. Ravichandran, D. Casasent
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Advanced correlation filter synthesis algorithms to achieve rotation invariance are described. We use a specified form for the filter as the rotation invariance constraint and derive a general closed-form solution for a multiclass rotation-invariant filter that can recognize a number of different objects. By requiring the filter to minimize the average correlation plane energy, we produce a multiclass rotation invariant (RI) RI-MACE filter, which controls correlation plane sidelobes and improves discrimination against false targets. To improve noise performance, we require the filter to minimize a weighted sum of correlation plane signal and noise energy. Initial test results of all filters are provided.
On Aligning Curves
Authors: Thomas B. Sebastian, Philip N. Klein, Benjamin B. Kimia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We present a novel approach to finding a correspondence (alignment) between two curves. The correspondence is based on a notion of an alignment curve which treats both curves symmetrically. We then define a similarity metric based on the alignment curve using two intrinsic properties of the curve, namely, length and curvature. The optimal correspondence is found by an efficient dynamic-programming method both for aligning pairs of curve segments and pairs of closed curves, and is effective in the presence of a variety of transformations of the curve. Finally, the correspondence is shown in application to handwritten character recognition, prototype formation, and object recognition, and is potentially useful in other applications such as registration and tracking.
Performance Analysis of Long-Lived Transaction Processing Systems with Rollbacks and Aborts
Authors: Deron Liang, Satish K. Tripathi
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Increasing the parallelism in transaction processing and maintaining data consistency appear to be two conflicting goals in designing Distributed Database Systems (DDBS). This problem becomes especially difficult if the DDBS is serving long-lived transactions (LLTs). Recently, a special case of LLTs, called sagas, has been introduced that addresses this problem. The DDBS with sagas provides high parallelism to transactions by allowing sagas to release their locks as early as possible. However, it is also subject to overhead due to efforts needed to restore data consistency in case of failures. In this paper, we first conduct a series of simulation studies to compare the performance of LLT systems with saga implementation (or saga systems) and the LLT systems without saga implementation (or nonsaga systems) in a faulty environment. The simulation studies show that the saga systems outperform their nonsaga counterparts under most of conditions including the heavy failure cases. We thus propose an analytical queuing model to further investigate the performance behavior of the saga systems. The motivation of the development of this analytical model is twofold. It assists us to further study quantitatively the performance penalty of the saga implementation due to the failure recovery overhead. Furthermore, the analytical solution can be used by system administrators to fine tune the performance of the saga system. This analytical model captures the primary aspects of the saga system, namely, data locking, resource contention, and failure recovery. Due to the complicated nature of the analytical modeling, we solve the model approximately for various performance metrics using decomposition methods, and validate the accuracy of the analytical results via simulations.
Taking Technology to the Molecular Level
Authors: Christine Peterson
Venue: Computer (2000)

Fifty years ago, nanotechnology could only merit serious consideration in dreams and science fiction. The author now believes nanotechnology's existence to be a certainty. The only question now is "when." The application areas for a mature nanotechnology industry are astounding. The author predicts nanotechnology will virtually eliminate pollution from the earth's air and water, as well as produce clean manufacturing processes for the future. Also, she foresees the creation of a space elevator stretching from Earth's surface to a geosynchronous orbit along which cargo and people could move, built with an extremely hard material called carbon nanotubes. And she predicts extremely small machines that destroy viruses, remove arterial plaque, and get rid of cancer cells. The author explains the research activities, some in the form of industry start-ups, taking place across a variety of disciplines: chemistry, physics, mechanical engineering, materials science, molecular biology, and computer science. She also explains some of the issues surrounding this extremely powerful and potentially dangerous technology.
A Systolic Array Implementation of the One-Shot Decorrelating Detector Used for Mobile CDMA Communications
Authors: Timothy F. Myers, Mario E. Magaña
Venue: Wireless Personal Communications: An International Journal (1999)

A systolic array implementation of the one-shot decorrelating detector algorithm designed for Code-Division Multiple-Access (CDMA) spread spectrum communication systems used in mobile communications environments is developed. This detector has the advantage that it is near-far resistant, that is, it minimizes the interference effects that near-end users have on far-end users. However, its implementation requires the on-line inversion of the correlation matrix between the desired and interfering users. For this reason, a systolic computation approach is chosen to help solve the problem of fast on-the-fly matrix inversion. Performance of the proposed implementation is assessed via digital computer simulation. The implementation methodology presented here leads to a VLSI implementation structure.
IP Telephony&mdash;New Horizon for Telemedicine and e-Health
Authors: Yongguo Zhao, Yukako Yagi, Isao Nakajima, Hiroshi Juzoji
Venue: Journal of Medical Systems (2002)

Internet Protocol (IP) based networks are increasingly being used as alternatives to the traditional circuit-switched networks for carrying voice traffic. IP telephony is taking a firm hold in the world telecommunication market for a wide range of applications including telemedicine. The merits of IP telephony for telemedicine lie in cost-savings and new applications and functionalities it may render. In this paper, we try to discuss and analyze the implications of IP telephony on the evolution and deployment of telemedicine and e-health.
Efficient representation of digital terrain models: compression and spatial decorrelation techniques
Authors: Jan T. Bjørke, Stein Nilsen
Venue: Computers Geosciences (2002)

Points on terrain surfaces often are correlated, i.e., the height of one point is dependent on the height of its neighbouring points. Since this correlation to some degree represents redundant information, it can be utilized in the construction of digital terrain models by reducing the amount of data volume. The topic for the present article is to compare the spatial decorrelation properties of wavelets with adaptive triangulation and an adaptive application of universal kriging. We have defined spatial decorrelation as the separation of the structural information of a terrain surface from its local fluctuations. The wavelet method we have selected for our study, is a 2D wavelet transform which reproduces polynomials of degree two. The experiments show that wavelets have slightly better decorrelation properties than the two other methods. The results also show that wavelets have many attractive properties in terrain modelling in terms of model generalization, noise reduction, multi-resolution, low time complexity and strong numerical stability.
Metric-Based Parameterizations for Multi-Step Unconstrained Optimization
Authors: I. A. Moghrabi
Venue: Computational Optimization and Applications (2001)

We consider multi-step quasi-Newton methods for unconstrained optimization. These methods were introduced by Ford and Moghrabi (Appl. Math., vol. 50, pp. 305&ndash;323, 1994&semi; Optimization Methods and Software, vol. 2, pp. 357&ndash;370, 1993), who showed how interpolating curves could be used to derive a generalization of the Secant Equation (the relation normally employed in the construction of quasi-Newton methods). One of the most successful of these multi-step methods makes use of the current approximation to the Hessian to determine the parameterization of the interpolating curve in the variable-space and, hence, the generalized updating formula. In this paper, we investigate new parameterization techniques to the approximate Hessian, in an attempt to determine a better Hessian approximation at each iteration and, thus, improve the numerical performance of such algorithms.
Wavelets, Gaussian mixtures and Wiener filtering
Authors: Albert Bijaoui
Venue: Signal Processing (2002)

In this short communication a non-linear Wiener filtering is obtained from a Bayesian approach of the probability density function modelled as a Gaussian mixture. Its application on the wavelet denoising leads to excellent results.
Netobjects Fusion 2 Design Guide, 10th edition
Authors: Dan Shafer, Ed Smith
Venue:  (1997)

:Shows Web designers and graphics artists how to create award-winning Web pages and Web sites without HTML coding by using NetObjects Fusion2. Offers built-in Web templates that give sites a consistent look and navigational feel with no HTML, scripti Includes exclusive coverage of the latest version, highlighting new features and bug fixes. Only source that provides 16 pages of full color examples of consistent, well-structured, and manageable Web sites. Lists "inside design tips" and shortcuts that make NetObjects Fusion 2 even more powerful and easier to use. Features a demo of NetObjects Fusion 2 for readers to sample before purchase. Provides author-prepared layouts in addition to the library of pre-designed pages discussed in the book and those included with NetObjects Fusion 2. Includes a range of add-on components, pre-designed database forms, and other modules that snap into Web pages whether or not NetObjects Fusion 2 is used.
Organisational trails through software systems
Authors: Claire Knight, Malcolm Munro
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

The use of three dimensional software visualisation techniques has the power to transform the way that tacit knowledge gathering and retrieval takes place during many software maintenance activities. The focus of this work is the understanding and management of software from various perspectives and therefore it is the visualisation of these software artefacts that is of greatest interest. This work moves towards providing a generic visualisation that is applicable to the management of many software systems within the bounds of the organisation, with the ability to view various artefacts over time (and thus their evolution) and also to incorporate lower level visualisations in three dimensions.
Symmetric Crossbar Arbiters for VLSI Communication Switches
Authors: Y. Tamir, H. C. Chi
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The design and implementation of symmetric crossbar arbiters are addressed. Severalarbiter designs are compared based on simulations of a multistage interconnectionnetwork. These simulations demonstrate the influence of the switch arbitration policy onnetwork throughput, average latency, and worst-case latency. It is shown that somenatural designs result in poor system performance and/or slow implementations. Twoefficient arbiter implementations are proposed. Based on network simulations, VLSIimplementation, and circuit simulation, it is shown that these arbiters achieve nearlyoptimal system performance without becoming the critical path that limits the systemclock.
A search-based bump-and-refit approach to incremental routing for ECO applications in FPGAs
Authors: Vinay Verma, Shantanu Dutt
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Incremental physical CAD is encountered frequently in the so-called engineering change order (ECO) process in which design changes are made typically late in the design process in order to correct logical and/or technological problems in the circuit. As far as routing is concerned, in order to capitalize on the enormous resources and time already spent on routing the circuit, and to meet time-to-market requirements, it is desirable to re-route only the ECO-affected portion of the circuit, while minimizing any routing changes in the much larger unaffected part of the circuit. Incremental re-routing also needs to be fast and to effectively use available routing resources. In this paper, we develop a complete incremental routing methodology for FPGAs using a novel approach called bump and refit (B&R); B&R was initially proposed in [4] in the much simpler context of extending some nets by a segment (for the purpose of fault tolerance) for FPGAs with simple i-to-i switchboxes. Here we significantly extend this concept to global and detailed incremental routing for FPGAs with complex switchboxes such as those in Lucent's ORCA and Xilinx's Virtex series. We also introduce new concepts such as B&R cost estimation during global routing, and determination of the optimal subnet set to bump for each bumped net, which we obtain using an efficient dynamic programming formulation. The basic B&R idea in our algorithms is to re-arrange some portions of some existing nets on other tracks within their current channels to find valid routings for the incrementally changed circuit without requiring any extra routing resources (i.e., completely unused tracks), and with little effect on the electrical properties of existing nets.We have developed optimal and near-optimal algorithms (called Subsec_B&R and Subnet_B&R, respectively) to find incremental routing solutions using the B&R paradigm in complex FPGAs. We implemented these algorithms for Lucent's ORCA-2C FPGA, and compared our algorithms to two recent incremental routing techniques, Standard and Rip-up&Reroute, and to Lucent's A_PAR routing tool. Experimental results show that our incremental routers perform very well for ECO applications. Firstly, B&R is 10 to 20 times faster than complete re-routing using A_PAR. Further, the B&R incremental routers are nearly 27% faster and the new nets have nearly 10% smaller lengths than in previous incremental techniques. Also, the B&R routers do not change either the lengths or topologies of existing nets, a significant advantage in ECO applications, in contrast to Rip-up&Reroute which increases the length of ripped up nets by an average of 8.75% to 13.6%.