ppxscal/embedding_network huggingface dataset:
Image enhancement using multiscale differential operators
Authors: Yu-Ping Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Differential operators have been widely used for multiscale geometric descriptions of images. Efficient computation of these differential operators can be obtained by taking advantage of the spline techniques. We make use of a special class of these operators for image enhancement, with a particular application to chromosome image enhancement. These operators constitute a translation invariant wavelet transform well suited for the structural description of chromosome geometry. Based on the fact that the geometrical features like edges are correlated between different scales in the representation, a novel algorithm is designed to enhance the salient features of the image. Comparisons of this algorithm with other approaches are presented.
A model of dynamic auditory perception and its application to robust speech recognition
Authors: B. Strope
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper derives a non-linear model of dynamic auditory perception. The model consists of a linear filter bank with carefully-parameterized logarithmic additive adaptation after each filter output. An extensive series of perceptual forward masking experiments, together with previously reported forward masking data, determine the model's dynamic parameters. The model's prediction error of forward masking data has a standard deviation of less than 3.3 dB across wide ranging frequencies, input levels, and probe delay times. We present an initial evaluation of the dynamic model as a front end for an isolated word recognition system, and show an improvement in the robustness to background noise when compared to MFCC and LPCC front ends.
Automatic recognition of Danish natural numbers for telephone applications
Authors: C. N. Jacobsen, J. G. Wilpon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

In major areas of the world, it is custom to cluster the digits of long numbers into groups of two or three digits and pronounce them using natural numbers such as "eighty/five" rather than the digits 'eight five'. Forcing the users of automatic services to change their speaking styles could seriously limit the acceptance of such services. So far, however, it has not been considered possible to obtain sufficiently high accuracies with natural numbers. In this paper, we present a series of experiments that improved our string accuracy to 93.3% for Danish 8-digit telephone numbers. This is very close to the accuracy obtained for connected digits, 95.3%, in the same language.
Fast and accurate routing demand estimation for efficient routability-driven placement
Authors: Peter Spindler, Frank M. Johannes
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents a fast and accurate routing demand estimation called RUDY and its efficient integration in a force-directed quadratic placer to optimize placements for routability. RUDY is based on a Rectangular Uniform wire DensitY per net and accurately models the routing demand of a circuit as determined by the wire distribution after final routing. Unlike published routing demand estimation, RUDY depends neither on a bin structure nor on a certain routing model to estimate the behavior of a router. Therefore RUDY is independent of the router. Our fast and robust force-directed quadratic placer is based on a generic demand-and-supply model and is guided by the routing demand estimation RUDY to optimize placements for routability. This yields a placer which simultaneously reduces the routing demand in congested regions and increases the routing supply there. Therefore our placer fully utilizes the potential to optimize the routability. This results in the best published routed wirelength of the IBMv2 benchmark suite until now. In detail, our approach outperforms mPL, ROOSTER, and APlace by 9%, 8%, and 5%, respectively. Compared by the CPU times, which ROOSTER needs to place this benchmark, our routability optimization placer is eight times faster.
Stability criteria for Arnoldi-based model-order reduction
Authors: I. M. Elfadel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Pade approximation is an often-used method for reducing the order of a finite-dimensional, linear, time invariant, signal model. It is known to suffer from two problems: numerical instability during the computation of the Pade coefficients and lack of guaranteed stability for the resulting reduced model even when the original system is stable. We show how the numerical instability problem can be avoided using the Arnoldi algorithm applied to an appropriately chosen Krylov subspace. Moreover, we give an easily computable sufficient condition on the system matrix that guarantees the stability of the reduced model at any approximation order.
Audio-visual intent-to-speak detection for human-computer interaction
Authors: P. De Cuetos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Introduces a practical system that aims to detect a user's intent to speak to a computer, by considering both audio and visual cues. The whole system is designed to intuitively turn on the microphone for speech recognition without needing to click on a mouse, thus improving the human-like communication between users and computers. The first step is to detect a frontal face through a simple desktop video camera image, by using some well-known image processing techniques for face and facial feature detection on one image. The second step is an audio-visual speech event detection that combines both visual and audio indications of speech. In this paper, we consider visual measures of speech activity as well as audio energy to determine if the previously detected user is actually speaking or not.
Practical and efficient implementation of the Levinson algorithm for multichannel sound reproduction
Authors: J. J. Lopez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

This paper addresses the problem of computation of inverse filters in transauralization and multichannel sound reproduction. A huge set of block Toeplitz equations must be usually solved in order to design good filters under the least squares error criterion. A practical and efficient method of main matrix construction and the solution of the set of equations are thoroughly described. An optimal implementation of the Levinson algorithm in two steps that dramatically reduces the computational cost is also presented. The algorithm uses the generalized Levinson recursion for block matrices as a first step and the Gohberg-Semencul formula as the second step. This allows to save about 75% of operations in a typical transauralization problem. A study of the performance of the algorithm in terms of computational cost compared to other algorithms is also carried out.
A hybrid approach to learn Bayesian networks using evolutionary programming
Authors: K. Y. Lee
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A novel hybrid framework is reported that improves upon our previous work, MDLEP, which uses evolutionary programming to solve the difficult Bayesian network learning problem. A new merge operator is also introduced that further enhances the efficiency. As experimental results suggest, our hybrid approach performs significantly better than MDLEP. 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
Induction for positive almost sure termination
Authors: Isabelle Gnaedig
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

In this paper, we propose an inductive approach to prove positive almost sure termination of probabilistic rewriting under the innermost strategy. We extend to the probabilistic case a technique we proposed for termination of usual rewriting under strategies. The induction principle consists in assuming that terms smaller than the starting terms for an induction ordering are positively almost surely terminating. The proof is developed in generating proof trees, modelizing rewriting trees, in alternatively applying abstraction steps, expressing the application of the induction hypothesis, and narrowing steps, simulating the possible rewriting steps after abstraction. This technique can be fully automatized, in particular for rewrite systems on constants, very useful to modelize probabilistic protocols.
Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation
Authors: Xiangjun Zhang, Xiaolin Wu, Feng Wu
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Considering that quincunx lattice is a more e±cient spatial sampling scheme than square lattice, we investigate a new approach of image coding for quincunx sample arrangement. The key findings are: 1) adaptive directional lifting is particularly suited to decorrelate samples on quincunx lattice, and 2) quincunx samples can be processed by a 2D piecewise autoregressive model to reproduce the image of conventional square pixel grid, while preserving high frequency spatial features well. By incorporating these two techniques into the encoder and decoder respectively, we are able to improve the performance of JPEG 2000 image codec at low to modest bit rates. Since an image can be easily split into quincunx segments, this work has signi¯cance for multiple description image/video coding as well.
Modified B-spline interpolators and filters: synthesis and efficient implementation
Authors: K. Egiazarian
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Interpolation techniques are widely used in many applications of signal processing. This paper is devoted to synthesizing and efficiently implementing a class of generalized spline-interpolators. A new parametric class of generalized B-splines is introduced. It contains as special cases B-splines and alternative B-splines. In the most general case, the proposed spline functions can be represented as a linear combination of the weighted and shifted classic B-splines of different orders. The applicability of the resulting splines to discrete-time interpolation is investigated and compared to classical splines. Furthermore, the implementation of the discrete-time interpolation with the aid of efficient digital filter structures is considered in detail.
Surface modeling using multi-view range and color images
Authors: Yiyong Sun, Joonki Paik, Andreas Koschan, Mongi Abidi
Venue: Integrated Computer-Aided Engineering (2003)

This paper presents a framework of surface modeling from multi-view range and color images. The input to the algorithms are pairs of triangle meshes and color images, and each pair is obtained by a single-view scanning. In the proposed framework, the triangle meshes from raw data are first processed by the novel surface denoising algorithm based on area decreasing flow, which avoids the difficulty in curvature estimation of mean curvature flow. The proposed adaptive triangle mesh smoothing algorithm is based on crease edge strength of each vertex and uses tensor voting of the normal vector field inside a geodesic window. Surfaces from multiple views are then integrated into a single 3D model. Two integration approaches are discussed, which are based on mesh zippering and implicit surface fusion, respectively. Color images are incorporated to generate textured models. The reconstructed surfaces are finally post-processed by volumetric smoothing and filling the holes. Experimentation using two different range scanners shows that the proposed surface modeling framework is robust and flexible in processing data from different types of range scanners.
Realizable MIMO decision feedback equalizers
Authors: C. Tidestav
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A general MMSE decision feedback equalizer (DFE) for multiple input-multiple output channels is presented. It is derived under the constraint of realizability, requiring finite smoothing lag and causal filters both in the forward and feedback link. The proposed DFE, which provides an optimal structure as well as optimal filter degrees, is obtained as an explicit solution in terms of the channel and noise description. A generalization of the scalar zero-forcing DFE is also presented. Conditions for the existence of such an equalizer are discussed. We argue that when no zero-forcing equalizer exists, poor near-far resistance of the corresponding optimal minimum mean square error DFE can be expected. A numerical example indicates the potential advantages of using a decision feedback equalizer with appropriate structure. The main improvements are obtained at moderate to high signal-to-noise ratios.
Frequency selective NEXT cancellation
Authors: A. M. Sayed
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper, a frequency selective NEXT cancellation algorithm for xDSL transmission is proposed. NEXT is cancelled by subtracting estimated noise from the received signal. An adaptive filter is used to estimate the band limited interference noise from the interference data. This algorithm is applied for a DSL application where asymmetric and symmetric services coexist. It showed about 40% improvement of transmission speed.
Operations on M-Convex Functions on Jump Systems
Authors: Yusuke Kobayashi, Kazuo Murota, Ken’ichiro Tanaka
Venue: SIAM Journal on Discrete Mathematics (2007)

A jump system is a set of integer points with an exchange property, which is a generalization of a matroid, a delta-matroid, and a base polyhedron of an integral polymatroid (or a submodular system). Recently, the concept of M-convex functions on constant-parity jump systems was introduced by Murota as a class of discrete convex functions that admit a local criterion for global minimality. M-convex functions on constant-parity jump systems generalize valuated matroids, valuated delta-matroids, and M-convex functions on base polyhedra. This paper reveals that the class of M-convex functions on constant-parity jump systems is closed under a number of natural operations such as splitting, aggregation, convolution, composition, and transformation by networks. The present results generalize hitherto-known similar constructions for matroids, delta-matroids, valuated matroids, valuated delta-matroids, and M-convex functions on base polyhedra.
Process Evolution with Atomicity Consistency
Authors: Chunyang Ye, S. C. Cheung, W. K. Chan
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The processes enacting cross-organizational collaboration continually evolve to adapt to changing business environments. These processes may evolve at any time during collaboration when collaborative organizations should respond timely to critical environment changes. Atomicity is an important requirement for maintaining application consistency. The satisfaction of this requirement at the commencement of collaboration may no longer be held after process evolution. This paper analyzes three basic scenarios of process evolution in cross- organizational collaboration, and proposes a collection of guidelines to govern atomicity-preserving evolution during collaboration.
Towards a semantic web of community, content and interactions
Authors: Katia P. Sycara
Venue:  (2006)

The Web plays a critical role in hosting Web communities, their content and interactions. A prime example is the open source software (OSS) community, whose members, including software developers and users, interact almost exclusively over the Web. The OSS community constantly generates, shares and refines content in the form of software code through active interaction over the Web on code design and bug resolution processes. The knowledge and implementation experiences around the software content are implicit in the interactions in the community discussion forums on the Web. The Semantic Web is an envisaged extension of the current Web, in which content is given a well-defined meaning, through the specification of metadata and ontologies, that can be understood by software agents. This increases the utility of the content and enables information from heterogeneous sources to be integrated. Although the individual components of a Semantic Web are fairly well-understood, there is a research gap in the application of Semantic Web to a specific domain. This thesis work explores the application of the Semantic Web in the context of a typical OSS community, the OpenACS community, with a focus on the interactions around the bug resolution process. The research answers three questions: How to create a Semantic Web around the OSS community, the software content, and the interactions? How to use the Semantic Web in the bug resolution process? What is the potential impact of the Semantic Web on the bug resolution process, and vice versa? To answer these questions, we developed a prototype Semantic Web system for OSS communities, Dhruv. Dhruv provides an enhanced semantic interface to bug resolution messages and recommends related software objects and artifacts. Dhruv uses an integrated model of the OpenACS community, the software, and the Web interactions, which is semi-automatically populated from the existing artifacts of the community. Comparison of Dhruv's recommendations with historical bug resolution data reveals that Dhruv is able to recommend relevant artifacts for bug resolution messages. A qualitative think-aloud study of Dhruv with OpenACS community members indicates that Dhruv has high potential of being useful to the OpenACS community. Study participants found the enhanced semantic interface particularly compelling.
Doing Numerical Cosmology with the Cactus Code
Authors: Dumitru N. Vulcanov
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The article presents some aspects concerning the construction of a new thorn for the Cactus code, a complete 3-dimensional machinery in numerical relativity. This thorn is dedicated to numerical simulations in cosmology, that means it can provide evolutions of different cosmological models, mainly based on Friedman- Robertson-Walker metric. Some numerical results are presented, testing the convergence, stability and the applicability of the code.
Exploring medical data using visual spaces with genetic programming and implicit functional mappings
Authors: Julio J. Valdes, Robert Orchard, Alan J. Barton
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Two medical data sets (Breast cancer and Colon cancer) are investigated within a visual data mining paradigm through the unsupervised construction of virtual reality spaces using genetic programming and classical optimization (for comparison purposes). The desired visual spaces are such that a modified genetic programming approach was proposed in order to generate programs representing vector functions. The extension leads to populations that are composed of forests, instead of single expression trees. No particular kind of genetic programming algorithm is required due to the generic nature of the approach taken in the paper. The results (visual spaces) show that the relationships between the data objects and their classes can be appreciated in all of the obtained spaces regardless of the mapping error. In addition, the spaces obtained with genetic programming resulted in lower mapping errors than a classical optimizer and produced relatively simple equations. Further, the set of obtained equations can be statistically analyzed in terms of the original attributes in order to further the understanding of the derivation of the new nonlinear features that are constructed. Thus, explicit mappings provided by genetic programming can be used for feature selection and generation in data mining where scalar and/or vector functions are involved.
Chimera: affordable desktop molecular modeling on Linux workstations
Authors: David Konerding, Conrad Huang, Thomas Ferrin
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

Molecular modeling is a well-established tool used in a variety of scientific disciplines, including pharmaceutical chemistry (the development of new drugs) and bioinformatics (the application of information theory to biological sequence analysis) [1]. Molecular modeling is frequently used for planning experiments, analyzing the results of experiments, and for making predictions in situations where technical limitations make experiments difficult or impossible. Recently the Linux/GNU operating system, running on inexpensive desktop PCs using video cards with powerful hardware graphics acceleration, has grown very popular in molecular modeling due to its low cost, low barrier to use, and compatibility with existing UNIX workstations. The Computer Graphics Lab at the University of California San Francisco [2] is developing an advanced modeling application, Chimera [4], to succeed its well-regarded but aging application, MidasPlus [3]. Chimera is written in C++ and Python and emphasizes programmable extensibility as its primary feature. In recognition of the increasing interest in Linux as a molecular modeling platform, we undertook a port of Chimera to Linux. Porting Chimera to Linux represented a number of challenges which had to be overcome; we describe the problems we faced and our solutions.
The acquisition of expertise in software engineering education
Authors: J. E. Sims-Knight
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The authors' goal in this paper is to examine the nature of expertise in software development and then to analyze the components of process education necessary to promote its development. This analysis includes three aspects of expertise: (a) declarative knowledge ("knowledge that"); (b) procedural knowledge ("how to knowledge"); and (c) metacognitive knowledge (self-monitoring, agency, reflection). These "flavors" of knowing play an integral role in software development. Traditional education, with its emphasis on textbooks and lectures as its primary pedagogical tools, can teach declarative knowledge, but that knowledge is not automatically connected with doing. The major impact of process education has been to provide a more effective learning environment that focuses on the development of procedural knowledge. It has become clear that procedural and declarative knowledge alone are not sufficient for the development of expertise. Students need to learn how to reflect on both the problem at hand and on the ways they are solving the problem if they are to become agents for their own improvement. Although process educators are often aware and desirous of facilitating metacognitive knowledge, it is rarely addressed explicitly. In this paper, the authors connect issues of metacognitive knowledge to the evolution of software development skill. Their analysis leads to recommendations for structuring software engineering education activities throughout the students' program of study to maximize the development of all three components of expertise. They include examples from their work on integrating process activities in undergraduate computer science instruction.