ppxscal/embedding_network huggingface dataset:
Dynamic Browsing of Audiovisual Lecture Recordings Based on Automated Speech Recognition
Authors: Stephan Repp, Andreas Groß, Christoph Meinel
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

The number of digital lecture video recordings has increased dramatically since recording technology became available. The accessibility and the search inside of this large archive are limited and difficult. Manual annotation and segmentation is time-consuming and useless. A promising approach is based on using the audio layer of a lecture recording to get information about the lecture contents. In this paper, we are presenting a retrieval method and a user-interface based on existing recorded lectures. A deficient transcription from a speech recognition engine (SRE) is sufficient for browsing in the video-archive. A user-interface for dynamic browsing of the e-learning contents is presented and an evaluation of the supplied keywords concludes the paper.
Exploring the Effectiveness of Normative i* Modelling: Results from a Case Study on Food Chain Traceability
Authors: Alberto Siena, Neil Maiden, James Lockerbie, Kristine Karlsen, Anna Perini, Angelo Susi
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

This paper evaluates the effectiveness of an extension to i* modelling --- normative i* modelling --- during the requirements analysis for new socio-technical systems for food traceability. The i* focus on modelling systems as networks of heterogeneous, inter-dependent actors provides limited support for modelling system-wide properties and norms, such as laws and regulations, that also influence the specification of socio-technical systems. In this paper we introduce an extension to i* to model and analyse norms, then apply it to model laws and regulations applicable to European food traceability systems. We report an analysis of the relative strengths and weaknesses of this extended form of i* with its traditional forms, and use results to answer two research questions about the usefulness and usability of the i* modelling extension.
Plenary lecture III: complex adaptive signal processing employing independent and optimal convergence factors with applications in time-varying environments
Authors: Wasfy B. Mikhael
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

The increased usage of complex signal representations has necessitated the need for improved complex signal processing techniques. Complex adaptive signal processing techniques are presented, which independently adjust the real and imaginary components of the complex quantities, employing optimal convergence factors. Extensive simulations confirm the improved performance of the proposed methods, especially in dynamic scenarios. The effectiveness of these novel techniques will be illustrated in several applications.
Shared subtypes: subtyping recursive parametrized algebraic data types
Authors: Ki Yung Ahn, Tim Sheard
Venue: ACM SIGPLAN Notices (2009)

A newtype declaration in Haskell introduces a new type renaming an existing type. The two types are viewed by the programmer as semantically different, but share the same runtime representation. When operations on the two semantic views coincide, the run-time cost of conversion between the two types is reduced to zero (in both directions) because of this common representation. We describe a new language feature called Shared Subtypes (SSubtypes), which generalizes these properties of the newtype declaration. SSubtypes allow programmers to specify subtype rules between types and sharing rules between data constructors. A value of a type T, where T is a subtype of U, can always be cast, at no cost, to value of type U. This free up-casting allows library functions that consume the supertype to be applied without cost to subtypes. Yet any semantic interpretations desired by the programmer can be enforced by the compiler. SSubtype declarations work particularly well with GADTs. GADTs use differing type indexes to make explicit semantic differences, by using a different index for each way of viewing the data. Shared subtypes allow GADTs to share the same runtime representation as a reference type, of which the GADT is a refinement.
Estimation of Source Signals Number and Underdetermined Blind Separation Based on Sparse Representation
Authors: Ronghua Li, Beihai Tan
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

In this paper, we propose a new two-step algorithm (PDTA) to solve the problem of underdetermined blind separation, where the number of sensors is less than that of source signals. Unlike the usual two-step algorithm, our algorithm's first step is to estimate the number of source signals and the mixture matrix instead of K-mean clustering algorithm, in which people often suppose that the number of source signals is known when they estimate the mixture matrix. After the mixture matrix is estimated by PDTA, the short path algorithm is used to recover source signals. The last simulations show the good performance of estimation the number of source signals and recovering source signals.
FIR equiripple digital filter for reduction of power line interference in the ECG signal
Authors: Mahesh S. Chavan, R. A. Agarwala, M. D. Uplane
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

Present paper deals with design and development of digital FIR equiripple filter. The basic ECG has the frequency range from .5Hz to 100Hz. Artifacts plays the vital role in the processing of the ECG signal. It becomes difficult for the Specialist to diagnose the diseases if the artifacts are present in the ECG signal. In the present work notch filter is designed. Designed filter is applied to the ECG signal containing powerline noise. Complete design is performed with FDA tool in the Mathlab. The notch equiripple filter designed is having higher order which increasing the computational complexity. For accessing real time ECG the advantech add-on card has been used. The result shows the before filtering and after filtering results which clearly indicates the removal of the power line interference in the ECG signal.
Fast Approximate Point Set Matching for Information Retrieval
Authors: Raphaël Clifford, Benjamin Sach
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We investigate randomised algorithms for subset matching with spatial point sets--given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consisting of m points, find the largest match for a subset of the pattern in the data set. This problem is known to be 3-SUM hard and so unlikely to be solvable exactly in subquadratic time. We present an efficient bit-parallel O(nm) time algorithm and an O(nlogm) time solution based on correlation calculations using fast Fourier transforms. Both methods are shown experimentally to give answers within a few percent of the exact solution and provide a considerable practical speedup over existing deterministic algorithms.
Speed control of induction motors with fuzzy logic controller
Authors: Tania L. Acevedo, Aldo Pardo, Jorge Luis Díaz Rodriguez, Kang Yen
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

This objective of this paper is the design and simulation of an AC drive with Fuzzy Logic Controller (FLC) for induction motor speed control. The integration with SPWM strategy is also included. Several simulations were carried out using Simulink® and Matlab® the simulations show the advantage of using a fuzzy controller. At the end, optimum operating responses were obtained.
Brief paper: MPC for tracking piecewise constant references for constrained linear systems
Authors: D. Limon, I. Alvarado, T. Alamo, E. F. Camacho
Venue: Automatica (Journal of IFAC) (2008)

In this paper, a novel model predictive control (MPC) for constrained (non-square) linear systems to track piecewise constant references is presented. This controller ensures constraint satisfaction and asymptotic evolution of the system to any target which is an admissible steady-state. Therefore, any sequence of piecewise admissible setpoints can be tracked without error. If the target steady state is not admissible, the controller steers the system to the closest admissible steady state. These objectives are achieved by: (i) adding an artificial steady state and input as decision variables, (ii) using a modified cost function to penalize the distance from the artificial to the target steady state (iii) considering an extended terminal constraint based on the notion of invariant set for tracking. The control law is derived from the solution of a single quadratic programming problem which is feasible for any target. Furthermore, the proposed controller provides a larger domain of attraction (for a given control horizon) than the standard MPC and can be explicitly computed by means of multiparametric programming tools. On the other hand, the extra degrees of freedom added to the MPC may cause a loss of optimality that can be arbitrarily reduced by an appropriate weighting of the offset cost term.
Inapproximability of Survivable Networks
Authors: Yuval Lando, Zeev Nutov
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation ratio preserving reduction from Directed SNDP to Undirected SNDP. Our reduction extends and widely generalizes as well as significantly simplifies the main results of [6]. Using it, we derive some new hardness of approximation results, as follows. We show that directed and undirected variants of SNDP and of k -Connected Subgraph are equivalent w.r.t. approximation, and that a ρ-approximation for Undirected Rooted SNDP implies a ρ-approximation for Directed Steiner Tree.
Approximate convex decomposition of polyhedra and its applications
Authors: Jyh-Ming Lien, Nancy M. Amato
Venue: Computer Aided Geometric Design (2008)

Decomposition is a technique commonly used to partition complex models into simpler components. While decomposition into convex components results in pieces that are easy to process, such decompositions can be costly to construct and can result in representations with an unmanageable number of components. In this paper we explore an alternative partitioning strategy that decomposes a given model into ''approximately convex'' pieces that may provide similar benefits as convex components, while the resulting decomposition is both significantly smaller (typically by orders of magnitude) and can be computed more efficiently. Indeed, for many applications, an approximate convex decomposition (acd) can more accurately represent the important structural features of the model by providing a mechanism for ignoring less significant features, such as surface texture. We describe a technique for computing acds of three-dimensional polyhedral solids and surfaces of arbitrary genus. We provide results illustrating that our approach results in high quality decompositions with very few components and applications showing that comparable or better results can be obtained using acd decompositions in place of exact convex decompositions (ecd) that are several orders of magnitude larger.
Deformations, patches, and discriminative models for automatic annotation of medical radiographs
Authors: Thomas Deselaers, Hermann Ney
Venue: Pattern Recognition Letters (2008)

In this paper, we describe three different methods for the classification and annotation of medical radiographs. The methods were applied in the medical image annotation tasks of ImageCLEF in 2005, 2006, and 2007. Image annotation can be used to access and find images in a database using textual queries when no textual image description is available. One of the methods is a non-linear model taking into account local image deformations to compare images which are then classified using the nearest neighbour decision rule. The other two methods use local image descriptors for a bag-of-features approach. The bags of local image features are classified using discriminative classifiers. Our methods performed best in the 2005 and 2006 evaluations and second best in 2007.
Algorithm --- Fundamental Concept in Preparing Informatics Teachers
Authors: Ewa Kolczyk
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

The concept of the algorithm is fundamental within the computer science (informatics) domain. It is important to introduce it gradually in a spiral manner through all stages of education. Informatics teachers should be able to explain, to give examples and to help understanding the concept of algorithm at an elementary level. Therefore they need some ideas, tools, and didactic concepts to do it. The article presents some examples of tools and techniques, which the future informatics teachers should be familiar with. In teacher training we should deliver meaningful examples and carefully show the stages of building the intuition of the algorithm. 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
Dimensionality Problem in the Visualization of Correlation-Based Data
Authors: Gintautas Dzemyda, Olga Kurasova
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

A method for visualization the correlation-based data has been investigated. The advantage of this method lies in the possibility to restore the system of multidimensional vectors describing parameters from their correlation matrix (one vector for one parameter) and to visualise these vectors for the visual decision making on the similarity of the parameters. The goal of this research is to investigate the possibility to reduce the dimensionality of the vectors from the restored system and to evaluate the visualization quality in dependence on the reduction level.
Write it recursively: a generic framework for optimal path queries
Authors: Akimasa Morihata, Kiminori Matsuzaki, Masato Takeichi
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of optimal path problem. In this paper, we propose a generic framework for optimal path queries. We offer a domain-specific language to describe optimal path queries, together with an algorithm to find an optimal path specified in our language. One of the most distinct features of our framework is the use of recursive functions to specify queries. Recursive functions reinforce expressiveness of our language so that we can describe many problems including known ones; thus, we need not learn existing results. Moreover, we can derive an efficient querying algorithm from the description of a query written in recursive functions. Our algorithm is a generalization of existing algorithms, and answers a query in O(n log n) time on a graph of O(n) size. We also explain our implementation of an optimal path querying system, and report some experimental results.
VWM: An Improvement to Multiagent Coordination in Highly Dynamic Environments
Authors: Seyed Hamid Hamraz, Behrouz Minaei-Bidgoli, William F. Punch
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

This paper is aimed to describe a general improvement over the previous work on the cooperative multiagent coordination. The focus is on highly dynamic environments where the message transfer delay is not negligible. Therefore, the agents shall not count on communicating their intentions along the time they are making the decisions, because this will directly add the communication latencies to the decision making phase. The only way for the agents to be in touch is to communicate and share their beliefs, asynchronously with the decision making procedure. Consequently, they can share similar knowledge and make coordinated decisions based on it. However, in a very dynamic environment, the shared knowledge may not remain similar due to the communication limitations and latencies. This may lead to some inconsistencies in the team coordination performance. Addressing this issue, we propose to hold another abstraction of the environment, called Virtual World Model (VWM), for each agent in addition to its primary internal world state. The primary world state is updated as soon as a new piece of information is received while the information affects the VWM through a synchronization mechanism. The proposed idea has been implemented and tested for Iran University of Science and Technology (IUST) RoboCupRescue simulation team, the 3rd winner of the 2006 worldcup competitions.
A tunable SC 2nd order bandpass Σ-Δ modulator with novel architecture
Authors: Jae-Bung Kim, Seong-Ik Cho
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

In this paper tunable SC(switched capacitor) 2nd order bandpass Σ-Δ(Sigma-Delta) modulator with novel architecture that can adjust the center fre quency by one coefficient value is proposed for data conversion in the IF(Intermediate Frequency). Its architecture can optionally adjust all the 2nd ordeer noise transfer function in comparison with the conventional architecture. In order to adjust the center frequency, the conventional architecture needs the fixed coefficient values, basic clock, and eight clocks. On the other hand, the proposed architecture can adjust the center frequency by one coefficient value and basic clock only.
A Connectivity-Driven Retransmission Scheme Based On Transport Layer Readdressing
Authors: Michio Honda, Jin Nakazawa, Yoshifumi Nishida, Masahiro Kozuka, Hideyuki Tokuda
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Abstract—Migration between different wireless access networks often involves disconnected period, which is caused by passing an area of bad wireless coverage and potential overhead to switch the network on the network interface to connect to. The disconnected period can cause extra transmission delay due to the timer-driven retransmission behavior in the transport protocols, such as TCP and SCTP. We propose a new retransmission scheme to achieve better migration performance in SCTP, which is a newer connection-oriented and reliable transport protocol that is becoming popular. Our scheme minimizes the extra transmission delay by leveraging address reconfiguration operation in SCTP without involving other layers. It decreases the delay more than 5 seconds compared to the original SCTP when migration involves approximately ten-second disconnected period. The implementation of our scheme is already imported in FreeBSD.
Orbital Branching
Authors: James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that are equivalent with respect to the symmetry remaining in the problem after branching, including symmetry which is not present at the root node. These groups of equivalent variables, called orbits, are used to create a valid partitioning of the feasible region which significantly reduces the effects of symmetry while still allowing a flexible branching rule. We also show how to exploit the symmetries present in the problem to fix variables throughout the branch-and-bound tree. Orbital branching can easily be incorporated into standard IP software. Through an empirical study on a test suite of symmetric integer programs, the question as to the most effective orbit on which to base the branching decision is investigated. The resulting method is shown to be quite competitive with a similar method known as isomorphism pruning and significantly better than a state-of-the-art commercial solver on symmetric integer programs.
Adapting QA Components to Mine Answers in Speech Transcripts
Authors: Günter Neumann, Rui Wang
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The paper describes QAst-v1 a robust question answering system for answering factoid questions in manual and automatic transcriptions of speech. The system is an adaptation of our text---based crosslingual open---domain QA system that we used for the CLEF main tasks.
An Empirical Study of Utility Measures for k-Anonymisation
Authors: Grigorios Loukides, Jianhua Shao
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

k-Anonymisation is a technique for masking microdata in order to prevent individual identification. Besides preserving privacy, data anonymised by such a method must also retain its utility, i.e. it must remain useful to applications. Existing k-anonymisation methods all attempt to optimise data utility, but they do so by using measures that do not take application requirements into account. In this paper, we empirically study several popular utility measures by comparing their performance in a range of application scenarios. Our study shows that these measures may not be a reliable indicator of data utility for applications in practice, and how to use these measures effectively must be considered.
A Polynomial Time Constructible Hitting Set for Restricted 1-Branching Programs of Width 3
Authors: Jiří Šíma, Stanislav Žák
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

An important problem in complexity theory is to find polynomial time constructible hitting sets for Boolean functions in different standard models. This would have consequences for the relationship between deterministic and probabilistic computations in the respective models. Using the result by Alon, Goldreich, Håstad, and Peralta (1992) we provide a polynomial time constructible hitting set for restricted read-once branching programs of width 3. The restriction excludes only one from all patterns of level-to-level transitions in a normalized form of 3-width 1-branching programs. In fact, our technique works for a slightly more general class of such programs. Although this restriction seems to be relatively strong our proof reveals the core of difficulties and thus represents the first step for proving the result for less restricted models.
Model Checking Event-B by Encoding into Alloy
Authors: Paulo J. Matos, João Marques-Silva
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

Current day systems are ever more detailed and complex leading to the necessity of developing models that abstract unimportant implementation details while emphasizing their structure. Until recently it was only possible to perform temporal model checking in an Event-B model by converting the model to B-METHOD and then using ProB [1]. More recently, a prototype ProB plug in [2] for the RODIN tool has been developed. Nevertheles, encoding Event-B to Alloy allows building on top of the Alloy model finding engine therefore benefiting from all of its optimizations. An extended version of this work is in [3].