ppxscal/embedding_network huggingface dataset:
Hop Period Estimation for Frequency Hopping Signals Based on Hilbert-Huang Transform
Authors: Ye Yuan, Wen-bo Mei, Si-liang Wu, Qi Yuan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

A method for estimating the hop period of frequency hopping (FH) signals based on Hilbert-Huang transform (HHT) is proposed. This method iteratively decomposes the FH signal into intrinsic mode functions (IMFs) and applies Hilbert transform to each IMF to yield Hilbert spectrum, whose maxima for each time instant are extracted to form a sequence. A simple Fourier transform based analysis of the obtained sequence provides the estimate of hop period for a FH signal. The proposed method is fully cross-term free, and it does not make any assumption about the parameter information. The performance of the method is evaluated in terms of estimation variances in the presence of Gaussian white noise.
When Is a "Little in the Middle" OK? The Internet's End-to-End Principle Faces More Debate
Authors: Gregory Goth
Venue: IEEE Distributed Systems Online (2004)

The recent attempt by VeriSign to launch their SiteFinder search engine has renewed interest in the ongoing debate about Internet governance.
On the Ermanno-Bernoulli and Quasi-Ermanno-Bernoulli constants for linearizing dynamical systems
Authors: F. I. Arunaye, H. White
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

It is well known that the Ermanno-Bernoulli constants derived from Laplace-Runge-Lenz vector of dynamical systems are efficiently used to reduce them to coupled harmonic oscillator(s) and conservation law in the context of point and nonlocal symmetries of dynamical systems. In this paper, we derive alternative constants named Quasi-Ermanno-Bernoulli constants from the Hamilton vector of dynamical systems and show that it serves the same purpose. We also note that the symmetry groups obtained from the reduced systems using the Quasi-Ermanno-Bernoulli constants are equivalent to that obtained from the formal.
Modelling of Dynamic Systems Using Generalized RBF Neural Networks Based on Kalman Filter Mehtod
Authors: Jun Li, You-Peng Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

A novel multi-input, multi-output generalized radial basis function (RBF) neural networks for nonlinear system modelling is presented in the paper, which uses extend Kalman filter to sequentially update both the output weights and the centers of the network. Simultaneously, such RBF models employ radial basis functions whose form is determined by admissible exponential generator functions. To test the validity of the proposed method, this paper demonstrates that generalized RBF neural networks with the extended Kalman filter can be used effectively for the identification and modelling of nonlinear dynamical systems. Simulation results reveal that the new generalized RBF networks guarantee faster learning and very satisfactory function approximation capability in modeling nonlinear dynamic systems.
Dialogue Based Text Editing
Authors: Jaromír Plhák
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

This paper presents the basic principles for text editing by means of dialogue. First, the usage of the text division algorithm is discussed as well as its enhancement. Then, the dialogue text processing interface which co-operates with the voice synthesizer is described. We propose basic functions, formulate the most notable problems and suggest and discuss their possible solutions.
Building a PDMS infrastructure for XML data sharing with SUNRISE
Authors: Federica Mandreoli, Riccardo Martoglia, Simona Sassatelli, Giorgio Villani, Wilma Penzo
Venue: Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web (2008)

Semantic support for data representation as well as a flexible machine-readable format have made XML the de facto standard for Internet applications semantic interoperability. Its applicability is primarily evident in realities where actors are heterogeneous data sources which interact each other for data sharing purposes. This is exactly the scenario envisioned by Peer Data Management Systems (PDMSs), where autonomous sources (peers) model their local data according to a schema, and are connected in a peer-to-peer network by means of pairwise semantic mappings between the peers' own schemas. One of the main challenges in such a semantically heterogeneous environment is concerned with query processing when dealing with the inherent semantic approximations occurring in the data. In this paper we present an instantiation of SUNRISE (System for Unified Network Routing, Indexing and Semantic Exploration) for XML data sources. SUNRISE is a complete PDMS infrastructure which extends each peer with functionalities for capturing the semantic approximation originating from schema heterogeneity and exploiting it for a semantically driven network organization and query routing.
The Role of Model-Based Testing
Authors: Mark Utting
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

This position paper gives an overview of model-based testing and discusses how it might fit into the proposed grand challenge for a program verifier.
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
Authors: Wouter Gelade
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Studying the impact of operations, such as intersection and interleaving, on the succinctness of regular expressions has recently received renewed attention [12,13,14]. In this paper, we study the succinctness of regular expressions (REs) extended with interleaving, intersection and counting operators. We show that in a translation from REs with interleaving to standard regular expressions a double exponential size increase can not be avoided. We also consider the complexity of translations to finite automata. We give a tight exponential lower bound on the translation of REs with intersection to NFAs, and, for each of the three classes of REs, we show that in a translation to a DFA a double exponential size increase can not be avoided. Together with known results, this gives a complete picture of the complexity of translating REs extended with interleaving, intersection or counting into (standard) regular expressions, NFAs, and DFAs.
A Minimalistic Model of Visually Guided Obstacle Avoidance and Path Selection Behavior
Authors: Lorenz Gerstmayr, Hanspeter A. Mallot, Jan M. Wiener
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

In this study we present an empirical experiment investigating obstacle avoidance and path selection behavior in rats and a number of visually-guided models that could account for the empirical data. In the experiment, the animals were repeatedly released into an open arena containing several obstacles and a single feeder that was marked by a large visual landmark. We recorded and analyzed the animals' trajectories as they approached the feeder. We found that the animals adapted their paths according to the specific obstacle configurations not only to avoid the obstacles that were blocking the direct path, but also to select optimal or near-optimal trajectories. On basis of these results, we then develop and present a series of minimalistic models of obstacle avoidance and path selection behavior that are based purely on visual input. In contrast to standard approaches to obstacle avoidance and path planning, our models do not require a map-like representation of space.
Efficient Implementation of an Optimal Interpolator for Large Spatial Data Sets
Authors: Nargess Memarsadeghi, David M. Mount
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Interpolating scattered data points is a problem of wide ranging interest. One of the most popular interpolation methods in geostatistics is ordinary kriging. The price for its statistical optimality is that the estimator is computationally very expensive. We demonstrate the space and time efficiency and accuracy of approximating ordinary kriging through the use of covariance tapering combined with iterative methods.
A Polygon-to-Rectangle Conversion Algorithm
Authors: Kevin Gourley, Douglas Green
Venue: IEEE Computer Graphics and Applications (1983)

Reduced data storage, simplified data, and faster plotting of designs on graphics displays¿this algorithm has much to offer for IC mask making and CAD applications.
On Practical Implementation of Holonic Control Principles in Baggage Handling Systems Using IEC 61499
Authors: Geoff Black, Valeriy Vyatkin
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

IEC 61499 Functional Blocks is an upcoming architectural framework for the design of complete distributed industrial automation systems and their reusable components. This paper presents a multi-agent distributed control approach for a baggage handling system using IEC 61499 Functional Blocks. In particular, it focuses on demonstrating a distributed control system that is scalable, reconfigurable and fault tolerant. The design follows the Automation Object approach, which ends up in a functional block representing a single section of conveyor, such that the structure (and consequently the behaviour) of the conveyor network is entirely defined by the interconnection of these blocks within the IEC 61499 design environment. The use of distributed simulation to achieve predictive control is demonstrated as a part of the control system design.
Measurement of dynamic metrics using dynamic analysis of programs
Authors: Varun Gupta, Jitender Kumar Chhabra
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Dynamic analysis of programs is a prerequisite for the measurement of dynamic metrics. Dynamic analysis of an application involves the collection of run-time data from the run-time profiles or from dynamic models of the software system. Dynamic analysis is more precise specially in handling object-oriented features like inheritance, polymorphism, etc but is at the same time, slow and complex process in comparison to static analysis of the software systems. Dynamic analysis of software can be performed in many ways: -using profilers, from dynamic models and using Aspect Oriented Programming. Some other less popular techniques like AST rewriting based, Pre-processor based, Method-wrappers based and hybrid approach also exist in the literature. This paper attempts to examine these methods and it is found that Aspect-oriented approach provides a more desirable support for dynamic analysis of programs, as compared to rest of the methods. Aspect oriented approach is easier to implement and at the same time, an efficient technique for dynamic analysis without any side effects.
Computing All Optimal Solutions in Satisfiability Problems with Preferences
Authors: Emanuele Rosa, Enrico Giunchiglia, Marco Maratea
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

The problem of finding an optimal solution in a constraint satisfaction problem with preferences has attracted a lot of researchers in Artificial Intelligence in general, and in the constraint programming community in particular. As a consequence, several approaches for expressing and reasoning about satisfiability problems with preferences have been proposed, and viable solutions exist for finding one optimal solution. However, in many cases, it is not desirable to find just one solution. Indeed, it might be desirable to be able to compute more, and possibly all, optimal solutions, e.g., for comparatively evaluate them on the basis of other criteria not captured by the preferences.In this paper we present a procedure for computing all optimal solutions of a satisfiability problem with preferences. The procedure is guaranteed to compute all and only the optimal solutions, i.e., models which are not optimal are not even computed.
Fault-Tolerant Cluster Management Tool for Supporting Nonstop of Cluster DBMS
Authors: Jae-Woo Chang, Jung-Ho Um
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this paper, we design and implement a fault-tolerant cluster management tool which can monitor the status of the nodes in a cluster DBMS (Database Management System) as well as the status of the various DBMS instances at a given node. Based on the monitoring, our cluster management tool can provide an intelligent fail-over mechanism for dealing with multiple node failures in a cluster DBMS, thus making its fault-tolerance possible when combined with a load balancer. We implement our cluster management tool by using Linux virtual server 0.81 as a load balancer and iBASE/Cluster as a cluster-based DBMS, under a cluster system with four server nodes. It is shown that the sensing and recovery time of our cluster management tool for the iBASE/Cluster is about 2 seconds while that of OCMS for Oracle DBMS is more than 20 seconds. Finally we show that our cluster management tool can support the nonstop and self-managing of cluster DBMS with its intelligent fail-over mechanism even in case of multiple node failures.
Solving Biomechanical Model Using Third-Order Runge-Kutta Methods
Authors: R. R. Ahmad, A. S. Rambely, L. H. Lim
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

A certain biomechanical model involves ordinary differential equations. This research focuses on solving a biomechanical model of a cyclist coasting downhill. The objective of this study is to establish the velocity of the model, using two numerical methods, i.e., the third-order Runge-Kutta methods. The two methods are the existing classical Runge-Kutta and a modified Runge-Kutta method formed by Wazwaz. The numerical results obtained from these two methods are compared with the exact solution and the relative errors are produced.
First-principle study on polarizability and hyperpolarizability of a transition metal cluster, [Mo$_{2}$S$_{3}$(C$_{6}$H$_{11}$)$_{3}$(CO)$_{6}$]&middot;N(C$_{2}$H$_{3}$)$_{4}$
Authors: Kechen Wu, Ping Liu, Zhangfeng Zhou, Chensheng Lin, Botao Zhuang
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

We reported the first-principle study of linear and nonlinear optical polarizability of a di-nuclear transition metal cluster, [Mo$_{2}$S$_{3}$(CO)$_{6}$(C$_{6}$H$_{11}$)$_{3}$]&middot;N(C$_{2}$H$_{3}$)$_{4}$, by using finite-field method. The calculations were performed at an HF/Lanl2dz level. The spatial average value of the first hyperpolarizability along z direction was very large, &beta;$_{z} = 13.8 &times; 10<FORMULA>^{-30}$ esu, indicating the potential applications of this cluster for IR nonlinear optical processes. Our results showed that the charge transfer inside the metal core cluster, [Mo$_{2}$S$_{3}$(CO)$_{6}$], played an important role in nonlinear optical response while the joint effect of metal core and organic ligands (C$_{6}$H$_{11}$)$_{3}$ also contributed to nonlinear optical polarizability. In addition, the organic ionic group, [N(C$_{2}$H$_{3}$)$_{4}$]$^{+}$, situated in z direction enhanced the &beta;$_{z}$ value. The study may help us to understand the nonlinear optical nature of the transition metal clusters and provided an example to show the computational efficiency of finite-field method in the first-principle theoretical study of the complex system containing transition-metal element.
Practical Recurrent Learning (PRL) in the Discrete Time Domain
Authors: Mohamad Faizal Samsudin, Takeshi Hirose, Katsunari Shibata
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

One of the authors has proposed a simple learning algorithm for recurrent neural networks, which requires computational cost and memory capacity in practical order O(n 2)[1]. The algorithm was formulated in the continuous time domain, and it was shown that a sequential NAND problem was successfully learned by the algorithm. In this paper, the authors name the learning "Practical Recurrent Learning (PRL)", and the learning algorithm is simplified and converted in the discrete time domain for easy analysis. It is shown that sequential EXOR problem and 3-bit parity problem as non linearly-separable problems can be learned by PRL even though the learning performance is often quite inferior to BPTT that is one of the most popular learning algorithms for recurrent neural networks. Furthermore, the learning process is observed and the character of PRL is shown.
Optimizing Process Parameters for Ceramic Tile Manufacturing Using an Evolutionary Approach
Authors: Thitipong Navalertporn, Nitin V. Afzulpurkar
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper, an integrated approach of neural network and bidirectional particle swarm is proposed. The neural network is used for obtaining the relationships between decision variables and the measures of interest while the bidirectional particle swarm is utilized to perform the optimization where multiple objectives and multiple constraints are presented. Finally, the proposed algorithm is applied to solve a process parameter design problem in ceramic tile manufacturing. The results showed that bidirectional particle swarm is an effective method for solving multi-objective optimization problems, and an integrated approach of neural networks and bidirectional particle swarm can be used in solving complex process parameter design problems.
Verification skip writes head-positioning error mechanism using skip writes problem detection
Authors: Anant Oonsivilai, Nittaya Meeboon
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

HDD-structure interaction is one of the main issues facing the development of the hard disk drive (HDD) system while as they operate at high rotational speeds. Writing instability of HDD has affected related to difficulty in read-write in a HDD. This paper illustrates studying the skip write problem. The effects of head gimbal assemblies (HGA) trouble to writing on media are considered. In addition, studying the variables that affect to writing problem by head gimbal assemblies (HGA) is accomplished. Finally, comparison between experimental data from HDD activity and mathematics analysis of skip write model is also investigated.
Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment
Authors: Yannis Marinakis, Magdalene Marinaki, Michael Doumpos, Nikolaos Matsatsinis, Constantin Zopounidis
Venue: Journal of Global Optimization (2008)

The classification problem consists of using some known objects, usually described by a large vector of features, to induce a model that classifies others into known classes. The present paper deals with the optimization of Nearest Neighbor Classifiers via Metaheuristic Algorithms. The Metaheuristic Algorithms used include tabu search, genetic algorithms and ant colony optimization. The performance of the proposed algorithms is tested using data from 1411 firms derived from the loan portfolio of a leading Greek Commercial Bank in order to classify the firms in different groups representing different levels of credit risk. Also, a comparison of the algorithm with other methods such as UTADIS, SVM, CART, and other classification methods is performed using these data.
Our Quest for the Holy Grail of Agent Verification
Authors: John-Jules Ch. Meyer
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

Since the inception of agent technology almost two decades ago, researchers have worked both on the formal, theoretical aspects of intelligent agents and on the realisation / implementation of them. However, the link between the two has always remained rather unclear, to this day. Although there is a definite need for the verification of agents, the methods and techniques for this are still in their infancy. We describe our personal ongoing quest for the `right' approach to agent verification.
Handwritten Cursive Jawi Character Recognition: A Survey
Authors: Mohammad Faidzul Nasrudin, Khairuddin Omar, Mohamad Shanudin Zakaria, Liong Choong Yeun
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

The subject of cursive handwritten character recognition is still open to be studied because of its complex nature. Recognition of Arabic handwritten and its variants such as Farsi (Persian) and Urdu had been receiving considerable attention in recent years. Numerous methods for recognizing Arabic characters have been proposed and applied to various types of images. These research highlights have not yet beengiven to another variant of Arabic which is the Jawi script. This paper provides a comprehensive review of existing works in handwritten Jawi character recognition. It includes the history and writing of Jawi, and challenges, current works, and future direction of Jawi character recognition system.
The Relationship between Game Genres, Learning Techniques and Learning Styles in Educational Computer Games
Authors: Kowit Rapeepisarn, Kok Wai Wong, Chun Che Fung, Myint Swe Khine
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Educational computer game has many similar characteristics like any other genres of games. However its particular aspect is designed to teach, and in which main objective involves in learning a topic. To develop an effective educational computer game, different game genres, learning activities and techniques, and learning styles are important issues for consideration. This paper presents an analysis by comparing and establishing relationships between the game genres and learning techniques based on the types of learning and potential game style of Prensky [1] and learning styles based on the study of Chong et al. [2].
CXLEngine: a comprehensive XML loosely structured search engine
Authors: Kamal Taha, Ramez Elmasri
Venue: Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web (2008)

We proposed previously in [9] an XML semantic search engine called OOXSearch, which answers loosely structured queries. It takes into account the semantic relationships between data elements based on their contexts. The context of a data element is determined by its parent element. The framework of OOXSearch treats each parent-children set of elements as a single unified entity. OOXSearch works well for all types of XML trees, except when the tree contains a parent that has a child interior element, whose type is the same as the type of its parent (e.g. the parent is "professor and its child interior element is "student" - both professor and student belong to the "person" type). In this paper, we propose an XML search engine called CXLEngine, which is an improvement over OOXSearch. It adopts all the techniques of OOXSearch in addition to new techniques that handle the types of XML trees described above, which OOXSearch does not handle well. We evaluated CXLEngine by comparing it experimentally with OOXSearch and with two other proposed systems, XSEarch [5] and Schema-Free XQuery [8]. The results showed marked improvement.