ppxscal/embedding_network huggingface dataset:
Digital Camera System on a Chip
Authors: Eric R. Fossum
Venue: IEEE Micro (1998)

Since the early 1990s, there has been an explosion of activity in the area of CMOS image sensors. Up until recently, the dominant and nearly only solid-state image sensor technology was the charge-coupled device (CCD). However, most microprocessors, logic circuits, ASICs (application-specific integrated circuits) and memory circuits are based on CMOS technology. Now it appears that CMOS will be used for image sensors in a rapidly expanding sphere of applications. Several important factors have contributed to the emergence of CMOS image sensors at this time rather than 10-20 years ago. The primary factor is a recent demand by customers for portable, low power, miniaturized digital imaging systems. A second important factor is that present-day CMOS offers submicron feature sizes and low defect and contamination levels, respectively permitting cost-effective pixel sizes and low junction leakage (or dark) current. In addition, threshold voltage control and uniformity is stable and reproducible. The third important factor is that new circuit techniques have been invented or have been adopted from CCD signal processing that permit both low noise and high-dynamic-range imaging that is competitive with the best CCDs. This includes the development of the active pixel sensor technology and column-parallel signal processing circuits for temporal and fixed-pattern noise reduction. In this article, we review CMOS image sensor technology basics, look at the state of the art, and try to examine where the technology may be leading us.
Naive Semantics to Support Automated Database Design
Authors: V. C. Storey, R. C. Goldstein, H. Ullrich
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Research devoted to developing knowledge-based tools for database design has demonstrated that it is possible to encode a great deal of process knowledge about database design in a (knowledge-based) computer program. However, experience with these tools shows that the contribution of an expert human designer extends beyond his or her knowledge of database design techniques. This paper discusses the application of an approach, called Naive Semantics (NS), to simulate the contributions made to a design based on the designer's general knowledge. Naive semantics involves the use of an extensible store of generally understood knowledge about the world. This paper describes the types of information that could be included in a Naive Semantics knowledge base and how that knowledge might be applied to increase the effectiveness of automated database design systems. Results of various implementations of ontologies based on Naive Semantics are discussed.
Multidimensional signal compression using multiscale recurrent patterns
Authors: Murilo B. de Carvalho, Eduardo A. B. da Silva, Weiler Alves Finamore
Venue: Signal Processing (2002)

In this paper we propose a new multidimensional signal lossy compression method based on multiscale recurrent patterns, referred to as multidimensional multiscale parser (MMP). In it, a multidimensional signal is recursively segmented into variable-length vectors, and each segment is encoded using expansions and contractions of vectors in a dictionary. The dictionary is updated while the data is being encoded, using concatenations of expanded and contracted versions of previously encoded vectors. The only data encoded are the segmentation tree and the indexes of the vectors in the dictionary, and therefore no side information is necessary for the dictionary updating. The signal segmentation is carried out through a rate-distortion optimization procedure. A two-dimensional version of the MMP algorithm was implemented and tested with several kinds of image data. We have observed that the proposed dictionary updating procedure is effective in adapting the algorithm to a large variety of image content, lending to it a universal flavor. For text and graphics images, it outperforms the state-of-the-art SPIHT algorithm by more that 3 dB at 0.5 opp, while for mixed document images, containing text, graphics and gray-scale images, by more than 1.5 dB at the same rate. Due to the way the images are segmented, they appear slightly blocky at low rates. We have alleviated this problem by proposing an effective way of reducing the blockiness in the reconstructed image, with no penalty in signal-to-noise ratio performance in most cases. We conclude the paper with a theoretical analysis of the approximate matching of Gaussian vectors using scales, which gives a justification of why approximate multiscale matching is a good option, specially at low rates.
A comparison of current computer analysis methods for seismic performance of reinforced concrete members
Authors: William F. Cofer, Yi Zhang, David I. McLean
Venue: Finite Elements in Analysis and Design (2002)

In this paper, an evaluation of current capabilities in the area of cyclic analysis of reinforced concrete components is presented through the application of several analysis methods to a benchmark problem. Data from experimental tests involving the flexural and shear performance of a reinforced concrete column was used for comparison. Analyses for cyclic and monotonic load cases were performed using a degrading plastic hinge model, a fiber beam model, and a three-dimensional finite element model. Details of the data preparation and analysis results are presented and evaluated. Recommendations are made regarding the relative effectiveness of the methods for practical dynamic analysis.
Face Recognition for Smart Environments
Authors: Alex (Sandy) Pentland, Tanzeem Choudhury
Venue: Computer (2000)

Smart environments, wearable computers, and ubiquitous computing in general are the coming "fourth generation" of computing and information technology. But that technology will be a stillbirth without new interfaces for interaction, minus a keyboard or mouse. To win wide consumer acceptance, these interactions must be friendly and personalized; the next-generation interfaces must recognize people in their immediate environment and, at a minimum, know who they are. In this article, the authors discuss face recognition technology, how it works, problems to be overcome, current technologies, and future developments and possible applications. Twenty years ago, the problem of face recognition was considered among the most difficult in artificial intelligence and computer vision. Today, however, there are several companies that sell commercial face recognition software that is capable of high-accuracy recognition with databases of more than 1,000 people. The authors describe the face recognition technology used, explaining the algorithms for face recognition as well as novel applications, such as behavior monitoring that assesses emotions based on facial expressions.
Image-based surface modeling: a multi-resolution approach
Authors: Augusto Sarti, Stefano Tubaro
Venue: Signal Processing (2002)

In this article we propose a general and robust technique for modeling surfaces through the analysis of multiple image acquisitions. Our method is based on the minimization of the multi-view texture mismatch and is inherently multi-resolution, as the surface is obtained through a progressive refinement of hierarchical radial basis functions.
Total embedding distributions for bouquets of circles
Authors: Jin Ho Kwak, Sang Ho Shim
Venue: Discrete Mathematics (2002)

Crosscap-number distributions, the distribution of graph embeddings into nonorientable surfaces, have been known for only a few cases. Chen et al. (Discrete Math. 128 (1994) 73) calculated the crosscap-number distribution of necklaces, closed-end ladders and cobblestone paths. In this paper, we compute the total genus polynomials and the total embedding polynomials of bouquets of circles with an aid of edge-attaching surgery technique. It extends their genus distributions computed by Gross et al. (J. Combin. Theory (B) 47 (1989) 292). The same work is also done for dipoles.
Implementing Streaming SIMD Extensions on the Pentium III Processor
Authors: Srinivas K. Raman, Vladimir Pentkovski, Jagannath Keshava
Venue: IEEE Micro (2000)

The SSE provides a rich set of instructions to meet the requirements of demanding multimedia and Internet applications. In implementing the SSE, the Pentium III developers made a number of design trade-offs to satisfy tight die size constraints and attain frequency goals.
Boosting the Performance of Shared Memory Multiprocessors
Authors: Per Stenström, Mats Brorsson, Fredrik Dahlgren, Håkan Grahn, Michel Dubois
Venue: Computer (1997)

Shared memory multiprocessors make it practical to convert sequential programs to parallel ones in a variety of applications. An emerging class of shared memory multiprocessors are nonuniform memory access machines with private caches and a cache coherence protocol. Proposed hardware optimizations to CC-NUMA machines can shorten the time processors lose because of cache misses and invalidations. The authors look at cost-performance trade-offs for each of four proposed optimizations: release consistency, adaptive sequential prefetching, migratory sharing detection, and hybrid update/invalidate with a write cache. The four optimizations differ with respect to which application features they attack, what hardware resources they require, and what constraints they impose on the application software. The authors measured the degree of performance improvement using the four optimizations in isolation and in combination, looking at the trade-offs in hardware and programming complexities. Although one combination of the proposed optimizations (prefetching and migratory sharing detection) can boost a sequentially consistent machine to perform as well as a machine with release consistency, release consistency models offer significant performance improvements across a broad application domain at little extra complexity in the machine design. Moreover, a combination of sequential prefetching and hybrid update/invalidate with a write cache cuts the execution time of a sequentially consistent machine by half with fairly modest changes to the second-level cache and the cache protocol. The authors expect that designers will begin to turn more to the release consistency model.
Measuring Software Quality: A Case Study
Authors: Thomas Drake
Venue: Computer (1996)

Over the years, the National Security Agency has become extremely dependent on the software that makes up its information technology infrastructure. NSA has come to view software as a critical resource upon which much of the world's security, prosperity, and economic competitiveness increasingly rest. If anything, dependence on software and its corresponding effect on national security makes it imperative for NSA to accept and maintain only the highest quality software. Cost overruns or software systems that are defective or of low quality can impose a significant burden on national security and NSA's mission. NSA is no more immune than the rest of the software industry to the problems of low-quality software. Software development is intensely manual in nature, and it inevitably falls victim to rushed schedules, constantly changing requirements, poor process, and failure to adhere to software engineering practices. So what is NSA doing about software quality? The NSA's Software Engineering Applied Technology Center has done metrics analysis on some 25 million lines of code. The result is a highly correlated set of measures that we have developed into a streamlined set of code-level release criteria that we apply to code written at NSA organizations. The author describes these critical measures and has drawn up a case study to illustrate the benefits of applied quality assurance and code-level measurement activities.
Shape from Shading with a Linear Triangular Element Surface Model
Authors: K. M. Lee, C. C. J. Kuo
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The authors propose to combine a triangular element surface model with a linearized reflectance map to formulate the shape-from-shading problem. The main idea is to approximate a smooth surface by the union of triangular surface patches called triangular elements and express the approximating surface as a linear combination of a set of nodal basis functions. Since the surface normal of a triangular element is uniquely determined by the heights of its three vertices (or nodes), image brightness can be directly related to nodal heights using the linearized reflectance map. The surface height can then be determined by minimizing a quadratic cost functional corresponding to the squares of brightness errors and solved effectively with the multigrid computational technique. The proposed method does not require any integrability constraint or artificial assumptions on boundary conditions. Simulation results for synthetic and real images are presented to illustrate the performance and efficiency of the method.
On the nonlinear diamond operator related to the wave equation
Authors: G. Sritanratana, A. Kananthai
Venue: Nonlinear Analysis: Real World Applications (2002)

In this paper, we study the solution of nonlinear equation ku(x)= f(x, Δk-1ku(x)) where k is the Diamond operator iterated k times and is defined by k = ((Σi=1p ∂2∂xi2)2 - (Σj=p+1p+q ∂2∂xj2)2)k or the operator k can be expressed by k = kΔk = Δkk. The operators Δk and k are Laplacian and the ultrahyperbolic operator iterated k times, defined by k =(∂2∂x12 + ∂2∂x22+...+ ∂2∂xp2 - ∂2∂xp+12 - ∂2/∂xp+22 - ... - ∂2/∂xp+q2)k and Δk = (∂2/∂x12 + ∂2/∂x22+...+ ∂2/∂xn2)k, p + q = nis the dimension of the n-dimensional Euclidean space Rn, x=(xl,x2, ...,xn,,) ∈ Rn, k is a nonnegative integer, u(x) is an unknown and f is a given function. It is found that, the existence of the solution u(x) of such equation depending on the conditions of f and Δk-1ku(x) and moreover such solution u(x) related to the wave equation depending on the conditions of p, q and k.
An Analysis of a Reliability Model for Repairable Fault-Tolerant Systems
Authors: M. Balakrishnan, C. S. Raghavendra
Venue: IEEE Transactions on Computers (1993)

The ARIES reliability model, which models a class of repairable and nonrepairable fault-tolerant systems by a continuous-time Markov chain and uses the Lagrange-Sylvester interpolation formula to directly compute the exponential of the state transition rate matrix (STRM) that appears in the solution of the Markov chain, is discussed. The properties of the STRM for ARIES repairable systems are analyzed. Well-established results in matrix theory are used to find an efficient solution for reliability computation when the eigenvalues of the STRM are distinct. A class of systems that ARIES models for which the solution technique is inapplicable is identified. Several transformations which are known to be numerically stable are used in the solution method. The solution method also offers a facility for incrementally computing reliability when the number of spares in the fault-tolerant system is increased by one.
DAISY: a simulation-based high-level synthesis tool for &Delta;&Sigma; modulators
Authors: K. Francken, P. Vancorenland, G. Gielen
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

An integrated tool called DAISY (Delta-Sigma Analysis and Synthesis) is presented for the high-level synthesis of &Delta;&Sigma; modulators. The approach determines both the optimum modulator topology and the required building block specifications, such that the system specifications -- mainly accuracy and signal bandwidth -- are satisfied at the lowest possible power consumption. A genetic-based differential evolution algorithm is used in combination with a fast dedicated behavioral simulator that includes the major nonidealities of the building blocks to realistically analyze and optimize the modulator performance. Experimental results illustrate the effectiveness of the approach. Also, an overview of optimized topologies as a function of the modulator specifications for a wide range of values shows the capabilities and performance range covered by the tool.
Spatial Databases-Accomplishments and Research Needs
Authors: Shashi Shekhar, Sanjay Chawla, Siva Ravada, Andrew Fetterer, Xuan Liu, Chang-tien Lu
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Spatial databases, addressing the growing data management and analysis needs of spatial applications such as Geographic Information Systems, have been an active area of research for more than two decades. This research has produced a taxonomy of models for space, spatial data types and operators, spatial query languages and processing strategies, as well as spatial indexes and clustering techniques. However, more research is needed to improve support for network and field data, as well as query processing (e.g., cost models, bulk load). Another important need is to apply spatial data management accomplishments to newer applications, such as data warehouses and multimedia information systems. The objective of this paper is to identify recent accomplishments and associated research needs of the near term.
The Cost of Recovery in Message Logging Protocols
Authors: Sriram Rao, Lorenzo Alvisi, Harrick M. Vin
Venue: IEEE Transactions on Knowledge and Data Engineering (2000)

Past research in message logging has focused on studying the relative overhead imposed by pessimistic, optimistic, and causal protocols during failure-free executions. In this paper, we give the first experimental evaluation of the performance of these protocols during recovery. Our results suggest that applications face a complex trade-off when choosing a message logging protocol for fault tolerance. On the one hand, optimistic protocols can provide fast failure-free execution and good performance during recovery, but are complex to implement and can create orphan processes. On the other hand, orphan-free protocols either risk being slow during recovery, e.g., sender-based pessimistic and causal protocols, or incur a substantial overhead during failure-free execution, e.g., receiver-based pessimistic protocols. To address this trade-off, we propose hybrid logging protocols, a new class of orphan-free protocols. We show that hybrid protocols perform within two percent of causal logging during failure-free execution and within two percent of receiver-based logging during recovery.
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
Authors: Yu-Chee Tseng, Shu-Hui Chang, Jang-Ping Sheu
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

The star graph interconnection network has been recognized as an attractive alternative to the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian cycle. In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe¿n¿ 3 faulty links, a Hamiltonian cycle still can be found in an n-star, and that with fv¿n¿ 3 faulty nodes, a ring containing at most 4fv nodes less than that in a Hamiltonian cycle can be found (i.e., the ring contains at least n! ¿ 4fv nodes). In general, in an n-star with fe faulty links and fv faulty nodes, where fe + fv¿n¿ 3, our embedding is able to establish a ring containing at least n! ¿ 4fv nodes.
Performance Analysis Integration in the Uintah Software Development Cycle
Authors: J. Davison De St. Germain, Alan Morris, Steven G. Parker, Allen D. Malony, Sameer Shende
Venue: International Journal of Parallel Programming (2003)

The increasing complexity of high-performance computing environments and programming methodologies presents challenges for empirical performance evaluation. Evolving parallel and distributed systems require performance technology that can be flexibly configured to observe different events and associated performance data of interest. It must also be possible to integrate performance evaluation techniques with the programming paradigms and software engineering methods. This is particularly important for tracking performance on parallel software projects involving many code teams over many stages of development. This paper describes the integration of the TAU and XPARE tools in the Uintah Computational Framework (UCF). Discussed is the use of performance mapping techniques to associate low-level performance data to higher levels of abstraction in UCF and the use of performance regression testing to provide a historical portfolio of the evolution of application performance. A scalability study shows the benefits of integrating performance technology in building large-scale parallel applications.
VHDL as Input for High-Level Synthesis
Authors: R. Camposano, L. F. Saunders, R. M. Tabet
Venue: IEEE Design Test (1991)

High-level synthesis is defined, and the feasibility of high-level synthesis from a behavioral, sequential description in VHDL (VHSIC hardware description language) is examined. It is seen that in some cases the semantics and descriptive power of the language create difficulties for high-level synthesis, and in other cases the high-level synthesis framework used imposes limitations. Restrictions in the form of rules are suggested for overcoming these difficulties. It is shown that although VHDL semantics were initially defined in terms of simulation, they do not pose any fundamental problems for high-level synthesis.
PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking
Authors: Jan M. Rabaey, M. Josie Ammer, Julio L. da Silva, Danny Patel, Shad Roundy
Venue: Computer (2000)

Technology advances have made it conceivable to build and deploy dense wireless networks of heterogeneous nodes collecting and disseminating wide ranges of environmental data. Applications of such sensor and monitoring networks include smart homes equipped with security, identification, and personalization systems; intelligent assembly systems; warehouse inventory control; interactive learning toys; and disaster mitigation. The opportunities emerging from this technology give rise to new definitions of distributed computing and the user interface. Crucial to the success of these ubiquitous networks is the availability of small, light-weight, low-cost network elements, which the authors call PicoNodes. The authors present a configurable architecture that enables these opportunities to be efficiently realized in silicon. They believe that this energy-conscious system-design and implementation methodology will lead to radio nodes that are two orders of magnitude more efficient than existing solutions.