ppxscal/embedding_network huggingface dataset:
Composer: Authoring Tool for iTV Programs
Authors: Rodrigo Laiola Guimarães, Romualdo Monteiro De Resende Costa, Luiz Fernando Gomes Soares
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

This paper presents Composer, an authoring tool to help creating interactive TV programs for the Brazilian Terrestrial Digital TV System. In Composer, several abstractions are defined creating different document views (structural, temporal, layout and textual). One of these views, the temporal view, preserves as much as possible the timeline paradigm, so popular in TV program editing. Using this view, authoring can be done by placing media objects on a time axis, however, preserving the relative relationships among them. Moreover, non-deterministic time events, like viewer interactions and content adaptations, can also be represented in the temporal view. In addition, the occurrence of these unpredictable events can be simulated, and the resulting TV program played, from any starting point. Besides other facilities provided by its four views, Composer also supports third-party views created as add-ons, and live program editing.
Early Aspects for Non-Functional Properties in Service Oriented Business Processes
Authors: Hiroshi Wada, Junichi Suzuki, Katsuya Oba
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

In Service Oriented Architecture, each application is often designed with a set of reusable services and a business process. In order to retain the reusability of services, it is important to separate non-functional properties of applications (e.g., security and reliability) from their functional properties. Currently, non-functional properties are often defined on a per-service basis. In contrast, this paper investigates a new per-process strategy, and proposes an aspect oriented language to separate functional and non-functional properties in business processes. Each aspect formally specifies non-functional properties that crosscut among multiple services. The proposed language frees applications developers from manually specifying and validating non-functional properties for services one by one, thereby reducing the burdens/costs of application development and maintenance. This paper describes the design of the proposed language and demonstrates how each aspect (i.e., a set of non-functional properties) is woven to a business process and transformed to application code.
An Introduction to Application-Independent Evaluation of Speaker Recognition Systems
Authors: David A. Leeuwen, Niko Brümmer
Venue: Speaker Classification I: Fundamentals, Features, and Methods (2007)

In the evaluation of speaker recognition systems--an important part of speaker classification [1], the trade-off between missed speakers and false alarms has always been an important diagnostic tool. NIST has defined the task of speaker detection with the associated Detection Cost Function (DCF) to evaluate performance, and introduced the DET-plot [2] as a diagnostic tool. Since the first evaluation in 1996, these evaluation tools have been embraced by the research community. Although it is an excellent measure, the DCF has the limitation that it has parameters that imply a particular application of the speaker detection technology.In this chapter we introduce an evaluation measure that instead averages detection performance over application types. This metric, , was first introduced in 2004 by one of the authors [3]. Here we introduce the subject with a minimum of mathematical detail, concentrating on the various interpretations of and its practical application.We will emphasize the difference between discrimination abilities of a speaker detector (`the position/shape of the DET-curve'), and the calibration of the detector (`how well was the threshold set'). If speaker detectors can be built to output well-calibrated log-likelihood-ratio scores, such detectors can be said to have an application-independent calibration. The proposed metric can properly evaluate the discrimination abilities of the log-likelihood-ratio scores, as well as the quality of the calibration.
Study of Time-Frequency Order Tracking of Vibration Signals of Rotating Machinery in Changing State
Authors: Xiaoping Zhao, Qingpeng Kong, Qingtao Guo
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Order tracking is an important method for condition monitoring and fault diagnosis, dynamic analysis and design in rotating machinery. Especially, the hidden fault is usually easier to discover at engine run up/down. Order tracking is implemented by band pass filter in time-frequency domain and time signal of desired order is reconstructed. Compared to other existing order analysis methods, this technique is not only more intuitive and more powerful, and can also be applied where rotational speed information is not available. The experimental results show that the method is suitable for vibration response character extraction of rotating machinery.
Cryptanalysis of SFLASH with Slightly Modified Parameters
Authors: Vivien Dubois, Pierre-Alain Fouque, Jacques Stern
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

SFLASH is a signature scheme which belongs to a family of multivariate schemes proposed by Patarin et al. in 1998 [9]. The SFLASH scheme itself has been designed in 2001 [8] and has been selected in 2003 by the NESSIE European Consortium [6] as the best known solution for implementation on low cost smart cards. In this paper, we show that slight modifications of the parameters of SFLASH within the general family initially proposed renders the scheme insecure. The attack uses simple linear algebra, and allows to forge a signature for an arbitrary message in a question of minutes for practical parameters, using only the public key. Although SFLASH itself is not amenable to our attack, it is worrying to observe that no rationale was ever offered for this "lucky" choice of parameters.
An Ontology---Based Semantic Cooperation Framework for Business Processes
Authors: Yue Ni, Shuangxi Huang, Yushun Fan
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

Nowadays many functions within intra- and inter- enterprises have been encapsulated into Web services to enable platform independent integration and interoperation. To realize the enterprise applications, most Web services are composed as workflows based on Business Process Execute Language (BPEL). However, the absence of semantic information in processes reduces the efficiency of interoperation and cooperation among these Web services from different providers. In this paper, a novel framework to support semantic cooperation of business processes is proposed, which brings semantic information into processes through mapping OWL-S to BPEL and Web Service Definition Language (WSDL) documents, then Web services from various domains and enterprises can understand each other eventually. The framework is being implemented under Project ImportNET.
Classification and Retrieval through Semantic Kernels
Authors: Claudia D'Amato, Nicola Fanizzi, Floriana Esposito
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting well-founded kernel methods for several mining applications related to OWL knowledge bases. Namely, our method integrates the novel kernel functions with a support vector machine that can be set up to work with these representations. In particular, we present preliminary experiments where statistical classifiers are induced to perform the tasks of instance classification and retrieval.
A Monitoring Toolset for Paose
Authors: Lawrence Cabac, Till Dörges, Heiko Rölke
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

Paose (Petri net-based Agent-Oriented Software Engineering) combines the paradigm of AOSE (Agent-Oriented Software Engineering, see [10]) with the expressive power of Petri nets - reference nets [12] to be more precise. While AOSE is a powerful approach when it comes to designing and developing distributed (agent) applications, it does not address the problems specific to debugging, monitoring, and testing of these applications, i.e. no global state of the system and very dynamic operating conditions. To tackle these problems, two tools have been developed in the context of Paose, which are presented in this work.Firstly, this paper will give a short overview over the interrelated set of tools, which exists already and supports Petri net-based AOSE. The tools are centered around the Petri net-based multi-agent system development and runtime environment Renew / Mulan / Capa.Secondly, Mulan-Viewer and Mulan-Sniffer will be presented in more detail --- two tools to address the issues encountered during debugging, monitoring, and testing agent applications. Both tools are first class members of the aforementioned family. The first tool, Mulan-Viewer, deals with the introspection of agents and agent behaviors, while it also offers rudimentary features for controlling the agent-system. The Mulan-Sniffer as the second tool places emphasis on tracing, visualizing, and analyzing communication between all parts of the multi-agent application and offers interfaces for more advanced methods of analysis, such as process mining. Both Mulan-Viewer and Mulan-Sniffer are realized as Renew plugins that can also be extended by other plugins.
A Kernel-Based Two-Stage One-Class Support Vector Machines Algorithm
Authors: Chi-Yuan Yeh, Shie-Jue Lee
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

One-class SVM is a kernel-based method that utilizes the kernel trick for data clustering. However it is only able to detect one cluster of non-convex shape in the input space. In this study, we propose an iterative two-stage one-class SVM to cluster data into several groups. In the first stage, one-class SVM is used to find an optimal weight vector for each cluster in the feature space, while in the second stage the weight vector is used to refine the clustering result. A mechanism is provided to control the optimal hyperplane to work against outliers. Experimental results have shown that our method compares favorably with other kernel based clustering algorithms, such as KKM and KFCM on several synthetic data sets and UCI real data sets.
Measuring Complexity of Object Oriented Programs
Authors: Sanjay Misra, Ibrahim Akman
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this paper, a metric for object oriented language is formulated and validated. On the contrary of the other metrics used for object oriented programming (OOPs), the proposed metric calculates the complexity of a class at method level and hence considers the internal architecture of the classes, subclasses and member functions. The proposed metric is evaluated against Weyuker's proposed set of measurement principles through examples and validated through experimentation, case study and comparative study with similar measures. The practical usefulness of the metric is evaluated by a practical framework.
A multi-agent cooperative model for crisis management system
Authors: Abeer El-Korany, Khaled El-Bahnasy
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The aim of this paper is to present a multi-agent based approach for crisis management. The proposed framework oriented towered fire fighting and suppression. The main purpose of this system is to enable the users manage fire by providing advice to enhance the decision process and response. A multi-agent system that decomposed of a fire control KADS-based expert system agents, GIS agent, and other sophisticated web-based services is presented. A prototype is implemented to demonstrate the feasibility this system. The main purpose of the prototype is to provide the fire fighters with effective management of resources and activities that take place in handling fires.
Victor Mikhaylovich Glushkov, 1923-1982
Authors: Heinz Zemanek
Venue: IEEE Annals of the History of Computing (1982)

Academician Victor M. Glushkov, vice president of the Ukrainian Academy of Sciences, director of the Institute for Cybernetics in Kiev, and holder of the IFIP Silver-Core, died on January 30, 1982, after a long and severe illness. 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
PDE4Java: Plagiarism Detection Engine for Java source code: a clustering approach
Authors: Ameera Jadalla, Ashraf Elnagar
Venue: International Journal of Business Intelligence and Data Mining (2008)

The educational community across the world is facing the increasing problem of plagiarism. The proposed Plagiarism Detection Engine for Java (PDE4Java) detects code-plagiarism by applying data mining techniques. The engine consists of three main phases; Java tokenisation, similarity measurement and clustering. It has an optional default tokeniser that makes it flexible to be used with almost any programming language. The system provides a visualising representation for each cluster besides the textual representation. The simulation results of PDE4Java showed a comparable performance to that of JPlag and it outperformed the expectations when compared to the domain experts' findings.
Solution of an open problem on pseudo-Archimedean t-norms
Authors: Kun-Lun Zhang, Dong-Hai Li, Li-Xia Song
Venue: Information Sciences: an International Journal (2008)

An open problem on pseudo-Archimedean t-norms, recently posed by B. De Baets and R. Mesiar [B. De Baets, R. Mesiar, Triangular norms on product lattices, Fuzzy Sets and Systems 104 (1) (1999) 61-75], is discussed.
Collaborative Environments through Dialogues and PBL to Encourage the Self-directed Learning in Computational Sciences
Authors: Fernando Ramos-Quintana, Josefina Sámano-Galindo, Víctor H. Zárate-Silva
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Self-directed learning has been one of the main objectives in the education domain. A learning model can drive a self-directed learning if an adequate educational environment is built. We propose an educational environment to encourage the self-directed learning, which is composed of a computer collaborative tool that uses dialogues and the concept of ill structured problems. The knowledge being learned is represented by a network of concepts built by the students through the exchanged messages. The network of concepts expressed the relation between the main concepts of the topic being learned. A coherent network is the tangible proof that the process of self-directed learning has been correctly achieved. Two topics of computer sciences are reported: Object Oriented Programming and Case Based Reasoning. The results have proven that along with the knowledge acquired, self-directed learning contributes directly to the development of skills for solving problems and attitudes of collaborative work.
Facility Location in Dynamic Geometric Data Streams
Authors: Christiane Lammersen, Christian Sohler
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We present a randomized algorithm that maintains a constant factor approximation for the cost of the facility location problem in the dynamic geometric data stream model. In this model, the input is a sequence of insert and delete operations of points from a discrete space { 1 ...Δ} d , where d is a constant. The algorithm needs $\log^{\mathcal{O}(1)}\Delta$ time to process an insertion or deletion of a point, uses $\log^{\mathcal{O}(1)}\Delta$ bits of storage, and has a failure probability of 1/Δ ¿(1).
Higher-level layout through topological abstraction
Authors: Angelo Di Iorio, Luca Furini, Fabio Vitali, John Lumley, Tony Wiley
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Existing layout languages provide support for geometric properties allowing - and in a sense forcing - users to give a complete geometric description of the desired output: if the characteristics of the output medium change, the layout of the whole document has to be reworked completely, as the properties set by the user are no longer appropriate for the modified context. In this paper we propose a different paradigm which allows users to produce layouts by describing their topological and abstract properties, rather than geometric ones. We first define and detail topological properties as abstract relationships between the document components, independent from the output characteristics, and then describe an XML-based layout language based on these concepts, called TALL. A running engine able to transform topological layouts into actual PDF files, based on XSLT and the DDF framework, is presented as well.
Post's Problem for Ordinal Register Machines
Authors: Joel D. Hamkins, Russell G. Miller
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We study Post's Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounded in the writable ordinals. This mirrors the results in [3] for infinite-time Turing machines, and also provides insight into the different methods required for register machines and Turing machines in infinite time.
Testing criteria for object oriented visual dataflow languages
Authors: Marcel R. Karam
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Commercial and research Visual Dataflow Languages (VDFLs) with object oriented features have had a substantial impact on end-user programming. Like any other object oriented programming languages, be they visual or textual, VDFLs often contain faults. In this article we investigate, from a data-flow testing perspective, the various side effects introduced by objects behavior in VDFLs. Our findings helped us establish the theoretical and practical foundations needed to adapt code-based data-flow test adequacy criteria to VDFLs, in the context of Prograph [7], and provide users of the latter with some of the error detection benefits of traditional object oriented testing.
Deriving and Mining Spatiotemporal Event Schemas in In-Situ Sensor Data
Authors: Arie Croitoru
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This paper introduces a novel framework for deriving and mining hierarchical event structures of spatiotemporal phenomena in data from in-situ sensor measurements. The framework builds on the hierarchical event schema as a cogitative construct for the understanding of dynamic phenomena and on the granularity tree as a hierarchical ontological construct for spatiotemporal phenomena. The construction of event schemas (and granularity trees) is carried out using scale-space analysis from which the interval tree, a hierarchical decomposition of the data is derived. We show that the interval tree fulfills the Axioms and conditions of both time granularity and granularity trees, and expand the granularity tree construct to support temporal order constraints. Once hierarchical decomposition is derived, the data mining problem is transformed to an ordered tree matching problem.
Multilingual Interfaces for Parallel Coupling in Multiphysics and Multiscale Systems
Authors: Everest T. Ong, J. Walter Larson, Boyana Norris, Robert L. Jacob, Michael Tobis, Michael Steder
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Multiphysics and multiscale simulation systems are emerging as a new grand challenge in computational science, largely because of increased computing power provided by the distributed-memory parallel programming model on commodity clusters. These systems often present a parallel coupling problem in their intercomponent data exchanges. Another potential problem in these coupled systems is language interoperability between their various constituent codes. In anticipation of combined parallel coupling/language interoperability challenges, we have created a set of interlanguage bindings for a successful parallel coupling library, the Model Coupling Toolkit. We describe the method used for automatically generating the bindings using the Babel language interoperability tool, and illustrate with short examples how MCT can be used from the C++ and Python languages. We report preliminary performance reports for the MCT interpolation benchmark. We conclude with a discussion of the significance of this work to the rapid prototyping of large parallel coupled systems.
Gender Effect on Functional Networks in Resting Brain
Authors: Liang Wang, Chaozhe Zhu, Yong He, Qiuhai Zhong, Yufeng Zang
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Previous studies have witnessed that complex brain networks have the properties of high global and local efficiency. In this study, we investigated the gender effect on brain functional networks measured using functional magnetic resonance imaging (fMRI). Our experimental results showed that there were no significant difference in global and local efficiency between male and female. However, the gender-related effects on nodal efficiency were found at several brain regions, including the left middle frontal gyrus, right superior temporal gyrus, left middle cingulum gyrus, left hippocampus, right hippocampus, right parahippocampal and left amygdala. These results were compatible with previous findings. To our knowledge, this study provided the first evidence of gender effect on the efficiency of brain functional networks using resting-state fMRI.
A Path Finding Via VRML and VISION Overlay for Autonomous Robot
Authors: Kil To Chong, Eun-Ho Son, Jong-Ho Park, Young-Chul Kim
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

We describe a method for localizing a mobile robot in its working environment using a vision system and Virtual Reality Modeling Language (VRML). The robot identifies the landmarks located in the environment, using image processing and neural network pattern matching techniques, and then it performs self-positioning based on vision information and a well-known localization algorithm. The correction of position error is performed using the 2-D scene of the vision and the overlay with the VRML scene. Through an experiment, the self-positioning algorithm has been implemented to a prototype robot and also it performed autonomous path tracking.