ppxscal/embedding_network huggingface dataset:
Multiscale blind image restoration using a wavelet decomposition
Authors: D. Krishnan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A multiscale blind image restoration scheme using a wavelet decomposition is presented. The proposed algorithm uses a wavelet decomposition to decompose the degradation model g=Df+w into smaller subband degradation models. Although the subband degradation models are in fact coupled together, our procedure decouples them by estimating the coupling error e/sub s/(D,f) and subtracting the estimate from the subband degraded image g/sub s/. The expectation maximization (EM) algorithm is then applied to each subband signal to estimate simultaneously the subband blur operator D/sub s/ and the original undegraded subband image f/sub s/. Due to the well-posed condition of the subband blur operator, common ringing artifact is suppressed and regularization which trades fidelity for stability is not necessary.
Computing Connected Components and Some Related Applications on a Rap
Authors: Tzong-Wann Kao, Shi-Jinn Horng, Horng-Ren Tsai
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

A reconfigurable array of processors (RAP) is a parallel processing system which has the ability to change dynamically the supported interconnection scheme during the execution of an algorithm.
An ADC-BiST scheme using sequential code analysis
Authors: Erdem S. Erdogan, Sule Ozev
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents a built-in self-test (BiST) scheme for analog to digital converters (ADC) based on a linear ramp generator and efficient output analysis. The proposed analysis method is an alternative to histogram based analysis techniques to provide test time improvements, especially when the resources are scarce. In addition to the measurement of DNL and INL, non-monotonic behavior can also be detected with the proposed technique. We present two implementation options based on how much on-chip resources are available. The ramp generator has a high linearity over a full-scale range of 1V and the generated ramp signal is capable of testing 13 --- bit ADCs. The circuit implementation of the ramp generator utilizes a feedback configuration to improve the linearity having an area of 0.017mm2 in 0.5&mu;m process.
Integrating and Testing a System-Wide Feature in a Legacy System: An Experience Report
Authors: Teemu Kanstren, Mika Hongisto, Kari Kolehmainen
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

This paper describes our experiences with integrating and testing an embedded, system-wide feature called Dynamic Voltage and Frequency Scaling (DVFS) in a software platform for mobile devices. DVFS affects the whole system by scaling the hardware performance levels during run-time. Implementing and testing the basic functionality of DVFS was easy, however verifying that the whole system worked after integration was more difficult. The platform was legacy code which had not been developed with any consideration for this kind of a feature. We had to consider the complex run-time behaviour of the whole platform, including operating system services, device drivers and applications. DVFS could cause problems and failures in almost any part of the system. Based on our experiences, we describe problems in integrating and testing a system-wide feature like DVFS and suggest possible directions for future research to help address some of these problems.
An assessment of networked multimedia and hypermedia
Authors: G. Bjedov, R. Howard
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

This paper is an assessment of our experiences using networked multimedia and hypertext documents at the US Military Academy. Over the last two years, we have taught a course in which the course material is rich in networked multimedia and hypertext. During the last year, we began a formal assessment of the pedagogical effects of using this hypertext and multimedia in the classroom and making it available in the student's rooms. This assessment used a course population of approximately 200 students and consisted of measurements of: (1) the amount of time each lesson the student spent using a particular multimedia tool; and (2) the student's assessment of each tool at the end of the semester. You can use the results of this assessment to plan your development of multimedia and hypertext documents.
Using Object Deputy Model for Aspect Oriented Programming
Authors: Zukai Tang, Zhiyong Peng, Yi Ren
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

This paper presents our exploration that uses Object Deputy Model to support Aspect Oriented Programming in Smalltalk. Our programming model provides a special binding mechanism called deputy relationship by which classes and objects can be connected with deputy classes and deputy objects. We propose that those newly added modeling units can provide functionality of Aspect Oriented Programming, since the separation and integration of system concerns can be easily modeled by our approach. Furthermore, based on the features derived from Object Deputy Model, our approach provides more dynamic facilities that make the aspect activation and advice execution more flexible.
Adaptive feedback cancelling in subbands for hearing aids
Authors: S. Wyrsch
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In this paper a hearing aid concept with recruitment of loudness compensation and acoustic feedback cancellation is presented. Special consideration is given to the acoustic feedback canceler which uses only the available (e.g. speech) input signal for adaptation. In principle, the feedback canceler is adapted to the feedback path in the transform domain using a power-normalized least mean square (LMS) algorithm. The transformation into uniform subbands is based on an augmentation of the modulated lapped transform (MLT). Together with the hearing-loss compensating forward filter the proposed feedback canceler is computationally very efficient.
Performance assessment of 4.8 kbit/s AMBE coding under aeronautical environmental conditions
Authors: S. F. Campos Neto, F. L. Corcoran, J. Phipps, S. Dimolitsas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The quality delivered by low-rate parametric speech coding deployed in commercial mobile satellite systems has to be assessed by formal subjective assessment methods due to their non-linear nature. Aeronautical systems, especially those for deployment in small aircraft, pose yet more stringent conditions due to high environmental noise levels. In this paper the results of an evaluation of the voice quality of DVSI's 4.8 kbit/s Advanced Multi-Band Excited (AMBE) coding under aeronautical channel conditions are presented for listening and conversational experiments. From these assessments it was concluded that that the voice quality of the Inmarsat Aeronautical system will be perceptibly improved when the current full-rate codec is replaced by the AMBE codec.
On global asymptotic stability of fully connected recurrent neural networks
Authors: D. P. Mandic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Conditions for global asymptotic stability (GAS) of a nonlinear relaxation process realized by a recurrent neural network (RNN) are provided. Existence, convergence, and robustness of such a process are analyzed. This is undertaken based upon the contraction mapping theorem (CMT) and the corresponding fixed point iteration (FPI). Upper bounds for such a process are shown to be the conditions of convergence for a commonly analyzed RNN with a linear state dependence.
GUMSAWS: A Generic User Modeling Server for Adaptive Web Systems
Authors: Jie Zhang, Ali A. Ghorbani
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

In this paper we focus on the architecture, design and implementation of a generic user modeling server for adaptive web systems (GUMSAWS), reaching the goals of generality, extendability and replaceability. GUMSAWS acts as a centralized user modeling server to assist several adaptive web systems (possibly in different domains) concurrently. It incrementally builds up user models, provides functions of storing, updating and deleting entries in user profiles, and maintains consistency of user models. Our system is also able to infer missing entries in user profiles from different information sources, including direct information, groups information, association rules and general facts. We further evaluate its inference performance within the context of e-commerce. Experimental results show that the average accuracy of inferring user missing property values from different information resources is found to be almost 70%. We also use a personalized electronic news system to demonstrate the example of our system in use.
Soft Errors: Technology Trends, System Effects, and Protection Techniques
Authors: Subhasish Mitra, Pia Sanda, Norbert Seifert
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Radiation-induced soft errors are getting worse in digital systems manufactured in advanced technologies. Stringent data integrity and availability requirements of enterprise computing and networking applications demand special attention to soft errors in sequential elements and combinational logic. This tutorial will discuss the impact of technology scaling on soft error rates, circuit-level modeling of soft errors, architectural impact of soft errors, challenges associated with evaluation of run-time behaviors of systems in the presence of soft errors, actual data on system behaviors in the presence of soft errors, metrics for quantifying soft error vulnerabilities, design of architectures with Built-in-Soft-Error-Resilience techniques, and actual case studies.
Methods of attacking chaotic encryption and countermeasures
Authors: M. I. Sobhy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Methods of attacking chaotic encryption algorithms have been developed. These methods have been applied to all the published chaotic encryption systems and all these systems are broken in very short computer times. Counter measures have also been developed in order to make chaotic encryption secure. Several examples and results are given.
A simple genetic algorithm for tracing the deformed midline on a single slice of brain CT using quadratic Bézier curves
Authors: Chun-Chih Liao, Furen Xiao, Jau-Min Wong, I-Jen Chiang
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Midline shift (MLS) is one of the most important quantitative features clinicians use to evaluate the severity of brain compression. It can be recognized by modeling brain deformation according to the estimated biomechanical properties of the brain structures. This paper proposes a novel method to identify the deformed midline by decomposing it into three segments: the upper and the lower straight segments representing parts of the tough meninges separating two brain hemispheres, and the central curved segment formed by a quadratic Bézier curve, representing the intervening soft brain tissue. The deformed midline is obtained by minimizing the summed square of the differences across all midline points, applying a genetic algorithm. Our algorithm was evaluated on images containing various pathologies from 81 consecutive patients treated in a single institute over one-year period. The deformed midlines were evaluated by human experts, and the values of midline shift were accurate in 95%.
Improved parallel model combination techniques with split Gaussian mixtures for speech recognition under noisy conditions
Authors: Jeih-weih Hung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

The parallel model combination (PMC) technique has been very successful and frequently used to improve the performance of a speech recognition system under noisy environments. In this approach it is assumed that the log spectrum of speech signals is Gaussian-distributed, which is not always valid especially when the number of mixtures in the HMMs is few. In this paper, a simple approach is proposed to improve the PMC method by splitting the mixtures before the domain transformation process in the PMC is performed, and merging the mixtures back to the original number after the PMC processes are completed. Preliminary experimental results show that the increased number of mixtures during the PMC processes can in fact provide significant improvements over the original PMC method in terms of the recognition accuracies, especially when the SNR is low.
Static Analysis of Business Artifact-centric Operational Models
Authors: Cagdas E. Gerede, Kamal Bhattacharya, Jianwen Su
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Business Artifacts are the core entities used by businesses to record information pertinent to their operations. Business operational models are representations of the processing of business artifacts. Traditional process modeling approaches focus on the actions taken to achieve a certain goal (verb-centric). Business artifact-centric modeling starts by identifying what is acted upon (noun-centric), and constructs business operational models by identifying the tasks/actions that business actors execute to add business value. In this paper, we identify important classes of properties on artifact-centric operational models. In particular, we focus on persistence, uniqueness and arrival properties. To enable a static analysis of these properties, we propose a formal model for artifact-centric operational models. We show that the formal model guarantees persistence and uniqueness. We prove that, while checking an arrival property is undecidable in general, under a restricted version of the formalism, an arrival property can be checked in EXPTIME .
A Visualization Framework for Task-Oriented Modeling Using UML
Authors: Christian F. J. Lange, Martijn A. M. Wijns, Michel R. V. Chaudron
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The UML is a collection of 13 diagram notations to describe different views of a software system. The existing diagram types display model elements and their relations. Software engineering is becoming more and more model-centric, such that software engineers start using UML models for more tasks than just describing the system. Tasks such as analysis or prediction of system properties require additional information such as metrics of the UML model or from external sources, e.g. a version control system. In this paper we identify tasks of model-centric software engineering and information that is required to fulfill these tasks. We propose views to visualize the information to support fulfilling the tasks. This paper reports on industrial case studies and a light-weight user experiment to validate the usefulness of the proposed views that are implemented in our MetricView Evolution tool.
Parallel Region Execution of Loops with Irregular Dependencies
Authors: A. Zaafrani, M. R. Ito
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Several compile time transformations of loops with simple dependencies have been developed in order to expose possible parallelism in these loops. However, once an irregular data dependence is detected, no attempt is usually made to extract any parallel thread from the loop. In this paper, we present the parallel region execution, a new compile time approach for improving the execution of loops with complex dependencies. It consists of dividing the iteration space of the loop into parallel regions and serial regions, where all the iterations in the parallel regions can be fully executed in parallel. Our parallel region execution technique has been tested on the MasPar machine for various examples and generally resulted in a large speedup.
Making exception handling work
Authors: Bruno Cabral, Paulo Marques
Venue: Proceedings of the 2nd conference on Hot Topics in System Dependability - Volume 2 (2006)

Most modern programming languages rely on exceptions for dealing with errors. Although exception handling was a significant improvement over other mechanisms like checking return codes, it's far from perfect. In fact, it can be argued that this mechanism is seriously flawed. In this paper we argue that exception handling should be automatically done at the runtime/operating system level. The motivation is similar to the one that lead to garbage collection: memory management was a tedious and error prone process, thus virtual machines included support for taking care of it. We believe that many exceptions can be automatically dealt with, and recovered, as long as appropriate mechanisms exist in the runtime environment. We believe that this approach may dramatically influence the way programming languages are designed and significantly contribute having more robust code, being actually developed with much less programming effort.
Index-based multidimensional array queries: safety and equivalence
Authors: Rona Machlin
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

We propose a new multidimensional array query model giving array bounds and other shape-related metadata a central role. Arrays are treated as shaped maps from indices to values. Schemas are augmented by shape constraints. Queries also have shape preconditions. Within this framework, we introduce the index-based array queries expressing index reorganizations and value summarizations. We define them via adeclarative, rule-based language with shape-membership constraints inits rule bodies and subscripting and aggregation in its rule heads. We explore safety (including bounds analysis) and query equivalence for various subclasses divided according to the aggregator type, whether we allow disjunctions, and whether we allow (limited) Presburger arithmetic in index and shape terms. We show safety istractable in the nonarithmetic cases, while state safety remains in P in the arithmetic ones. We show that, for a class of monoid-based setand bag aggregators, equivalence reduces to equivalence of index-cores- core queries collecting array indices rather than values. Forset-aggregator queries, we give complete characterizations of equivalence in terms of containment maps and show the equivalenceproblems are in P in the nonarithmetic, conjunctive case and in coNP in all others.
Development of a Tiny Orientation Estimation Device to Operate under Motion and Magnetic Disturbance
Authors: Tatsuya Harada, Taketoshi Mori, Tomomasa Sato
Venue: International Journal of Robotics Research (2007)

A tiny absolute orientation estimating device equipped with a network function has been developed using accelerometers and magnetometers to estimate gravity and the geomagnetic field, respectively. Because accelerometers measure motion other than gravity, a method has been proposed to eliminate the effect of motion. An estimation method is proposed that excludes the effect of magnetic disturbances. An advantage of this estimation method is that models can be switched according to the environment. Sigma Points Kalman Filters (SPKFs) were evaluated to determine the proper filter for the proposed algorithm. A Square-Root Central Difference Kalman Filter (SR-CDKF) was the best method considering stability, accuracy, and calculation cost. Using simulations and the realized device, the proposed algorithm stably estimated the orientation in the presence of motion and magnetic disturbances.
Activity Identification Utilizing Data Mining Techniques
Authors: Jae Young Lee, William Hoff
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

We propose a novel method that, given an unknown moving object trajectory, determines which known activity type the trajectory would belong to. The proposed method utilizes various data mining techniques, including clustering, classification, and Markov model. We collect trajectories of moving objects of known activity types and build one Markov model for each activity type. Given an unknown trajectory, we compute the likelihood of this trajectory belonging to each activity type using the Markov model and the trajectory is determined to belong to the activity type that results in the highest likelihood. We use only location information of moving objects. We do not use any other information such as color, size, or shape of objects, or contextual information. We demonstrate the effectiveness of this method using trajectories of students playing two sports activitiesUltimate Frisbee and volleyball. We show that the accuracy of this method is as high as 94%.
An evolutionary programming approach for detecting novel computer network attacks
Authors: K. P. Anchor, G. B. Lamont, G. H. Gunsch
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Attacks against computer networks are becoming more sophisticated, with adversaries using new attacks or modifying exiting attacks. This research presents an initial step in using an evolutionary programming approach to develop a system for automatically detecting attacks with features similar to known attacks. Initial testing shows the algorithm performs satisfactorily.
Timed Behavior Trees and Their Application to Verifying Real-Time Systems
Authors: Lars Grunske, Kirsten Winter, Robert Colvin
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation currently does not support the concept of time and consequently its application is limited to non-real-time systems. To overcome this limitation we extend the notation to Timed Behavior Trees, which can be semantically defined by timed automata. Based on this extension we are able to include local timing assumptions in a BT model and can verify system-level timing properties with temporal proof methodologies. We validate the use of the new notation by means of a case study. To verify system-level timing properties we translate the model into timed automata and use the tool UPPAAL for timed model checking.
Simple deterministic approximation algorithms for counting matchings
Authors: Mohsen Bayati, David Gamarnik, Dimitriy Katz, Chandra Nair, Prasad Tetali
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in abounded degree graph. Additionally, for an arbitrary graph, weconstruct a deterministic algorithm for computing approximately thenumber of matchings within running time exp(O(√n log2n)),where n is the number of vertices. Our approach is based on the correlation decay technique originating in statistical physics. Previously thisapproach was successfully used for approximately counting thenumber of independent sets and colorings in some classes of graphs [1, 24, 6].Thus we add another problem to the small, but growing, class of P-complete problems for whichthere is now a deterministic FPTAS.