ppxscal/embedding_network huggingface dataset:
Some Verification Issues at NASA Goddard Space Flight Center
Authors: Michael G. Hinchey, James L. Rash, Christopher A. Rouff
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

NASA is developing increasingly complex missions to conduct new science and exploration. Missions are increasingly turning to multi-spacecraft to provide multiple simultaneous views of phenomena, and to search more of the solar system in less time. Swarms of intelligent autonomous spacecraft, involving complex behaviors and interactions, are being proposed to accomplish the goals of these new missions. The emergent properties of swarms make these missions powerful, but simultaneously far more difficult to design, and to verify that the proper behaviors will emerge. In verifying the desired behavior of swarms of intelligent interacting agents, the two significant sources of difficulty are the exponential growth of interactions and the emergent behaviors of the swarm. NASA Goddard Space Flight Center (GSFC) is currently involved in two projects that aim to address these sources of difficulty. We describe the work being conducted by NASA GSFC to develop a formal method specifically for swarm technologies. We also describe the use of requirements-based programming in the development of these missions, which, it is believed, will greatly reduce development lead-times and avoid many of the problems associated with such complex systems.
Domain-Specific Model Editors with Model Completion
Authors: Sagar Sen, Benoit Baudry, Hans Vangheluwe
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

Today, integrated development environments such as Eclipse allow users to write programs quickly by presenting a set of recommendations for code completion. Similarly, word processing tools such as Microsoft Word present corrections for grammatical errors in sentences. Both of these existing systems use a set of constraints expressed in the form of a grammar to restrict/correct the user. Taking this idea further, in this paper we present an integrated software system capable of generating recommendations for model completion of partial models built in arbitrary domain specific model editors. We synthesize the model editor equipped with automatic completion from a modelling language's declarative specification consisting of a meta-model and constraints on it along with a visual syntax. The automatic completion feature is powered by a Prolog engine whose input is a constraint logic program derived from some models. The input logic program is obtained by a model transformation from models in multiple languages: the meta-model (as a class diagram), constraints on it (as constraint logic clauses), and a partial model (in the domain specific language). The Prolog engine solves the generated logic program and the solution(if there is one) is returned to the model editor as a set of recommendations for properties of the partial model. We incorporate automatic completion in the generative tool AToM 3 and use SWI-Prolog for constraint representation and satisfaction. We present examples using an illustrative visual language of Finite State Machines.
ROCC: A Communication Overlay Abstraction for Wireless Users
Authors: Seth Holloway, Christine Julien
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

As wireless devices become more popular, the potential for new collaborative applications has emerged. For example, a group of coworkers can opportunistically come together and share project documents and other data. Such applications are characterized by the fact that information needs to be distributed among all members of a group. Supporting such coordination currently requires using low-level multicast protocols that are complex and resource intensive to initialize and maintain without the support of an infrastructure. In this paper, we introduce the ring overlay for collaborative coordination (ROCC), which offers a fair, reliable coordination service for wireless environments. ROCC specifically addresses wireless application situations requiring group coordination. ROCC is influenced by traditional token ring and overlay communication protocols but leverages unique properties of the broadcast nature of the wireless environment to improve performance. The result is a minimal, fair, dynamic group coordination service. This paper introduces the ROCC abstraction and demonstrates its potential through analysis.
Probability Distribution Reconstruction for Nominal Attributes in Privacy Preserving Classification
Authors: Piotr Andruszkiewicz
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Concerns about privacy of data used in Data Mining have emerged recently. Users are afraid of misuse of this data and discovered knowledge. Thus several methods of preserving privacy classification have been proposed in literature. One of these methods enables miners to use continuous and nominal attributes simultaneously in classification. Reconstruction of probability distribution is an important task in privacy preserving classification for both nominal and continuous attributes which were distorted with the randomization-based technique and are stored in centralized database. We present the new algorithm - EQ - for reconstruction of probability distribution of nominal attributes, which outperforms former algorithm especially for high privacy levels. Effectiveness of the new solution (information loss in reconstruction of probability distribution of nominal attributes and accuracy of classification) has been tested and presented in this paper. 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
Distributed Simulation and Web Map Mash-Up for Forest Fire Spread
Authors: Yosri Harzallah, Vincent Michel, Qi Liu, Gabriel Wainer
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

The emergence of recent XML-based technologies paved the way for new types of architectures and message exchanges on the Internet through Web services. Mash-Ups consist of combining existing systems capabilities in order to create new added value services. This paper focuses on a Mash-Up of different Web Services that can be used by emergency planning teams and firefighters to better understand the behavior of wildfires. This mash-up uses a distributed simulation system (DCD++) and it combines it with the Global Weather service, displaying the results on a Google Map. The weather data is combined in real-time with the theoretical fire spreading model to obtain precise results. An XML-based solution has been developed in order to serve performance, interoperability and usability around a two-tier architecture consisting of a Java Servlet and a Javascript client. This effort paves the road for even more advanced solutions integrating the simulation location environment with Geographic Information System (GIS) data, which would highly improve the results obtained by the emergency managers.
Modeling of Signals in Subnanosecond Analog-to-Digital Information Converters
Authors: Albinas Marcinkevičius, Darius Poviliauskas
Venue: Informatica (2004)

The mathematical model and methods of calculation of the layout structure of comparator signal circuits with distributed parameters are presented. The algorithm of computer formulation and solving of equations of transfer functions of comparator circuits is provided. Theoretical substantiation of optimizing the micro-layout of large-scale integration circuits of parallel subnanosecond analog-to-digital converters (ADC) is proposed. The signal modeling and investigation of transitional processes in comparator circuits of the subnanosecond range 6-, 8-bit ADC of different layouts are presented. It has been determined that the transitional process quality in inputs of comparator blocks strongly depends on the signal circuit layout architecture, the compatibility of wave resistances of signal microstrip lines and on the number of branches to comparator bloks.The designed layouts of the 6-bit subnanosecond range ADC comparator circuit with different layout structures are presented. Modeling of equivalent circuits of the designed layouts was performed and the modeling results are presented.The architecture of topology for comparators circuits presented here allows the developing of gigahertz 6- and 8-bit analog-to-digital information converter.
Coalition game-based distributed coverage of unknown environments by robot swarms
Authors: Ke Cheng, Prithviraj Dasgupta
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We consider the problem of distributed exploration or coverage of an unknown environment by a swarm of mobile mini-robots that have limited memory, computation and communication capabilities. We describe a novel mechanism of distributed coverage of an unknown environment by swarmed robots that can dynamically merge and split into structured teams or exchange team members to improve the efficiency of solving the coverage problem. Our mechanism combines the technique of swarm-based flocking with coalition games to enable robots dynamically select utility maximizing teams that move in formation.
OTL: On-Demand Thread Stack Allocation Scheme for Real-Time Sensor Operating Systems
Authors: Sangho Yi, Seungwoo Lee, Yookun Cho, Jiman Hong
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In wireless sensor networks, each sensor node has severe resource constraints in terms of energy, computing device, and memory space. Especially, the memory space of the platform hardware is much smaller than that of the other computing systems. In this paper, we propose a OTL, which is an on-demand thread stack allocation scheme for MMU-less real-time sensor operating systems. The OTL enables to adaptively adjust the stack size by allocating stack frame based on the amount of each function's stack usage. The amount of the function's stack usage is checked at compile-time, and the adaptive adjustment of the stack occurs at run-time. Our experimental results show that the OTL significantly minimizes the spatial overhead of the threads' stacks with tolerable time overhead compared with fixed stack allocation mechanism of the existing sensor operating systems.
Visibly Pushdown Transducers
Authors: Jean-François Raskin, Frédéric Servais
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Visibly pushdown automata have been recently introduced by Alur and Madhusudan as a subclass of pushdown automata. This class enjoys nice properties such as closure under all Boolean operations and the decidability of language inclusion. Along the same line, we introduce here visibly pushdown transducers as a subclass of pushdown transducers. We study properties of those transducers and identify subclasses with useful properties like decidability of type checking as well as preservation of regularity of visibly pushdown languages.
Breast Mass Classification on Full-Field Digital Mammography and Screen-Film Mammography
Authors: Jiazheng Shi, Berkman Sahiner, Heang-Ping Chan, Lubomir M. Hadjiiski, Jun Ge, Jun Wei
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Studies have shown that full-field digital mammography (FFDM) has the potential to alleviate some of the limitations of screen-film mammography (SFM). It is therefore important to develop computer-aided diagnosis (CAD) systems for FFDM or adapt CAD systems developed for SFM to FFDM. The purpose of this study was to evaluate the performance of a CAD system, originally developed for characterization of breast masses on SFM, on a data set of masses acquired with FFDM. The performance on the FFDM set was compared to that on the corresponding masses on SFM of the same patients acquired within six months of the FFDM exam. The CAD system was trained on an SFM data set with 397 biopsy-proven masses (187 malignant and 210 benign) in 868 regions of interest (ROIs) (437 malignant and 431 benign). Four computer-extracted mammographic features and the patient age were selected as input predictor variables to two classification methods: linear discriminant analysis (LDA) and C5.0 decision tree (DT). The trained CAD systems were fixed and tested on an independent FFDM data set with 122 biopsy-proven masses (29 malignant and 93 benign) in 238 ROIs (60 malignant and 178 benign) and on the corresponding SFM data set. Receiver operating characteristic (ROC) analysis indicated that the CAD system using the LDA classifier achieved view-based test Az values of 0.81±0.03 and 0.82±0.03 for SFM and FFDM, respectively. The case-based test Az values with the same classifier were 0.82±0.04 for SFM and 0.88±0.03 for FFDM. The difference in the Az values between the two modalities did not achieve statistical significance (p=0.62 and p=0.13 for view-based and case-based evaluation, respectively). The use of the DT classifier resulted in a slight increase in performance for both modalities, with view-based Az values of 0.82±0.03 and 0.83±0.03 for SFM and FFDM, respectively.
An Adaptive and Customizable Feedback System for Intelligent Interactive Learning Systems
Authors: Maite Lopez-Garate, Alberto Lozano-Rodero, Luis Matey
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper describes a proposal to build an intelligent feedback selection system for Intelligent Interactive Learning Systems (IILS). The system is aimed at generating multimodal feedback in real-time as a response to student's actions. We examine both educational and human factors that have influence on the behavior and let the instructor decide the significance of each factor. The instructor will customize the system to refine its behavior in each training session, and while the system decides which the appropriate feedback is, the instructor can focus on other instructional tasks.
Embodiment in data sculpture: a model of the physical visualization of information
Authors: Jack Zhao, Andrew Vande Moere
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Information is becoming pervasive in the contemporary society, and is increasingly saturating the visual senses and the cognitive efforts of the lay masses. As our attention for visual impulses and cognitive effort has become more competitive, new approaches are being pursued to convey information to people in memorable and intuitive ways. With human's inherent proficiency in comprehending the physical affordances present in the real world, some researchers and designers are investigating how meaningful insights can be conveyed by way of "sculpting" data. This paper proposes a domain model to establish the concept of data sculpture as a data-based physical artifact, possessing both artistic and functional qualities, that aims to augment a nearby audience's understanding of data insights and any socially relevant issues that underlie it. This paper also proposes a model of embodiment to capture and analyze the wide and multi-layered spectrum of existing data sculptures. In this model, the introduced concepts of metaphorical distances are used as a means to measure embodiment in data sculpture. The models provide groundwork for useful design principles for effective information communication of socially relevant, data-driven insights to a large, lay audience using data sculpture.
Blind Source Separation Coping with the Change of the Number of Sources
Authors: Masanori Ito, Noboru Ohnishi, Ali Mansour, Mitsuru Kawamoto
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

This manuscript deals with the blind source separation problem with an instantaneous but dynamical mixture model. This study is limited to the case when the number of sources is time-variant. Theoretically, when new sources are detected, a new separating matrix should be estimated in order to extract all sources. However this effort implies an overwhelm computational cost. Our idea consists to use the previous separating matrix which was estimated before the appearance of the new sources. Owing to this point, the computational time and cost can be effectively reduced compared with the conventional separation scheme. Our new algorithm was corroborated with many simulations. Some results are given in the manuscript. The obtained and presented results clearly show that the proposed method outperformed the conventional method in processing time as well as in separation quality.
FCTH: Fuzzy Color and Texture Histogram - A Low Level Feature for Accurate Image Retrieval
Authors: Savvas A. Chatzichristofis, Yiannis S. Boutalis
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

This paper deals with the extraction of a new low level feature that combines, in one histogram, color and texture information. This feature is named FCTH - Fuzzy Color and Texture Histogram - and results from the combination of 3 fuzzy systems. FCTH size is limited to 72 bytes per image, rendering this descriptor suitable for use in large image databases. The proposed feature is appropriate for accurately retrieving images even in distortion cases such as deformations, noise and smoothing. It is tested on a large number of images selected from proprietary image databases or randomly retrieved from popular search engines. To evaluate the performance of the proposed feature, the averaged normalized modified retrieval rank was used.An online demo that implements the proposed feature in an image retrieval system is available at: http://orpheus.ee.duth.gr/image_retrieval.
Applying Anticipatory Text Selection in a Writing Aid for People with Severe Motor Impairment
Authors: Craig Heckathorne, Dudley Childress
Venue: IEEE Micro (1983)

By anticipating the next letter or word a disabled user is likely to choose, this system enables that user to more efficiently generate text when employing a scanning method.
Category Theoretic Semantics for Typed Binding Signatures with Recursion
Authors: John Power, Miki Tanaka
Venue: Fundamenta Informaticae (2008)

We generalise Fiore et al's account of variable binding for untyped cartesian contexts to give an account of binding for either variables or names that may be typed. We do this in an enriched setting, allowing the incorporation of recursion into the analysis. Extending earlier work by us, we axiomatise the notion of context by defining and using the notion of an enriched pseudo-monad S on V-Cat, with leading examples of V given by Set and &omega;Cpo, the latter yielding an account of recursion. Fiore et al implicitly used the pseudo-monad T$_{fp}$ on Cat for small categories with finite products. Given a set A of types, our extension to typed binders and enrichment involves generalising from Fiore et al's use of [F, Set] to [(SA)$^{op}$, V$^{A}$]. We define a substitution monoidal structure on [(SA)$^{op}$, V$^{A}$], allowing us to give a definition of binding signature at this level of generality, and extend initial algebra semantics to the typed, enriched axiomatic setting. This generalises and axiomatises previouswork by Fiore et al and later authors in particular cases. In particular, it includes the Logic of Bunched Implications and variants, infinitary examples, and structures not previously considered such as those generated by finite limits.
Two new compact finite-difference schemes for the solution of boundary value problems in second-order non-linear ordinary differential equations, using non-uniform grids
Authors: L.K. Bieniasz
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

Two new finite-difference, three-point compact discretisations of boundary value problems in second-order non-linear ordinary differential equations: $U^{(2)}$(x)-F(x, U(x), $U^{(1)}$(x))=0, applicable to non-uniform grids, are derived and compared in calculations with three previously published methods. The discretisations are modifications of the efficient uniform-grid arithmetic average method of Chawla and Shivakumar [Neural Parallel Sci. Comput. 4 (1996) 387-396]. Formal error analysis reveals that the truncation errors of the new discretisations are of third order with respect to the local grid spacings. New, economical, fourth-order accurate, two-point compact approximations to the first derivatives of the solution at the boundaries are also designed. Numerical experiments with the solution of singularly perturbed example problems, characterized by boundary and interior layers, indicate that the practical orders of accuracy of the new schemes are close to four, even for non-uniform grids. The methods prove competitive with the three-point extension of the Numerov method, and with one other extension of the Chawla and Shivakumar method.
Predicting the Performance of Learning Algorithms Using Support Vector Machines as Meta-regressors
Authors: Silvio B. Guerra, Ricardo B. Prudêncio, Teresa B. Ludermir
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In this work, we proposed the use of Support Vector Machines (SVM) to predict the performance of machine learning algorithms based on features of the learning problems. This work is related to the Meta-Regression approach, which has been successfully applied to predict learning performance, supporting algorithm selection. Experiments were performed in a case study in which SVMs with different kernel functions were used to predict the performance of Multi-Layer Perceptron (MLP) networks. The SVMs obtained better results in the evaluated task, when compared to different algorithms that have been applied as meta-regressors in previous work.
Declarative Debugging of Membership Equational Logic Specifications
Authors: Rafael Caballero, Narciso Martí-Oliet, Adrián Riesco, Alberto Verdejo
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Algorithmic debugging has been applied to many declarative programming paradigms; in this paper, it is applied to the rewriting paradigm embodied in Maude. We introduce a declarative debugger for executable specifications in membership equational logic which correspond to Maude functional modules. Declarative debugging is based on the construction and navigation of a debugging tree which logically represents the computation steps. We describe the construction of appropriate debugging trees for oriented equational and membership inferences. These trees are obtained as the result of collapsing in proof trees all those nodes whose correctness does not need any justification. We use an extended example to illustrate the use of the declarative debugger and its main features, such as two different strategies to traverse the debugging tree, use of a correct module to reduce the number of questions asked to the user, and selection of trusted vs. suspicious statements by means of labels. The reflective features of Maude have been extensively used to develop a prototype implementation of the declarative debugger for Maude functional modules using Maude itself.