ppxscal/embedding_network huggingface dataset:
Limited-Vocabulary Estonian Continuous Speech Recognition System using Hidden Markov Models
Authors: Tanel Alumäe, Leo Võhandu
Venue: Informatica (2004)

The article presents a limited-vocabulary speaker independent continuous Estonian speech recognition system based on hidden Markov models. The system is trained using an annotated Estonian speech database of 60 speakers, approximately 4 hours in duration. Words are modelled using clustered triphones with multiple Gaussian mixture components. The system is evaluated using a number recognition task and a simple medium-vocabulary recognition task. The system performance is explored by employing acoustic models of increasing complexity. The number recognizer achieves an accuracy of 97%. The medium-vocabulary system recognizes 82.9% words correctly if operating in real time. The correctness increases to 90.6% if real-time requirement is discarded.
Evaluation of E-learning systems: experiences in teaching human - computer interaction
Authors: Michailidis Nikolaos, Margounakis Dimitrios, Politis Dionysios
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

E-learning is a very promising way of delivering training and is broadly used in tertiary education. Although e-learning has a great potential, it is still at its starting point in Greece. The present paper describes the experiences we obtained from teaching the Human - Computer Interaction course in the Computer Science Department of Aristotle University of Thessaloniki. Blackboard has been used as the main platform for e-learning. The presented qualitative and quantitative facts reveal the power of e-learning and assure a greater level of success and efficiency after the enrichment of the current course and the development of new online courses.
Discriminating Mood Taxonomy of Chinese Traditional Music and Western Classical Music with Content Feature Sets
Authors: Wen Wu, Lingyun Xie
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

According to numbers of music cognitive experiments, moods or emotions in music could be categorical. Since mood classifications are commonly used to structure the large collections of music available on the Web, automatic discrimination between mood taxonomy of Chinese traditional music and Western classical music would be a valuable addition to music information retrieval (MIR) systems. In this paper, three content feature sets are extracted directly from the waveform audio clips, and then two mood taxonomy models are implemented. A Bayesian network is trained to classify the discrete mood categories. Finally, because the already-known algorithms have rarely applied to the Chinese traditional music, the comparative experimental result between Chinese and Western music evokes further research necessities.
Neural-Network-Based Fuzzy Group Forecasting with Application to Foreign Exchange Rates Prediction
Authors: Lean Yu, Kin Keung Lai, Shouyang Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

This study proposes a novel neural-network-based fuzzy group forecasting model for foreign exchange rates prediction. In the proposed model, some single neural network models are first used as predictors for foreign exchange rates prediction. Then these single prediction results produced by each single neural network models are fuzzified into some fuzzy prediction representations. Subsequently, these fuzzified prediction representations are aggregated into a fuzzy group consensus, i.e., aggregated fuzzy prediction representation. Finally, the aggregated prediction representation is defuzzified into a crisp value as the final prediction results. For illustration and testing purposes, a typical numerical example and three typical foreign exchange rates prediction experiments are presented. Experimental results reveal that the proposed model can significantly improve the prediction performance for foreign exchange rates.
Inter-frame and Inter-layer Motion Prediction during Fast Block Motion Estimation in MCTF
Authors: A. K. Karunakar, M. M. Manohara Pai
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

The motion compensated temporal filtering (MCTF) using 5/3 LeGall bi orthogonal wavelet filter requires bidirectional motion estimation (ME) that is computationally intensive. Hence encoder of Scalable Video Coder(SVC) becomes very slow. This paper proposes Motion Prediction technique for Fast Block Based ME during MCTF in SVC. The technique exploits center biased characteristics of motion vectors. It applies coarse and fine search of any fast block based ME, only to the first pair of frames in a group of pictures (GOP). The generated motion vectors (MVs) are supplied to the next consecutive frames and even to subsequent temporal levels, that is used to initiate the fine search. The technique significantly reduces the number of blocks that undergoes ME in a GOP and hence reduces computational complexity of ME in MCTF. The proposed algorithm is implemented in MC-EZBC and there is no visible variations in the quality of the decoded video.
Generic discrimination: sorting and paritioning unshared data in linear time
Authors: Fritz Henglein
Venue: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming (2008)

We introduce the notion of discrimination as a generalization of both sorting and partitioning and show that worst-case linear-time discrimination functions (discriminators) can be defined generically, by (co-)induction on an expressive language of order denotations. The generic definition yields discriminators that generalize both distributive sorting and multiset discrimination. The generic discriminator can be coded compactly using list comprehensions, with order denotations specified using Generalized Algebraic Data Types (GADTs). A GADT-free combinator formulation of discriminators is also given. We give some examples of the uses of discriminators, including a new most-significant-digit lexicographic sorting algorithm. Discriminators generalize binary comparison functions: They operate on n arguments at a time, but do not expose more information than the underlying equivalence, respectively ordering relation on the arguments. We argue that primitive types with equality (such as references in ML) and ordered types (such as the machine integer type), should expose their equality, respectively standard ordering relation, as discriminators: Having only a binary equality test on a type requires Θ(n2) time to find all the occurrences of an element in a list of length n, for each element in the list, even if the equality test takes only constant time. A discriminator accomplishes this in linear time. Likewise, having only a (constant-time) comparison function requires Θ(n log n) time to sort a list of n elements. A discriminator can do this in linear time.
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
Authors: Michele Zorzi, Ramesh R. Rao
Venue: IEEE Transactions on Mobile Computing (2003)

In this paper, we propose a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We focus on the multihop performance of such a solution, in terms of the average number of hops to reach a destination as a function of the distance and of the average number of available neighbors. An idealized scheme (in which the best relay node is always chosen) is discussed and its performance is evaluated by means of both simulation and analytical techniques. A practical scheme to select one of the best relays is shown to achieve performance very close to that of the ideal case. Some discussion about design issues for practical implementation is also given.
Towards Utilizing Model-Driven Engineering of Composite Applications for Business Performance Analysis
Authors: Mathias Fritzsche, Wasif Gilani, Christoph Fritzsche, Ivor Spence, Peter Kilpatrick, John Brown
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

Composite Applications on top of SAPs implementation of SOA (Enterprise SOA) enable the extension of already existing business logic. In this paper we show, based on a case study, how Model-Driven Engineering concepts are applied in the development of such Composite Applications. Our Case Study extends a back-end business process which is required for the specific needs of a demo company selling wine. We use this to describe how the business centric models specifying the modified business behaviour of our case study can be utilized for business performance analysis where most of the actions are performed by humans. In particular, we apply a refined version of Model-Driven Performance Engineering that we proposed in our previous work and motivate which business domain specifics have to be taken into account for business performance analysis. We additionally motivate the need for performance related decision support for domain experts, who generally lack performance related skills. Such a support should offer visual guidance about what should be changed in the design and resource mapping to get improved results with respect to modification constraints and performance objectives, or objectives for time.
An Adaptive Bandwidth Request Scheme for QoS Support in WiMAX Polling Services
Authors: Cheng-Yueh Liu, Yaw-Chung Chen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

IEEE 802.16, also called WiMAX was developed to accommodate large coverage and high bandwidth last-mile Internet access. In WiMAX, provisioning of QoS is still an important issue. Before transmitting packets, subscriber stations (SS) must send a bandwidth request message to the base station (BS). If available bandwidth is not sufficient to use unicast polling for each SS to send bandwidth request, the BS will form a group of stations that utilize multicast and broadcast polling to contend the slots for transmitting bandwidth request. Since extended real-time polling service (ertPS) proposed in 802.16e has strict delay time requirement, the lower the delay, the better the QoS. In order to reducing the delay caused by collisions of request packets, we proposed a scheme that utilizes contention-free period to allocate slots for bandwidth request. Both mathematic analysis and simulation results show that our scheme features lower delay and better QoS performance for ertPS flows as the number of stations increases.
A Fuzzy Neural Network Based on Back-Propagation
Authors: Huang Jin, Gan Quan, Cai Linhui
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Some arguments on fuzzy neural network algorithm have been put forward, whose weights were considered as special fuzzy numbers. This paper proposes a conception of strong L-R type fuzzy number and derives a learning algorithm based on BP algorithm via level sets of strong L-R type fuzzy numbers. The special fuzzy number has been weakened to the common case. Then the range of application has been enlarged.
Interactive Game Development with a Projector-Camera System
Authors: Andy Ju Wang
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

This paper reports our experience on interactive game development with a projector-camera system in a special topic course. We describe the course objective, learning outcomes, and how we offered it in our curriculum. Ideas of the rationale and expansion of this course is also presented. A camera-projector system requires a digital camera, a projector, and a computer. The projector and camera could be installed in various locations depending on the application. Our system used a rear-installed (behind the player) projector and camera, with players standing in between the projector-camera pair and the projected surface --- a screen or a wall. We discuss in this paper a simple testing game engine using OpenCV and DirectX, with a few example games developed by the student teams.
Simulation of Sound Emitted from Collision of Droplet with Shallow Water by the Lattice Boltzmann Method
Authors: Shinsuke Tajiri, Michihisa Tsutahara, Hisao Tanaka
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The sound emitted from splash of water droplet colliding with shallow water is simulated by the finite difference lattice Boltzmann method. Two-particle immiscible fluid model is used, and the under water sound is considered by introducing the elasticity for the liquid phase. After the collision, sounds propagating into the gas and liquid phases are successively detected. The directivity of the sound is shown to depend on the depth of the water.
Strip Packing vs. Bin Packing
Authors: Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (First Fit Decreasing Height) as a subroutine, we get a practical (simple and fast) algorithm for strip packing with an upper bound 11/9. (2) A class of Harmonic-based algorithms for bin packing can be applied to online strip packing maintaining the same asymptotic competitive ratio. It implies online strip packing admits an upper bound of 1.58889 on the asymptotic competitive ratio. This significantly improves the previously best bound of 1.6910 and affirmatively answers an open question posed in [5] .
An Efficient and Secure Rights Sharing Method for DRM System Against Replay Attack
Authors: Donghyun Choi, Yunho Lee, Hogab Kang, Seungjoo Kim, Dongho Won
Venue: Proceedings of the 4th international conference on Autonomic and Trusted Computing (2007)

In the past years there has been an increasing interest in developing DRM (Digital Rights Management) systems. The purpose of DRM is to protect the copyrights of content providers and to enable only designated users to access digital contents. From the consumers' point of view, they have a tendency to go against complex and confusing limitations. Consumers want to enjoy contents without hassle and with as few limitations as possible. The concept of Authorized Domain (AD) was presented to remove such problems. However, the previous work on authorized domain has two problems. The first is that it requires a rather expensive revocation mechanism. The second is that the devices still can play contents which are previously obtained even though they are currently out of the authorized domain. On the contrary, our scheme prevents the content from being played by devices which are out of the domain for better security. Furthermore our scheme does not need to maintain a revocation list and can prevent replay attack.
(Web Search)shared: Social Aspects of a Collaborative, Community-Based Search Network
Authors: Maurice Coyle, Barry Smyth
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

Collaborative Web search (CWS) is a community-based approach to Web search that supports the sharing of past result selections among a group of related searchers so as to personalize result-lists to reflect the preferences of the community as a whole. In this paper, we present the results of a recent live-user trial which demonstrates how CWS elicits high levels of participation and how the search activities of a community of related users form a type of social search network.
Use of Heuristic Local Search for Single-Objective Optimization in Multiobjective Memetic Algorithms
Authors: Hisao Ishibuchi, Yasuhiro Hitotsuyanagi, Noritaka Tsukamoto, Yusuke Nojima
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper proposes an idea of using heuristic local search procedures specific for single-objective optimization in multiobjective genetic local search (MOGLS). A large number of local search techniques have been studied for various combinatorial optimization problems. Thus we may have a situation where a powerful local search procedure specific for a particular objective is available in multiobjective optimization. Such a local search procedure, however, can improve only a single objective. Moreover, it may have severe side-effects on the other objectives. For example, in a scheduling problem, an insertion move of a job with the maximum delay to an earlier position in a current schedule is likely to improve only the maximum tardiness. In this paper, we assume a situation where each objective has its own heuristic local search procedure. First we explain our MOGLS algorithm, which is the hybridization of NSGA-II and weighted sum-based local search. Next we propose an idea of using heuristic local search procedures specific for single-objective optimization in MOGLS. Then we implement the proposed idea as a number of variants of MOGLS. These variants are different from each other in the choice of a heuristic local search procedure. We examine three schemes: random, probabilistic and deterministic. Finally we examine the performance of each variant through computational experiments on multiobjective 0/1 knapsack problems with two, three and four objectives. It is shown that the use of heuristic local search procedures and their appropriate choice improve the performance of MOGLS.
Adaptive Chosen Ciphertext Secure Threshold Key Escrow Scheme from Pairing
Authors: Yu Long, Kefei Chen, Shengli Liu
Venue: Informatica (2006)

This paper proposes a threshold key escrow scheme from pairing. It tolerates the passive adversary to access any internal data of corrupted key escrow agents and the active adversary that can make corrupted servers to deviate from the protocol. The scheme is secure against threshold adaptive chosen-ciphertext attack. The formal proof of security is presented in the random oracle model, assuming the decision Bilinear Diffie-Hellman problem is computationally hard.
The Effect of Clock Resolution on Keystroke Dynamics
Authors: Kevin Killourhy, Roy Maxion
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Keystroke dynamics--the analysis of individuals' distinctive typing rhythms--has been proposed as a biometric to discriminate legitimate users from impostors (whether insiders or external attackers). Anomaly detectors have reportedly performed well at this discrimination task, but there is room for improvement. Detector performance might be constrained by the widespread use of comparatively low-resolution clocks (typically 10---15 milliseconds).This paper investigates the effect of clock resolution on detector performance. Using a high-resolution clock, we collected keystroke timestamps from 51 subjects typing 400 passwords each. We derived the timestamps that would have been generated by lower-resolution clocks. Using these data, we evaluated three types of detectors from the keystroke-dynamics literature, finding that detector performance is slightly worse at typical clock resolutions than at higher ones (e.g., a 4.2% increase in equal-error rate). None of the detectors achieved a practically useful level of performance, but we suggest opportunities for progress through additional, controlled experimentation.
Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
Authors: Ling-Huey Su
Venue: Computers and Operations Research (2009)

This study addresses the identical parallel machine scheduling problem in which the total earliness and tardiness about a common due date are minimized subject to minimum total flowtime, P@?(E+T)/@?C"i. The problem is demonstrated to be transformed into a simplified version of the parallel machine problem with the objective of minimizing makespan subject to minimum total flowtime, P@?C"m"a"x/@?C"i. Several properties are considered to solve optimally the restricted version of the problem. A streamlined binary integer programming model is developed to solve the P@?C"m"a"x/@?C"i problem and the P@?(E+T)/@?C"i problem. Computational experiments indicate that the binary integer programming model is superior to the existing optimization algorithm for the P@?C"m"a"x/@?C"i problem in the literature.
Agent Learning Instead of Behavior Implementation for Simulations --- A Case Study Using Classifier Systems
Authors: Franziska Klügl, Reinhard Hatko, Martin V. Butz
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

Although multi-agent simulations are an intuitive way of conceptualizing systems that consist of autonomous actors, a major problem is the actual design of the agent behavior. In this contribution, we examine the potential of using agent-based learning for implementing the agent behavior. We enhanced SeSAm, a platform for agent-based simulation, by replacing the usual rule-based agent architecture by XCS, a well-known learning classifier system (LCS). The resulting model is tested using a simple evacuation scenario. The results show that on the one hand side plausible agent behavior could be learned. On the other hand side, though, the results are quite brittle concerning the frame of environmental feedback, perception and action modeling.
WS-RF Workflow in Triana
Authors: Andrew Harrison, Ian Taylor, Ian Wang, Matthew Shields
Venue: International Journal of High Performance Computing Applications (2008)

This paper describes the integration of WS-RF functionality into the graphical workflow enactment engine Triana. The motivation for our work is the belief that standardized communication models as represented by the numerous Web services related specifications will enrich the semantic content of service intercommunication and are likely to achieve widespread adoption. These two features will help to facilitate the kind of dynamic binding of services advocated by Service Oriented Architectures. Furthermore we maintain that exposing the capabilities offered by these specifications to the end user in a simple and intuitive manner is essential if they are to be used intelligently and flexibly, particularly when the specifications do not address the functional semantics of a service as is the case with WS-RF. We examine the possibilities that WS-RF offers to workflow creation and execution, particularly how it enables a number of optimizations which are useful in scientific workflows to be performed in a standardized manner, and describe the visual interpretation of WS-RF, the underlying technologies that enable this interpretation as well as issues arising from the integration of WS-RF into Triana.