pinecone/core-2020-05-10-deduplication huggingface dataset:
Automatic differentiation for GPU-accelerated 2D/3D registration

A common task in medical image analysis is the alignment of data from different sources, e.g., X-ray images and computed tomography (CT) data. Such a task is generally known as registration. We demonstrate the applicability of automatic differentiation (AD) techniques to a class of 2D/3D registration problems which are highly computationally intensive and can therefore greatly benefit from a parallel implementation on recent graphics processing units (GPUs). However, being designed for graphics applications, GPUs have some restrictions which conflict with requirements for reverse mode AD, in particular for taping and TBR analysis. We discuss design and implementation issues in the presence of such restrictions on the target platform and present a method which can register a CT volume data set (512 × 512 × 288 voxels) with three X-ray images (512 × 512 pixels each) in 20 seconds on a GeForce 8800GTX graphics card
Robust aircraft conceptual design using automatic differentiation in Matlab

The need for robust optimisation in aircraft conceptual design, for which the design parameters are assumed stochastic, is introduced. We highlight two approaches, first-order method of moments and Sigma-Point reduced quadrature, to estimate the mean and variance of the design’s outputs. The method of moments requires the design model’s differentiation and here, since the model is implemented in Matlab, is performed using the AD tool MAD. Gradient-based constrained optimisation of the stochastic model is shown to be more efficient using AD-obtained gradients than finite-differencing. A post-optimality analysis, performed using ADenabled third-order method of moments and Monte-Carlo analysis, confirms the attractiveness of the Sigma-Point technique for uncertainty propagation
Tactile perceptual dimensions: a study with light-weight wool fabrics

Volume 5024 of the series Lecture Notes in Computer Science.The aim of this study was to identify the tactile dimensions
in the discrimination of light-weight wool fabrics. The participants
judged the overall similarity between 21 light-weight wool fabrics using
free sorting tasks. The fabrics were evaluated using active touch with limited
exploratory procedure. Multidimensional scaling (MDS) was used to
generate the perceptual space, revealing one dimension of tactile perception.
Finally, through regression analysis we were able to interpret this
dimension, using verbal attributes and physical properties of the fabrics.
We discuss the relevance of the stimuli properties and the associations
between verbal attributes and between physical properties, on the evaluation
of the fabrics, considering its theoretical implications
Model-driven Simulation of a Maritime Surveillance System

update for BASE on Sep 08 2018 22:43:36International audienceThis paper reports an industrial experiment made at Thales to use Model Driven Architecture (MDA) for system engineering. System engineering processes are currently mainly document-centric. The main experiment goal was to study the applicability of MDA at the system engineering level. The experiment consisted of setting up a model-driven simulation environment for a maritime surveillance system. The simu- lation is achieved thanks to 3 models conform to 3 metamodels. The implementation uses the Eclipse Modeling Framework and is written in the Java Programming language. This pilot project met the deadline, the budget and the threshold of desired functionalities. We report the main advances given by the MDA approach in the context of simulation for system engineering
Ladder Metamodeling & PLC Program Validation through Time Petri Nets

International audienceLadder Diagram (LD) is the most used programming language for Programmable Logical Controllers (PLCs). A PLC is a special purpose industrial computer used to automate industrial processes. Bugs in LD programs are very costly and sometimes are even a threat to human safety. We propose a model driven approach for formal verification of LD programs through model-checking. We provide a metamodel for a subset of the LD language. We define a time Petri net (TPN) semantics for LD programs through an ATL model transformation. Finally, we automatically generate behavioral properties over the LD models as LTL formulae which are then checked over the generated TPN using the model-checkers available in the Tina toolkit. We focus on race condition detection. This work is supported by the topcased project, part of the french cluster Aerospace Valley (granted by the french DGE), cf. http://www.topcased.or
Towards collaborative intelligent tutors: Automated recognition of users' strategies.

This paper addresses the problem of inferring students’ strategies when they interact with data-modeling software used for pedagogical purposes. The software enables students to learn about statistical data by building and analyzing their own models. Automatic recognition of students’ activities when interacting with pedagogical software is challenging. Students can pursue several plans in parallel and interleave the execution of these plans. The algorithm presented in this paper decomposes students’ complete interaction histories with the software into hierarchies of interdependent tasks that may be subsequently compared with ideal solutions. This algorithm is evaluated empirically using commercial software that is used in many schools. Results indicate that the algorithm is able to (1) identify the plans students use when solving problems using the software; (2) distinguish between those actions in students’ plans that play a salient part in their problem-solving and those representing exploratory actions and mistakes; and (3) capture students’ interleaving and free-order action sequences.Engineering and Applied Science
Adaptive Olfactory Encoding in Agents Controlled by Spiking Neural Networks

???The original publication is available at www.springerlink.com???. Copyright SpringerWe created a neural architecture that can use two different types of information encoding strategies depending on the environment. The goal of this research was to create a simulated agent that could react to two different overlapping chemicals having varying concentrations. The neural network controls the agent by encoding its sensory information as temporal coincidences in a low concentration environment, and as firing rates at high concentration. With such an architecture, we could study synchronization of firing in a simple manner and see its effect on the agent???s behaviour
Interface micromotion failure simulation of cementless hip prosthesis

The most commonly reported failure modes of cementless hip stems are loosening and thigh pain; both are attributed to the relative motion at the bone-implant interface due to failure to achieve sufficient primary fixation. Accurate predictions of hip stemsâ€™ stability are therefore crucial to the pre-clinical analyses of hip arthroplasty. This study uses finite element technique to analyse the effect of muscle forces on the predicted micromotion and therefore stability of cementless femoral components. An in-house experimentally validated micromotion algorithm was used in analyses simulating two of the most common physiological activities â€“ walking and stair-climbing. The results showed that models where muscle loads were included had ten times larger micromotion than those modelled without muscle loads. Ignoring muscle forces in any pre-clinical evaluation of femoral stems are therefore not advisable as it will overestimate the stability of the stem
Annotation Markers for runtime replication protocol selection

This paper presents an architecture enabling developers to easily and
flexibly assign replication protocols simply by annotating individual server methods.
This avoids using costly replication protocols for all object methods, e.g.
read-only methods can use less costly protocols, reserving the costly replication
protocols for update methods. The architecture has been implemented in the
Jgroup/ARM middleware, and enables addition of new replication protocols without
modifying the core toolkit. It also supports runtime selection of replication
protocol for individual methods. This can be used to support self-optimization of
protocol selection by optimizing for the most appropriate configuration under a
given system load
Discovery of network properties with all-shortest-paths queries

We consider the problem of discovering properties (such as the diameter) of an unknown network G(V,E) with a minimum number of queries. Initially, only the vertex set V\ud
of the network is known. Information about the edges and non-edges of the network can be obtained\ud
by querying nodes of the network. A query at a node q∈V returns the\ud
union of all shortest paths from q to all other nodes in V. We study the\ud
problem as an online problem - an algorithm does not initially know the\ud
edge set of the network, and has to decide where to make the next query\ud
based on the information that was gathered by previous queries. We\ud
study how many queries are needed to discover the diameter, a minimal\ud
dominating set, a maximal independent set, the minimum degree, and\ud
the maximum degree of the network. We also study the problem of deciding with a minimum number of queries whether the network is 2-edge or\ud
2-vertex connected. We use the usual competitive analysis to evaluate the\ud
quality of online algorithms, i.e., we compare online algorithms with optimum offline algorithms. For all properties except maximal independent\ud
set and 2-vertex connectivity we present and analyze online algorithms.\ud
Furthermore we show, for all the aforementioned properties, that "many"\ud
queries are needed in the worst case. As our query model delivers more\ud
information about the network than the measurement heuristics that are\ud
currently used in practise, these negative results suggest that a similar\ud
behavior can be expected in realistic settings, or in more realistic models\ud
derived from the all-shortest-paths query model.Peer-reviewedPost-print15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), Villars sur Ollon, Switzerland, 17th - 20th June 200
A hierarchical leader election protocol for mobile ad hoc networks

8th International Conference on Computational Science, ICCS 2008; Krakow; Poland; 23 June 2008 through 25 June 2008Leader Election is an important problem in mobile ad hoc networks and in distributed computing systems. In this study, we propose a hierarchical, cluster based protocol to elect a leader in a mobile ad hoc network. The initial phase of the protocol employs a clustering algorithm to group nodes of the network after which a leader for a cluster(clusterhead) is elected. The second phase is performed by forming a connected ring of these leaders using the Ring Formation Algorithm. Finally, Chang Roberts Leader Election Algorithm for rings is employed in the final phase to elect the super-leader among the clusterheads. We provide performance results of this protocol for various mobility parameters and analyze its time and message complexities
Distributed algorithms to form cluster based spanning trees in wireless sensor networks

8th International Conference on Computational Science, ICCS 2008; Krakow; Poland; 23 June 2008 through 25 June 2008We propose two algorithms to form spanning trees in sensor networks. The first algorithm forms hierarchical clusters of spanning trees with a given root, the sink. All of the nodes in the sensor network are then classified iteratively as subroot, intermediate or leaf nodes. At the end of this phase, the local spanning trees are formed, each having a unique subroot (clusterhead) node. The communication and data aggregation towards the sink by an ordinary node then is accomplished by sending data to the local subroot which routes data towards the sink. A modified version of the first algorithm is also provided which ensures that the obtained tree is a breadth-first search tree where a node can modify its parent to yield shorter distances to the root. Once the sub-spanning trees in the clusters are formed, a communication architecture such as a ring can be formed among the subroots. This hybrid architecture which provides co-existing spanning trees within clusters yields the necessary foundation for a two-level communication protocol in a sensor network as well as providing a structure for a higher level abstraction such as the γ synchronizer where communication between the clusters is performed using the ring similar to an α synchronizer and the intra cluster communication is accomplished using the sub-spanning trees as in the β synchronizers. We discuss the model along with the algorithms, compare them and comment on their performances
Cryptography Adapted to the New European Area of Higher Education

9 pages, no figures.-- Contributed to: Computational Science – ICCS 2008: 8th International Conference, Kraków, Poland, June 23-25, 2008, Proceedings, Part II.A new experience for teaching Cryptography to engineering students is shown. The aim is to give them a better understanding of secure and cryptographic algorithms by using Maple software, in a graduate-level course. In this paper we discuss how to structure, define, and implement a web-based course as a part of the traditional classes, according to the convergence of the European Higher Education Project. The proposed course facilitates the use of new Information and Communication Technologies.This work has been supported by Ministerio de Industria, Turismo y Comercio (Spain) in collaboration with Telef¶onica I+D (Project SEGUR@) with reference CENIT-2007 2004.Peer reviewe
Security Issues in mGovernment

E-government is one of the most rapidly evolving service domains in the contemporary information society. Many governments have already developed and provided e-government services to businesses and citizens. Nowadays\ud
actors in the government domain attempt to take the next step and exploit the latest wireless technologies in order to provide ubiquitous services for mobile\ud
users. However, this approach involves some hidden risks mainly due to the inherent insecurity of the air medium and the vulnerabilities of the wireless systems.\ud
Thus, in this paper we investigate the security gaps and considerations\ud
which should be taken into account for an m-government system. Finally, we\ud
provide a list of security guidelines and policies, which the users of the system\ud
should be aware of and follow in order to avoid security attacks
Computable categoricity of graphs with finite components

A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably categorical graphs. We restrict ourselves to strongly locally finite graphs; these are the graphs all of whose components are finite. We present a necessary and sufficient condition for certain classes of strongly locally finite graphs to be computably categorical. We prove that if there exists an infinite \Delta^0_2-set of components that can be properly embedded into infinitely many components of the graph then the graph is not computably categorical. We outline the construction of a strongly locally finite computably categorical graph with an infinite chain of properly embedded components
Program schemes with deep pushdown storage.

Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, TeX, based around assignments, while-loops and non- deterministic guessing but with access to a deep pushdown stack which, apart from having the usual push and pop instructions, also has deep-push instructions which allow elements to be pushed to stack locations deep within the stack. We syntactically define sub-classes of TeX by restricting the occurrences of pops, pushes and deep-pushes and capture the complexity classes NP and PSPACE. Furthermore, we show that all problems accepted by program schemes of TeX are in EXPTIME
Parameter Control in Evolutionary Algorithms

http://www.springerlink.com/content/978-3-540-69431-1/The issue of setting the values of various parameters of an evolutionary algorithm is crucial for good performance. In this paper we discuss how to do this, beginning with the issue of whether these values are best set in advance or are best changed during evolution. We provide a classification of different approaches based on a number of complementary features, and pay special attention to setting parameters on-the-fly. This has the potential of adjusting the algorithm to the problem while solving the problem. This paper is intended to present a survey rather than a set of prescriptive details for implementing an EA for a particular type of problem. For this reason we have chosen to interleave a number of examples throughout the text. Thus we hope to both clarify the points we wish to raise as we present them, and also to give the reader a feel for some of the many possibilities available for controlling different parameters
An Adaptive Cartography of DTV Programs

International audienceWith the development of information technologies and more precisely, the so-called digital convergence, the number of digital TV (DTV) programs available on any kind of DTV receiver (satellite, cable, terrestrial or IP) has increased dramatically. This has made the task of selecting a DTV program very complicated and time consuming. This paper proposes an intelligent graphical user interface (GUI) tool that gives a new appearance to the on-air and recorded DTV contents in order to enable DTV viewers to, quickly and in a user-friendly manner, select a program. The GUI tool is based on a synthetic cartography of DTV programs in which the shape generated reflects the DTV viewers' preferences over a period of time. These preferences are obtained by using any method for program clustering and recommendation. Results are demonstrated on the task of recommending programs in the context of the French terrestrial DTV by using a content-based approach
A software architecture for shared resource management in mobile ad hoc networks

33rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2007; Harrachov; Czech Republic; 20 January 2007 through 26 January 2007We propose a three layer software architecture for shared resource management in mobile ad hoc networks(MANETs). At the lowest layer, the Merging Clustering Algorithm(MCA)[ll] partitions the MANET into a number of balanced clusters periodically. At the second layer, the Backbone Formation Algorithm(BFA) provides a virtual ring using the clusterheads found by MCA. Finally, an example resource management protocol which is a modified and scaled version of the Ricart-Agrawala algorithm implemented using the virtual ring structure is presented with the performance results
How Much Language is Enough? Theoretical and Practical Use of the Business Process Modeling Notation

Graphical models of business processes are used for analysis, design, and implementation of these processes and their supporting information systems. The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of processes. BPMN offers a wide range of modeling constructs, significantly more than other popular languages. However, it would appear that not all of these constructs are equally important in practice. Business analysts frequently use arbitrary subsets of BPMN. In this paper we investigate what these subsets are, and how they differ between academic, consulting, and general use of the language. We analyzed 120 BPMN diagrams using mathematical and statistical techniques. Our findings indicate that BPMN is used in groups of several, well-defined con-struct clusters, but less than 20% of its vocabulary is regularly used and some constructs did not occur in any of the models we analyzed. While the average model contains just 9 different BPMN constructs, models of this complexity have typically just 4-5 constructs in common, which means that only a small agreed subset of BPMN has emerged. Our findings have implications for the entire ecosystems of analysts and modelers in that they provide guidance on how to reduce language complexity, which should increase the ease and speed of process modeling
Model-based engineering of widgets, user applications and servers compliant with ARINC 661 specification

International audienceThe purpose of ARINC 661 specification [1] is to define interfaces to a Cockpit Display System (CDS) used in any types of aircraft installations. ARINC 661 provides precise information for communication protocol between application (called User Applications) and user interface components (called widgets) as well as precise information about the widgets themselves. However, in ARINC 661, no information is given about the behaviour of these widgets and about the behaviour of an application made up of a set of such widgets. This paper presents the results of the application of a formal description technique to the various elements of ARINC 661 specification within an industrial project. This formal description technique called Interactive Cooperative Objects defines in a precise and non-ambiguous way all the elements of ARINC 661 specification. The application of the formal description techniques is shown on an interactive application called MPIA (Multi Purpose Interactive Application). Within this application, we present how ICO are used for describing interactive widgets, User Applications and User Interface servers (in charge of interaction techniques). The emphasis is put on the model-based management of the feel of the applications allowing rapid prototyping of the external presentation and the interaction techniques. Lastly, we present the CASE (Computer Aided Software Engineering) tool supporting the formal description technique and its new extensions in order to deal with large scale applications as the ones targeted at by ARINC 661 specification
Coupled schema transformation and data conversion for XML and SQL

A two-level data transformation consists of a type-level transformation of a data format coupled with value-level transformations of data instances corresponding to that format. We have implemented a system for performing two-level transformations on XML schemas and their corresponding documents, and on SQL schemas and the databases that they describe. The core of the system consists of a combinator library for composing type-changing rewrite rules that preserve structural information and referential constraints. We discuss the implementation of the system’s core library, and of its SQL and XML front-ends in the functional language Haskell. We show how the system can be used to tackle various two-level transformation scenarios, such as XML schema evolution coupled with document migration, and hierarchical-relational data mappings that convert between XML documents and SQL databases.Fundação para a Ciência e a Tecnologia (FCT) - POSI/ICHS/44304/2002