ppxscal/embedding_network huggingface dataset:
Target indexing in synthetic aperture radar imagery using topographic features
Authors: R. Meth
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Automatic target indexing using synthetic aperture radar (SAR) imagery is investigated. Target areas are located using a constant false alarm rate (CFAR) detector. Classification of targets is performed using the topographical primal sketch, which assigns each pixel a label that is invariant under monotonic gray tone transformations. The use of a topographic scheme based on the curvature of the underlying image intensity allows for the classification of targets in high resolution imagery. Target matching is performed using correlation and graph matching schemes that incorporate quantitative values associated with each feature as well as qualitative feature labels. Experimental results for indexing of targets performed at 1 foot and 1 meter resolutions are presented.
UV151: a simulation tool for teaching/learning the 8051 microcontroller
Authors: A. del Rio
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Teaching/learning microcontrollers in the laboratory has been traditionally carried out using general purpose simulators and/or evaluation boards. In-circuit emulators are not widely used because of their high cost. This paper presents UV151, a software tool developed for teaching/learning the 8051 microcontroller in the laboratory and/or the classroom. UV151 includes an assembler, a multimicro simulator, a logic analyzer, and an assistant. The tool allows to simulate systems consisting of up to 4 microcontrollers plus a set of external peripherals. Both the CPU core and the embedded peripherals of each microcontroller are simulated. Everything in UV151 has been designed with the educational perspective in mind. A set of windows depict the configuration and behaviour of every embedded peripheral. UV151 is being used in several courses on microcontrollers at University of Vigo (Spain) and also at the college level. The tool is suitable for learning nearly everything about the 8051, ranging from the CPU and instruction set basics to complex use of timers, interrupts and the serial port. This paper shows the benefits of using UV151 as an alternative to traditional instruction tools.
Challenges in Health Informatics
Authors: Michael Shepherd
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Early grand challenge papers in health informatics identified numerous challenges, many of which either remain as open questions or have been resolved within fairly narrow domains and generalized solutions have not been developed. These open questions and those resolved but not generalized remain so because underlying research issues have not been resolved. These research issues include the synthesis of information from multiple heterogeneous sources within a user/task context and the delivery of that information in a context and form which the user can understand and appreciate. This paper presents the argument that an interdisciplinary approach based on information retrieval and knowledge management may resolve the two challenges of information synthesis and contextual retrieval.
On Statistical Measures for Selecting Pertinent Formal Concepts to Discover Production Rules from Data
Authors: Mondher Maddouri, Fatma Kaabi
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The Discovery of production rules (association rules and/or classification rules) is one of the most important tasks of data mining. The discovered knowledge is intelligible and comprehensible by experts in any field. In previous works, we used formal concept analysis to discover classification rules [4] and association rules [5] embedded in data sets. One of the difficulties we found is to measure the pertinence of the discovered rules. In supervised learning of classification rules, we used the known entropy measure [3]. In un-supervised learning of association rules, we used the known support measure [2]. However, some recent works [11, 9] have proven the insufficiency of these measures and have introduced other ones. In this paper, we present a bibliographic summary of many existing pertinence measures. Then, we present an experimental study of the behavior of these measures in order to help the users of our learning system, choosing the appropriate measure.
Design and performance analysis of low complexity encoding algorithm for h.264/avc
Authors: C.-C. Jay Kuo
Venue:  (2006)

The emerging H.264 video coding standard provides state-of-the-art video coding techniques and has significant coding performance improvement over existing standards. The general objective of this research is to reduce the H.264 encoder complexity without significant RD performance degradation. In particular, we have focused on the complexity reduction for the coding mode decision and motion estimation, which are the modules that demand a high computational cost in the encoder. For the improved coding mode decision, we develop an efficient two-stage framework. Fist, a coarse level intra/inter coding mode prediction is performed to decide the class. The proposed algorithm calculates three features and maps them into the one of three regions; namely, risk-free, risk-tolerable, and risk-intolerable regions. Depending on the mapped region, we can apply algorithms of different complexities for the final mode decision. Based on the coding mode decision result, either intra predictive coding or inter predictive coding process is proceeded in macroblock adaptive manner. In case of intra predictive coding, we propose a fast intra mode decision scheme for the fine-level mode decision. For inter predictive coding, a fast multiple reference assignment scheme for efficient motion estimation is proposed. First, the dynamic block-size effect on time-varying sequence characteristics is quantified by its impact on the RD performance degradation. The block-size effect on the RD coding gain is exploited to develop a new algorithm, called the block-size adaptive referencing (BAR) scheme, that assigns a different number of references in a block-size adaptive manner. The proper BAR scheme can be chosen to minimize the reference frame numbers while keeping the expected RD loss under a target level. Finally, fast motion search is performed within selected references in a block-size adaptive manner and the model parameters are adjusted using the normalized LMS adaptive filter to accommodate time varying sequence characteristics. The proposed algorithms can save considerable computational complexity of H.264 reference code with negligible degradation in the RD performance.
Crucial Patterns in Service-Oriented Architecture
Authors: Jaroslav Kral, Michal Zemlicka
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

Service orientation is becoming the leading paradigm of contemporary software. The paradigm has been well known and successfully used in some domains like process control for decades. It is, however, a new paradigm in business scopes for many people and many software vendors. We discuss some implications of this fact. We study patterns in service-oriented methodology, partly in comparison with patterns in object-oriented methodology. We mainly discuss systems called confederation using a document transfer protocol like SOAP-literal. Most important patterns for confederations are user (business) oriented service interfaces, reuse of legacy systems, and the use of so-called architecture services.
Energy-scalable algorithms and protocols for wireless microsensor networks
Authors: W. R. Heinzelman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Wireless microsensor networks lend themselves to trade-offs in energy and quality. In these networks, the individual sensor data per se are not necessarily important to the end user. Rather, it is the combined knowledge of all the sensors that describes what is occurring in the environment. By allowing the algorithms and protocols to adapt the quality of this description, with a corresponding change in energy dissipation, sensor networks can be flexible to the end-user's requirements. In this paper, we provide models for predicting quality and energy and show the advantages of trading off these two parameters. By ensuring that the system operates at a minimum energy for each quality point, the system can achieve both flexibility and energy efficiency, allowing the end-user to maximize system lifetime.
A viscoelastic soft tissue model for haptic surgical simulation
Authors: Iman Brouwer, Vincent Mora, Denis Laroche
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Brain surgeons distinguish tumors from healthy tissue by the way the tissue deforms. Accurately simulating these deformations at haptic update rates is still a challenge. Biological tissues exhibit complex viscoelastic behavior and undergo large deformation during surgery. For this purpose we evaluate the accuracy and computational performance of the Christensen viscoelastic material model in combination with non-linear finite elements. Our results show that realistic viscoelastic properties of brain tissue can be simulated with haptic feedback at 70% of the update rate of the non-viscoelastic large deformation Neo-Hookean model.
Data reduction in spatially colored noise using a virtual uniform linear array
Authors: J. Eriksson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper focuses on beamspace DOA estimation in colored noise. We present a beamspace transformation that preserves the Cramer Rao bounds for the parameters of interest, and at the same time interpolates the true array manifold in such a way that a virtual uniform linear array is obtained in beamspace. Besides the computational savings offered by the dimensionality reduction, the virtual array enables the use of computationally simple algorithms such as root-MUSIC or ESPRIT.
Short-data-record estimators of the MVDR/NMSE filter
Authors: D. A. Pados
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We show that statistical conditional optimization criteria lead to the development of a simple iterative algorithm that starts from the matched filter (or constraint vector of interest) and generates a sequence of filters that converges to the minimum-variance-distortionless-response (MVDR) solution for any positive definite input autocorrelation matrix. When the input autocorrelation matrix is replaced by a conventional sample-average (positive definite) estimate, the algorithm effectively generates a sequence of MVDR filter estimators; the bias converges rapidly to zero and the covariance trace raises slowly and asymptotically to the covariance trace of the familiar sample-matrix-inversion (SMI) estimator. For short-data-records, the early elements of the generated sequence of estimators offer favorable bias/covariance balance and are seen to outperform in mean-square estimation error (constrained-)LMS, RLS-type, and, certainly, SMI estimates.
Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements
Authors: Andreas Abel, Thierry Coquand, Peter Dybjer
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

The decidability of equality is proved for Martin-Lof type theory with a universe á la Russell and typed beta-eta- equality judgements. A corollary of this result is that the constructor for dependent function types is injective, a property which is crucial for establishing the correctness of the type-checking algorithm. The decision procedure uses normalization by evaluation, an algorithm which first interprets terms in a domain with untyped semantic elements and then extracts normal forms. The correctness of this algorithm is established using a PER-model and a logical relation between syntax and semantics.
A locally adaptive perceptual masking threshold model for image coding
Authors: T. D. Tran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper involves designing, implementing, and testing of a locally adaptive perceptual masking threshold model for image compression. This model computes, based on the contents of the original images, the maximum amount of noise energy that can be injected at each transform coefficient that results in perceptually distortion-free still images or sequences of images. The adaptive perceptual masking threshold model can be used as a pre-processor to a JPEG compression standard image coder. DCT coefficients less than their corresponding perceptual thresholds can be set to zero before the normal JPEG quantization and Huffman coding steps. The result is an image-dependent gain in the bit rate needed for transparent coding. In an informal subjective test involving 318 still images in the AT&T Bell Laboratory image database, this model provided a gain in bit-rate saving on the order of 10 to 30%.
Working Session: Software Architecture Competence
Authors: Paul Clements, Rick Kazman, Mark Klein
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Much research in the software architecture field has focused on the purely technical aspects of architecting: architectural styles, documentation, analysis, architecture description languages, reverse engineering, and so forth. In this working session we seek to explore a less exhaustively studied, but equally important, realm: architectural competence. What defines a competent software architect? And equally important, what defines an architecturally competent software development organization? In particular, we seek to better understand the following issues: o What do architects actually do on a day-to-day basis? o What skills and knowledge must a competent architect have? o What does it mean to be a competent architect? o What can an organization do to get the best performance from its software architects? o How can we measure architectural competence of an individual or an organization and how can we increase this? Our goal for this working session is to propose an initial "theory" of architectural competence, even if very informally rendered, and then provide some practical guidance deriving from that theory to practicing architects (and to those who aspire to be architects), as well as technical managers in software development organizations.
Two-dimensional line space Voronoi Diagram
Authors: Stephane Riviere, Dominique Schmitt
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Given a set of points called sites, the Voronoi diagram is a partition of the plane into sets of points having the same closest site. Several generalizations of the Voronoi diagram have been studied, mainly Voronoi diagrams for different distances (other than the Euclidean one), and Voronoi diagrams for sites that are not necessarily points (line segments for example). In this paper we present a new generalization of the Voronoi diagram in the plane, in which we shift our interest from points to lines, that is, we compute the partition of the set of lines in the plane into sets of lines having the same closest site (where sites are points in the plane). We first define formally this diagramand give first properties. Then we use a duality relationship between points and lines to visualize this data structure and give more properties. We show that the size of this line space Voronoi diagram for n sites is in \Theta(n^2) and give an optimal algorithm for its explicit computation. We then show a remarkable relationship between this diagram and the dual arrangement of the sites and give a new result on an arrangement of lines: we show that the size of the zone of a line augmented with its incident faces is still in O(n). We finally apply this result to show that the size of the zone of a line in the line space Voronoi diagram is in O(n).
Defect-tolerant Logic with Nanoscale Crossbar Circuits
Authors: Tad Hogg, Greg Snider
Venue: Journal of Electronic Testing: Theory and Applications (2007)

Crossbar architectures are one approach to molecular electronic circuits for memory and logic applications. However, currently feasible manufacturing technologies for molecular electronics introduce numerous defects so insisting on defect-free crossbars would give unacceptably low yields. Instead, increasing the area of the crossbar provides enough redundancy to implement circuits in spite of the defects. We identify reliability thresholds in the ability of defective crossbars to implement boolean logic. These thresholds vary among different implementations of the same logical formula, allowing molecular circuit designers to trade-off reliability, circuit area, crossbar geometry and the computational complexity of locating functional components. We illustrate these choices for binary adders. For instance, one adder implementation yields functioning circuits 90% of the time with 30% defective crossbar junctions using an area only 1.8 times larger than the minimum required for a defect-free crossbar. We also describe an algorithm for locating a combination of functional junctions that can implement an adder circuit in a defective crossbar.
On the implementation of particle filters for DOA tracking
Authors: W. Ng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper addresses practical issues for the implementation of sequential Monte Carlo sampling schemes, also known as particle filtering, for application to tracking problems. The discussion focusses on ways to improve on previous resampling schemes, resulting in significantly improved performance. These conclusions are demonstrated and supported by examples of application of the particle filter to a sequential tracking of a known number of directions of arrival.
Data driven workflow planning in cluster management systems
Authors: Srinath Shankar, David J. DeWitt
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Traditional scientific computing has been associated with harnessing computation cycles within and across clusters of machines. In recent years, scientific applications have become increasingly data-intensive. This is especially true in the fields of astronomy and high energy physics. Furthermore, the lowered cost of disks and commodity machines has led to a dramatic increase in the amount of free disk space spread across machines in a cluster. This space is not being exploited by traditional distributed computing tools. In this paper we have evaluated ways to improve the data management capabilities of Condor, a popular distributed computing system. We have augmented the Condor system by providing the capability to store data used and produced by workflows on the disks of machines in the cluster. We have also replaced the Condor matchmaker with a new workflow planning framework that is cognizant of dependencies between jobs in a workflow and exploits these new data storage capabilities to produce workflow schedules. We show that our data caching and workflow planning framework can significantly reduce response times for data-intensive workflows by reducing data transfer over the network in a cluster. We also consider ways in which this planning framework can be made adaptive in a dynamic, multi-user, failure-prone environment.
Designing Large Hierarchical Multiprocessor Systems under Processor, Interconnection, and Packaging Advancements
Authors: Debashis Basak, Dhabaleswar K. Panda
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

A general framework for architectural design of large hierarchical multiprocessor systems under rapidly changing packaging, processor, and interconnection technologies is presented. In recent years processor boards with larger area (A) and greater pinouts are becoming feasible. Board interconnection technology has advanced from peripheral connections O(\sqrt A ) to elastomeric surface connections 0(A). As processor and interconnection technology grows, there is a varying demand on the interconnection network of the system. The proposed framework is capable of taking into account all these changes in technologies and, depending on a given set of technological parameters, derive the most optimum topology. The framework is illustrated by considering the design problem of the currently popular class of k-ary n-cube cluster-c scalable architectures.
Modeling Enablers for Successful KM Implementation
Authors: Vittal S. Anantatmula, Shivraj Kanungo
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Knowledge is recognized as a critical resource to gain and sustain competitive advantage in business. While many organizations are employing knowledge management (KM) initiatives, research studies suggest that it is difficult to establish return on investment of such efforts; however, desired results can be obtained through successful implementation. In this research study, using literature review, we identified a set of enablers and barriers of successful KM implementation. Using this set of factors, we developed a questionnaire by applying Interpretive Structural Modeling (ISM) methodology to determine underlying relations among these factors and develop strategies for successful implementation of KM initiatives. Contributions from this research effort should also support organizations in making decisions about improving organizational performance using KM initiatives, and understanding the directional relations among KM factors. Because of the number of participants in our study, applicability of our research results may have certain limitations. To address this inadequacy, as a future research effort, we intend to increase the number of respondents and participant organizations.
Template-based simulation in digital wireless communication
Authors: P. G. Flikkema
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This paper presents a template-based approach for the study of simulation and digital communication developed for use in a graduate-level course in wireless communication. The simulation templates and subsequent original student work are implemented using a graphical block-oriented package. To accelerate the learning process, students are exposed to modeling and simulation via two templates. These templates are also designed to reinforce the extremely important inter-play between theory and simulation. To promote teaming skills, students are organized into groups of two or three for exercises based on the templates and for further investigation of a particular topic.