ppxscal/embedding_network huggingface dataset:
Refining the Curriculum: Client-Server and Object-Oriented Training
Authors: Patricia J. Douglas, George M. Alliger, Robert Goldberg
Venue: Computer (1996)

Client-server technology and object-oriented development are two promising technologies whose large-scale application has historically posed significant migration problems. Because the technologies themselves are proven, we are left to wonder about the human element underlying technology insertion-that is, the element of personnel and training. Surprisingly little systematic research has been conducted in this area, and few organizations have experience effecting change of this magnitude. The authors developed several surveys that capture, at a task level, the relative importance of various elements of CS and OO technology. As this article shows, task criticality, when taken in conjunction with required skill level, opens a window on training needs.
VLSI Architectures for Neural Networks
Authors: Philip Treleaven, Marco Pacheco, Marley Vellasco
Venue: IEEE Micro (1989)

An introduction to neural networks and neural information processing is provided. Neurocomputers are discussed, focusing on how their design exploits the architectural properties of VLSI circuits. General-purpose and special-purpose neurocomputer developments throughout the world are examined. As illustration, and to put European developments in perspective, some of the important projects in the United States and Japan are described. European research is then discussed in greater detail.
Multiresolution-based segmentation of calcifications for the early detection of breast cancer
Authors: S. Sentelle, C. Sentelle, M. A. Sutton
Venue: Real-Time Imaging (2002)

Clusters of microcalcifications in a mammogram may be an early indication of breast cancer. Unfortunately, due to size, shape and limited contrast from surrounding normal tissue, microcalcifications can occasionally be hard to detect in computer-aided detection (CAD) systems. These CAD systems can also be slow compared to a radiologist's performance when reviewing film-screen mammography. The research described here investigates a rapid, multiresolution-based approach combined with wavelet analysis to provide an accurate segmentation of potential calcifications. An initial multiresolution approach to fuzzy c-means (FCM) segmentation is employed to rapidly distinguish medically significant tissues. Tissue areas chosen for high-resolution analysis are broken into multiple windows. Within each window, wavelet analysis is used to generate a contrast image, and a local FCM segmentation generates an estimate of local intensity. A simple two-rule fuzzy system then combines intensity and contrast information to derive fuzzy memberships of pixels in the high-contrast, bright pixel class. A double threshold is finally applied to this fuzzy membership to detect and segment calcifications. This sequence of steps is shown to approach detection rates of conventional classifier designs and may therefore be useful as a pre-processing module for these systems to improve speed. Results are reported for 25 images obtained from the Digital Database for Screening Mammography (DDSM).
Guest Editors' Introduction: Component-Based Software Engineering
Authors: Wojtek Kozaczynski, Grady Booch
Venue: IEEE Software (1998)

Components are "hot," and changing at a fast pace. Here are industry forecasts from two leaders in the field, as well as their choices for inclusion in this focus: a state-of-the-practice overview and some of the latest work in CBSE.
Sticky notes for the semantic web
Authors: David R. Karger, Boris Katz, Jimmy Lin, Dennis Quan
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Computer-based annotation is increasing in popularity as a mechanism for revising documents and sharing comments over the Internet. One reason behind this surge is that viewpoints, summaries, and notes written by others are often helpful to readers. In particular, these types of annotations can help users locate or recall relevant documents. We believe that this model can be applied to the problem of retrieval on the Semantic Web. In this paper, we propose a generalized annotation environment that supports richer forms of description such as natural language. We discuss how RDF can be used to model annotations and the connections between annotations and the documents they describe. Furthermore, we explore the idea of a question answering interface that allows retrieval based both on the text of the annotations and the annotations associated metadata. Finally, we speculate on how these features could be pervasively integrated into an information management environment, making Semantic Web annotation a first class player in terms of document management and retrieval
Near-lossless image compression by relaxation-labelled prediction
Authors: Bruno Aiazzi, Luciano Alparone, Stefano Baronti
Venue: Signal Processing (2002)

This paper describes a differential pulse code modulation scheme suitable for lossless and near-lossless compression of monochrome still images. The proposed method is based on a classified linear-regression prediction followed by context-based arithmetic coding of the outcome residuals. Images are partitioned into blocks, typically 8 × 8, and a minimum mean square error linear predictor is calculated for each block. Given a preset number of classes, a clustering algorithm produces an initial guess of as many predictors to be fed to an iterative labelling procedure that classifies pixel blocks simultaneously refining the associated predictors. The final set of predictors is encoded, together with the labels identifying the class, and hence the predictor, to which each block belongs. A thorough performance comparison, both lossless and near-lossless, with advanced methods from the literature and both current and upcoming standards highlights the advantages of the proposed approach. The method provides impressive performances, especially on medical images. Coding time are affordable thanks to fast convergence of training and easy balance between compression and computation by varying the system's parameters. Decoding is always real-time thanks to the absence of training.
A local-global principle for vertex-isoperimetric problems
Authors: Sergei L. Bezrukov, Oriol Serra
Venue: Discrete Mathematics (2002)

We consider the vertex-isoperimetric problem (VIP) for cartesian powers of a graph G. A total order ≤ on the vertex set of G is called isoperimetric if the boundary of sets of a given size k is minimum for any initial segment of ≤, and the ball around any initial segment is again an initial segment of ≤. We prove a local-global principle with respect to the so-called simplicial order on Gn (see Section 2 for the definition). Namely, we show that the simplicial order ≤n is isoperimetric for each n ≥ 1 iff it is so for n = 1,2. Some structural properties of graphs that admit simplicial isoperimetric orderings are presented. We also discuss new relations between the VIP and Macaulay posets.
Case study on real-time visualization of virtual t&uuml;bingen on commodity PC hardware
Authors: Michael Meißner, Jasmina Orman, Stephan J. Braun
Venue: Proceedings of the conference on Visualization '01 (2001)

For psychophysical studies in spatial cognition a virtual model of the picturesque old town of T&uuml;bingen has been constructed. In order to perform psychophysical experiments in highly realistic virtual environments the model is based on high quality texture maps adding up to several hundreds of MBytes. To accomplish the required real-time frame updates, view frustum and occlusion culling without visibility pre-processing, levels of detail, and texture compression are applied in an interleaved manner. Shared memory communication and a standard PC with two commodity graphics cards is used to enable the powerful combination of those techniques because this combination is not yet available on a single graphics card.
Get the Design Right!
Authors: Lawrence Bernstein
Venue: IEEE Software (1993)

The author suggests that prototyping, in addition to end-user interaction, is the best technique for developing correct software designs. He offers a personal account of a software project in which the need for end-user interaction became apparent, even though prototyping was used. Two problems associated with relying too much on prototyping are discussed.
Iconic Programming: Where to go?
Authors: Tadao Ichikawa, Masahito Hirakawa
Venue: IEEE Software (1990)

Pioneering work in iconic languages is briefly recounted, and arguments regarding the feasibility of their use as programming languages are examined. In particular, their usefulness to computer professionals and for large programs is discussed. Approaches to designing good iconic interfaces are examined. Progress to date in iconic programming research is summarized.
Finite Satisfiability of Integrity Constraints in Object-Oriented Database Schemas
Authors: A. Formica
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Checking satisfiability of database constraints is a fundamental problem in database design. In addition, database constraints have to be not only satisfiable but also finitely satisfiable. This problem is generally addressed by using theorem provers that, being developed for first order logic formulas, are based on semidecidable procedures. Furthermore, even in simple cases, theorem provers are quite inefficient in dealing with comparison operators such as, for instance, the equality. In this paper, a decidable, sound, and complete method for checking finite satisfiability of a specific class of integrity constraints for object-oriented databases, including the equality constraints, is presented. The method, that is based on a graph-theoretic approach, has exponential complexity in the worst case, rarely occurring in practice.
Mean Shift, Mode Seeking, and Clustering
Authors: Yizong Cheng
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking process on a surface constructed with a ¿shadow¿ kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications in clustering and Hough transform are demonstrated. Mean shift is also considered as an evolutionary strategy that performs multistart global optimization.
Function Materialization in Object Bases: Design, Realization, and Evaluation
Authors: A. Kemper, C. Kilger, G. Moerkotte
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM.
Symplectic Shifted Tableaux and Deformations of Weyl's Denominator Formula for sp(2n)
Authors: A. M. Hamel, R. C. King
Venue: Journal of Algebraic Combinatorics: An International Journal (2002)

A determinantal expansion due to Okada is used to derive both a deformation of Weyl's denominator formula for the Lie algebra sp(2n) of the symplectic group and a further generalisation involving a product of the deformed denominator with a deformation of flagged characters of sp(2n). In each case the relevant expansion is expressed in terms of certain shifted sp(2n)-standard tableaux. It is then re-expressed, first in terms of monotone patterns and then in terms of alternating sign matrices.
A Computer-Aided Prototyping System
Authors: Luqi, Mohammad Ketabchi
Venue: IEEE Software (1988)

A description is given of an approach to rapid prototyping that uses a specification language (the Prototype-System Description Language, PSDL) integrated with a set of software tools. including an execution support system, a rewrite system, a syntax-directed editor with graphics capabilities, a software base, a design database, and a design-management system. The prototyping language lets the designer use dataflow diagrams with nonprocedural control constraints as part of the specification of a hierarchically structured prototype. The resulting description is free from programming-level details, in contrast to prototypes constructed with a programming language. The discussion covers the language and method, rewrite subsystem, design manager, software base, and execution support.
When the Pursuit of Quality Destroys Value
Authors: John Favaro
Venue: IEEE Software (1996)

New views of mature ideas on software and quality productivity.This month, John Favaro reminds us that our software efforts are embedded in the larger, more complex business world. He shows us how quality must be considered in the context of business goals and needs.- Shari Lawrence Pfleeger
Experience Using Cleanroom Software Engineering
Authors: S. Wayne Sherer, Ara Kouchakdjian, Paul G. Arnold
Venue: IEEE Software (1996)

The US Army first attempted to improve these processes using Cleanroom methods at its Life Cycle Software Engineering Center at Picatinny Arsenal, New Jersey. The Center provides several software support services for Army battlefield-automated-systems. The Army's desire for process improvement resulted in part from a software-process assessment conducted by a team of representatives from the Army Materiel Command, with coaching from the Software Engineering Institute. Center management reviewed these findings and realized that their then-current software-engineering activities lacked control. Working without an organizational mandate, participants could only perpetuate their experience on a personal level, by carrying it forward from one project to the next. Because no defined process existed for maintaining continual project control, common practice consisted of typical, ad hoc, software-engineering techniques instead of a disciplined and defined software-engineering process. The project we describe in this article resulted from discussions between Picatinny Arsenal and the US Department of Defense's Software Technology for Adaptable, Reliable Systems program management and was the first to put STARS concepts into practice.The Department of Defense's software-support activities provided opportunities to demonstrate STARS successful efforts at improving software quality and productivity. These activities represent a major portion of the Department of Defense's software budget. The proportion of the budget allocated to these activities will likely increase during the next decade as the many systems in the development pipeline are turned over to software-support organizations for maintenance. It is likely that, as fewer new systems come into the inventory, Department of Defense managers will attempt to extend the useful life of old systems through software enhancements and re-engineering. We anticipate that Cleanroom techniques will play an increasing role in this process.
Guest Editor's Introduction: Critical Embedded Automotive Networks
Authors: Philip Koopman
Venue: IEEE Micro (2002)

Designing automotive computer systems involves satisfying stringent cost requirements and providing highly reliable operation in adverse environments. Despite this cost/performance challenge, electronic and computer-based features continue proliferating in vehicles, leading to widespread use of embedded real-time control networks.In the next few years, networked control will reach such a sophistication level that using additional performance and safety features will require giving up mechanical linkages between the driver and the vehicle. Networked computers will control vehicle operation just as they do today in fly-by-wire aircraft designs.
Shape Connectivity: Multiscale Analysis and Application to Generalized Granulometries
Authors: Costas S. Tzafestas, Petros Maragos
Venue: Journal of Mathematical Imaging and Vision (2002)

This paper develops a multiscale connectivity theory for shapes based on the axiomatic definition of new generalized connectivity measures, which are obtained using morphology-based nonlinear scale-space operators. The concept of connectivity-tree for hierarchical image representation is introduced and used to define generalized connected morphological operators. This theoretical framework is then applied to establish a class of generalized granulometries, implemented at a particular problem concerning soilsection image analysis and evaluation of morphological properties such as size distributions. Comparative results demonstrate the power and versatility of the proposed methodology with respect to the application of typical connected operators (such as reconstruction openings). This multiscale connectivity analysis framework aims at a more reliable evaluation of shape/size information within complex images, with particular applications to generalized granulometries, connected operators, and segmentation.
The Feel of Java
Authors: James Gosling
Venue: Computer (1997)

Java evolved out of a Sun research project started six years ago to look into distributed control of consumer electronics devices. At that time, the priorities of the consumer electronics industry were quite different from those in the computer industry. Whereas five years ago the computer industry's mantra was compatibility, the consumer electronics industry considered security, networking, portability, and cost far more important. The buzzwords that have been applied to Java-distributed computing, architecture neutrality, and so on-derive directly from this context. This article provides a firsthand account of some of the design decisions underlying Java and the rationale behind them.
Enriched Methods for Large-Scale Unconstrained Optimization
Authors: José Luis Morales, Jorge Nocedal
Venue: Computational Optimization and Applications (2002)

This paper describes a class of optimization methods that interlace iterations of the limited memory BFGS method (L-BFGS) and a Hessian-free Newton method (HFN) in such a way that the information collected by one type of iteration improves the performance of the other. Curvature information about the objective function is stored in the form of a limited memory matrix, and plays the dual role of preconditioning the inner conjugate gradient iteration in the HFN method and of providing an initial matrix for L-BFGS iterations. The lengths of the L-BFGS and HFN cycles are adjusted dynamically during the course of the optimization. Numerical experiments indicate that the new algorithms are both effective and not sensitive to the choice of parameters.
Segmentation with Depth but Without Detecting Junctions
Authors: Selim Esedoglu, Riccardo March
Venue: Journal of Mathematical Imaging and Vision (2003)

Given an image that depicts a scene with several objects in it, the goal of segmentation with depth is to automatically infer the shapes of the objects and the occlusion relations between them. Nitzberg, Mumford and Shiota formulated a variational approach to this problem: in their model, the solution is obtained as the minimizer of an energy. We describe a new technique of minimizing their energy that avoids explicit detection/connection of T-junctions.
Design of Compliant Mechanisms: Applications to MEMS
Authors: Sridhar Kota, Jinyong Joo, Zhe Li, Steven M. Rodgers, Jeff Sniegowski
Venue: Analog Integrated Circuits and Signal Processing (2001)

Compliant mechanisms are single-piece flexible structures that deliver the desired motion by undergoing elastic deformation as opposed to jointed rigid body motions of conventional mechanisms. Compliance in design leads to jointless, no-assembly (Fig. 1), monolithic mechanical devices and is particularly suited for applications with small range of motions. The compliant windshield wiper shown in Fig. 1 illustrates this paradigm of no-assembly. Conventional flexural mechanisms employ flexural joints that connect relatively rigid links as depicted in Fig. 2. Reduced fatigue life, high stress concentration and difficulty in fabrication are some of the drawbacks of flexural joints. Our focus is on designing compliant mechanisms with distributed compliance which employs flexural links (see Fig. 3) and have no joints (neither pin nor flexural joints) for improved reliability, performance, and ease of manufacture. Distributed compliant mechanisms derive their flexibility due to topology and shape of the material continuum rather than concentrated flexion at few regions. This paper focuses on the unique methodology employed to design jointless mechanisms with distributed compliance. The paper also illustrates a compliant stroke amplification mechanism that was recently designed, fabricated and tested for MEMS application.
A direct comparison of presence levels in text-based and graphics-based virtual environments
Authors: David Nunez, Edwin Blake
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

We present results from an experiment (n=78) which used two presence measures to directly compare presence in text-based and graphics-based VEs of two levels of quality. The results show that text-based VEs produce less presence than graphics-based VEs, but the actual difference is less than 20%. This finding has implications for those wishing to implement VEs in impoverished devices or those working towards understanding the cognitive processing of VEs.