ppxscal/embedding_network huggingface dataset:
Microcomputers and the university computer center
Authors: Richard Stillman
Venue: Proceedings of the 7th annual ACM SIGUCCS conference on User services (1979)

Because of current trends in the pricing of computer components, the makeup of the typical computer system is changing radically. Instead of large, multi-user systems built around a single CPU, there is a trend toward single user, dedicated application, and small timesharing systems. The computer center must take an active role in this transition by recognizing and supporting areas in which microcomputers are being introduced.I would like to acknowledge the assistance of Jane Wolin, Head of Programming of the CCIS, in developing the ideas expressed in this paper. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Extraction of 2D Motion Trajectories and Its Application to Hand Gesture Recognition
Authors: Ming Hsuan Yang, Narendra Ahuja, Mark Tabb
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We present an algorithm for extracting and classifying two-dimensional motion in an image sequence based on motion trajectories. First, a multiscale segmentation is performed to generate homogeneous regions in each frame. Regions between consecutive frames are then matched to obtain two-view correspondences. Affine transformations are computed from each pair of corresponding regions to define pixel matches. Pixels matches over consecutive image pairs are concatenated to obtain pixel-level motion trajectories across the image sequence. Motion patterns are learned from the extracted trajectories using a time-delay neural network. We apply the proposed method to recognize 40 hand gestures of American Sign Language. Experimental results show that motion patterns of hand gestures can be extracted and recognized accurately using motion trajectories.
4D space-time techniques: a medical imaging case study
Authors: Melanie Tory, Niklas Röber, Torsten Möller, Anna Celler, M. Stella Atkins
Venue: Proceedings of the conference on Visualization '01 (2001)

We present the problem of visualizing time-varying medical data. Two medical imaging modalities are compared --- MRI and dynamic SPECT. For each modality, we examine several derived scalar and vector quantities such as the change in intensity over time, the spatial gradient, and the change of the gradient over time. We compare several methods for presenting the data, including isosurfaces, direct volume rendering, and vector visualization using glyphs. These techniques may provide more information and context than methods currently used in practice; thus it is easier to discover temporal changes and abnormalities in a data set.
Test and Reliability: Partners in IC Manufacturing, Part 2
Authors: Charles F. Hawkins, Jaume Segura, Jerry Soden, Ted Dellin
Venue: IEEE Design Test (1999)

The gate oxide of complementary metal-oxide semiconductor (CMOS) transistors is critical. Penalties for poor-quality oxides can be severe, impacting test escape, burn-in, and field failure costs. Twenty years ago, oxide thicknesses were about 750 \AA. Now they are 40 \AA, and reductions continue. Gate oxide electric-field intensity is presently higher than burn-in electric-field intensities of 10 years ago. This article discusses the major gate oxide failure modes, reliability modeling, burn-in, and qualification testing. We present a typical method to calculate failure rates.
The Story of O2
Authors: O. Deux et al.
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A complete description of the O2 system, an object-oriented database system, is presented. It has the functionality of a DBMS (persistence, disk management, sharing and query language) and of an object-oriented system (complex objects, object identity, encapsulation, typing, inheritance, overriding, extensibility, and completeness). It also includes a set of user interface generation tools and a complete programming environment. O2 supports a multilanguage paradigm and a dual mode of operation (development and execution) and it operates on a workstation/server configuration. The system is described as seen from the programmer's point of view and as seen through the programming environment. A complete description of the implementation is given. An evaluation of the prototype performance is also given.
Causal Probabilistic Networks with Both Discrete and Continuous Variables
Authors: K. G. Olesen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An extension of the expert system shell known as handling uncertainty by general influence networks (HUGIN) to include continuous variables, in the form of linear additive normally distributed variables, is presented. The theoretical foundation of the method was developed by S.L. Lauritzen, whereas this report primarily focus on implementation aspects. The approach has several advantages over purely discrete systems. It enables a more natural model of of the domain in question, knowledge acquisition is eased, and the complexity of belief revision is most often reduced considerably.
A New Dynamic Voting Algorithm for Distributed Database Systems
Authors: N. R. Adam
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

We consider the problem of keeping a distributed database system that has been partitioned because of site or communication link failures partially operable while ensuring data consistency. A dynamic-voting-consistency algorithm is proposed, and its correctness is demonstrated. The proposed algorithm results in improved efficiency in executing read requests by not requiring a read quorum. This algorithm is effective in environments where the majority of user requests are "read" types of requests. Furthermore, the proposed algorithm results in efficient recovery by avoiding updating those data objects that are still current. Under the proposed algorithm, the majority partition would be available even if changes in the network topology take place at a higher rate than the update rate, as long as only simple partitioning takes place.
On the Efficiency of Parallel Backtracking
Authors: V. N. Rao, V. Kumar
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Analytical models and experimental results concerning the average case behavior ofparallel backtracking are presented. Two types of backtrack search algorithms areconsidered: simple backtracking, which does not use heuristics to order and prunesearch, and heuristic backtracking, which does. Analytical models are used to comparethe average number of nodes visited in sequential and parallel search for each case. Forsimple backtracking, it is shown that the average speedup obtained is linear when thedistribution of solutions is uniform and superlinear when the distribution of solutions isnonuniform. For heuristic backtracking, the average speedup obtained is at least linear,and the speedup obtained on a subset of instances is superlinear. Experimental results formany synthetic and practical problems run on various parallel machines that validate thetheoretical analysis are presented.
Hamiltonicity of {K1,4,K1,4 + e}-free graphs
Authors: Rao Li, R. H. Schelp
Venue: Discrete Mathematics (2002)

A graph G is called {H1, H2,...,Hk}-free if G contains no induced subgraph isomorphic to any Hi, 1 ≤ i ≤ k. Let G be a 3-connected {K1,4,,K1,4 + e}-free graphs of order n ≥ 30. If δ(G)≥(n + 5)/5, then G is hamiltonian, where K1,4+e is a graph obtained by joining a pair of nonadjacent vertices in a K1,4.
Statistical Relational Databases: Normal Forms
Authors: S. P. Ghosh
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Problems associated with defining normal forms of relational tables relevant to statistical processing are discussed. The concepts of derived identifier, class identifier, derived class-counts, count domains, compact domains, and uniform domains for statistical relational tables are introduced. The structures of the first and the second statistical-normal forms and the relational decompositions needed to achieve them are also discussed. It is shown that the statistical-normal form can be an important method to determine whether the usual statistical analysis techniques are valid. Some suggestions are presented for extending the structured query language (SQL) statements to achieve these operations on statistical relational tables. Some results linking Codd's normal forms with statistical normal forms are discussed. Relational statistical abnormalities, called outlyers, are also discussed.
Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling
Authors: Heung-Yeung Shum, Katsushi Ikeuchi, Raj Reddy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Observation-based object modeling often requires integration of shape descriptions from different views. In current conventional methods, to sequentially merge multiple views, an accurate description of each surface patch has to be precisely known in each view, and the transformation between adjacent views needs to be accurately recovered. When noisy data and mismatches are present, the recovered transformation become erroneous. In addition, the transformation errors accumulate and propagate along the sequence, resulting in an inaccurate object model. To overcome these problems, we have developed a weighted least-squares (WLS) approach which simultaneously recovers object shape and transformation among different views without recovering interframe motion as an intermediate step.We show that object modeling from a sequence of range images is a problem of principal component analysis with missing data (PCAMD), which can be generalized as a WLS minimization problem. An efficient algorithm is devised to solve the problem of PCAMD. After we have segmented planar surface regions in each view and tracked them over the image sequence, we construct a normal measurement matrix of surface normals, and a distance measurement matrix of normal distances to the origin for all visible regions appeared over the whole sequence of views, respectively. These two measurement matrices, which have many missing elements due to noise, occlusion, and mismatching, enable us to formulate multiple view merging as a combination of two WLS problems. A two-step algorithm is presented to computer planar surface descriptions and transformations among different views simultaneously. After surface equations are extracted, spatial connectivity among these surfaces is established to enable the polyhedral object model to be constructed.Experiments using synthetic data and real range images show that our approach is robust against noise and mismatching and generates accurate polyhedral object models by averaging over all visible surfaces. Two examples are presented to illustrate the reconstruction of polyhedral object models from sequences of real range images.
Solving Linear Rational Expectations Models
Authors: Christopher A. Sims
Venue: Computational Economics (2002)

We describe methods for solving general linear rational expectations models in continuous or discrete timing with or without exogenous variables. The methods are based on matrix eigenvalue decompositions.
The Software Design Studio: An Exploration
Authors: Sarah Kuhn
Venue: IEEE Software (1998)

Some software designers have recently turned to building architecture for inspiration in their efforts to improve professional practice. An attempt to apply the studio method of architectural training to software design education, reported in this article, reveals much about education and practice in both professions. Studio courses provoke creative reflection on how to improve current training practices and could provide a new way to develop software design expertise.
Vario functions of higher order - definition and application to characterization of snow surface roughness
Authors: Ute Christina Herzfeld
Venue: Computers Geosciences (2002)

Vario functions are lag-dependent experimental functions introduced to characterize spatial properties of surfaces and profiles in a general algebraic sense and their derivatives. Vario functions of higher order are defined recursively. Under certain mathematical conditions, first-order vario functions coincide with experimental variograms. Vario functions of higher order provide a useful extension of the geostatistical classification method, in particular in the cases of poor signal-to-resolution ratio and in the cases of complex morphogenesis. Several theoretical questions concerning vario functions are investigated: feature detection and quantitative analysis in a situation of poor signal-to-resolution ratio, the divergence criterion for determination of the usable distance range of the second-order vario function, characterization of superimposed features (of the geo-variable) by secondary minima and convexity or concavity of the (second-order) vario function, effects of increasing resolution in vario-function calculation for the study of small-scale features, and the question of homogeneity of a data set. Higher-order vario functions prove essential in the characterization of snow surface roughness, demonstrated for microtopographic data from Niwot Ridge, Colorado Front Range. Application of the geostatistical classification approach to vario functions of higher order leads to conclusions on snow surface morphogenesis and its dependence on environmental and geographical conditions that are not obtainable otherwise.
Improving the robustness of a surface integral formulation for wideband impendance extraction of 3D structures
Authors: Zhenhai Zhu, Jingfang Huang, Ben Song, Jacob White
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In order for parasitic extraction of high-speed integrated circuit interconnect to be sufficiently efficient, and fit with model-order reduction techniques, a robust wideband surface integral formulation is essential. One recently developed surface integral formulation has shown promise, but was plagued with numerical difficulties of poorly understood origin. In this paper we show that one of that formulation's difficulties was related to the inaccuracy in the approach to evaluate integrals over discretization panels, and we present an accurate approach based on an adapted piecewise quadrature scheme. We also show that the condition number of the original system of integral equations can be reduced by differentiating one of the integral equations. Computational results on a ring and a spiral inductor are used to show that the new quadrature scheme and the differentiated integral formulation improve accuracy and accelerate the convergence of iterative solution methods.
User-level performance of elastic traffic in a differentiated-services environment
Authors: S. C. Borst, R. Núñez-Queija, M. J. G. Van Uitert
Venue: Performance Evaluation (2002)

We consider a system with two service classes, one of which supports elastic traffic. The traffic characteristics of the other class can be completely general, allowing streaming applications as an important special case. The link capacity is shared between the two traffic classes in accordance with the generalized processor sharing (GPS) discipline. GPS-based scheduling algorithms, such as weighted fair queuing, provide a flexible mechanism for service differentiation and prioritization.We examine the user-level performance of the elastic traffic. The elastic traffic users randomly initiate file transfers with a heavy-tailed distribution. Within the elastic traffic class, the active flows share the available bandwidth in an ordinary processor-sharing (PS) fashion. The PS discipline has emerged as a natural paradigm for evaluating the user-perceived performance of bandwidth sharing algorithms like TCP. For a certain parameter range, we establish that the transfer delay incurred by the elastic traffic flows is asymptotically equivalent to that in an isolated PS system with constant service rate. This service rate is only affected by the streaming traffic through its average rate. Specifically, the elastic traffic is largely immune from possible adverse traffic characteristics or performance degradation due to prioritization of the streaming traffic. This confirms that GPS-based multiplexing mechanisms achieve significantly better performance for both traffic classes than a static bandwidth partitioning approach.
Object-Orientated Design of Digital Library Platforms for Multiagent Environments
Authors: A. N. Zincir-Heywood, M. I. Heywood, C. R. Chatwin
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

The application of an object orientated (OO) methodology to the design of a platform for heterogeneous Digital Libraries with multiagent technologies is demonstrated. Emphasis is placed on maximizing the autonomy of the query processing activity. The Fusion OO paradigm is specifically employed as the basis for the design process due to the significance attributed to the development of object interfaces under static and dynamic conditions. Finally, characteristics of the proposed Domain Index Server (DIS) platform are contrasted with those of an alternative platform (UMDL) by way of the respective Fusion descriptions. This identifies a different emphasis to the interface design between objects in the two platforms: The DIS system uses more dynamic links while the UMDL system focuses on permanent and constant links. Simulation of the two platforms provides performance data that demonstrates the higher capacity of the DIS scheme.
Two Mac Users Look at MS-DOS Graphical Interfaces
Venue: IEEE Software (1990)

No abstract available The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Two-Chip MPEG-2 Video Encoder
Authors: Toshio Kondo, Kazuhito Suguri, Mitsuo Ikeda, Tetsuya Abe, Hiroaki Matsuda, Tsuneo Okubo, Kenji Ogura, Yutaka Tashiro, Naoki Ono, Toshihiro Minami, Ritsu Kusaba, Takeshi Ikenaga, Nobutaro Shibata, Ryota Kasai, Koji Otsu, Fumiaki Nakagawa, Yasuhiko Sato
Venue: IEEE Micro (1996)

We have developed a real-time MPEG2 (simple profile at main level) encoder chip set with ENC-M for motion compensation and ENC-C for coding/control. This set has full functions and sufficient processing power for real-time compression of NTSC 4:2:0 video signals (720 x 480 pels, 30 frames/s), with only three external memories: 4-Mbit VRAM, 16-Mbit synchronous DRAM, and 2-Mbit FIFO-structured DRAM. These features enable us to implement, for example, a small PC board for NTSC video CODEC.
Portable and Fault-Tolerant Software Systems
Authors: Volker Strumpen
Venue: IEEE Micro (1998)

The development of portable and fault-tolerant software, in particular for parallel and distributed systems, continues to be a challenge. This article describes a new approach to solking this problem by means of portable checkpoints and automatic code generation for saving and recovering from portable checkpoints on binary incompatible machines. The development of the prototype compiler porch is part of an ongoing research effort to explore the limits of sorce-to-source compilation to this end.
A MAC Policy Framework for Multilevel Relational Databases
Authors: Xiaolei Qian, Teresa F. Lunt
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

We develop a formal framework of MAC policies in multilevel relational databases. We identify the important components of MAC policies and their desirable properties. The framework provides a basis for systematically specifying MAC policies and characterizing their potential mismatches. Based on the framework, we compare and unify the MAC policies and policy components that are proposed in the literature or imposed in existing systems. Our framework could be used to capture and resolve MAC policy mismatches in the trusted interoperation of heterogeneous multilevel relational databases.
Electromigration resistance of sputtered silver lines using different patterning techniques
Authors: M. Hauder, W. Hansch, J. Gstöttner, D. Schmitt-Landsiedel
Venue: Microelectronic Engineering (2002)

Electromigration was investigated for sputtered Ag lines patterned by wet etching or by a novel hybrid etching technique. This new patterning technique works in two steps. After employing an oxygen plasma in the first step, a hydrogen peroxide solution is used in the second step. This technique shows an almost anisotropic etching behavior in contrast to the investigated wet etching techniques. The hybrid etched patterns were found to have an increased lifetime with up to about a threefold value in comparison to the best wet etched Ag lines.
Middleware Challenges Ahead
Authors: Kurt Geihs
Venue: Computer (2001)

New application requirements--including the need to support enterprise application integration, Internet applications, quality of service, nomadic mobility, and ubiquitous computing--challenge established middleware design principles. Meeting these challenges will lead to a major middleware design and development phase that requires new insights into distributed system technology. A middleware layer seeks to hide the underlying networked environment's complexity by, for example, insulating applications from explicit protocol handling, disjoint memories, data replication, network faults, and parallelism. Middleware masks the heterogeneity of computer architectures, operating systems, programming languages, and networking technologies to facilitate application programming and management. The transition to new-generation middleware systems poses several questions. What is the most appropriate programming model for diverse application scenarios? Can we build customizable, configurable, and flexible middleware frameworks for inherently heterogeneous environments? What middleware features and infrastructure services will mobile ubiquitous computing require? These issues frame the agenda for future middleware research and generate open research problems requiring building applications atop new middleware prototypes.
Collecting Data for Comparability: Benchmarking Software Development Productivity
Authors: Katrina D. Maxwell
Venue: IEEE Software (2001)

Collecting comparable benchmarking data is not a straightforward task. In this article, the author shares the experience she has acquired over the last eight years collecting, validating, analyzing and benchmarking software development projects. She presents her findings as a set of guidelines for data collection and benchmarking efforts.
Reducing the Effects of Noise in Image Reconstruction
Authors: Rick Archibald, A. Gelb
Venue: Journal of Scientific Computing (2002)

Fourier spectral methods have proven to be powerful tools that are frequently employed in image reconstruction. However, since images can be typically viewed as piecewise smooth functions, the Gibbs phenomenon often hinders accurate reconstruction. Recently, numerical edge detection and reconstruction methods have been developed that effectively reduce the Gibbs oscillations while maintaining high resolution accuracy at the edges. While the Gibbs phenomenon is a standard obstacle for the recovery of all piecewise smooth functions, in many image reconstruction problems there is the additional impediment of random noise existing within the spectral data. This paper addresses the issue of noise in image reconstruction and its effects on the ability to locate the edges and recover the image. The resulting numerical method not only recovers piecewise smooth functions with very high accuracy, but it is also robust in the presence of noise.