ppxscal/embedding_network huggingface dataset:
Inverse Kinematics Using Sequential Monte Carlo Methods
Authors: Nicolas Courty, Elise Arnaud
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to avoid the classical pitfalls of numerical inversion methods since only direct calculations are required. The resulting algorithm accepts arbitrary constraints and exhibits linear complexity with respect to the number of degrees of freedom. Hence, the proposed system is far more efficient for articulated figures with a high number of degrees of freedom.
New Data Types and Operations to Support Geo-streams
Authors: Yan Huang, Chengyang Zhang
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

The volume of real-time streaming data produced by geo-referenced sensors and sensor networks is staggeringly large and growing rapidly. Queries on these geo-streams often require tracking spatio-temporal extent (e.g. evolving region) continuously in real time. The notion of real-time monitoring and notification requires support from a database capable of tracking and querying dynamic and transient spatio-temporal events as well as static spatial objects and sending out real-time notifications. In this paper, we leverage the work in data type based spatio-temporal databases and propose new data types called STREAM and their abstract semantics to support geo-stream applications. New operations on STREAM data types are defined and illustrated by embedding them into SQL.
Algebraic-Distance Minimization of Lines and Ellipses for Traffic Sign Shape Localization
Authors: Pedro Gil-Jiménez, Saturnino Maldonado-Bascón, Hilario Gómez-Moreno, Sergio Lafuente-Arroyo, Javier Acevedo-Rodríguez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

In traffic sign recognition systems, one of the normal approaches is the identification of the shape of the sign prior to the recognition itself. Normally, the recognition process needs an accurate localization of the sign for a good performance. If we are dealing with triangular, rectangular and circular signs, this means the accurate localization of the vertices of the triangle and the rectangle, or the parameters of the ellipse. In this paper we have developed a system which searches the above mentioned parameters from the signature of the blob using techniques of algebraic-distance minimization. Comparisons with previous works show good improvements in the localization of the shape, especially in the presence of slight occlusions. This work is part of a traffic sign recognition system, and in this paper we focus on the shape localization step.
Structure of Query Modification Process: Branchings
Authors: Nikolai Buzikashvili
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

A common approach to query log analysis considers any query only as a possible modification of a direct predecessor. The paper considers a branching search. It is shown that up to 20% of sessions containing 3 and more different queries contain combinations which may be interpreted as branchings; a number of branches is a little bigger than two; one of the branches consists of only one query; branching may be realized as both narrowing and broadening.
Verified Methods in Stochastic Traffic Modelling
Authors: Sebastian Kempken, Wolfram Luther
Venue: Reliable Implementation of Real Number Algorithms: Theory and Practice: International Seminar Dagstuhl Castle, Germany, January 8-13, 2006 Revised Papers (2008)

In this paper, we present two validated methods from different application fields in stochastic traffic modelling. First, we show how the autocorrelation of a semi-Markov arrival process can be described as a sum of exponential terms using validated numerics. Next, we use interval arithmetic as a reliable method to analyse the transient states of simple GI/G/1 queueing systems and compute the time required for the system to reach the equilibrium.
An Introduction to Computer Graphics and Creative 3-D Environments, 1 edition
Authors: Barry G. Blundell
Venue:  (2008)

This book introduces the fundamentals of 2-D and 3-D computer graphics. Additionally, a range of emerging, creative 3-D display technologies are described, including stereoscopic systems, immersive virtual reality, volumetric, varifocal, and others. Interaction is a vital aspect of modern computer graphics, and issues concerning interaction (including haptic feedback) are discussed. Included with the book are anaglyph, stereoscopic, and Pulfrich viewing glasses. Topics covered include: - essential mathematics, - vital 2-D and 3-D graphics techniques, - key features of the graphics, - pipeline, - display and interaction techniques, - important historical milestones. Designed to be a core teaching text at the undergraduate level, accessible to students with wide-ranging backgrounds, only an elementary grounding in mathematics is assumed as key maths is provided. Regular Over to You activities are included, and each chapter concludes with review and discussion questions.
Deploying DSR Technology on Today's Mobile Phones: A Feasibility Study
Authors: Dmitry Zaykovskiy, Alexander Schmitt
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

In this paper we study the feasibility for the deployment of Distributed Speech Recognition (DSR) technology on today's mobile phones using publicly available tools and architectures. The existing standards for DSR front-ends are presented and discussed; arguments for the choice of an appropriate standard for a deployment on the particular platform are given. We point out hindrances and pitfalls during development and deployment. Standard conform solutions for the two most prominent development environments, Symbian C++ and Java Micro Edition, are presented and evaluated on real end-user devices.
Detecting digital audio forgeries by checking frame offsets
Authors: Rui Yang, Zhenhua Qu, Jiwu Huang
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

MP3 is the most popular compressed audio format in our daily life but it can be doctored very easily by pervasive audio editing software. Thus it is necessary to develop authentication methods for MP3. Different from JPEG compression for image, MP3 compression has its own characteristics. Thus existing forensics methods for JPEG compression is unable to be applied to MP3 compression directly. In this paper, we propose a passive approach to detect doctored MP3 audio by checking frame offsets. As the audio samples are divided into frames to encode, each frame has its own frame offset after encoding. Forgeries lead to the broken of frame grids. So the frame offsets are good indication for locating forgeries, and the frame offsets can be detected by the identification of quantization characteristic. In this way, the doctored positions can be automatically located. Experimental results demonstrate the validity of the proposed approach on detecting some common forgeries, such as deletion, insertion, substitution and splicing. Under different bitrates, the detection ratios are above 94%. To the best of our knowledge, this piece of work is the first one to investigate digital forensics on MP3 format.
SVM Model Based on Particle Swarm Optimization for Short-Term Load Forecasting
Authors: Yongli Wang, Dongxiao Niu, Weijun Wang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

A model integrating Particle Swarm Optimization (PSO) and support vector machines (SVM) is presented to forecast short-term load of electric power systems in this paper. PSO is a method for finding a solution of stochastic global optimizer based on swarm intelligence. Using the interaction of particles, PSO searches the solution space intelligently and finds out the best one. The PSO-SVM method proposed in this paper is based on the global optimization of PSO and local accurate searching of SVM. Practical example results indicate that the application of the PSO-SVM method to short term load forecasting of power systems is feasible and effective. And to prove the effectiveness of the model, other existing methods are used to compare with the result of SVM. The results show that the model is effective and highly accurate in the forecasting of short-term power load.
Optimization of Parametric Companding Function for an Efficient Coding
Authors: Shin-Ichi Maeda, Shin Ishii
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Designing a lossy source code remains one of the important topics in information theory, and has a lot of applications. Although plain vector quantization (VQ) can realize any fixed-length lossy source coding, it has a serious drawback in the computation cost. Companding vector quantization (CVQ) reduces the complexity by replacing vector quantization with a set of scalar quantizations. It can represent a wide class of practical VQs, while the structure in CVQ restricts it from representing every lossy source coding. In this article, we propose an optimization method for parametrized CVQ by utilizing a newly derived distortion formula. To test its validity, we applied the method especially to transform coding. We found that our trained CVQ outperforms Karhunen-Loëve transformation (KLT)-based coding not only in the case of linear mixtures of uniform sources, but also in the case of low bit-rate coding of a Gaussian source.
Theoretical Study of the Structural and Electronic Properties of Luteolin and Apigenin Dyes
Authors: Anna Amat, Antonio Sgamellotti, Simona Fantacci
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

In this paper structure and electronic properties of luteolin and apigenin and all their possible anionic species have been investigated with DFT and MP2 methods. Molecular geometries have been optimized obtaining for all systems non-planar structures except for the deprotonated species in 4' position. Potential energy proles as a function of the torsional angle between B phenyl ring and 1,4-benzopyrone have been computed for luteolin and apigenin and their corresponding anionic species in 4' position. Electronic structure for both neutral avonoids has been analyzed with DFT(B3LYP) investigating the frontier molecular orbitals in terms of energy and character. Finally, changes on the electronical structure upon deprotonation have been evaluated.
A PGAS-Based Algorithm for the Longest Common Subsequence Problem
Authors: M. Bakhouya, O. Serres, T. El-Ghazawi
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Finding the Longest Common Subsequence (LCS) is a traditional and well studied problem in bioinformatics and text editing. In this paper, a customized parallel algorithm based on the Partitioned Global Address Space (PGAS) programming model to compute the LCS is presented. The algorithm is based on two related parameters balancing the communication and the synchronization needs in order to find the best data and workload distributions. The basic design of the algorithm and its complexity analysis are discussed together with experimental results. These results show the impact of those parameters on PGAS algorithm performance.
An abstract interface for cyber-defense mechanisms
Authors: Franklin Webber, Partha Pal, Paul Rubel, Michael Atighetchi
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

Defending a computer system against malicious attack depends on making many different defense mechanisms work together. In addition to protecting against intrusions, these mechanisms should provide intrusion detection and response. The semantics of input and output for these mechanisms -- what the alert from an intrusion detector means, and the implications of issuing a command in response -- can vary greatly from one mechanism to another. In this paper, we discuss the abstract interface we have developed for integrating various defense mechanisms to defend a distributed application. Our interface is more than an API: it defines not only the syntax of communication with defense mechanisms but also its meaning, thus allowing us to reason systematically about the state of attack and defense. We briefly describe our current work toward automating that reasoning and thus toward applications that defend themselves intelligently and automatically. We also argue that reasoning about attack and defense at an abstract level allows one to model and analyze whether the defense is effective.
An Overview on Mobile E-Learning Research of Domestic and Foreign
Authors: Yun Yang, Wenan Tan, Suxian Lin, Xianhua Zhao, Fujun Yang
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Mobile e-Learning is based on the combination of mobile data communication technology and wireless Internet. It is important to study and analyze mobile e-Learning research of domestic and foreign,because it will drive the future education and learning markets. This paper summarizes the research on Mobile e-Learning around the whole world and shows clearly construction directions needed toward in China. A systematic discussion and analysis of e-learning providers, educational institutions, and their cooperation is also presented.
Recovering capitalization and punctuation marks for automatic speech recognition: Case study for Portuguese broadcast news
Authors: F. Batista, D. Caseiro, N. Mamede, I. Trancoso
Venue: Speech Communication (2008)

The following material presents a study about recovering punctuation marks, and capitalization information from European Portuguese broadcast news speech transcriptions. Different approaches were tested for capitalization, both generative and discriminative, using: finite state transducers automatically built from language models; and maximum entropy models. Several resources were used, including lexica, written newspaper corpora and speech transcriptions. Finite state transducers produced the best results for written newspaper corpora, but the maximum entropy approach also proved to be a good choice, suitable for the capitalization of speech transcriptions, and allowing straightforward on-the-fly capitalization. Evaluation results are presented both for written newspaper corpora and for broadcast news speech transcriptions. The frequency of each punctuation mark in BN speech transcriptions was analyzed for three different languages: English, Spanish and Portuguese. The punctuation task was performed using a maximum entropy modeling approach, which combines different types of information both lexical and acoustic. The contribution of each feature was analyzed individually and separated results for each focus condition are given, making it possible to analyze the performance differences between planned and spontaneous speech. All results were evaluated on speech transcriptions of a Portuguese broadcast news corpus. The benefits of enriching speech recognition with punctuation and capitalization are shown in an example, illustrating the effects of described experiments into spoken texts.
Arabic Named Entity Recognition from Diverse Text Types
Authors: Khaled Shaalan, Hafsa Raza
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

Name identification has been worked on quite intensively for the past few years, and has been incorporated into several products. Many researchers have attacked this problem in a variety of languages but only a few limited researches have focused on Named Entity Recognition (NER) for Arabic text due to the lack of resources for Arabic named entities and the limited amount of progress made in Arabic natural language processing in general. In this paper, we present the results of our attempt at the recognition and extraction of 10 most important named entities in Arabic script; the person name, location, company, date, time, price, measurement, phone number, ISBN and file name. We developed the system, Name Entity Recognition for Arabic (NERA), using a rule-based approach. The system consists of a whitelist representing a dictionary of names, and a grammar, in the form of regular expressions, which are responsible for recognizing the named entities. NERA is evaluated using our own corpora that are tagged in a semi-automated way, and the performance results achieved were satisfactory in terms of precision, recall, and f-measure.
A Broad Band Parameter Identifying Model for Structural Dynamics Auto-Test
Authors: Jian-yang Zhao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

An algorithm of auto-parameter identification of broad band model (BBPI) is presented. The complete frequency-band of interest can be processed at once without depending on user interface. The paper represents the algorithm theory and its fast methods. The theory sets up on the frequency response functions (FRF) with Least Squares frame curve fitting based on Z-domain. The first methods involve two aspects: the recurring equations for computing frequency-response matrix are used to speed up the modal parameter estimation process, and the terminal condition is used to reduce the repeat times for finding maximum order. Obtained the highest order of matrix, the modal-order and therefore the modal parameters can be computed. As representative example, a Circular Plate data set of 3 references and 36 responses is used to demonstrate the use of BBPI. The results are the same one from complex mode indication function (CMIF). The BBPI can be used to online test system, especially in monitoring situations without user.
A Feature Extraction Method Based on Wavelet Transform and NMFs
Authors: Suwen Zhang, Wanyin Deng, Dandan Miao
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

In this paper, a feature extraction method is proposed by combining Wavelet Transformation (WT) and Non-negative Matrix Factorization with Sparseness constraints (NMFs) together for normal face images and partially occluded ones. Firstly, we apply two-level wavelet transformation to the face images. Then, the low frequency sub-bands are decomposed according to NMFs to extract either the holistic representations or the parts-based ones by constraining the sparseness of the basis images. This method can not only overcome the the low speed and recognition rate problems of traditional methods such as PCA and ICA, but also control the sparseness of the decomposed matrices freely and discover stable, intuitionistic local characteristic more easily compared with classical non-negative matrix factorization algorithm (NMF) and local non-negative matrix decomposition algorithm (LNMF). The experiment result shows that this feature extraction method is easy and feasible with lower complexity. It is also insensitive to the expression and the partial occlusion, obtaining higher recognition rate. Moreover, the WT+NMFs algorithm is robust than traditional ones when the occlusion is serious.
Business Value Assessment of Packaged Applications
Authors: Chunhua Tian, Shun Jiang, Rongzeng Cao, Wei Ding, Juhnyoung Lee
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Unlike others, IT services using packaged applications such as SAP and Oracle modules highly reuse and configure prepackaged software modules. However, the implementation and configuration situation of a packaged application project may significantly differ from another. In this paper, we propose a generic method and model for assessing the cost and benefit of IT services using packaged applications. The proposed method utilizes a questionnaire-based approach to project scoping to capture the heterogeneity. The questionnaire also helps define rules to model the relationship between effort requirements and possible scenarios of packaged application implementation. The proposed method utilizes a rule-based approach to generate cost estimations of given IT service projects. For packaged applications, template data can be pre-defined and customized by using reference process and metrics models, and solution hierarchies. Then, for a given implementation scenario, the business value is estimated by using and customizing the template data. Once the cost and benefit of an IT initiative is assessed as described, other derivative analyses such as business case analyses and pricing can be done by using the estimated costs and business benefits.
Efficient Time Triggered Query Processing in Wireless Sensor Networks
Authors: Bernhard Scholz, Mohamed Medhat Gaber, Tim Dawborn, Raymes Khoury, Edmund Tse
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper we introduce a novel system that comprises techniques advancing the query processing in wireless sensor networks. Our system facilitates time triggered queries that are scheduled in a distributed fashion among sensor nodes. Thus, time synchronisation is of paramount importance. Since accurate time synchronisation requires more energy, our system allows a trade off between precision of time and energy according to the user requirements. To minimize the communication overhead for query processing, our system employs new query execution mechanisms.We have implemented our query processing system on SunTM Small Programmable Object Technology (SPOT) sensor network platform. The system was entirely programmed in Java enabling an object oriented design and implementation. It provides a friendly graphical user interface for query management and visualisation of results.
Maximum Frame Size in Large Layer 2 Networks
Authors: Karel Slavicek
Venue: Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2007)

Ethernet protocol originally designed local area networks became very popular and in practice the only protocol used in local and metropolitan networks. Currently both IETF and IEEE are working on some improvements of this protocol to make it more attractive for usage in WAN networks. These modifications may add some additional fields into ethernet header so that the effective maximum transportable data unit will be decreased. From this point follows the problem how to inform upper layers about maximum data unit which ethernet layer can transport. This problem is not addressed in prepared IETF and IEEE standards. This paper tries to point out to this problem and propose some possible solutions.