ppxscal/embedding_network huggingface dataset:
Limits on Super-Resolution and How to Break Them
Authors: Simon Baker, Takeo Kanade
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Nearly all super-resolution algorithms are based on the fundamental constraints that the super-resolution image should generate the low resolution input images when appropriately warped and down-sampled to model the image formation process. (These reconstruction constraints are normally combined with some form of smoothness prior to regularize their solution.) In the first part of this paper, we derive a sequence of analytical results which show that the reconstruction constraints provide less and less useful information as the magnification factor increases. We also validate these results empirically and show that, for large enough magnification factors, any smoothness prior leads to overly smooth results with very little high-frequency content (however, many low resolution input images are used). In the second part of this paper, we propose a super-resolution algorithm that uses a different kind of constraint, in addition to the reconstruction constraints. The algorithm attempts to recognize local features in the low-resolution images and then enhances their resolution in an appropriate manner. We call such a super-resolution algorithm a hallucination or recogstruction algorithm. We tried our hallucination algorithm on two different data sets, frontal images of faces and printed Roman text. We obtained significantly better results than existing reconstruction-based algorithms, both qualitatively and in terms of RMS pixel error.
Perfect simulation for Reed-Frost epidemic models
Authors: Philip D. O'Neill
Venue: Statistics and Computing (2003)

The Reed-Frost epidemic model is a simple stochastic process with parameter q that describes the spread of an infectious disease among a closed population. Given data on the final outcome of an epidemic, it is possible to perform Bayesian inference for q using a simple Gibbs sampler algorithm. In this paper it is illustrated that by choosing latent variables appropriately, certain monotonicity properties hold which facilitate the use of a perfect simulation algorithm. The methods are applied to real data.
Depth and Image Recovery Using a MRF Model
Authors: S. Kapoor, P. Y. Mundkur, U. B. Desai
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper deals with the problem of depth recovery and image restoration from sparse and noisy image data. The image is modeled as a Markov random field and a new energy function is developed to effectively detect discontinuities in highly sparse and noisy images. The model provides an alternative to the use of a line process. Interpolation over missing data sites is first done using local characteristics to obtain initial estimates and then simulated annealing is used to compute the maximum a posteriori (MAP) estimate. A threshold on energy reduction per iteration is used to speed up simulated annealing by avoiding computation that contributes little to the energy minimization. Moreover, a minor modification of the posterior energy function gives improved results for random as well as structured sparsing problems. Results of simulations carried out on real range and intensity images along with details of the simulations are presented.
A methodology for the design of application specific instruction set processors (ASIP) using the machine description language LISA
Authors: Andreas Hoffmann, Oliver Schliebusch, Achim Nohl, Gunnar Braun, Oliver Wahlen, Heinrich Meyr
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

The development of application specific instruction set processors (ASIP) is currently the exclusive domain of the semiconductor houses and core vendors. This is due to the fact that building such an architecture is a difficult task that requires expertise knowledge in different domains: application software development tools, processor hardware implementation, and system integration and verification. This paper presents a retargetable framework for ASIP design which is based on machine descriptions in the LISA language. From that, software development tools can be automatically generated including HLL C-compiler, assembler, linker, simulator and debugger frontend. Moreover, synthesizable HDL code can be derived which can then be processed by standard synthesis tools. Implementation results for a low-power ASIP for DVB-T acquisition and tracking algorithms designed with the presented methodology will be given.
Embedded Software-Based Self-Test for Programmable Core-Based Designs
Authors: Angela Krstic, Wei-Cheng Lai, Kwang-Ting Cheng, Li Chen, Sujit Dey
Venue: IEEE Design Test (2002)

The programmable cores on SoCs can perform on-chip test generation, measurement, response analysis, and even diagnosis. This software-based approach to self-testing enables at speed testing and incurs low DFT overhead. With the growing popularity of system-on-a-chip (SoC) architectures, demands for short time to market and rich functionality have driven design houses to adopt a new core-based So design flow. Core-based SoC incorporates multiple complex, heterogeneouscomponents on a single piece of silicon; these can include digital, analog, mixed signal, RF, micromechanical, and otherkindsofsystems.Thisblurring of the boundaries between different types of devices, together with rapidly increasing operational frequencies and shrinking feature sizes, has introduced a whole new set of testing challenges. The programmable cores on SoCs can perform on-chip test generation, measurement, response analysis, and even diagnosis. This software-based approach to self-testing enables at-speed testing and incurs low DFT overhead.
Coding of 3D virtual objects with NURBS
Authors: Diego Santa-Cruz, Touradj Ebrahimi
Venue: Signal Processing (2002)

With the advancement of computer graphics in the recent years, an increasing number of pictures, video and 3D content is generated by synthesis processing rather than acquired with capture devices such as cameras or scanners. Several techniques have been developed for compression of discrete (i.e. piece-wise planar) 3D models, in the form of 3D polygonal meshes. However, no important attempt has been made to compress the smooth surfaces of artificially generated 3D models, that are most often represented as parametric surfaces, of which Non-Uniform Rational B-Spline (NURBS) is a popular form. This paper presents a method for compressing NURBS 3D models with a small and controllable loss. The scheme uses a differential pulse coded modulation coder with different predictors for knot values and control points, coupled with a uniform scalar quantizer, followed by a bitplane arithmetic entropy coder. The multiplicity of knots is preserved by the use of a multiplicity map. The rate-distortion characteristics of the proposed scheme are evaluated on various models. When compared to MPEG-4 (ISO/IEC 14496-2:1999: information technology--coding of andio-visual objects--Part 2: Visual, December 1999; ISO/IEC 14496-2:1999/Amd 1:2000: visual extensions, August 2000) and Touma-Gotsman (Proceedings of the 24th Conference on Graphics Interface (GI-98), Morgan Kaufmann, Los Altos, CA, San Francisco, CA, June 1998, pp. 26-34) compressed triangular meshes, the proposed scheme achieves more than five times better compression, for equivalent L2 error and much better visual quality.
Evolution mechanism of reactive system programs
Authors: Noriaki Yoshiura
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

Reactive system, such as operating systems or elevator control systems, is a system which ideally never terminates and is intended to maintain some interaction with its environment. There are some researches of synthesis reactive system programs from specifications described in formal languages such as temporal logic. The synthesis methods proposed in these researches synthesize several reactive system programs from one specification. It becomes a problem how to choose a good reactive system program among several programs synthesized from one specification. However, which reactive system is good depends on the behaviors of the environment. That is, we can not decide which reactive system program is good until it interacts the environment. Thus, it is desirable that a reactive system program should evolve itself according to the behavior of the environment. In this paper, we propose an idea of reactive system program evolution.
On the number of edges in graphs with a given weakly connected domination number
Authors: Laura A. Sanchis
Venue: Discrete Mathematics (2002)

A dominating set for a graph G = (V, E) is a subset of vertices V' ⊆ V such that for all υ ∈ V - V' there exists some u ∈ V' adjacent to υ. The domination number of G, denoted by λ(G), is the size of its smallest dominating set. A dominating set is weakly connected if the edges not incident on any vertices of the dominating set do not separate the graph (Discrete Math. 167-168 (1997) 261). The weakly connected domination number of G is the size of its smallest weakly connected dominating set. We show in this paper that the maximum number of edges that a graph with n vertices and weakly connected domination number equal to d ≥ 3 can have is (n-d-12). We also characterize the extremal graphs attaining this bound.
Stability Criteria for Finite Difference Approximations to Parabolic Systems&mdash;An Update
Authors: Moshe Goldberg, Anna Pidgirnyak
Venue: Journal of Scientific Computing (2002)

In a recent series of papers, Goldberg &lsqb;G1, G2&rsqb; and Sun and Yuan &lsqb;SY&rsqb; studied the L2-stability of a well-known family of finite difference approximations for the initial-value problem associated with the multispace-dimensional parabolic system \frac{\partial{\bf u}({\bf x}, t)}{\partial t}=\sum_{1 \le p \le q \le s} \, A_{pq} \, \frac{\partial^2 {\bf u}({\bf x}, t)}{\partial x_p \partial x_q}+\sum_{1 \le p \le s} \, B_p \, \frac{\partial {\bf u}({\bf x}, t)}{\partial x_p}+C{\bf u}({\bf x}, t) where Apq,Bp and C are constant matrices, Apq being Hermitian. In the present paper we discuss these earlier results and complete the underlying theory by answering four open questions.
A Graphical Query Language: VISUAL and Its Query Processing
Authors: Nevzat Hurkan Balkir, Gultekin Ozsoyoglu, Z. Meral Ozsoyoglu
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

This paper describes VISUAL, a graphical icon-based query language with a user-friendly graphical user interface for scientific databases and its query processing techniques. VISUAL is suitable for domains where visualization of the relationships is important for the domain scientist to express queries. In VISUAL, graphical objects are not tied to the underlying formalism; instead, they represent the relationships of the application domain. VISUAL supports relational, nested, and object-oriented models naturally and has formal basis. For ease of understanding and for efficiency reasons, two VISUAL semantics are introduced, namely, the interpretation and execution semantics. Translations from VISUAL to the Object Query Language (for portability considerations) and to an object algebra (for query processing purposes) are presented. Concepts of external and internal queries are developed as modularization tools.
Production, Growth and Business Cycles: Technical Appendix
Authors: Robert G. King, Charles I. Plosser, Sergio T. Rebelo
Venue: Computational Economics (2002)

The methods used in our two survey papers on real business cycles (King, Plosser and Rebelo, 1988a,b) are detailed in this document. Our presentation of the basic neoclassical model of growth and business cycles is broken into three parts. First, we describe the model and its steady state, discussing: the structure of the environment including government policy rules; the nature of optimal individual decisions and the dynamic competitive equilibrium; technical restrictions to insure steady state growth; comparable restrictions on preferences and policy rules; stationary levels and ratios in the steady state; and the nature of a transformed economy. Second, we detail methods for studying near steady-state dynamics, considering: the linear approximation approach; the rational expectations solution algorithm; the nature of alternative solutions; and the special case of the fixed labor model. Third, we discuss the computation of simulations, moments and impulse responses. The objective of this appendix is to provide a detailed analysis of a neoclassical economy that is sufficiently flexible to permit: (a) exogenous steady state growth; (b) distorting tax rules of various sorts; and (c) time varying government spending. Although we do not focus on all of these issues in the present discussion, other investigations in progress will utilize this framework. The appendix is divided into three main parts. Part A describes the artificial economy under study and analyses its steady state, Part B develops methods to study approximate dynamics around the steady state, and Part C derives a set of formulas for generating population moments. This technical appendix is designed to serve two functions. First, it develops the theoretical material in Sections 2 and 3 of the main text in more depths. Second, it serves as a detailed guide to PC-MATLAB programs for computing dynamic equilibria, written by King and Rebelo in the Spring of 1987. Notation in programs and the technical appendix has been detailed as closely as feasible.
Semantic Data Broadcast for a Mobile Environment Based on Dynamic and Adaptive Chunking
Authors: Ken C. K. Lee, Hong Va Leong, Antonio Si
Venue: IEEE Transactions on Computers (2002)

Database broadcast is an effective and scalable approach to disseminate information of high affinity to a large collection of mobile clients. A common problem of existing broadcast approaches is the lack of knowledge for a client to determine if all data items satisfying its query could be obtained from the broadcast. We therefore propose a semantic-based broadcast approach. A semantic descriptor is attached to each broadcast unit, called a data chunk. This semantic descriptor allows a client to determine if a query can be answered entirely based on broadcast items and, if needed, identify the precise definition of the remaining items in the form of a ¿supplementary¿ query. Data chunks can be of static or dynamic sizes and organized hierarchically. Their boundary can be determined on-the-fly, adaptive to the nature of client queries. We investigate different ways of organizing the data chunks over a broadcast channel to improve access performance. We introduce the data affinity index metric, which more accurately reflects client-perceived performance. A simulation model is built to evaluate our semantic-based broadcast schemes.
Avoiding the Legal Mire
Authors: Colm MacKernan
Venue: IEEE Micro (1998)

Most joint or multilateral standards start when acquaintances in a particular business, but working for different companies, meet one another, perhaps by design, perhaps by accident -- say, in a cocktail bar at some convention -- and start to discuss a mutual problem or issue. Usually all are at least vaguely acquainted with the research that each other's company is up to. Someone suggests that it might be a good thing if a standard were to be agreed for some device. Maybe some general ideas are sketched out on the back of a napkin. Then everyone goes home, and talks with management. Some e-mail flits about, the idea comes to be taken more seriously, and someone in management decides that pursuing a standard would be a good thing. This is when the legal problems start.
Interpreting the performance of HPF/Fortran 90D
Authors: Manish Parashar, Salim Hariri, Tomasz Haupt, Geoffrey C. Fox
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

In this paper we present a novel interpretive approach for accurate and cost-effective performance prediction in a high performance computing environment, and describe the design of a source-driven HPF/Fortran 90D performance prediction framework based on this approach. The performance prediction framework has been implemented as part of a HPF/Fortran 90D application development environment. A set of benchmarking kernels and application codes are used to validate the accuracy, utility, usability, and cost-effectiveness of the performance prediction framework. The use of the framework for selecting appropriate compiler directives and for application performance debugging is demonstrated.
Constructing Applications from Reusable Components
Authors: Werner Staringer
Venue: IEEE Software (1994)

By integrating commercial off-the-shelf software, reusable components from other projects, and custom-developed code, the author quickly and cheaply created a flexible and extensible financial risk-management application. He also found that the Nextstep operating system lets users play a more active role in design and development and fosters reuse.
The Gamma Database Machine Project
Authors: D. J. Dewitt, S. Ghandeharizadeh, D. A. Schneider, A. Bricker, H. -I. Hsiao, R. Rasmussen
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

The design of the Gamma database machine and the techniques employed in its implementation are described. Gamma is a relational database machine currently operating on an Intel iPSC/2 hypercube with 32 processors and 32 disk drives. Gamma employs three key technical ideas which enable the architecture to be scaled to hundreds of processors. First, all relations are horizontally partitioned across multiple disk drives, enabling relations to be scanned in parallel. Second, parallel algorithms based on hashing are used to implement the complex relational operators, such as join and aggregate functions. Third, dataflow scheduling techniques are used to coordinate multioperator queries. By using these techniques, it is possible to control the execution of very complex queries with minimal coordination. The design of the Gamma software is described and a thorough performance evaluation of the iPSC/s hypercube version of Gamma is presented.
Copyrights and Author Responsibilities
Authors: Harold S. Stone
Venue: Computer (1992)

The issues associated with the reuse of copyrighted material are discussed by examining a number of case studies. The concepts of exclusive rights and fair use of copyright-protected material are described. An author's reuse of his or her own copyright-protected material, duplicate submissions, and simultaneous submissions are also discussed. The ways in which the engineering profession deals with plagiarism are reviewed.
On the circle closest to a set of points
Authors: Zvi Drezner, Stefan Steiner, George O. Wesolowsky
Venue: Computers and Operations Research (2002)

The objective of this paper is to find a circle whose circumference is as close as possible to a given set of points. Three objectives are considered: minimizing the sum of squares of distances, minimizing the maximum distance, and minimizing the sum of distances. We prove that these problems are equivalent to minimizing the variance, minimizing the range, and minimizing the mean absolute deviation, respectively. These problems are formulated and heuristically solved as mathematical programs. Special efficient heuristic algorithms are designed for two cases: the sum of squares, and the minimax. Computational experience is reported.
RTL-Based Functional Test Generation for High Defects Coverage in Digital Systems
Authors: M. B. Santos, F. M. Gonçalves, I. C. Teixeira, J. P. Teixeira
Venue: Journal of Electronic Testing: Theory and Applications (2001)

Functional test has long been viewed as unfitted for high-quality production test. The purpose of this paper is to propose a RTL-based test generation methodology which can rewardingly be used both for design validation and to enhance the test effectiveness of classic, gate-level test generation. The proposed methodology leads to high Defects Coverage (DC) and to relatively short test sequences, thus allowing low-energy operation in test mode. The test effectiveness, regarding DC, is shown to be weakly dependent on the structural implementation of the behavioral description. The usefulness of the methodology is ascertained using the VeriDOS simulation environment and the CMUDSP and Torch ITC'99 benchmark circuits.
A speed-up for the commute between subword trees and DAWGs
Authors: Alberto Apostolico, Stefano Lonardi
Venue: Information Processing Letters (2002)

A popular way to describe and build the DAWG or Directed Acyclic Word Graph of a string is by transformation of the corresponding subword tree. This transformation, which is not difficult to reverse, is easy to grasp and almost trivial to implement except for the assumed implication of a standard tree isomorphism algorithm. Here we point out a simple property of subword trees that makes checking tree isomorphism in this context a straightforward process, thereby simplifying the transformation significantly. Subword trees and DAWGs arise rather ubiquitously in applications of string processing, where they often play complementary roles. Efficient conversions are thus especially desirable.
Classes extraction from procedural programs
Authors: H. B&#x00E9;a&#x00EF;d Ajroud, A. Jaoua, S. Kaabi
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

We analyse the relation between users' functions and global variables of procedural program. We apply rectangular decomposition in order to find the coverage. The paper shows how we extract classes from this coverage by using some defined rules. Thus, the proposed approach is a tool that can be used in re-engineering of old programs because it helps the programmer in transforming the program such as it obeys object oriented principles.
Algorithms for Distributed Query Processing in Broadcast Local Area Networks
Authors: W. Perrizo, J. Y. Y. Lin, W. Hoffman
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

Distributed query-processing algorithms for broadcast local-area networks are described which provide execution strategies and estimates of response time. Four semijoin-specific techniques, five transmission-specific techniques, and three size estimation update functions are incorporated into a baseline algorithm. These variants of the baseline algorithm are simulated and their response times compared using randomly generated data. The technique found to be most beneficial, on the average, for general queries involving multiple joining attributes is the composite semijoining technique. When used in combination with composite semijoining, relation transmission and bit-matrix transmission further reduce response time. Bit-matrix transmission is a data compression technique in which single attributes and a bit matrix of the value pairings are sent in place of a composite attribute. The authors examine these techniques in detail and compare their expected response times.
Viper: A Multiprocessor SOC for Advanced Set-Top Box and Digital TV Systems
Authors: Santanu Dutta, Rune Jensen, Alf Rieckmann
Venue: IEEE Design Test (2001)

Viper is a complete system-on-a-chip solution from Philips Semiconductors for next-generation digital television and digital video applications. It incorporates Philips' intellectual-property reuse methodology in addition to standard hardware and software building blocks.
The high performance computing and communications (HPCC) program: technologies for the national information infrastructure
Authors: Donald A. B. Lindberg
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The Federal HPCC Program is a 10-agency billion dollar per year effort to accelerate the development of high performance computing and communications technologies and the diffusion of these technologies to improve U.S. competitiveness and the well-being of citizens.