pinecone/core-2020-05-10-deduplication huggingface dataset:
Detection of object onset and offset in naturalistic scenes

The present study was conducted to investigate whether ob- servers are equally prone to overlook any kinds of visual events in change blindness. Capitalizing on the finding from visual search studies that abrupt appearance of an object effectively captures observers' attention, the onset of a new object and the offset of an existing object were contrasted regarding their detectability when they occurred in a naturalistic scene. In an experiment, participants viewed a series of photograph pairs in which layouts of seven or eight objects were depicted. One object either appeared in or disappeared from the layout, and participants tried to detect this change. Results showed that onsets were detected more quickly than offsets, while they were detected with equivalent ac- curacy. This suggests that the primacy of onset over offset is a robust phenomenon that likely makes onsets more resistant to change blindness under natural viewing conditions
Prêt à Voter with Write-Ins

This paper presents an extension of the Pret a Voter verifiable voting system to handle write-ins. This is achieved by introducing an additional `Write-In' option and allowing the voter optionally to enter a write-in candidate of their choice. The voter obtains a receipt which includes their write-in, but that receipt does not indicate whether the write-in candidate was selected or not. The system provides flexibility with respect to the tallying of write-in votes. We also introduce null ballots in order to achieve receipt-freeness with respect to write-ins
On the Side-Effects of Introducing E-voting

The literature abounds with discussions on the relative security merits of various voting systems, and on whether a move towards electronic voting is, from a security perspective, something to be encouraged or discouraged. Little has been said, however, on whether there would be unintended side-effects of changing the voting technology, in terms of the votes cast. Security issues aside, should we expect the introduction of an electronic voting system to affect the results of the election? This paper attempts to tease out some of the possible effects, by analysing ballot data from the 2008 Australian Capital Territory (ACT) Legislative Assembly Election
A Formal Framework for Modelling Coercion Resistance and Receipt Freeness

Coercion resistance and receipt freeness are critical properties for any voting system. However, many di fferent de finitions of these properties have been proposed, some formal and some informal; and there has been little attempt to tie these definitions together or identify relations between them. We give here a general framework for specifying di fferent coercion resistance and receipt freeness properties using the process algebra CSP. The framework is general enough to accommodate a wide range of defi nitions, and strong enough to cover both randomization attacks and forced abstention attacks. We provide models of some simple voting systems, and show how the framework can be used to analyze these models under di fferent de finitions of coercion resistance and receipt freeness. Our formalisation highlights the variation between the defi nitions, and the importance of understanding the relations between them
Improved BDD-based discrete analysis of timed systems

Model checking timed systems through digitization is relatively easy, compared to zone-based approaches. The applicability of digitization, however, is limited mainly for two reasons, i.e., it is only sound for closed timed systems; and clock ticks cause state space explosion. The former is mild as many practical systems are subject to digitization. It has been shown that BDD-based techniques can be used to tackle the latter to some extent. In this work, we significantly improve the existing approaches by keeping the ticks simple in the BDD encoding. Taking advantage of the ‘simple’ nature of clock ticks, we fine-tune the encoding of ticks and are able to verify systems with many ticks. Furthermore, we develop a BDD library which supports not only encoding/verifying of timed state machines (through digitization) but also composing timed components using a rich set of composition functions. The usefulness and scalability of the library are demonstrated by supporting two languages, i.e., closed timed automata and Stateful Timed CSP.Full Tex
Towards a Cybernetic Theory and Reference Model of Self designing Complex Collaborative Networks

The multi-disciplinary and inter-disciplinary movement studyingCollaborative Networks (CNs) introduced terminologies, referencearchitectures, methodologies and models, with the aim of helping the design,creation, operation and maintenance of CNs, and its virtual organisations(VOs). Almost a decade ago, the IST European VOMap project reported a lackof 'well founded theory and models' for sustainable collaborative networks, andthis article is an attempt into this direction. The article defines and introduces'Cybernetics of Collaborative Networks' (C2N) as a field of CN-researchintended as a unified theory of CNs, formalising, synthesising, harmonising andsystematising individual CN-related results addressing management and controlproblems in CNs. Through this envisaged synthesis, the paper invokes anumber of relevant reference models and corresponding theories to outline apossible reference model and theory for self-designing CNs.Griffith Sciences, School of Information and Communication TechnologyFull Tex
The need for standardized tests to evaluate the reliability of data transport in wireless medical systems

Wireless medical systems are comprised of four stages, namely the
medical device, the data transport, the data collection and the data evaluation
stages. Whereas the performance of the first stage is highly regulated, the others
are not. This paper concentrates on the data transport stage and argues that it is
necessary to establish standardized tests to be used by medical device
manufacturers to provide comparable results concerning the communication
performance of the wireless networks used to transport medical data. Besides, it
suggests test parameters and procedures to be used to produce comparable
communication performance results.Grupo AMI – Assistência Médica Integral (Casa de Saúde Guimarães, SA)Fundação para a Ciência e a Tecnologia (FCT
Examination on Time-Dependent Soil Models in One-Dimensional Consolidation

This paper reviews the performance of two time-dependent constitutive models in predictions of one-dimensional consolidation. The Soft-Soil Creep model [1] is an example of an elastic-viscoplastic formulation that incorporates a time-dependent state variable to estimate viscoplastic deformation. We show that the SSC model is equivalent to the isotache formulation proposed by Imai [2], as both are based on a unique relationship between stress, void ratio and the viscoplastic component of void ratio rate. Simulations of 1-D consolidation confirm that both models represent Hypothesis B behavior, where the axial strain at the End of Primary (EOP) consolidation is dependent on the depth of the clay layer. The effects of specimen thickness and the phenomenon of pore pressure increase at the start of consolidation are discussed in detail. Our interpretation highlights the importance of assumptions regarding the initial strain rate on the behavior observed at different scales under a given applied increment of loading
Scalable Reed-Solomon-based Reliable Local Storage for HPC Applications on IaaS Clouds

International audienceWith increasing interest among mainstream users to run HPC applications, Infrastructure-as-a-Service (IaaS) cloud computing platforms represent a viable alternative to the acquisition and maintenance of expensive hardware, often out of the financial capabilities of such users. Also, one of the critical needs of HPC applications is an efficient, scalable and persistent storage. Unfortunately, storage options proposed by cloud providers are not standardized and typically use a different access model. In this context, the local disks on the compute nodes can be used to save large data sets such as the data generated by Checkpoint-Restart (CR). This local storage offers high throughput and scalability but it needs to be combined with persistency techniques, such as block replication or erasure codes. One of the main challenges that such techniques face is to minimize the overhead of performance and I/O resource utilization (i.e., storage space and bandwidth), while at the same time guaranteeing high reliability of the saved data. This paper introduces a novel persistency technique that leverages Reed-Solomon (RS) encoding to save data in a reliable fashion. Compared to traditional approaches that rely on block replication, we demonstrate about 50% higher throughput while reducing network bandwidth and storage utilization by a factor of 2 for the same targeted reliability level. This is achieved both by modeling and real life experimentation on hundreds of nodes
Peer-to-peer multi-class boosting

ISBN: 978-3-642-32819-0 (Print) 978-3-642-32820-6 (Online)International audienceWe focus on the problem of data mining over large-scale fully distributed databases, where each node stores only one data record. We assume that a data record is never allowed to leave the node it is stored at. Possible motivations for this assumption include privacy or a lack of a centralized infrastructure. To tackle this problem, earlier we proposed the generic gossip learning framework (GoLF), but so far we have studied only basic linear algorithms. In this paper we implement the well-known boosting technique in GoLF. Boosting techniques have attracted growing attention in machine learning due to their outstanding performance in many practical applications. Here, we present an implementation of a boosting algorithm that is based on FilterBoost. Our main algorithmic contribution is a derivation of a pure online multi-class version of FilterBoost, so that it can be employed in GoLF. We also propose improvements to GoLF, with the aim of maximizing the diversity of the evolving models gossiped in the network, a feature that we show to be important. We evaluate the robustness and the convergence speed of the algorithm empirically over three benchmark databases. We compare the algorithm with the sequential AdaBoost algorithm and we test its performance in a failure scenario involving message drop and delay, and node churn
CUDA-for-clusters: a system for efficient execution of CUDA kernels on multi-core clusters

Rapid advancements in multi-core processor architectures coupled with low-cost, low-latency, high-bandwidth interconnects have made clusters of multi-core machines a common computing resource. Unfortunately, writing good parallel programs that efficiently utilize all the resources in such a cluster is still a major challenge. Various programming languages have been proposed as a solution to this problem, but are yet to be adopted widely to run performance-critical code mainly due to the relatively immature software framework and the effort involved in re-writing existing code in the new language. In this paper, we motivate and describe our initial study in exploring CUDA as a programming language for a cluster of multi-cores. We develop CUDA-For-Clusters (CFC), a framework that transparently orchestrates execution of CUDA kernels on a cluster of multi-core machines. The well-structured nature of a CUDA kernel, the growing popularity, support and stability of the CUDA software stack collectively make CUDA a good candidate to be considered as a programming language for a cluster. CFC uses a mixture of source-to-source compiler transformations, a work distribution runtime and a light-weight software distributed shared memory to manage parallel executions. Initial results on running several standard CUDA benchmark programs achieve impressive speedups of up to 7.5X on a cluster with 8 nodes, thereby opening up an interesting direction of research for further investigation
Achieving Reliability in Master-worker Computing via Evolutionary Dynamics

The proceeding at: 18th International Conference on Parallel and Distributed Computing, Euro-Par 2012), took place 2012, August 27-31, in Rhodes Island, Greece.This work considers Internet-based task computations in which a master process assigns tasks, over the Internet, to rational workers and collect their responses. The objective is for the master to obtain the correct task outcomes. For this purpose we formulate and study the dynamics of evolution of Internet-based master-worker computations through reinforcement learning.This work is supported by the Cyprus Research Promo-tion Foundation grant TΠE/ΠΛHPO/0609(BE)/05, NSF grants CCF-0937829, CCF-1114930, Comunidad de Madrid grant S2009TIC-1692, Spanish MOSAICO and RESINEE grants and MICINN grant TEC2011-29688-C02-01, and National Natural Science Foundation of China grant 61020106002.Publicad
Challenges at the intersection of social media and social innovation

Inspired by recent critical social and economic developments – and their
most visible eruptions in the Arab world, Spain and Greece – which demonstrate
that there is a relatively low barrier of entrance for individuals and groups to adopt
social media for virtually any shared purpose, objective or cause, a “manifesto” has
been written by a group of transdisciplinary researchers, activists and practitioners
from the fields of ICT and social movements.
It promotes the possibility of using social media as a platform to effectively
support the processes of social innovation, overcoming its limitations of speed and
scale to become an alternative to currently established institutional mechanisms.
Such social innovations comprise all new strategies, concepts, ideas and
organizations that meet current social needs and strengthen civil society.
Further, the present paper proposes a framework for research into the elements
of socio-technical architectures capable of sustaining large scale social innovations
enabled by the availability of social media, considering the “paradigm shift of
communication” in a knowledge society and describing key challenges of social
innovation initiatives. In this context, the objective of the Manifesto on Social
Media for Social Innovation is to propose actions oriented to extract the best of
the potential synergies among those two concepts of social innovation and
social media
Defining Process Performance Indicators By Using Templates and Patterns

Process Performance Indicators (PPIs) are a key asset for the mea- 2 surement of the achievement of strategic and operational goals in process–oriented 3 organisations. Ideally, the definition of PPIs should not only be unambiguous, 4 complete, and understandable to non–technical stakeholders, but also traceable 5 to business processes and verifiable by means of automated analysis. in practice, 6 PPIs are defined either informally in natural language, with its well–known prob- 7 lems, or at a very low level, or too formally, becoming thus hardly understand- 8 able to managers and users. in order to solve this problem, in this paper, a novel 9 approach to improve the definition of PPIs using templates and ontology–based 10 linguistic patterns is proposed. Its main benefits are that it is easy to learn, pro- 11 motes reuse, reduces ambiguities and missing information, is understandable to 12 all stakeholders and maintains traceability with the process model. Furthermore, 13 since it relies on a formal ontology based on Description Logics, it is possible 14 to perform automated analysis and infer knowledge regarding the relationships 15 between PPI definitions and other process elements.Comisión Interministerial de Ciencia y Tecnología TIN2009–07366Junta de Andalucía TIC–5906Junta de Andalucía P07–TIC–2533
Approximate clone detection in repositories of business process models

Evidence exists that repositories of business process models used in industrial practice contain significant amounts of duplication. This duplication may stem from the fact that the repository describes variants of the same pro- cesses and/or because of copy/pasting activity throughout the lifetime of the repository. Previous work has put forward techniques for identifying duplicate fragments (clones) that can be refactored into shared subprocesses. However, these techniques are limited to finding exact clones. This paper analyzes the prob- lem of approximate clone detection and puts forward two techniques for detecting clusters of approximate clones. Experiments show that the proposed techniques are able to accurately retrieve clusters of approximate clones that originate from copy/pasting followed by independent modifications to the copied fragments
Isotactics as a foundation for alignment and abstraction of behavioral models

There are many use cases in business process management that require the comparison of behavioral models. For instance, verifying equivalence is the basis for assessing whether a technical workflow correctly implements a business process, or whether a process realization conforms to a reference process. This paper proposes an equivalence relation for models that describe behaviors based on the concurrency semantics of net theory and for which an alignment relation has been defined. This equivalence, called isotactics, preserves the level of concurrency of aligned operations. Furthermore, we elaborate on the conditions under which an alignment relation can be classified as an abstraction. Finally, we show that alignment relations induced by structural refinements of behavioral models are indeed behavioral abstractions
Flower Pollination Algorithm for Global Optimization

Flower pollination is an intriguing process in the natural world. Its
evolutionary characteristics can be used to design new optimization algorithms.
In this paper, we propose a new algorithm, namely, flower pollination
algorithm, inspired by the pollination process of flowers. We first use ten
test functions to validate the new algorithm, and compare its performance with
genetic algorithms and particle swarm optimization. Our simulation results show
the flower algorithm is more efficient than both GA and PSO. We also use the
flower algorithm to solve a nonlinear design benchmark, which shows the
convergence rate is almost exponential.Comment: 10 page
Enhancing Goal-based Requirements Consistency: an Argumentation-based Approach

International audienceRequirements engineering research has for long recognized the leading role of goals as requirement artifacts during the requirements engineering specification processes. Given the large number of artifacts created during the requirements specification and the continuous evolution of these artifacts, reasoning about them remains a challenging task. Moreover, the rising complexity of the target domain under consideration during the requirements engineering process as well as the growth of geographically distributed projects explain why the number of collected requirements as well as their complexity also increase. In this context, providing support to stakeholders in achieving a common understanding of a set of goal-based requirements, in consolidating them and keeping them consistent over time is another challenging task. In this paper, we propose an approach to detect consistent sets of goal-based requirements and maintain their consistency over time. Our approach relies on argumentation theory which allows to detect the conflicts among elements called arguments. In particular, we rely on meta-argumentation, which instantiates abstract argumentation frameworks, where requirements are represented as arguments and the standard Dung-like argumentation framework is extended with additional relations between goal-based requirements
A web platform and a decision model for computer-interpretable guidelines

Situations of medical error and defensive medicine are com-
mon in healthcare environments and have repercussions in the quality
of care under o er. The occurrence of adverse events and the increase of
healthcare expenses are some of the consequences of medical malpractice.
Indeed, these situations may be prevented by encouraging the compli-
ance with Clinical Guidelines (CGs). However, the current format of CGs
proved to be disadvantageous for real-time application, i.e., they may not
provide recommendations to healthcare professionals when required, and
on time. The introduction of Computer-Interpretable Guidelines (CIGs)
may provide a solution to this problem, however they are not widely
implemented and there are some issues that need to be contemplated.
Indeed, in this paper it is presented the CompGuide project for guideline
representation and sharing, combined with the handling of incomplete
information in that context
A statistical classifier for assessing the level of stress from the analysis of interaction patterns in a touch screen

This paper describes an approach for assessing the level of stress of users
of mobile devices with tactile screens by analysing their touch patterns. Two features
are extracted from touches: duration and intensity. These features allow to analyse
the intensity curve of each touch.We use decision trees (J48) and support vector machines
(SMO) to train a stress detection classifier using additional data collected in
previous experiments. This data includes the amount of movement, acceleration on
the device, cognitive performance, among others. In previous work we have shown
the co-relation between these parameters and stress. Both algorithms show around
80% of correctly classified instances. The decision tree can be used to classify, in
real time, the touches of the users, serving as an input to the assessment of the stress
level.This work is funded by National Funds through the FCT Fundacao para a Ciencia e a Tecnologia (Portuguese Foundation for Science and Technology) within project PEst-OE/EEI/UI0752/2011. The work of Davide Carneiro is also supported by a doctoral grant by FCT (SFRH/BD/64890/2009)
A kernel for time series classification: application to atmospheric pollutants

In this paper a kernel for time-series data is presented. The main idea of the kernel is that it is designed to recognize as similar time series that may be slightly shifted with one another. Namely, it tries to focus on the shape of the time-series and ignores the fact that the series may not be perfectly aligned. The proposed kernel has been validated on several datasets based on the UCR time-series repository [1]. A comparison with the well-known Dynamic Time Warping (DTW) distance and Euclidean distance shows that the proposed kernel outperforms the Euclidean distance and is competitive with respect to the DTW distance while having a much lower computational cost.Postprint (author’s final draft
Active security in multiparty computation over black-box groups

Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks.\ud
\ud
We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q 3 property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer’s Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit