ppxscal/embedding_network huggingface dataset:
An Improved Geometric Deformable Model for Color Image Segmentation
Authors: Shiguo Huang, Mingquan Zhou, Guohua Geng
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

There were some difficulties when applying current geometric deformable models to color image segmentation. In order to solve the problem, different edge detectors are compared, and then CGAC-an improved geometric deformable model is developed by applying a new edge detector from Di Zenzo multivalued geometry of color image to GAC. The experimental results show that when applying GAC channel by channel directly to color image segmentation, different boundaries of the same object represented by zero level sets in different channels can be obtained but they can not be identified which boundary is the exact boundary of object. On the contrary, when the evolution of zero level sets stops by applying CGAC, ideal boundary of object, which coincides with human perception, is obtained.
RiverInk--An Extensible Framework for Multimodal Interoperable Ink
Authors: Jonathan Neddenriep, William G. Griswold
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Pen-based interfaces offer exciting opportunities in ubiquitous computing by enabling new hardware form factors and socially acceptable computing tasks. However, prevailing ink representations are not compatible across devices or even within vendors, compromising interoperability and hence true ubiquity. We propose a lossless multimodal multi-format XML ink framework called RiverInk that overcomes many of the interoperability issues faced in using platform-specific standards. This paper motivates the interoperability problems created by ubiquity, and then describes the design of RiverInk's format, APIs, and ink controls. RiverInk's framework encompasses interoperable support for both archival and streaming ink-based applications, and a range of alternatives for platforms that do not currently support ink. Three RiverInk applications were developed within the ActiveCampus ubiquitous computing environment to demonstrate both the ease of adding interoperability to an ink-based application and the degree of interoperability provided. The adaptability of the framework to new platforms is discussed.
On convergence analysis of fractionally spaced adaptive blind equalizers
Authors: Zhi Ding
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We study the convergence analysis of fractionally-spaced adaptive blind equalizers. We show that based on the trivial and nontrivial nullspaces of a channel convolution matrix, all equilibria, can be classified as channel dependent equilibria (CDE) or algorithm dependent equilibria (ADE). Because oversampling provides channel diversity, the nullspace of the channel convolution matrix is affected. We show that fractionally spaced equalizers (FSE) does not possess any CDE if a length-and-zero condition is satisfied. We characterize the global convergence ability of several popular blind adaptive algorithms simply based on their ADE. We also present an FSE implementation of the super-exponential algorithm. We show that the FSE implementation does not introduce any non-ideal approximation.
On the cognitive processes of human perception
Authors: Yingxu Wang
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

This paper presents a rigorous treatment of human perceptual processes such as emotions, motivations, and attitudes. A set of mathematical models and formally described cognitive processes is developed. The interactions and relationships between motivation and attitude are formally described in real-time process algebra (RTPA). Applications of the mathematical models of motivations and attitudes in software engineering are demonstrated. This work is the detailed description of a part of the layered reference model of the brain (LRMB) that provides a comprehensive model for explaining the fundamental cognitive processes of the brain and their interactions.
A multi-user Kurtosis algorithm for blind source separation
Authors: C. B. Papadias
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In earlier work we presented a set of necessary and sufficient conditions for the blind separation of a number of independent identically distributed (i.i.d.) source signals that share the same distribution and are mutually independent. We present an algorithm for implementing the multi-user Kurtosis (MUK) constrained optimization criterion suggested by these conditions. The algorithm is derived directly from the MUK cost function via a stochastic-gradient update at each iteration, followed by a Gram-Schmidt orthogonalization to project onto the criterion's constraint. A convergence analysis of the derived algorithm reveals that it is globally convergent (in the absence of noise) to a desired setting that recovers all the input sources, up to an arbitrary phase rotation each.
Network configuration management via model finding
Authors: Sanjai Narain
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

Complex, end-to-end network services are set up via the configuration method: each component has a finite number of configuration parameters each of which is set to a definite value. End-to-end network service requirements can be on connectivity, security, performance and fault-tolerance. However, there is a large conceptual gap between end-to-end requirements and detailed component configurations. To bridge this gap, a number of subsidiary requirements are created that constrain, for example, the protocols to be used, and the logical structures and associated policies to be set up at different protocol layers. By performing different types of reasoning with these requirements, different configuration tasks are accomplished. These include configuration synthesis, configuration error diagnosis, configuration error fixing, reconfiguration as requirements or components are added and deleted, and requirement verification. However, such reasoning is currently ad hoc. Network requirements are not even precisely specified hence automation of reasoning is impossible. This is a major reason for the high cost of network management and total cost of ownership. This paper shows how to formalize and automate such reasoning using a new logical system called Alloy. Alloy is based on the concept of model finding. Given a first-order logic formula and a domain of interpretation, Alloy tries to find whether the formula is satisfiable in that domain, i.e., whether it has a model. Alloy is used to build a Requirement Solver that takes as input a set of network components and requirements upon their configurations and determines component configurations satisfying those requirements. This Solver is used in different ways to accomplish the above reasoning tasks. The Solver is illustrated in depth by carrying out a variety of these tasks in the context of a realistic fault-tolerant virtual private network with remote access. Alloy uses modern satisfiability solvers that solve millions of constraints in millions of variables in seconds. However, poor requirements can easily nullify such speeds. The paper outlines approaches for writing efficient requirements. Finally, it outlines directions for future research.
Determining Configuration Probabilities of Safety-Critical Adaptive Systems
Authors: Rasmus Adler, Marc Forster, Mario Trapp
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This article presents a novel technique to calculate the probability that an adaptive system assumes a configuration. An important application area of dynamic adaptation is the cost-efficient development of dependable embedded systems. Dynamic adaptation exploits implicitly available redundancy, reducing the need for hardware redundancy, to make systems more available, reliable, survivable and, ultimately, more safe. Knowledge of configuration probabilities of a system is an essential requirement for the optimization of safety efforts in development. In perspective, it is also a prerequisite for dependability assessment. Our approach is based on a modeling language for complex reconfiguration behavior. We transform the adaptation model into a probabilistic target model that combines a compositional fault tree with Markov chains. This hybrid model can be evaluated efficiently using a modified BDD-based algorithm. The approach is currently being implemented in an existing reliability modeling tool.
Towards an Open Source Toolkit for Ubiquitous Device Authentication
Authors: Rene Mayrhofer
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Most authentication protocols designed for ubiquitous computing environments try to solve the problem of intuitive, scalable, secure authentication of wireless communication. Due to the diversity of requirements, protocols tend to be implemented within specific research prototypes and can not be used easily in other applications. We propose to develop a common toolkit for ubiquitous device authentication to foster wide usability of research results. This paper outlines design goals and presents a first, freely available implementation.
Computing resource bounds using inclusion scheduling
Authors: C. Chantrapornchai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We propose an framework to estimate resource bounds. The framework takes imprecise system characteristics and multiple design attributes into account. Considering a design goal, an initial bound is first generated. Then, a polynomial-time process called inclusion scheduling is used as a tool to determine a schedule under impreciseness and improve the bounds. Our experiments show that considering impreciseness can achieve a better bound than the traditional approach.
Denial of service via algorithmic complexity attacks
Authors: Scott A. Crosby, Dan S. Wallach
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

We present a new class of low-bandwidth denial of service attacks that exploit algorithmic deficiencies in many common applications' data structures. Frequently used data structures have "average-case" expected running time that's far more efficient than the worst case. For example, both binary trees and hash tables can degenerate to linked lists with carefully chosen input. We show how an attacker can effectively compute such input, and we demonstrate attacks against the hash table implementations in two versions of Perl, the Squid web proxy, and the Bro intrusion detection system. Using bandwidth less than a typical dialup modem, we can bring a dedicated Bro server to its knees; after six minutes of carefully chosen packets, our Bro server was dropping as much as 71% of its traffic and consuming all of its CPU. We show how modern universal hashing techniques can yield performance comparable to commonplace hash functions while being provably secure against these attacks.
A general approach to heteroscedastic linear regression
Authors: David S. Leslie, Robert Kohn, David J. Nott
Venue: Statistics and Computing (2007)

Our article presents a general treatment of the linear regression model, in which the error distribution is modelled nonparametrically and the error variances may be heteroscedastic, thus eliminating the need to transform the dependent variable in many data sets. The mean and variance components of the model may be either parametric or nonparametric, with parsimony achieved through variable selection and model averaging. A Bayesian approach is used for inference with priors that are data-based so that estimation can be carried out automatically with minimal input by the user. A Dirichlet process mixture prior is used to model the error distribution nonparametrically; when there are no regressors in the model, the method reduces to Bayesian density estimation, and we show that in this case the estimator compares favourably with a well-regarded plug-in density estimator. We also consider a method for checking the fit of the full model. The methodology is applied to a number of simulated and real examples and is shown to work well.
Software Reliability Engineering: A Roadmap
Authors: Michael R. Lyu
Venue: 2007 Future of Software Engineering (2007)

Software reliability engineering is focused on engineering techniques for developing and maintaining software systems whose reliability can be quantitatively evaluated. In order to estimate as well as to predict the reliability of software systems, failure data need to be properly measured by various means during software development and operational phases. Moreover, credible software reliability models are required to track underlying software failure processes for accurate reliability analysis and forecasting. Although software reliability has remained an active research subject over the past 35 years, challenges and open questions still exist. In particular, vital future goals include the development of new software reliability engineering paradigms that take software architectures, testing techniques, and software failure manifestation mechanisms into consideration. In this paper, we review the history of software reliability engineering, the current trends and existing problems, and specific difficulties. Possible future directions and promising research subjects in software reliability engineering are also addressed.
Dynamic signal mixtures and blind source separation
Authors: D. Obradovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Methods for blind source separation (BSS) from linear instantaneous signal mixtures have drawn a significant attention due to their ability to recover original independent non-Gaussian sources without analyzing their temporal statistics. Hence, original voices or images (module permutation and linear scaling) are extracted from their mixtures without modeling the dynamics of the signals. The typical methods for performing blind source separation are linear independent component analysis (ICA) and the infomax method. Linear ICA directly penalizes a suitably chosen measure of the statistical dependence between the extracted signals. These measures are either obtained from the information theoretic postulates such as the mutual information or from the cumulant expansion of the associated probability density functions. The infomax method is based on the entropy maximization of the non-linear transformation of the separated signals. This paper analyzes extensions of the instantaneous blind source separation techniques to the case of linear dynamic signal mixtures. Furthermore, the paper introduces a novel method based on combining time delayed decorrelation (TDD) with the minimization of the cumulant cost function. TDD is used to obtain an acceptable initial condition for the cumulant based cost function optimization in order to reduce the numerical complexity of the latter method. This combined approach is illustrated on two examples including a real life cocktail party example.
Automated generation of news content hierarchy by integrating audio, video, and text information
Authors: Qian Huang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper addresses the problem of generating semantically meaningful content by integrating information from different media. The goal is to automatically construct a compact yet meaningful abstraction of the multimedia data that can serve as an effective index table, allowing users to browse through large amounts of data in a non-linear fashion with flexibility, efficiency, and confidence. We propose an integrated solution in the context of broadcast news that simultaneously utilizes cues from video, audio, and test to achieve the goal. Some experimental results are presented and discussed.
Navigating Large Clustered Graphs with Triple-Layer Display
Authors: Mao Lin Huang, Quang Vinh Nguyen
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper presents a technique for navigating large clustered graphs with triple-layer display. Although our navigation and interaction technique can be applied independently to any graph layout algorithms, in our implementation, our navigation algorithm is cooperated with a clustered graph layout algorithm. In short, we provide users with the display of three levels of contextual information for navigation. They are the display of full-context, the display of the current-context view and the display of the focused view. Our technique not only allows users to navigate hierarchically up and down through the entire clustered graph, but also provides a way to navigate multiple clusters concurrently. We also use animation to preserve the users' mental maps during the interaction.
Learning to change the world: a case study of a mechanical engineering design course
Authors: W. C. Newstetter, J. I. Kolodner
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The National Science Foundation in collaboration with its engineering school coalition partners has been exploring methods for improving undergraduate engineering education. This initiative began in response to a 1992 survey of engineering deans and employers that identified specific weaknesses in engineering education. In response to this survey NSF and its partners have been attempting to remediate the identified weaknesses through specific educational practices. These include providing opportunities for: creative problem formulation and solving experiences; designing in teams; developing written, spoken and graphical communication skills; and using computers as cognitive tools. We know that engineering students need such opportunities to develop the kinds of skills that anoint them to change the world, but we know little about the pedagogic issues involved in developing such skills. This paper reports on a preliminary ethnographic study of a mechanical engineering design classroom. Although not developed in response to the NSF initiative, the course as it has evolved over the years has incorporated most of the the aforementioned remediation recommendations.
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Authors: Louis-Noel Pouchet, Cedric Bastoul, Albert Cohen, Nicolas Vasilache
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compilers. Because compiler heuristics rely on simplistic performance models, and because they are bound to a limited set of transformations sequences, they only uncover a fraction of the peak performance on typical benchmarks. Iterative optimization is a maturing framework to address these limitations, but so far, it was not successfully applied complex loop transformation sequences because of the combinatorics of the optimization search space. We focus on the class of loop transformation which can be expressed as one-dimensional affine schedules. We define a systematic exploration method to enumerate the space of all legal, distinct transformations in this class. This method is based on an upstream characterization, as opposed to state-of-the-art downstream filtering approaches. Our results demonstrate orders of magnitude improvements in the size of the search space and in the convergence speed of a dedicated iterative optimization heuristic.
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
Authors: Éric Colin De Verdière, Francis Lazarus
Venue: Journal of the ACM (JACM) (2007)

We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of the surface: a set of disjoint simple cycles that cut the surface into pairs of pants (spheres with three holes). We solve this problem in a framework where the cycles are closed walks on the vertex-edge graph of a combinatorial surface that may overlap but do not cross. We give an algorithm that transforms an input pants decomposition into another homotopic pants decomposition that is optimal: each cycle is as short as possible in its homotopy class. As a consequence, finding a shortest cycle homotopic to a given simple cycle amounts to extending the cycle into a pants decomposition and to optimizing it: the resulting pants decomposition contains the desired cycle. We describe two algorithms for extending a cycle to a pants decomposition. All algorithms in this article are polynomial, assuming uniformity of the weights of the vertex-edge graph of the surface.
Automatic phonetic transcription of large speech corpora
Authors: Christophe Van Bael, Lou Boves, Henk van den Heuvel, Helmer Strik
Venue: Computer Speech and Language (2007)

Most large speech corpora are delivered with a lexicon that contains a canonical transcription of every word in the orthographic transcription. Such a lexicon can be used for generating a hypothetical 'canonical' phonetic transcription from the orthography. In addition, time and money permitting, some speech corpora are provided with a manually verified broad phonetic transcription of at least part of the material. Since the manual verification of phonetic transcriptions is time-consuming and expensive, we investigated whether existing automatic transcription procedures and combinations of such procedures can offer a quick and cheap alternative for the generation of phonetic transcriptions like the manually verified transcriptions delivered with large speech corpora. In our study, we used 10 automatic transcription procedures to generate a broad phonetic transcription of well-prepared speech (read-aloud texts) and spontaneous speech (telephone dialogues) from the Spoken Dutch Corpus. The performance was assessed in terms of the number and the nature of the discrepancies between the emerging phonetic transcriptions and the corresponding manually verified phonetic transcriptions delivered with the Spoken Dutch Corpus. Some of the resulting automatic transcriptions appeared to be comparable to the manually verified transcriptions.
Designing packet buffers with statistical guarantees
Authors: G. Shrimali, I. Keslassy, N. McKeown
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Packet buffers are an essential part of routers. In high-end routers, these buffers need to store a large amount of data at very high speeds. To satisfy these requirements, we need a memory with the the speed of SRAM and the density of DRAM. A typical solution is to use hybrid packet buffers built from a combination of SRAM and DRAM, where the SRAM holds the heads and tails of per-flow packet FIFOs and the DRAM is used for bulk storage. The main challenge then is to minimize the size of the SRAM while providing reasonable performance guarantees. We analyze a commonly used hybrid architecture from a statistical perspective, and investigate how small the SRAM can get if the packet buffer designer is willing to tolerate a certain drop probability. We introduce an analytical model to represent the SRAM buffer occupancy, and derive drop probabilities as a function of SRAM size under a wide range of statistical traffic patterns. By our analysis, we show that, for low drop probability, the required SRAM size is proportional to the number of flows.