ppxscal/embedding_network huggingface dataset:
A Reconfiguration Framework for Self-Healing Software
Authors: Jeongmin Park, Giljong Yoo, Eunseok Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The computing environment of today is very complex. Research that endows a system with a self-healing ability that recognizes problems arising in a target system is valuable. However, most of the existing research shows that self-healing development environments need much effort and time to analyze and model constraints. Thus, in order to these problems, this paper proposes a reconfiguration framework for self-healing software. Through these, we can reduce the efforts required for developers of self-healing systems to analyze the target system. Abnormal behavior of the target system in regard to both external and internal problems can be resolved. We use a video conference system to evaluate the proposed approach. The effectiveness of our approach, compared against existing approaches for self-healing systems is verified.
Concurrent Program Metrics Drawn by Quasar
Authors: Claude Kaiser, Christophe Pajault, Jean-François Pradat-Peyre
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

Aiming at developing reliable concurrent software, the engineering practice uses appropriate metrics. Our tool Quasar analyses automatically the concurrent part of programs and produces data reporting its analysis process. We attempt to use the data as metrics for concurrent programming. The first aim of Quasar is the validation of concurrent code; in addition, the reported data may be relevant to mark the quality of code, to evaluate different concurrency semantics, to compare the execution indeterminism of different implementations of a concurrency pattern and to estimate the scalability of a solution. As a case study we analyse with Quasar several implementations of a distributed symmetric non-deterministic rendezvous algorithm. We consider two possible uses of the collected data for indeterminism estimation and for concurrent software quality.
The Truncated Tornado in TMBB: A Spatiotemporal Uncertainty Model for Moving Objects
Authors: Shayma Alkobaisi, Petr Vojtěchovský, Wan D. Bae, Seon Ho Kim, Scott T. Leutenegger
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

The uncertainty management problem is one of the key issues associated with moving objects (MOs). Minimizing the uncertainty region size can increase both query accuracy and system performance. In this paper, we propose an uncertainty model called the Truncated Tornado model as a significant advance in minimizing uncertainty region sizes. The Truncated Tornado model removes uncertainty region sub-areas that are unreachable due to the maximum velocity and acceleration of the MOs. To make indexing of the uncertainty regions more tractable we utilize an approximation technique called Tilted Minimum Bounding Box (TMBB) approximation. Through experimental evaluations we show that Truncated Tornado in TMBB results in orders of magnitude reduction in volume compared to a recently proposed model called the Tornado model and to the standard "Cone" model when approximated by axis-parallel MBB.
Improved Camera Calibration Method Based on a Two-Dimensional Template
Authors: Carlos Ricolfe-Viala, Antonio-Jose Sanchez-Salmeron
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Camera calibration is necessary to obtain 3D information from 2D images of a scene. Different techniques exist which are based on photo-grammetry or self-calibration. As a result of the calibration the intrinsic and extrinsic camera parameters are computed. A lot of work has been done in camera calibration and also in data pre- and post-processing techniques. From a practical point of view, it is quite difficult to decide which calibration method produces the best results and even whether any data processing at all is necessary.This paper defines the best performance camera calibration algorithm. Based on the state of the art of all camera calibration processes, including pre- and post-processing data, a camera calibration method is chosen on the grounds of robustness and ease of handing. After, the calibration method is improved adding pre- and post-processing statements. Data treatment reduces the noise of the measurements and optimum performance is thus achieved. Its performance is tested with both simulated and real data and best results are always computed. The aim is to define a complete method which will allow all camera calibration situations to be easily resolved.
Effectiveness of group moderation program for developing professional assessment skills of teachers
Authors: Hironori Sasaki, Yuka Kawasaki, Haruhisa Yamaguchi, Yumi Yamaguchi
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

In this study we created and applied a system of "group moderation" to clarify the criterion of the grades that teachers gave to students. In group moderation, teachers gathered with students' works and graded them. Then, they examined the reasons why they gave a particular grade and why other teachers graded higher or lower. The purpose of Group Moderation is to maintain consistency in teachers' judgments in criterion-based assessment. We set Group Moderation emphasizing on how to develop the professional assessment skill of teachers. We have also practiced Group Moderation in a seminar at the Okayama Education Center in Okayama, Japan. The results of this study showed that 1) group moderation improved the assessment ability of teachers to create the feedback on how to instruct students to achieve a higher level. 2) Group Moderation enhanced their ability to maintain the consistency of assessment.
On Linear Logic Planning and Concurrency
Authors: Ozan Kahramanoğulları
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We present an approach to linear logic planning where an explicit correspondence between partial order plans and multiplicative exponential linear logic proofs is established. This is performed by extracting partial order plans from sound and complete encodings of planning problems in multiplicative exponential linear logic in a way that exhibits a non-interleaving behavioral concurrency semantics. Relying on this fact, we argue that this work is a crucial step for establishing a common language for concurrency and planning that will allow to carry techniques and methods between these two fields.
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Authors: Phillip Rogaway, John Steinberger
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

We propose a family of compression functions built from fixed-key blockciphers and investigate their collision and preimage security in the ideal-cipher model. The constructions have security approaching and in many cases equaling the security upper bounds found in previous work of the authors [24]. In particular, we describe a 2n-bit to n-bit compression function using three n-bit permutation calls that has collision security N 0.5, where N = 2 n , and we describe 3n-bit to 2n-bit compression functions using five and six permutation calls and having collision security of at least N 0.55 and N 0.63.
Computational Discovery in Pure Mathematics
Authors: Simon Colton
Venue: Computational Discovery of Scientific Knowledge: Introduction, Techniques, and Applications in Environmental and Life Sciences (2007)

We discuss what constitutes knowledge in pure mathematics and how new advances are made and communicated. We describe the impact of computer algebra systems, automated theorem provers, programs designed to generate examples, mathematical databases, and theory formation programs on the body of knowledge in pure mathematics. We discuss to what extent the output from certain programs can be considered a discovery in pure mathematics. This enables us to assess the state of the art with respect to Newell and Simon's prediction that a computer would discover and prove an important mathematical theorem.
Pell Equations and Weak Regularity Principles
Authors: Charalampos Cornaros
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We study the strength of weak forms of the Regularity Principle in the presence of IE 1 (induction on bounded existential formulas) relative to other subsystems of PA. In particular, the Bounded Weak Regularity Principle is formulated, and it is shown that when applied to E 1 formulas, this principle is equivalent over $IE_1^-$ to IΔ 0 + exp. 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
Controlled Information Sharing in Collaborative Distributed Query Processing
Authors: Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

We present a simple, yet powerful, approach for the specification and enforcement of authorizations regulating data release among data holders collaborating in a distributed computation, to ensure that query processing discloses only data whose release has been explicitly authorized. Data disclosure is captured by means of profiles, associated with each data computation, that describe the information carried by the result. We also present an algorithm that, given a query plan, determines whether it can be safely executed and produces a safe execution strategy. The main advantage of our approach is its simplicity that, without impacting expressiveness, makes it nicely interoperable with current solutions for collaborative computations in distributed database systems.
XML Based Semantic Data Grid Service
Authors: Hui Tan, Xinmeng Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

This paper introduces a novel wrapper-mediator based semantic data grid service mechanism to solve the problem of Semantic heterogeneity and few compatible data sources. It uses ontology based semantic information to wrap the heterogeneous data source, and employs mediator structure to supply accessing interface for the data sources, and it extends semantic query, mapping and fusion languages to support semantic grid communication mechanism. The extension of XML algebra with semantic query enhanced is discussed to enable semantic querying on data gird environment.
Mapping Pipeline Skeletons onto Heterogeneous Platforms
Authors: Anne Benoit, Yves Robert
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous ---nowadays a standard assumption. A high-level approach to parallel programming not only eases the application developer's task, but it also provides additional information which can help realize an efficient mapping of the application. In this paper, we discuss the mapping of pipeline skeletons onto different types of platforms (from fully homogeneous to heterogeneous). We assume that a pipeline stage must be mapped on a single processor, and we establish new theoretical complexity results for two different mapping policies: a mapping can be either one-to-one (at most one stage per processor), or interval-based (interval of consecutive stages per processor). We provide several efficient polynomial heuristics for the most important policy/platform combination, namely interval-based mappings on platforms with identical communication links but different speed processors.
Quick Energy Drop in Stochastic 2D Minority
Authors: Damien Regnault
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Cellular automata are usually updated synchronously and thus deterministically. The question of stochastic dynamics arises in the development of cellular automata resistant to noise [1] and in simulation of real life systems [2]. Synchronous updates may not be a valid hypothesis for such simulations and most of these studies use stochastic versions of cellular automata.In [3,4,5,6], the authors study different classes of cellular automata under fully asynchronous dynamics (only one random cell fires at each time step) and ¿-asynchronous dynamics (each cell has a probability ¿ to fire at each time step). They develop tools and methods to ease the study of other cellular automata. In [4,6], they analyze 2D Minority under fully asynchronous dynamics for Von Neumann and Moore neighborhoods. The behavior of this cellular automaton under these dynamics is surprisingly rich. The energy of a configuration is an useful information. In [4], it is proved that configurations of energy greater than $\frac{5mn}{3}$ (where m and n are the length and the width of the configuration) will not appear in the long range behavior of 2D minority for Von Neumann neighborhood. In this paper we improve this bound to $18\lceil \frac{m}{4} \rceil \lceil \frac{n}{4} \rceil$. The proof is based on an enumeration of cases made by computer. This method could be easily tuned for other cellular automata or neighborhoods.
Dynamically Evolvable Dependable Software: From Oxymoron to Reality
Authors: Carlo Ghezzi, Paola Inverardi, Carlo Montangero
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

We analyze the main motivations that lead to the present need for supporting continuous software evolution, and discuss some of the reasons for change requirements. Achieving software that is both dynamically evolvable and dependable is our long-term research goal. We do not attempt here to propose a unified solution to dissolve the apparent oximoron, i.e. to reconcile these apparently conflicting goals. Rather, we enlighten different facets of the problem by distilling our experience through three research experience reports. We discuss the lessons learned from the state of the art and practice exemplified by our approaches and outline the directions of possible future research.
Exploiting COTS-Based RE Methods: An Experience Report
Authors: Nan Niu, Steve Easterbrook
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

This paper reports on an exploratory study of a key hypothesis of enterprise resource planning (ERP) requirements engineering (RE) adoption, namely that framing applications to the packaged RE model leads to integral practices and economic development. We analyzed two interrelated pilot projects developed for a business division of a large IT company, using Oracle's commercial off-the-shelf (COTS) application implementation method (AIM). The study showed that AIM RE improved team collaboration and project management experience, but needed to make hidden assumptions explicit to support data visibility and integrity. Our study can help practitioners generate more effective and mature processes when exploiting COTS-based RE methods.
A Computational Model of Formation of Grid Field and Theta Phase Precession in the Entorhinal Cells
Authors: Yoko Yamaguchi, Colin Molter, Wu Zhihua, Harshavardhan A. Agashe, Hiroaki Wagatsuma
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

This paper proposes a computational model of spatio-temporal property formation in the entorhinal neurons recently known as "grid cells". The model consists of module structures for local path integration, multiple sensory integration and for theta phase coding of grid fields. Theta phase precession naturally encodes the spatial information in theta phase. The proposed module structures have good agreement with head direction cells and grid cells in the entorhinal cortex. The functional role of theta phase coding in the entorhinal cortex for cognitive map formation in the hippocampus is discussed.
Quadrics of Revolution
Authors: Ronald Goldman
Venue: IEEE Computer Graphics and Applications (1983)

Arising naturally in mechanical design, these shapes are easier to analyze and use in solid modeling systems than the more general quadric surfaces.
SAT: situation-aware trust architecture for vehicular networks
Authors: Xiaoyan Hong, Dijiang Huang, Mario Gerla, Zhen Cao
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

Establishing trust in vehicular networks is a critical but also difficult task. In this position paper, we present a new trust architecture and model - Situation-Aware Trust (SAT) - to address several important trust issues in vehicular networks that we believe are essential to overcome the weaknesses of the current vehicular network security and trust models. Our model also strengthens the tie between Internet infrastructure. The new SAT includes three main components: (a) an attribute based policy control model for highly dynamic communication environments, (b) a proactive trust model to build trust among vehicles and prevent the breakage of the existing trust, and (c) a social network based trust system to enhance trust and to allow the set up of a decentralized trust framework when the vehicular network is under infrastructure failure or under attacks.
A Protocol to Cipher Digital Images Based on Cat Maps and Cellular Automata
Authors: A. Martín Del Rey, G. Rodríguez Sánchez, A. Villa Cuenca
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

In this paper a novel symmetric protocol to cipher digital images is introduced. The protocol proposed in this work is based on the paradigm stated by J. Fridrich at 1998. Consequently, there are two iterative stages in the algorithm: The confusion stage permutes the pixels in the image using the Cat map, whereas in the diffusion stage, the pixel values (the color of each pixel) are modified sequentially such that a small change in the color of only one pixel is spread out to many pixels. This second phase is carryied out by means of a reversible cellular automaton. The proposed protocol is shown to be secure against the more important cryptanalytic attacks.
Resilient network admission control
Authors: Michael Menth, Stefan Kopf, Joachim Charzinski, Karl Schrodi
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

Network admission control (NAC) limits the traffic in a network to avoid overload and to assure thereby the quality of service (QoS) for admitted flows. Overload may occur due to exceptional traffic demand, but it is mostly caused by redirected traffic due to link failures. Conventional NAC methods cannot cope with network outages and fail when they are needed most. This paper categorizes existing and new NAC methods and makes them resilient to network failures by a resilient resource management. We compare the efficiency of the NAC methods with and without resilience requirements and show that they have a significant impact on the required backup capacity when resilience is required.
A Domain-Specific-Modeling Approach to Support Scenarios-Based Instructional Design
Authors: Pierre Laforcade, Boubekeur Zendagui, Vincent Barré
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Over recent years, Model-Driven-Engineering has attracted growing interest as much as a research domain as an industrial process that can be applied to various educational domains. This article aims to discuss and propose such an application for learning-scenario-centered instructional design processes. Our proposition is based on a 3-domain categorization for learning scenarios. We also discuss and explain why we think Domain-Specific Modeling techniques are the future new trend in order to support the emergence of communities of practices for scenario-based instructional design. The originality resides in the support we propose to help communities of practitioners in building specific Visual Instructional Design Languages with dedicated editors instead of providing them with yet another language or editor.
Construction of Hierarchical Multi-Organ Statistical Atlases and Their Application to Multi-Organ Segmentation from CT Images
Authors: Toshiyuki Okada, Keita Yokota, Masatoshi Hori, Masahiko Nakamoto, Hironobu Nakamura, Yoshinobu Sato
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Hierarchical multi-organ statistical atlases are constructed with the aim of achieving fully automated segmentation of the liver and related organs from computed tomography images. Constraints on inter-relations among organs are embedded in hierarchical organization of probabilistic atlases (PAs) and statistical shape models (SSMs). Hierarchical PAs are constructed based on the hierarchical nature of inter-organ relationships. Multi-organ SSMs (MO-SSMs) are combined with previously proposed single-organ multi-level SSMs (ML-SSMs). A hierarchical segmentation procedure is then formulated using the constructed hierarchical atlases. The basic approach consists of hierarchical recursive processes of initial region extraction using PAs and subsequent refinement using ML/MO-SSMs. The experimental results show that segmentation accuracy of the liver was improved by incorporating constraints on inter-organ relationships.
Hybrid Multi-Agent Architecture (HoCa) Applied to the Control and Supervision of Patients in Their Homes
Authors: Juan A. Fraile, Dante I. Tapia, Miguel A. Sánchez
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents a Hybrid Multi-Agent Architecture based on an Ambient Intelligence model, for the control and supervision of dependent environments. HoCa architecture incorporates a management system of alerts based on SMS and MMS technologies, and an automated identification, localization, and movement control system based on Java Card and RFID technologies. HoCa is independent from the programming language and operating system in that it is executable. The core of the architecture is formed by both deliberative agents and reactive agents that interact to offer efficient services. The architecture has been tested in a real environment and the results obtained are presented in this paper.
Accent and Channel Adaptation for Use in a Telephone-Based Spoken Dialog System
Authors: Kinfe Tadesse Mengistu, Andreas Wendemuth
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

An utterance conveys not only the intended message but also information about the speaker's gender, accent, age group, etc. In a spoken dialog system, these information can be used to improve speech recognition for a target group of users that share common vocal characteristics. In this paper, we describe various approaches to adapt acoustic models trained on native English data to the vocal characteristics of German-accented English speakers. We show that significant performance boost can be achieved by using speaker adaptation techniques such as Maximum Likelihood Linear Regression (MLLR), Maximum a Posteriori (MAP) adaptation, and a combination of the two for the purpose of accent adaptation. We also show that promising performance gain can be obtained through cross-language accent adaptation, where native German speech from a different application domain is used as enrollment data. Moreover, we show the use of MLLR for telephone channel adaptation.