pinecone/core-2020-05-10-deduplication huggingface dataset:
Symbolic and analytic techniques for resource analysis of Java bytecode

Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap shapes, in the tradition of separation logic, and assertions about consumable resources. Separately, polyhedral methods have been used to calculate bounds on numbers of iterations in loop-based programs. We are attempting to combine these ideas to deal with Java programs involving both data structures and loops, focusing on the bytecode level rather than on source code
What's Decidable About Sequences?

We present a first-order theory of sequences with integer elements,
Presburger arithmetic, and regular constraints, which can model significant
properties of data structures such as arrays and lists. We give a decision
procedure for the quantifier-free fragment, based on an encoding into the
first-order theory of concatenation; the procedure has PSPACE complexity. The
quantifier-free fragment of the theory of sequences can express properties such
as sortedness and injectivity, as well as Boolean combinations of periodic and
arithmetic facts relating the elements of the sequence and their positions
(e.g., "for all even i's, the element at position i has value i+3 or 2i"). The
resulting expressive power is orthogonal to that of the most expressive
decidable logics for arrays. Some examples demonstrate that the fragment is
also suitable to reason about sequence-manipulating programs within the
standard framework of axiomatic semantics.Comment: Fixed a few lapses in the Mergesort exampl
An Approach to Using Non Safety-Assured Programmable Components in Modest Integrity Systems

Programmable components (like personal computers or smart devices) can offer considerable benefits in terms of usability and functionality in a safety-related system. However there is a problem in justifying the use of programmable components if the components have not been safety justified to an appropriate integrity (e.g. to SIL 1 of IEC 61508). This paper outlines an approach (called LowSIL) developed in the UK CINIF nuclear industry research programme to justify the use of non safety-assured programmable components in modest integrity systems. This is a seven step approach that can be applied to new systems from an early design stage, or retrospectively to existing systems. The stages comprise: system characterisation, component suitability assessment, failure analysis, failure mitigation, identification of additional defences, identification of safety evidence requirements, and collation and evaluation of evidence. In the case of personal computers, there is supporting guidance on usage constraints, claim limits on reliability, and advice on “locking down” the component to maximise reliability. The approach is demonstrated for an example system. The approach has been applied successfully to a range of safety-related systems used in the nuclear industry
Managerial commitment towards SPI in small and very small enterprises

This paper compares and contrasts the results of two similar studies into the software process practices in Irish Small and Very Small Enterprises. The first study contains rich findings in relation to the role and influence of managerial experience and style, with particular respect to the company founder and software development managers in small to medium seized enterprises (SMEs), whilst the second study contains extensive findings in relation to people and management involvement / commitment and SPI goal planning in very small enterprises (VSEs). By combining these results of these two studies of Irish SMEs/VSEs we can develop a rich picture of managerial commitment towards SPI and in particular explore the similarities between Small and Very Small Enterprises
An Incremental Answer Set Programming Based System for Finite Model Computation

We address the problem of Finite Model Computation (FMC) of firstorder  theories and show that FMC can efficiently and transparently be solved by  taking advantage of a recent extension of Answer Set Programming (ASP), called  incremental Answer Set Programming (iASP). The idea is to use the incremental  parameter in iASP programs to account for the domain size of a model. The  FMC problem is then successively addressed for increasing domain sizes until an  answer set, representing a finite model of the original first-order theory, is found.  We implemented a system based on the iASP solver iClingo and demonstrate its  competitiveness by showing that it slightly outperforms the winner of the FNT  division of CADE's Automated Theorem Proving (ATP) competition.Full Tex
An approximative inference method for solving ∃∀SO satisfiability problems

Acceptance rate: 33%The fragment ∃ ∀ SO(ID) of second order logic extended with inductive definitions is expressive, and many interesting problems, such as conformant planning, can be naturally expressed as finite domain satisfiability problems of this logic. Such satisfiability problems are computationally hard ($\Sigma^P_2$). In this paper, we develop an approximate, sound but incomplete method for solving such problems that transforms a ∃ ∀ SO(ID) to a ∃ SO(ID) problem. The finite domain satisfiability problem for the latter language is in NP and can be handled by several existing solvers. We show that this provides an effective method for solving practically useful problems, such as common examples of conformant planning. We also propose a more complete translation to ∃ SO(FP), existential SO extended with nested inductive and coinductive definitions.status: publishe
Technology transfer of dynamic IT outsourcing requires security measures in SLAs

For the present efforts in dynamic IT outsourcing environments like Grid or Cloud computing security and trust are ongoing issues. SLAs are a proved remedy to build up trust in outsourcing relations. Therefore, it is necessary to determine whether SLAs can improve trust from the perspective of the outsourcing customer by integration of security measures. The conducted survey indicates that customers see SLAs as an approach to increase their level of trust in IT outsourcing partners. In addition, security measures in SLAs are of high relevance to support trust but not yet integrated appropriately. However, SLAs are very important for the technology transfer of eScience projects in Grid computing. Again, Grid based outsourcing of biomedical IT services requires security measures in SLAs. Thus, the technology transfer process of dynamic IT outsourcing infrastructures requires adequate SLAs in order to be successful
Resource-level QoS metric for CPU-based guarantees in cloud providers

Success of Cloud computing requires that both customers and providers can be confident that signed Service Level Agreements (SLA) are supporting their respective business activities to their best\ud
extent. Currently used SLAs fail in providing such confidence, especially\ud
when providers outsource resources to other providers. These resource providers typically support very simple metrics, or metrics that hinder an efficient exploitation of their resources.\ud
In this paper, we propose a resource-level metric for specifying finegrain guarantees on CPU performance. This metric allows resource providers to allocate dynamically their resources among the running services\ud
depending on their demand. This is  accomplished by incorporating the customer’s CPU usage in the metric definition, but avoiding fake SLA violations when the customer’s task does not use all its allocated resources. As demonstrated in our evaluation, which has been conducted in a virtualized provider where we have implemented the needed infrastructure for using our metric, our solution presents fewer SLA violations than other CPU-related metrics.Peer ReviewedPostprint (published version
Approaching the internalization challenge of grid technologies into e-society by e-human "grid" ecology

The amount of information is growing exponentially with ever-new technologies emerging and is believed to be always at the limit. In contrast, huge resources are obviously available, which are underused in the IT sector, similar as e.g. in the renewable energy sector. This is especially for grid with its fast turnover rates very astonishing considering the barriers for further development put forward by the inability to satisfy the need for such resources. The phenomenon is a typical example of the Inverse Tragedy of the Commons, i.e. resources are underexploited in contrast to the unsustainable and destructing overexploitation in the Classic Tragedy of the Commons. An analysis of IT and the grid sector which attempts to share resources for better usage efficiency, reveals two challenges, which lead to the heart of the paradox: i) From a macro perspective all grid infrastructures involve not only mere technical solutions but also dominantly all of the autopoietic social sub-systems ranging from religion to policy. ii) On the micro level the individual players and their psychology and risk behaviour are of major importance for acting within the macro autopoietic framework. Consequently, the challenges of grid implementation are similar to those of other pressing global issues as e.g. climate protection. This is well described by extending the Human Ecology triangle to a rectangle: invironment-individual-society-environment. By applying this extension of this classical field of interdisciplinary basic and applied research to the grid sector, i.e. by further extension to an e-Human Grid Ecology rational, the Grid Inverse Tragedy of the Commons can be understood and approached regarding the internalization challenge into e-Society and e-Life, from which then guidelines for the day-to-day management can be derived. This is of general importance for many complex fields and thus with similar paradoxes and challenges
Manifold learning for image-based gating of intravascular ultrasound(IVUS) pullback sequences

Intravascular Ultrasound(IVUS) is an imaging technology which provides cross-sectional images of internal coronary vessel struc- tures. The IVUS frames are acquired by pulling the catheter back with a motor running at a constant speed. However, during the pullback, some artifacts occur due to the beating heart. These artifacts cause inaccu- rate measurements for total vessel and lumen volume and limitation for further processing. Elimination of these artifacts are possible with an ECG (electrocardiogram) signal, which determines the time interval cor- responding to a particular phase of the cardiac cycle. However, using ECG signal requires a special gating unit, which causes loss of impor- tant information about the vessel, and furthermore, ECG gating function may not be available in all clinical systems. To address this problem, we propose an image-based gating technique based on manifold learning. Quantitative tests are performed on 3 different patients, 6 different pull- backs and 24 different vessel cuts. In order to validate our method, the results of our method are compared to those of ECG-Gating method
Automatic Computation of Electrodes Trajectory for Deep Brain Stimulation

International audienceIn this paper, we propose an approach to find the optimal position of an electrode, for assisting surgeons in planning Deep Brain Stimulation. We first show how we formalized the rules governing this surgical procedure into geometric constraints. Then we explain our method, using a formal geometric solver, and a template built from 15 MRIs, used to propose a space of possible solutions and the optimal one. We show our results for the retrospective study on 8 implantations from 4 patients, and compare them with the trajectory of the electrode that was actually implanted. The results show a slight difference with the reference trajectories, with a better evaluation for our proposition
A Simple Content-based Strategy for Estimating the Geographical Location of a Webcam

This study proposes a strategy for determining the approximate geographical location of a webcam based on a sequence of images taken at regular intervals. For a time-stamped image sequence spanning 24 hours the approximate sunrise and sunset times are determined by classifying images into day and nighttime images based on the image intensity. Based on the sunrise and sunset times both the latitude and longitude of the webcam can be determined. Experimental data demonstrates the effectiveness of the strategy
Joint generative model for fMRI/DWI and its application to population

We propose a novel probabilistic framework to merge information from DWI tractography and resting-state fMRI correlations. In particular, we model the interaction of latent anatomical and functional connectivity templates between brain regions and present an intuitive extension to population studies. We employ a mean-field approximation to fit the new model to the data. The resulting algorithm identifies differences in latent connectivity between the groups. We demonstrate our method on a study of normal controls and schizophrenia patients.Author Manuscript 2011 March 12. 13th International Conference, Beijing, China, September 20-24, 2010, Proceedings, Part INational Alliance for Medical Image Computing (U.S.) (NIH NIBIBNAMICU54-EB005149)Neuroimaging Analysis Center (U.S.) (NIH NCRR NAC P41-RR13218)National Institutes of Health (U.S.) (Grant R01MH074794)National Defense Science and Engineering Graduate FellowshipNational Science Foundation (U.S.) (CAREER Grant 0642971
Model-free and Analytical EAP Reconstruction via Spherical Polar Fourier Diffusion MRI

International audienceHow to estimate the diffusion Ensemble Average Propagator (EAP) from the DWI signals in q-space is an open problem in diffusion MRI field. Many methods were proposed to estimate the Orientation Distribution Function (ODF) that is used to describe the fiber direction. However, ODF is just one of the features of the EAP. Compared with ODF, EAP has the full information about the diffusion process which reflects the complex tissue micro-structure. Diffusion Orientation Transform (DOT) and Diffusion Spectrum Imaging (DSI) are two important methods to estimate the EAP from the signal. However, DOT is based on mono-exponential assumption and DSI needs a lot of samplings and very large b values. In this paper, we propose Spherical Polar Fourier Imaging (SPFI), a novel model-free fast robust analytical EAP reconstruction method, which almost does not need any assumption of data and does not need too many samplings. SPFI naturally combines the DWI signals with dierent b-values. It is an analytical linear transformation from the q-space signal to the EAP profile represented by Spherical Harmonics (SH).We validated the proposed methods in synthetic data, phantom data and real data. It works well in all experiments, especially for the data with low SNR, low anisotropy, and non-exponential decay
Cellular automata segmentation of brain tumors on post contrast MR images

In this paper, we re-examine the cellular automata(CA) al- gorithm to show that the result of its state evolution converges to that of the shortest path algorithm. We proposed a complete tumor segmenta- tion method on post contrast T1 MR images, which standardizes the VOI and seed selection, uses CA transition rules adapted to the problem and evolves a level set surface on CA states to impose spatial smoothness. Val- idation studies on 13 clinical and 5 synthetic brain tumors demonstrated the proposed algorithm outperforms graph cut and grow cut algorithms in all cases with a lower sensitivity to initialization and tumor type
Automatic Detection of Anatomical Features on 3D Ear Impressions for Canonical Representation.

We propose a shape descriptor for 3D ear impressions, dederived from a comprehensive set of anatomical features. Motivated by hearing aid (HA) manufacturing, the selection of the anatomical features is carried out according to their uniqueness and importance in HA design. This leads to a canonical ear signature that is highly distinctive and potentially well suited for classification. First, the anatomical features are characterized into generic topological and geometric features, namely concavities, elbows, ridges, peaks, and bumps on the surface of the ear. Fast and robust algorithms are then developed for their detection. This indirect approach ensures the generality of the algorithms with potential applications in biomedicine, biometrics, and reverse engineering
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis

We present a novel approach for extracting cluttered objects based on their morphological properties. Specifically, we address the problem of untangling Caenorhabditis elegans clusters in high-throughput screening experiments. We represent the skeleton of each worm cluster by a sparse directed graph whose vertices and edges correspond to worm segments and their adjacencies, respectively. We then search for paths in the graph that are most likely to represent worms while minimizing overlap. The worm likelihood measure is defined on a low-dimensional feature space that captures different worm poses, obtained from a training set of isolated worms. We test the algorithm on 236 microscopy images, each containing 15 C. elegans worms, and demonstrate successful cluster untangling and high worm detection accuracy.National Institutes of Health (U.S.) (NIH grant R01-AI072508)National Institutes of Health (U.S.) (P01-AI083214)National Institutes of Health (U.S.) (R01-AI085581)National Institutes of Health (U.S.) (NAMIC U54-EB00514)National Science Foundation (U.S.) (NSF CAREER Award 0642971
In vivo human 3D cardiac fibre architecture: reconstruction using curvilinear interpolation of diffusion tensor images

In vivo imaging of the cardiac 3D fibre architecture is still a challenge, but it would have many clinical applications, for instance to better understand pathologies and to follow up remodelling after therapy. Recently, cardiac MRI enabled the acquisition of Diffusion Tensor images (DTI) of 2D slices. We propose a method for the complete 3D reconstruction of cardiac fibre architecture in the left ventricular myocardium from sparse in vivo DTI slices. This is achieved in two steps. First we map non-linearly the left ventricular geometry to a truncated ellipsoid. Second, we express coordinates and tensor components in Prolate Spheroidal System, where an anisotropic Gaussian kernel regression interpolation is performed. The framework is initially applied to a statistical cardiac DTI atlas in order to estimate the optimal anisotropic bandwidths. Then, it is applied to in vivo beating heart DTI data sparsely acquired on a healthy subject. Resulting in vivo tensor field shows good correlation with literature, especially the elevation (helix) angle transmural variation. To our knowledge, this is the first reconstruction of in vivo human 3D cardiac fibre structure. Such approach opens up possibilities in terms of analysis of the fibre architecture in patients
An Anthropomorphic Polyvinyl Alcohol Triple-Modality Brain Phantom based on Colin27

International audienceWe propose a method for the creation of an anatomically and mechanically realistic brain phantom from polyvinyl alcohol cryogel (PVA-C) for validation of image processing methods for segmentation, re- construction, registration, and denoising. PVA-C is material widely used in medical imaging phantoms for its mechanical similarities to soft tis- sues. The phantom was cast in a mold designed using the left hemiphere of the Colin27 brain dataset [1] and contains deep sulci, a complete in- sular region, and an anatomically accurate left ventricle. Marker spheres and inflatable catheters were also implanted to enable good registration and simulate tissue deformation, respectively. The phantom was designed for triple modality imaging, giving good contrast images in computed tomography, ultrasound, and magnetic resonance imaging. Multimodal data acquired from this phantom are made freely available to the image processing community (http://pvabrain.inria.fr) and will aid in the validation and further development of medical image processing tech- niques
An efficient EM-ICP algorithm for symmetric consistent non-linear registration of point sets

International audienceIn this paper, we present a new algorithm for non-linear registration of point sets. We estimate both forward and backward deformations fields best superposing the two point sets of interest and we make sure that they are consistent with each other by designing a symmetric cost function where they are coupled. Regularisation terms are included in this cost function to enforce deformation smoothness. Then we present a two-step iterative algorithm to optimise this cost function, where the two fields and the fuzzy matches between the two sets are estimated in turn. Building regularisers using the RKHS theory allows to obtain fast and efficient closed-form solutions for the optimal fields. The resulting algorithm is efficient and can deal with large point sets
University of Glasgow at ImageCLEFPhoto 2009 : optimising similarity and diversity in image retrieval

In this paper we describe the approaches adopted to generate the runs submitted to ImageCLEFPhoto 2009 with an aim to promote document diversity in the rankings. Four of our runs are text based approaches that employ textual statistics extracted from the captions of images, i.e. MMR [1] as a state of the art method for result diversification, two approaches that combine relevance information and clustering techniques, and an instantiation of Quantum Probability Ranking Principle. The fifth run exploits visual features of the provided images to re-rank the initial results by means of Factor Analysis. The results reveal that our methods based on only text captions consistently improve the performance of the respective baselines, while the approach that combines visual features with textual statistics shows lower levels of improvements
Are Passages Enough? The MIRACLE Team Participation at QA@CLEF2009

Preceedins of: 10th Workshop of the Cross-Language Evaluation Forum, CLEF 2009.Took place September 30 - October 2, 2009,in Corfu, Greece.  The event Web site is http://www.clef-campaign.org/2009.htmlThis paper summarizes the participation of the MIRACLE team in the Multilingual Question Answering Track at CLEF 2009. In this campaign, we took part in the monolingual Spanish task at ResPubliQA and submitted two runs. We have adapted our QA system to the new JRC-Acquis collection and the legal domain. We tested the use of answer filtering and ranking techniques against a baseline system using passage retrieval with no success. The run using question analysis and passage retrieval obtained a global accuracy of 0.33, while the addition of an answer filtering resulted in 0.29. We provide an analy-sis of the results for different questions types to investigate why it is difficult to leverage previous QA techniques. Another task of our work has been the appli-cation of temporal management to QA. Finally we include some discussion of the problems found with the new collection and the complexities of the domain.This work has been partially supported by the Research Network MAVIR (S-0505/TIC/000267) and by the project BRAVO (TIN2007- 67407-C3-01).Publicad