ppxscal/embedding_network huggingface dataset:
Convergence Theorems for Generalized Alternating Minimization Procedures
Authors: Asela Gunawardana, William Byrne
Venue: The Journal of Machine Learning Research (2005)

The EM algorithm is widely used to develop iterative parameter estimation procedures for statistical models. In cases where these procedures strictly follow the EM formulation, the convergence properties of the estimation procedures are well understood. In some instances there are practical reasons to develop procedures that do not strictly fall within the EM framework. We study EM variants in which the E-step is not performed exactly, either to obtain improved rates of convergence, or due to approximations needed to compute statistics under a model family over which E-steps cannot be realized. Since these variants are not EM procedures, the standard (G)EM convergence results do not apply to them. We present an information geometric framework for describing such algorithms and analyzing their convergence properties. We apply this framework to analyze the convergence properties of incremental EM and variational EM. For incremental EM, we discuss conditions under these algorithms converge in likelihood. For variational EM, we show how the E-step approximation prevents convergence to local maxima in likelihood.
Designing Highly Adaptive Tutorial Learning Units
Authors: Alfred Bork
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This tutorial will show the participants how to design adaptive tutorial learning units for the computer. It will also consider briefly implementation and evaluation of the designs.
Application of Fuzzy Control in Switched Reluctance Motor Speed Regulating System
Authors: Weiguo Liu, Shoujun Song
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

The applications of switched reluctance motors have being increased day by day, but it is a multivariable and strong-coupling highly nonlinear system, there are lots of difficulties to build its model. In this paper, combining with the quasi-linear model brought forward by Miller, the small-signal dynamic model of the switched reluctance motor is built based on matlab/simulink environment. This model is very suitable for research of control strategies. In industrial automation fields, conventional PID control is acting a very important role, but its robustness is very weak. In this paper, on the basis of conventional PID controller, fuzzy control technique is introduced. Two improved PID controller are proposed: Fuzzy_PID compound control and fuzzy parameters self-tuning PID control. The former combines the advantages of PID and fuzzy control, while the latter uses fuzzy technique to adjust the parameters of PID controller dynamically. The simulation results show that the two control strategies can not only improve the dynamic and static performances of the system effectively, but also enhance robustness of the system.
Exploring Web Search Results Using Coordinated Views
Authors: Orland Hoeber, Xue Dong Yang
Venue: Proceedings of the Fourth International Conference on Coordinated & Multiple Views in Exploratory Visualization (2006)

Most web search engines use a list-based representation of web search results, promoting a sequential evaluation of the document surrogates. Commonly, these search engines only display ten document surrogates per page, limiting the users' ability to explore the search results. We have developed two systems to support the visual exploration of web search results: HotMap and Concept Highlighter. In both of these systems, the search results are provided at two levels of detail: an overview map that provides a compact and abstract representation of the top 100 documents returned by the underlying search engine; and a detail window that shows 20 to 25 documents at a time. In this paper, we will discuss how these coordinated views support the visual exploration of web search results.
A Mixed Language Fault Simulation of VHDL and SystemC
Authors: Silvio Misera, Heinrich Theodor Vierhaus, Lars Breitenfeld, Andre Sieber
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Fault simulation technology is essential key not only to the validation of test patterns for ICs and SoCs, but also to the analysis of system behavior under fault transient and intermittent faults. For this purpose, we developed a hierarchical fault simulation environment that uses structural VHDL models at the gate level, but is able to model embedded blocks in C++. With SystemC becoming a de-facto standard in high-level modeling, a simulation approach had to be developed which makes effective use of SystemC technology by encapsulating such "threads" into the fault simulation environment. Furthermore, it can be shown that SystemC allows the modeling of complex transistorlevel structures, for which equivalent gate-level representations are not adequate.
New inverse filter criteria for identification and deconvolution of nonminimum-phase systems by single cumulant slice
Authors: W.-T. Chen, C.-Y. Chi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors propose a family of new cumulant based inverse filter criteria which only require a single slice of cumulants of the inverse filter output for the identification and deconvolution of linear time-invariant (LTI) nonminimum-phase systems with only non-Gaussian output measurements contaminated by Gaussian noise. Some simulation results and an application to speech deconvolution are provided to demonstrate that inverse filtering algorithms based on the proposed new criteria work well.
Fast continuous wavelet transform
Authors: M. Vrhel, Chulhee Lee, I. Unser
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We introduce a general framework for the efficient computation of the continuous wavelet transform (CWT). The method allows arbitrary sampling along the scale axis, and achieves O(N) complexity per scale where N is the length of the signal. Our approach makes use of a compactly supported scaling function to approximate the analyzing wavelet. We derive error bounds on the wavelet approximation and show how to obtain any desired level of accuracy through the use of higher order representations. Finally, we present examples of implementation for different wavelets using polynomial spline approximations.
A Novel Multilingual Text Categorization System using Latent Semantic Indexing
Authors: Chung-Hong Lee, Hsin-Chang Yang, Sheng-Min Ma
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

Latent Semantic Indexing is a well known technique in Information Retrieval, especially in dealing with polysemy and synonymy. LSI use SVD process to decompose the original term-document matrix into a lower dimension triplet. The triplet (the resulted matrices) is the approximation to original matrix and can capture the latent semantic relation between terms. In this paper, we propose a novel method for multilingual text categorization using Latent Semantic Indexing. The centroid of each class has been calculated in the decomposed SVD space. The similarity threshold of categorization is predefined for each centroid. Test documents with similarity measurement larger than the threshold will be labeled "Positive" (Relevant) or else would be labeled "Negative" (Non-Relevant). Experimental result indicated that the performance on the precision, recall and F1 are quite good using LSI technique to categorize the multi-language text. The F1 measurement has an average value of 70% and the precision can reach 80% using our algorithm.
A new general global array calibration method
Authors: N. Fistas, A. Manikas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

A new method is proposed for calibrating a planar array of general geometry with respect to errors in location, phase and gain, even when all errors are present simultaneously (global calibration). The method requires the use of three pilot sources, which operate one at a time and from at least two different azimuth angles. Since the sources need not operate simultaneously, one only pilot source may be used from three different directions. The method assumes that the electrical errors (phase and gain errors) are not direction dependent. Simulation results that support the performance of the proposed method are also presented.
Finding the Self? An Event-Related fMRI Study
Authors: W. M. Kelley, C. N. Macrae, C. L. Wyland, S. Caglar, S. Inati, T. F. Heatherton
Venue: Journal of Cognitive Neuroscience (2002)

Researchers have long debated whether knowledge about the self is unique in terms of its functional anatomic representation within the human brain. In the context of memory function, knowledge about the self is typically remembered better than other types of semantic information. But why does this memorial effect emerge? Extending previous research on this topic (see Craik et al., 1999), the present study used event-related functional magnetic resonance imaging to investigate potential neural substrates of self-referential processing. Participants were imaged while making judgments about trait adjectives under three experimental conditions (self-relevance, other-relevance, or case judgment). Relevance judgments, when compared to case judgments, were accompanied by activation of the left inferior frontal cortex and the anterior cingulate. A separate region of the medial prefrontal cortex was selectively engaged during self-referential processing. Collectively, these findings suggest that self-referential processing is functionally dissociable from other forms of semantic processing within the human brain.
Integrated simulation and gaming architecture for incident management training
Authors: Sanjay Jain, Charles R. McLean
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The simulation-based training systems that are available or under development today for incident management are typically focused on macro level sequence of events. A few systems targeted at individual responders are under development using a gaming environment. Separate uses of such systems provide disparate experiences to decision makers and individual responders. There is a need to provide common training experiences to these groups for better effectiveness. This paper presents a novel approach integrating gaming and simulation systems for training of decision makers and responders on the same scenarios preparing them to work together as a team. An integrated systems architecture is proposed for this purpose. Major modules in gaming and simulation subsystems are defined and interaction mechanisms established. Research and standards issues for implementation of the proposed architecture are discussed.
Multimedia learning objects for digital signal processing in communications
Authors: A. Asif
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Advances in the multimedia technology provide an opportunity to enhance learning in the university education. The paper presents a sample of multimedia learning objects and cooperative activities based on macromedia flash, questionmark perception, and mathworks Matlab, used to teach the theoretical concepts in a senior level course, digital signal processing in communication systems (DSP/CS). A study that compares the performance of students with and without multimedia access is also included.
The Potential and Limitation of Probability-Based Combinational Equivalence Checking
Authors: Shih-Chieh Wu, Chun-Yao Wang, Jan-An Hsieh
Venue: Proceedings of the 15th Asian Test Symposium (2006)

This paper presents a probability based approach to logic equivalence checking. First, a general probability assignment procedure is proposed to uniquely characterize output probability of a network. Thus, the equivalence of two networks can be asserted by the equality of output probabilities. To improve the efficiency of probability calculation, a new encoding scheme and operations are proposed. These encoding scheme and operations also solve the signal correlation issue during the output probability evaluation. As a result, an exact output probability of a network is successfully derived in one pass. Finally, the equivalence of internal gates between two networks are exploited to reduce the number of required input assignments and improve the efficiency of our approach. In the experiments, our approach is compared with a BDD based approach in terms of CPU time and memory usage. The results disclose the potential and limitation of the probabilistic approach to logic equivalence checking.
ODIN: A Model for Adapting and Enriching Legacy Infrastructure
Authors: William D. Lewis
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The Online Database of Interlinear Text (ODIN)1 is a database of interlinear text "snippets", harvested mostly from scholarly documents posted to theWeb. Although large amounts of language data are posted to the Web as part of scholarly discourse, making the existing "e-Linguistic infrastructure" surprisingly rich, most linguistic data available on the Web exists in legacy formats, is highly displaycentric, and is often difficult to locate or interoperate over. ODIN seeks to leverage this existing infrastructure into a rich, searchable, and interoperable resource by converting readily available semi-structured data to content-centric, searchable formats. To do this, ODIN mines scholarly papers and webpages for instances of linguistic data, focusing mostly on interlinear texts, extracts them, identifies source languages, and makes the instances available to search. Through ODIN's standard search feature, users can locate data by language name or Ethnologue code, and display lists of data by document for languages of interest. The newer Advanced Search feature allows users to locate instances by grammatical markup that is used (e.g., NOM, ACC, ERG, PST, 3SG), and by linguistic constructions (e.g., passives, conditionals, possessives, raising constructions, etc.). The latter are made possible through additional enrichment of discovered data using automated statistical taggers and parsers.
Face Recognition Using Multiple Classifiers
Authors: Pallabi Parveen, Bhavani Thuraisingham
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In this paper, we propose a near real-time effective face recognition system for consumer applications. Since the nature of application domain requires real time result and better accuracy, it poses a serious challenge. To address this challenge, we study various classification techniques, namely, support vector machine (SVM), linear discriminant analysis (LDA) and K nearest neighbor (KNN). We observe that although KNN is as effective as SVM but KNN prohibits its usage due to high response time when data is high dimensional. To speed up KNN retrieval we propose a feature reduction technique using Principle component analysis (PCA) to facilitate near real time face recognition along with better accuracy. We apply KNN after we reduce the number of features by PCA. Hence, we test various classification approaches, namely, SVM, KNN, KNN with PCA, LDA, and LDA with PCA on a benchmark dataset and demonstrate the effectiveness of KNN with PCA over SVM and LDA.
SWS-ASE: Leveraging Web Service-based Software Engineering
Authors: Ulrich Dinger, Roy Oberhauser, Christian Reichel
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Web Service (WS)-based integration is a broadly accepted technique to address the heterogeneity in current software systems. With regard to the growing complexity of state-of-the-art software engineering (SE) processes, Semantic WS (SWS) can be a strategy to manage the heterogeneous SE software tools and inherent cross-dependencies in an automated way. This paper presents an interoperable tool approach for Automated Software Engineering (ASE) which comprises a distributed SE process management framework based on SWS. It includes plug-ins to visualize the generated workflows as well as to manage the feature dependencies of SE choices, e.g., with regard to quality criteria. Application of the SWS-ASE infrastructure within industrial use cases yielded significant improvements in areas such as reliability, usability, and efficiency. Within this paper, the results of such a use case are discussed and depicted in detail.
The Research and Application on Business Tier Based on J2EE
Authors: WANG Jia-shun, CHEN Jia
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

After analyzing and researching on management system's specific business in logistic enterprises based on J2EE model, this paper proposes the design scheme of business tier with the ideology of design pattern, makes more reasonable design and improvement to abstract domain model from the business tier in maximum, resultingly the whole system is more flexible, expandable and reusable.
On the Performance and Use of Speaker Recognition Systems for Surveillance
Authors: Peter J. Barger, Sridha Sridharan
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

We model the performance of a speaker recognition system used for surveillance to prioritize a large number of candidate speakers in search of a single target speaker. It is assumed that the system operates by ordering all speakers in order from best match to worst match, with the goal of having the true speaker sample positioned as high as possible on the list. Some performance measures for prioritization systems are given and are applied to a real speaker recognition system. An analytic expression for the probability density function of the true speaker's position on the list is found, subject to basic assumptions concerning the distribution of true speaker and false speaker scores. A comparison is made to the performance of a system which is operating only by making verification decisions, and it is shown that making soft decisions results in significantly better surveillance performance.
Imagination, production, and collaboration in project-based learning using multimedia
Authors: William R. Penuel, Christine Korbak, Karen A. Cole, Otak Jump
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

There is evidence that technology has played a role in transforming classrooms into places where students are actively constructing knowledge and where teachers structure learning resources to facilitate discovery, problem-solving, and collaboration. In our research, we consider the roles of two processes that use technology to support a project approach to learning using multimedia: creating cycles of student imagination and production and supporting well-developed student collaboration. Our paper examines how technology and pedagogy work together in a fourth-fifth grade classroom taught by the fourth author to support student imagination, production, and collaboration and explores mechanisms that relate these characteristics to the building of student identities as members in a community of practice.
A tabu search algorithm for the min-max k-Chinese postman problem
Authors: Dino Ahr, Gerhard Reinelt
Venue: Computers and Operations Research (2006)

In this paper we present a tabu search algorithm for the min-max k-Chinese postman problem (MM k-CPP). Given an undirected edge-weighted graph and a distinguished depot node, the MM k-CPP consists of finding k > 1 tours (starting and ending at the depot node) such that each edge is traversed by at least one tour and the length of the longest tour is minimized. A special emphasis is put on investigating the trade-off between running time effort and solution quality when applying different improvement procedures in the course of the neighborhood construction. Furthermore, different neighborhoods are analyzed. Extensive computational results show that the tabu search algorithm outperforms all known heuristics and improvement procedures.Scope and purpose Given a road network, the Chinese postman problem (CPP) is to find the shortest postman tour covering all the roads in the network. Applications of the CPP include road maintenance, garbage collection, mail delivery, etc. Since usually large road networks have to be serviced the work load must be distributed among k ≥ 2 vehicles. In contrast to the usual objective to minimize the total distance traveled by the k vehicles (k-CPP), for the min-max k-Chinese postman problem (MM k-CPP) the aim is to minimize the length of the longest of the k tours. This kind of objective is preferable when customers have to be served as early as possible. Furthermore, tours will be enforced to be more balanced resulting in a fair scheduling of tours. Although the CPP and the k-CPP are polynomially solvable, the MM k-CPP is NP-hard. Hence, we must rely on heuristics producing approximate solutions. The purpose of this paper is to present a tabu search algorithm for the MM k-CPP which outperforms all known heuristics. In many cases we obtained solutions which could be proved to be near-optimal or even optimal.
Cycle Time Reduction
Authors: Nagesh Mukundarao
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

In today's competitive market, customer needs quick solutions with minimum cost, with out compromising the quality. Five years back, the average project cycle time was 4 to 6 months (was measured in months) and currently it is between 8 to 16 weeks (is measured in weeks). In near future, this will be measured in days. There is a need for quick decisions, earlier we used to say "no decision is better than a wrong decision", but now it is "any decision is better than no decision". The Cycle Time Reduction (CTR) can only be possible by quick turn around in the project. This introduces challenges like running many activities in parallel (multiple critical paths). This implies increased risks in the project, increased stress on the project team, increased communication channels leading to complex communication issues, reduced time frame to adapt to the changes and many more. This in turn might impact on the company's business in the longer run. This paper provides a list of approaches practiced to achieve the challenge of reducing software project cycle time.
Link Dynamics and Protocol Design in a Multihop Mobile Environment
Authors: Prince Samar, Stephen B. Wicker
Venue: IEEE Transactions on Mobile Computing (2006)

A multihop ad hoc network with mobile elements is considered. A model is created and analytic expressions derived to characterize the statistics for link lifetime, new link interarrival time, link breakage interarrival time, and link change interarrival time. Applications of these expressions to protocol design are discussed. As an example application, the link model is used to find an optimal balance between reactive and proactive routing strategies. It is shown that, when control traffic generated through proactive route updating is matched to link lifetimes, control traffic is significantly reduced while the goodput and delay benefits of the proactive approach are retained.