ppxscal/embedding_network huggingface dataset:
Motion estimation in 2D-DCT transform domain
Authors: Petrescu Catalin-Dumitru, Stefanoiu Dan, Lupu Ciprian
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Motion estimation is one of the most important steps in video compression algorithms. It reduces temporal redundancy present in frame sequences and allows a better compression of video material. Most of the actual video compression algorithms use "block matching" methods which operate on the bitmap form of the frames. Because real motion in video frames is not carried out over integer pixels, sub-pixel motion estimation is performed for improving the quality of the compression. Also, most of the video compression algorithms use discrete cosine transform for coding the residual frame information (in the motion compensation step). For this reason, motion estimation algorithms which operate directly in discrete cosine transform domain are of great interest. This paper presents a method for computing the values of DCT coefficients of a block of pixels positioned on certain coordinates over four adjacent blocks using only the DCT coefficients of these four blocks. Also, an equivalent of the full-search algorithm translated in 2D-DCT domain is presented.
Keynote lecture: discovery of faults in electrical machines using data mining tools
Authors: Sérgio Pinheiro dos Santos
Venue: Proceedings of the 7th WSEAS International Conference on Application of Electrical Engineering (2008)

Data mining is predicted to be one of ten emerging technologies that will change the world. According to the Gartner Group, "Data mining is the process of discovering meaningful new correlations, patterns and trends by sifting through large amounts of data stored in repositories, using pattern recognition technologies as well as statistical and mathematical techniques." With the rapid development of devices and computer technology, more and more on line systems have been installed to monitor the running conditions of machines groups, which resulted in the massive quantities of accumulative data. Now, many large-scale databases and data warehouses have come into being, some even arrived at the level of TB. And many researchers are faced with the urgent problem, as how make full use of such data, and whether it is feasible to extract valuable knowledge and condition monitoring. Maintenance costs represent a significant percent of industrial products' cost. The induction motor (IM) is the most commonly used type of ac motor. Examples are found in pumps, refrigerator compressors and so on. IMs are vulnerable problems as temperature, undesirable vibrations, unbalance of stator currents and broken bars, usually detected when the equipment is already broken, and sometimes, with irreversible damages. Data mining is a powerful technology with great potential to help researchers in faulty discovering. With the development of artificial intelligence and database technology, some machine learning algorithms including case-based learning, decision trees, genetic algorithm and pattern recognition tools are available in application now. In addition, advanced microprocessor manufacturing technology makes it possible to support the large-scale data analysis and processing. In this plenary speaker, it is outlined the basic notions in this area, define some key ideas and problems, and motivate their importance. Different data mining tools are explained as well some applications in real world problems.
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
Authors: Jorge Castro, Ricard Gavaldà
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

We present an improvement of an algorithm due to Clark and Thollard (Journal of Machine Learning Research, 2004) for PAC-learning distributions generated by Probabilistic Deterministic Finite Automata (PDFA). Our algorithm is an attempt to keep the rigorous guarantees of the original one but use sample sizes that are not as astronomical as predicted by the theory. We prove that indeed our algorithm PAC-learns in a stronger sense than the Clark-Thollard. We also perform very preliminary experiments: We show that on a few small targets (8-10 states) it requires only hundreds of examples to identify the target. We also test the algorithm on a web logfile recording about a hundred thousand sessions from an ecommerce site, from which it is able to extract some nontrivial structure in the form of a PDFA with 30-50 states. An additional feature, in fact partly explaining the reduction in sample size, is that our algorithm does not need as input any information about the distinguishability of the target.
Feature-Oriented Analysis and Specification of Dynamic Product Reconfiguration
Authors: Jaejoon Lee, Dirk Muthig
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

In many application domains, scenarios have been developed that benefit from the idea of ambience; Systems will not necessarily be activated by people anymore, but will react on their own to situations they recognize. It, thereby, must dynamically adapt itself to changes in the technical environment or user context. In addition, such dynamically reconfigurable products must be customized to the individual needs of particular users. Product line engineering can be applied to create these variants efficiently; however, means for handling adaptation capabilities at a generic level are required. This paper introduces the front-end of such a means by describing an approach for analysis and specification of features that vary as a part of reconfigurations at runtime.
Robust second-order accurate discretizations of the multi-dimensional Heaviside and Dirac delta functions
Authors: Chohong Min, Frédéric Gibou
Venue: Journal of Computational Physics (2008)

We present a robust second-order accurate method for discretizing the multi-dimensional Heaviside and the Dirac delta functions on irregular domains. The method is robust in the following ways: (1) integrations of source terms on a co-dimension one surface are independent of the underlying grid and therefore stable under perturbations of the domain's boundary; (2) the method depends only on the function value of a level function, not on its derivatives. We present the discretizations in tabulated form to make their implementations straightforward. We present numerical results in two and three spatial dimensions to demonstrate the second-order accuracy in the L^1-norm in the case of the solution of PDEs with singular source terms. In the case of evaluating the contribution of singular source terms on interfaces, the method is also second-order accurate in the L^~-norm.
Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking
Authors: Jens Schönherr, Martin Freibothe, Bernd Straube, Jörg Bormann
Venue: Theoretical Computer Science (2008)

In this article, a verification methodology for mixed-signal circuits is presented that can easily be integrated into industrial design flows. The proposed verification methodology is based on formal verification methods. A VHDL behavioral description of a mixed-signal circuit is transformed into a discrete model and then verified using well-established tools from formal digital verification. Using the presented methodology, a much higher coverage of the functionality of a mixed-signal circuit can be achieved than with simulation based verification methods. The approach has already been successfully applied to industrial mixed-signal circuits.
A secure peer-to-peer backup system
Authors: Houssem Jarraya, Maryline Laurent-Maknavicius
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

A peer-to-peer (P2P) backup system enables users to save a copy of their data in the free disk space of other peers in order to restore them later in case of hard disk crash, or handling errors... In this paper, we present a new peer-to-peer backup system implemented in the &laquo; DisPairSe &raquo; project and we concentrate on the security of such a system. Indeed, we provide mechanisms to ensure the integrity and confidentiality of data stored in the P2P network while respecting the anonymity of users. We also propose a solution to encourage peers to contribute to the backup system, to banish the selfish behaviour of a few peers and to give access to authorized nodes only. These solutions are based on the definition of a third trust party in charge of controlling the rights and the behaviour of peers.
Display of Density Volumes
Authors: Reiner Lenz, Bjorn Gudmundsson, Bjorn Lindskog, Per Danielsson
Venue: IEEE Computer Graphics and Applications (1986)

The advent of inexpensive, high-speed processing and storage has fueled interest in new ways to process and display 3D images. This new discipline of 3D imaging promises to produce a wealth of exciting applications in many fields. For three years, engineers at Linkoping University have experimented with algorithms and methods to display 3D images obtained from a variety of sources, including computer-aided tomography, transmission electron microscopy, and laser microscopy. This article reviews the applicability of different display methods for different types of volumes, the advantages and disadvantages of different techniques, and the results of experiments when image processing techniques were applied before the images were displayed.
Formal derivation of security design specifications from security requirements
Authors: Riham Hassan, Shawn Bohner, Sherif El-Kassas
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)

Engineering secure software remains a significant challenge for today's software organizations as they struggle to understand the implications of security o the system and develop systems that guarantee specified software security properties. Despite many software engineering advances, current methods for deriving a design from a set of requirements that guarantee the retention of the intended security properties remains difficult and often unachievable. If security requirements are formalized and transformed into design using formal methods, the result would reduce the potential for security vulnerabilities through better clarity, completeness, and consistency. To this end, we outline a requirements-driven security engineering approach for deriving design specifications from security requirements that guarantee security properties specified in requirements are retained. We build on the goal-oriented KAOS (Knowledge Acquisition in autOmated Specifications) framework to formally construct a complete, consistent, and clear security requirements model. The resulting model is then transformed to the B language to derive security design specifications. Using B enables us to further implement the design while preserving requirements relevant security properties. Using the B refinement mechanism, we generate design specifications and ultimately implementation. The approach treats security-specific elements in a systematic and constructive way while considering security early in the development lifecycle with assurance of completeness, consistency and clarity throughout the development. Moreover, our approach allows for requirement traceability at the various phases of development that helps security evaluators to have more confidence in the target of evaluation.
Digital art 2.0: art meets web 2.0 trend
Authors: Sotiris P. Christodoulou, Georgios D. Styliaras
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

In this paper, we describe a review of existing Web 2.0 applications and the current or potential usability of them during the lifecycle of digital art projects. More specifically, we outline the characteristics of the various digital art categories, and the features that need to be supported. Afterwards, we present a classification of Web 2.0 applications and we show how they can support the digital art projects in all categories and lifecycle steps, esp. regarding collaboration, as well as some future potentials.
Reference Architecture for Modeling Collaborative Engineering Processes
Authors: H. R. Siller, C. Vila, A. Estruch, J. V. Abellán, F. Romero
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

In this work, we present a Collaboration Infrastructure Reference Architecture needed to enable the product development process collaboration that has become a common practice between different departments and companies in the context of an Extended Enterprise. Also, a methodology to model the required workflows is presented in order to coordinate the product lifecycle collaboration activities focusing in the design and manufacturing.
A Novel EPA-KNN Gene Classification Algorithm
Authors: Haijun Wang, Yaping Lin, Xinguo Lu, Yalin Nie
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Accurate classification of samples using gene expression frofiles is very important in cancer detection and treatment. In this paper, a novel EPA-KNN (Emerging Patterns Advanced-K Nearest Neighbors) gene classification algorithm is proposed. Bayes estimation is applied for the computation of entropy to improve its reliability, and RCP (Random Cut Point) is presented to strengthen the generalization about unknown test samples. With these improvements, the EPAs are acquired. Then an EPA based classifier is constructed inspired by KNN. The experimental results show the new algorithm is feasible and effective.
The Verb Argument Browser
Authors: Bálint Sass
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

We present a special corpus query tool --- the Verb Argument Browser --- which is suitable for investigating argument structure of verbs. It can answer the following typical research question: What are the salient words which can appear in a free position of a given verb frame? In other words: What are the most important collocates of a given verb (or verb frame) in a particular morphosyntactic position? At present, the Hungarian National Corpus is integrated, but the methodology can be extended to other languages and corpora. The application has been of significant help in building lexical resources (e.g. the Hungarian WordNet) and it can be useful in any lexicographic work or even language teaching. The tool is available online at http://corpus.nytud.hu/vab (username: tsd, password: vab). 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
A Rich Internet Application Based on BPEL Services Composition for Port Logistics
Authors: Peng Zhu, Dongyuan Zhan, Chuanhong Zhu, Dongmin Li, Tingxin Song, Biqing Huang
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Cooperation among enterprises plays more and more important roles for meeting various customized demands and fast-changing market environment. Service Oriented Architecture (SOA) is an effective approach of integrating resources across enterprises. Web Service is a practical way to realize SOA and is getting broad applications in business. Web service composition becomes a bridge between service technologies and business processes. A service composition system is developed in this paper, which allows users to describe, publish and organize services, and orchestrate complex service process. Verification in logistics domain is implemented and a Rich Internet Application portal using Flex is employed.
Experimental System to Support Real-Time Driving Pattern Recognition
Authors: Vincenzo Lecce, Marco Calabrese
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This work proposes an advanced driving information system that, using the acceleration signature provided by low cost sensors and a GPS receiver, infers information on the driving behaviour. The proposed system uses pattern matching to identify and classify driving styles. Sensor data are quantified in terms of fuzzy concepts on the driving style. The GPS positioning datum is used to recognize trajectory (rectilinear, curving) while the acceleration signature is bounded within the detected trajectory. Rules of inference are applied to the combination of the sensor outputs. The system is real-time and it is based on a low-cost embedded lightweight architecture which has been presented in a previous work.
Efficient Finite Fields in the Maxima Computer Algebra System
Authors: Fabrizio Caruso, Jacopo D'Aurizio, Alasdair Mcandrew
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

In this paper we present our implementation of finite fields in the free and open Maxima computer algebra system. In the first version of our package we focused our efforts on efficient computation of primitive elements and modular roots. Our optimizations involve some heuristic methods that use "modular composition" and the generalized Tonelli-Shanks algorithm. Other open and free systems such as GP/Pari do not include in their standard packages any support for finite fields. The computation of the primitive element in Maxima is now faster than in Axiom. Our package provides a more user-friendly interface for teaching than other comparable systems.
Feature Selection for VIP E-Mail Accounts Analysis
Authors: Zhan Zhang, Yingjie Tian, Yong Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper introduces several feature selection methods on the VIP E-Mail account analysis, and then uses SVM to classify the users in order to maintain the ones who may leave in a short time. The websites hosting companies can follow the strategies, which are investigated in this paper, to reduce their labor cost and provide an attractive and simple registration for the users. The result shows that we can also reach the feasible predict accuracy.
The Interdisciplinary IMPROVE Project
Authors: M. Nagl
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

As already introduced in Sect. 1.1, IMPROVE is a joint project between different disciplines, namely Chemical Engineering and Informatics. Even more, Plastics Engineering and Labor Research are also involved. Informatics itself is represented by three groups of different research fields.Whereas Sect. 1.1 dealt with the problem to be solved and Sect. 1.2 discussed a resulting integrated prototypical environment, this section discusses the project and the research and development process to solve these problems.The section is structured as follows: First, the IMPROVE project structure is discussed, next its iterative and practical approach is introduced. Two further characterizations are given, namely the funding of IMPROVE and the predecessor projects. Finally, we give a survey of this book's structure. 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
Learning to share: narrowband-friendly wideband networks
Authors: Hariharan Rahul, Nate Kushman, Dina Katabi, Charles Sodini, Farinaz Edalat
Venue: ACM SIGCOMM Computer Communication Review (2008)

Wideband technologies in the unlicensed spectrum can satisfy the ever-increasing demands for wireless bandwidth created by emerging rich media applications. The key challenge for such systems, however, is to allow narrowband technologies that share these bands (say, 802.11 a/b/g/n, Zigbee) to achieve their normal performance, without compromising the throughput or range of the wideband network. This paper presents SWIFT, the first system where high-throughput wideband nodes are shown in a working deployment to coexist with unknown narrowband devices, while forming a network of their own. Prior work avoids narrowband devices by operating below the noise level and limiting itself to a single contiguous unused band. While this achieves coexistence, it sacrifices the throughput and operating distance of the wideband device. In contrast, SWIFT creates high throughput wireless links by weaving together non-contiguous unused frequency bands that change as narrowband devices enter or leave the environment. This design principle of cognitive aggregation allows SWIFT to achieve coexistence, while operating at normal power, and thereby obtaining higher throughput and greater operating range. We implement SWIFT on a wideband hardware platform, and evaluate it in the presence of 802.11 devices. In comparison to a baseline that coexists with narrowband devices by operating below their noise level, SWIFT is equally narrowband-friendly but achieves 3.6-10.5x higher throughput and 6x greater range.
The Complexity of Power-Index Comparison
Authors: Piotr Faliszewski, Lane A. Hemaspaandra
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

We study the complexity of the following problem: Given two weighted voting games G¿ and G¿¿ that each contain a player p, in which of these games is p's power index value higher? We study this problem with respect to both the Shapley-Shubik power index [16] and the Banzhaf power index [3,6]. Our main result is that for both of these power indices the problem is complete for probabilistic polynomial time (i.e., is PP-complete). We apply our results to partially resolve some recently proposed problems regarding the complexity of weighted voting games. We also show that, unlike the Banzhaf power index, the Shapley-Shubik power index is not #P-parsimonious-complete. This finding sets a hard limit on the possible strengthenings of a result of Deng and Papadimitriou [5], who showed that the Shapley-Shubik power index is #P-metric-complete.
Tlk or txt? Using voice input for SMS composition
Authors: Anna L. Cox, Paul A. Cairns, Alison Walton, Sasha Lee
Venue: Personal and Ubiquitous Computing (2008)

This paper reports a series of investigations, which aim to test the appropriateness of voice recognition as an interaction method for mobile phone use. First, a KLM model was used in order to compare the speed of using voice recognition against using multi-tap and predictive text (the two most common methods of text entry) to interact with the phone menus and compose a text message. The results showed that speech is faster than the other two methods and that a combination of input methods provides the quickest task completion times. The first experiment used a controlled message creation task to validate the KLM predictions. This experiment also confirmed that the result was not due to a speed/accuracy trade off and that participants preferred to use the combination of input methods rather than a single method for menu interaction and text composition. The second experiment investigated the effect of limited visual feedback (when walking down the road or driving a car for example) on interaction, providing further evidence in support of speech as a useful input method. These experiments not only indicate the usefulness of voice in SMS input but also that users could also be satisfied with voice input in hands-busy, eyes-busy situations.