ppxscal/embedding_network huggingface dataset:
Directed Percolation Arising in Stochastic Cellular Automata Analysis
Authors: Damien Regnault
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Cellular automata are both seen as a model of computation and as tools to model real life systems. Historically they were studied under synchronous dynamics where all the cells of the system are updated at each time step. Meanwhile the question of probabilistic dynamics emerges: on the one hand, to develop cellular automata which are capable of reliable computation even when some random errors occur [24,14,13]; on the other hand, because synchronous dynamics is not a reasonable assumption to simulate real life systems.Among cellular automata a specific class was largely studied in synchronous dynamics : the elementary cellular automata (ECA). These are the "simplest" cellular automata. Nevertheless they exhibit complex behaviors and even Turing universality. Several studies [20,7,8,5] have focused on this class under ¿-asynchronous dynamics where each cell has a probability ¿ to be updated independently. It has been shown that some of these cellular automata exhibit interesting behavior such as phase transition when the asynchronicity rate ¿ varies.Due to their richness of behavior, probabilistic cellular automata are also very hard to study. Almost nothing is known of their behavior [20]. Understanding these "simple" rules is a key step to analyze more complex systems. We present here a coupling between oriented percolation and ECA 178 and confirms observations made in [5] that percolation may arise in cellular automata. As a consequence this coupling shows that there is a positive probability that the ECA 178 does not reach a stable configuration as soon as the initial configuration is not a stable configuration and ¿> 0.996. Experimentally, this result seems to stay true as soon as ¿ > ¿ c ≈ 0.5.
Towards Self-configuration in Autonomic Electronic Institutions
Authors: Eva Bou, Maite López-Sánchez, Juan Antonio Rodríguez-Aguilar
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

Electronic institutions (EIs) have been proposed as a means of regulating open agent societies. EIs define the rules of the game in agent societies by fixing what agents are permitted and forbidden to do and under what circumstances. And yet, there is the need for EIs to adapt their regulations to comply with their goals despite coping with varying populations of self-interested agents. In this paper we focus on the extension of EIs with autonomic capabilities to allow them to yield a dynamical answer to changing circumstances through the adaptation of their norms.
Quantitative Languages
Authors: Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computation. We use weighted automata (finite automata with transition weights) to define several natural classes of quantitative languages over finite and infinite words; in particular, the real value of an infinite run is computed as the maximum, limsup, liminf, limit average, or discounted sum of the transition weights. We define the classical decision problems of automata theory (emptiness, universality, language inclusion, and language equivalence) in the quantitative setting and study their computational complexity. As the decidability of language inclusion remains open for some classes of weighted automata, we introduce a notion of quantitative simulation that is decidable and implies language inclusion. We also give a complete characterization of the expressive power of the various classes of weighted automata. In particular, we show that most classes of weighted automata cannot be determinized.
A comparative study of parallelization paradigms
Authors: Imran Ahmad, Aneel Rahim, Adeel Javed, Khalid Haseeb, G. Qasim
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Parallel programming is a challenging job in distributed community and depends upon the availability of suitable software tools and environment. And consequently, software developers have to face constraints such as nondeterminism, communication, synchronization, data partitioning and distribution, load balancing, fault-tolerance, heterogeneity, shared or distributed memory, deadlocks, and race conditions. In this communication, a comparative study of parallelization paradigms is presented which facilitates the parallel programmer to choose the appropriate and suitable paradigms in different scenarios.
Temporal Analysis of Mammograms Based on Graph Matching
Authors: Fei Ma, Mariusz Bajger, Murk J. Bottema
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

A method is proposed for detecting masses in screening mammograms by analyzing changes between current and previous mammograms. The method uses graph matching in order to circumvent the problem of registering images of the same breast taken up to three years apart. Ninety five temporal pairs of images were separated into a training set (51 pairs) and a testing set (44 pairs). A small increase in performance, as measured by the area under the ROC curve, was found for the testing set when detection rates with graph matching were compared to detection rates without graph matching.
Switching Linear Dynamic Models for Noise Robust In-Car Speech Recognition
Authors: Björn Schuller, Martin Wöllmer, Tobias Moosmayr, Günther Ruske, Gerhard Rigoll
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

Performance of speech recognition systems strongly degrades in the presence of background noise, like the driving noise in the interior of a car. We compare two different Kalman filtering approaches which attempt to improve noise robustness: Switching Linear Dynamic Models (SLDM) and Autoregressive Switching Linear Dynamical Systems (AR-SLDS). Unlike previous works which are restricted on considering white noise, we evaluate the modeling concepts in a noisy speech recognition task where also colored noise produced through different driving conditions and car types is taken into account. Thereby we demonstrate that speech enhancement based on Kalman filtering prevails over all standard de-noising techniques considered herein, such as Wiener filtering, Histogram Equalization, and Unsupervised Spectral Subtraction.
Automating Architecture Trade-Off Decision Making through a Complex Multi-attribute Decision Process
Authors: Majid Makki, Ebrahim Bagheri, Ali A. Ghorbani
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

A typical software architecture design process requires the architects to make various trade-off architecture decisions. The architects need to consider different possibilities and combinations of tactics and patterns to satisfy the elicited quality scenarios of the intended software system, some of which may be conflicting or inconsistent in nature. The formation of the correct composition of these elements of architecture decisions for the satisfaction of the quality scenarios can be considered an important art of the architect; however, in cases where the architect is dealing with multiple stakeholders with inconsistent preferences, this can be an awkward task. In this paper, we formalize this process as a complex multi-attribute decision making procedure within the Attribute Driven Design methodology. In such a context, we are able to incrementally elicit the communal preferences of the stakeholders with regards to the available quality scenarios and hence assist the software architect in methodically making the architecture decisions with the highest expected utility for the stakeholders.We will also introduce our implementation of a decision support system, which embodies the methods proposed in this paper, along with a case study.
Web-Based Lemmatisation of Named Entities
Authors: Richárd Farkas, Veronika Vincze, István Nagy, Róbert Ormándi, György Szarvas, Attila Almási
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

Identifying the lemma of a Named Entity is important for many Natural Language Processing applications like Information Retrieval. Here we introduce a novel approach for Named Entity lemmatisation which utilises the occurrence frequencies of each possible lemma. We constructed four corpora in English and Hungarian and trained machine learning methods using them to obtain simple decision rules based on the web frequencies of the lemmas. In experiments our web-based heuristic achieved an average accuracy of nearly 91%.
Research on Sampling Methods in Particle Filtering Based upon Microstructure of State Variable
Authors: Zhiquan Feng, Bo Yang, Yuehui Chen, Yanwei Zheng, Yi Li, Zhonghua Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

With the purpose of decreasing the number of particles needed to be sampled stochastically in particle filtering, a new sampling method used in particle filtering is put forward in this paper. First of all, under specific human-computer conditions, both cognitive psychology features of operators and motion features of the operators' hands are studied, upon which a novel concept, microstructure of state variable (MSV), is proposed. Then, a general method to describe the MSV is further discussed. At last, a Sampling Algorithm based on the MSV is put forward, which is also called SAMSV. The MSV provides an unique and efficient mathematic model that makes SAMSV avoid sampling huge particles with poor quality. In order to demonstrate validity and performance of SAMSV, a great deal of experiments is completed. By using fewer particles, compared with conventional particle filtering, the SAMSV may achieve better tracking precision. In forms of both the theoretical analysis and a great deal of experimental results from real video data, just a few particles are needed to describe post probability distribution of state variables without reducing the tracking precision by our dimensionality reduction method.
The Simplest XML Retrieval Baseline That Could Possibly Work
Authors: Philipp Dopichaj
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

Five years of INEX have produced many competing XML element retrieval methods that make use of the document structure. So far, no clearly best method has been identified, and there is even no clear evidence what parts of the document structure can be used to improve retrieval quality. Little research has been done on simply using standard information retrieval techniques for XML retrieval. This paper aims at addressing this; it contains a detailed analysis of the BM25 similarity measure in this context, revealing that this can form a viable baseline method.
Pogany: A Tangible Cephalomorphic Interface for Expressive Facial Animation
Authors: Christian Jacquemin
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

A head-shaped input device is used to produce expressive facial animations. The physical interface is divided into zones, and each zone controls an expression on a smiley or on a virtual 3D face. Through contacts with the interface users can generate basic or blended expressions. To evaluate the interface and to analyze the behavior of the users, we performed a study made of three experiments in which subjects were asked to reproduce simple or more subtle expressions. The results show that the subjects easily accept the interface and get engaged in a pleasant affective relationship that make them feel as sculpting the virtual face. This work shows that anthropomorphic interfaces can be used successfully for intuitive affective expression.
Educators Symposium at MODELS 2008
Authors: Michał Śmiałek
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Model-driven engineering is becoming increasingly popular in software development projects as it raises level of abstraction, thus improving our ability to handle complex systems. In many academic and industrial centers, software modeling has already been introduced into their curricula. Despite this, it seems that education does not yet support the modeling paradigm well enough thus limiting its acceptance as a mature method of developing software systems. The goal of this symposium was to find ways to change this situation. Specifically, the symposium sought ways of showing benefits of modeling in a way that is pedagogically effective and attractive to the students. It also tried to make recommendations for placing the modeling courses in the overall software development educational path, which should include not only UML fundamentals but also a demonstration of the importance and place of modeling in the overall path from business (environment) to software products.
Averaging Centerlines: Mean Shift on Paths
Authors: Theo Walsum, Michiel Schaap, Coert T. Metz, Alina G. Giessen, Wiro J. Niessen
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Generation of a reference standard from multiple manually annotated datasets is a non-trivial problem. This paper discusses the weighted averaging of 3D open curves, which we used to generate a reference standard for vessel tracking data. We show how weighted averaging can be implemented by applying the Mean Shift algorithm to paths, and discuss the details of our implementation. Our approach can handle cases where the observer centerlines take different branches in a natural way. The method has been evaluated on synthetic data, and has been used to generate reference centerlines for evaluation of vessel tracking algorithms.
Capturing performance knowledge for automated analysis
Authors: Kevin A. Huck, Oscar Hernandez, Van Bui, Sunita Chandrasekaran, Barbara Chapman, Allen D. Malony, Lois Curfman McInnes, Boyana Norris
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Automating the process of parallel performance experimentation, analysis, and problem diagnosis can enhance environments for performance-directed application development, compilation, and execution. This is especially true when parametric studies, modeling, and optimization strategies require large amounts of data to be collected and processed for knowledge synthesis and reuse. This paper describes the integration of the PerfExplorer performance data mining framework with the OpenUH compiler infrastructure. OpenUH provides auto-instrumentation of source code for performance experimentation and PerfExplorer provides automated and reusable analysis of the performance data through a scripting interface. More importantly, PerfExplorer inference rules have been developed to recognize and diagnose performance characteristics important for optimization strategies and modeling. Three case studies are presented which show our success with automation in OpenMP and MPI code tuning, parametric characterization, and power modeling. The paper discusses how the integration supports performance knowledge engineering across applications and feedback-based compiler optimization in general.
The DR-Prolog Tool Suite for Defeasible Reasoning and Proof Explanation in the Semantic Web
Authors: Antonis Bikakis, Constantinos Papatheodorou, Grigoris Antoniou
Venue: Proceedings of the 5th Hellenic conference on Artificial Intelligence: Theories, Models and Applications (2008)

In this work we present the design and general architecture of DR-Prolog, a system for defeasible reasoning and proof explanation in the Semantic Web, and the implementation of three different tools that constitute the DR-Prolog Tool Suite: (a) the DR-Prolog API; (b) the DR-Prolog Web application; and (c) the DR-Prolog desktop application. DR-Prolog supports reasoning with Defeasible Logic theories and ontological knowledge in RDF(S) and OWL, is compatible with RuleML, and enables extracting meaningful proof explanations for the answers it computes.
Computable Riemann Surfaces
Authors: Robert Rettinger
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

In this paper we introduce computable and time bounded Riemann surfaces, based on the classical abstract definition by charts. Building upon this definition we discuss computable versions of several classical results, such as the existence of complete continuations of holomorphic functions, universal coverings and the uniformization theorem (for some cases).Though we state most of our results for computable surfaces, many of them can also be transformed to a uniform version, i.e. based on representations of the class of Riemann surfaces (modulo conformal equivalence).
Global Induction of Decision Trees: From Parallel Implementation to Distributed Evolution
Authors: Marek Kretowski, Piotr Popczyński
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In most of data mining systems decision trees are induced in a top-down manner. This greedy method is fast but can fail for certain classification problems. As an alternative a global approach based on evolutionary algorithms (EAs) can be applied. We developed Global Decision Tree (GDT) system, which learns a tree structure and tests in one run of the EA. Specialized genetic operators are used, which allow the system to exchange parts of trees, generate new sub-trees, prune existing ones as well as change the node type and the tests. The system is able to induce univariate, oblique and mixed decision trees. In the paper, we investigate how the GDT system can profit from a parallelization on a compute cluster. Both parallel implementation and distributed version of the induction are considered and significant speedups are obtained. Preliminary experimental results show that at least for certain problems the distributed version of the GDT system is more accurate than its panmictic predecessor.
Unequal Error Recovery Scheme for Multimedia Streaming in Application-Level Multicast
Authors: Joonhyoung Lee, Youngha Jung, Yoonsik Choe
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

As a way of implementing multicast delivery, application-level multicast (ALM) is known for its various advantages including high flexibility and easy deployment. However, one of its key limitations in achieving reliability and quality-of-service (QoS) for streaming services is the hierarchical error propagation caused by its tree structure. As a solution to this error propagation problem, we propose an unequal error recovery (UER) scheme where we apply different number of retransmissions to the different levels of the ALM tree. The error recovery scheme is implemented using reliable-UDP (RUDP). For each node of the ALM tree, the optimal number of the maximum retransmissions that minimizes the residual loss rate is obtained using Lagrange theory for a given delay constraint. Compared to the equal error recovery scheme where the equal number of maximum retransmissions is applied throughout the ALM tree, the proposed UER scheme shows up to 10% improvement in residual loss rate while maintaining acceptable delay overhead for real-time streaming applications.
Enhanced Security by OS-Oriented Encapsulation in TPM-Enabled DRM
Authors: Yongdong Wu, Feng Bao, Robert H. Deng, Marc Mouffron, Frederic Rousseau
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

The Trusted Computing Group (TCG) defines the specifications for the Trusted Platform Module (TPM) and corresponding trust mechanisms that allow a TPM-enabled platform to run only authenticated software. For example, the operating system (OS) can use the facilities provided by the TPM to authenticate a Digital Rights Management (DRM) application before allowing it to run. However TCG does not provide any clear specification on what kind of software can be regarded as trusted and hence be authenticated. In fact it is unlikely that there will be a clear line between the software that should be authenticated and those should not, e.g., debugger for developing binary codes and Internet browser for running applets. This leaves a grey area where even authenticated software may be exploited for malicious usage. This paper investigates the security of DRM applications in a relaxed scenario where users have larger purview. We present two attacks: abuse attack and injection attack where some reasonably authenticated software can be exploited for stealing protected contents. In the abuse attack, an attacker uses an authenticated debugger to monitor the internal state of a DRM application for the purpose of violating the access privilege in the application. In the injection attack, an adversary is able to make malicious modifications on an original DRM application at will. These two attacks demonstrate that it is not straightforward to impose DRM in a TPM-enabled system. To counter the attacks, we provide the OS-encapsulation scheme which ensures that only the genuine OS can start the DRM application. Our scheme is an enhancement of security for TPM-enabled DRM in a loose but more practical environment, where people are allowed to use the debugger, web browser, etc.
Labelled Splitting
Authors: Arnaud Fietzke, Christoph Weidenbach
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

We define a superposition calculus with explicit splitting and an explicit, new backtracking rule on the basis of labelled clauses. For the first time we show a superposition calculus with explicit backtracking rule sound and complete. The new backtracking rule advances backtracking with branch condensing known from Spass. An experimental evaluation of an implementation of the new rule shows that it improves considerably the previous Spass splitting implementation. Finally, we discuss the relationship between labelled first-order splitting and DPLL style splitting with intelligent backtracking and clause learning.
Through-the-Lens Scene Design
Authors: Ye Tao, Marc Christie, Xueqing Li
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

The increasing need in composing nice views of 3D scenes make it necessary to propose better editing tools that emphasize composition and aesthetics through high-level manipulators. In this paper, we propose to relieve the user from some low-level aspects of manipulation using a Through-the-lens declarative scheme. The projected features of the components that guide the composition of a picture (staging, camera and settings) are considered as primitives on which constraints can be applied. Specifically, we show how to compute the locations and orientations of objects, cameras and lights by constraining such features as vertex positions, specular reflections, shadows and penumbra.
Performance Analysis of Unix-based Network File Systems
Authors: A. Melamed
Venue: IEEE Micro (1987)

Predictive models of Unix-based distributed file systems help the designer choose an architecture for such a system, configure it, and study the effects of enhancing it. 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