pinecone/core-2020-05-10-deduplication huggingface dataset:
A presence-aware smart home system (PASH)

Wireless Sensor Networks are providing tremendous benefit for a number of industries. A subset of sensed data collected by these networks is presence information. A smart home control system can be designed based on presence information provided by all devices or objects in the home, and we can act depending on it. For this reason, in this paper we present a Presenceaware Smart Home System. We explain its components and features that facilitate the daily living of person’s own home.Peer ReviewedPostprint (published version
Designing Messenger Visual, an instant messaging service for individuals with cognitive disability

Considering the importance of Internet-based communications in our\ud
society, the lack of Instant Messaging (IM) services adapted to individuals with\ud
cognitive disabilities who have difficulties using written language creates a\ud
situation of exclusion that has a negative impact on their daily lives. To\ud
alleviate this situation we present Messenger Visual, an IM service that uses\ud
pictograms as the main communication system. Along the paper we introduce\ud
the main design aspects of an IM service to support pictogram-based\ud
communications, as well as the design and evaluation aspects of an IM client\ud
that takes into account both the pictogram-based communication and the user\ud
interface accessibility requirements of individuals with cognitive disabilities.Postprint (published version
Using Hard Constraints for Representing Soft Constraints

International audienceMost of the current algorithms dedicated to the resolution of over-constrained problems, as PFC-MRDAC, are based on the search for a support for each value of each variable taken independently. The structure of soft constraints is only used to speed-up such a search, but not to globally deduce the existence or the absence of support. These algorithms do not use the ltering algorithms associated with the soft constraints. In this paper we present a new schema where a soft constraint is represented by a hard constraint in order to automatically benet from the pruning performance of the ltering algorithm associated with this constraint and from the incremental aspect of these ltering algorithms. In other words, thanks to this schema every ltering algorithm associated with a constraint can still be used when the constraint is soft. The PFC-MRDAC (via the Satisability Sum constraint) algorithm and the search for disjoint conict sets are then adapted to this new schema
Origins of scaling in genetic code

???The original publication is available at www.springerlink.com??? Copyright SpringerThe principle of least effort in communications has been shown, by Ferrer i Cancho and Sol??e, to explain emergence of power laws (e.g., Zipf???s law) in human languages. This paper applies the principle and the informationtheoretic model of Ferrer i Cancho and Sol??e to genetic coding. The application of the principle is achieved via equating the ambiguity of signals used by ???speakers??? with codon usage, on the one hand, and the effort of ???hearers??? with needs of amino acid translation mechanics, on the other hand. The re-interpreted model captures the case of the typical (vertical) gene transfer, and confirms that Zipf???s law can be found in the transition between referentially useless systems (i.e., ambiguous genetic coding) and indexical reference systems (i.e., zero-redundancy genetic coding). As with linguistic symbols, arranging genetic codes according to Zipf???s law is observed to be the optimal solution for maximising the referential power under the effort constraints. Thus, the model identifies the origins of scaling in genetic coding ??? via a trade-off between codon usage and needs of amino acid translation. Furthermore, the paper extends Ferrer i Cancho ??? Sol??e model to multiple inputs, reaching out toward the case of horizontal gene transfer (HGT) where multiple contributors may share the same genetic coding. Importantly, the extended model also leads to a sharp transition between referentially useless systems (ambiguous HGT) and indexical reference systems (zero-redundancy HGT). Zipf???s law is also observed to be the optimal solution in the HGT case
Swarm Cognition and Artificial Life

Trianni V., Tuci E. Swarm Cognition and Artificial Life. Proceedings of the 10th European Conference of Artificial Life (ECAL 2009), Vol. LNCS/LNAI 5777, 5778, Springer VerlagSwarm Cognition is the juxtaposition of two relatively unrelated concepts that evoke, on the one hand, the power of collective behaviours displayed by natural swarms, and on the other hand the complexity of cognitive processes in the vertebrate brain. Recently, scientists from various disciplines suggest that, at a certain level of description, operational principles used to account for the behaviour of natural swarms may turn out to be extremely powerful tools to identify the neuroscientific basis of cognition. In this paper, we review the most recent studies in this direction, and propose an integration of Swarm Cognition with Artificial Life, identifying a roadmap for a scientific and technological breakthrough in Cognitive Sciences
Impoverished empowerment : `meaningful' action sequence generation through bandwidth limitation

???The original publication is available at www.springerlink.com??? Copyright SpringerEmpowerment is a promising concept to begin explaining how some biological organisms may assign apriori values expectations to states in taskless scenarios. Standard empowerment samples the full richness of an environment and assumes it can be fully explored. This may be too aggressive an assumption and here we explore impoverished versions achieved through a limit on the bandwidth of the empowerment generating action sequences. It turns out that limited richness of actions concentrate on the most important" ones with the additional benefit that the empowerment horizon can be extended drastically into the fu- ture. This may indicate a path towards and intrinsical preselection for preferred behaviour sequences and may help to suggest more biologically plausible approaches
Update dynamics, strategy exchanges and the evolution of cooperation in the snowdrift game

We verify through numerical simulations that the influence
of the update dynamics on the evolution of cooperation in the Snowdrift
game is closely related to the number of strategy exchanges between
agents. The results show that strategy exchanges contribute to
the destruction of compact clusters favorable to cooperator agents. In
general, strategy exchanges decrease as the synchrony rate decreases.
This explains why smaller synchrony rates are beneficial to cooperators
in situations where a large number of exchanges occur with synchronous
updating. On the other hand, this is coherent with the fact that the
Snowdrift game is completely insensitive to the synchrony rate when the
replicator dynamics transition rule is used: there are almost no strategy
exchanges when this rule is used
Hierarchical behaviours : getting the most bang for your bit

???The original publication is available at www.springerlink.com??? Copyright SpringerHierarchical structuring of behaviour is prevalent in natural and artificial agents and can be shown to be useful for learning and performing tasks. To progress systematic understanding of these benefits we study the effect of hierarchical architectures on the required information processing capability of an optimally acting agent. We show that an information-theoretical approach provides important insights into why factored and layered behaviour structures are beneficial
Java Card implementation of the Elliptic Curve Integrated Encryption Scheme using prime and binary finite fields

8 páginas, 2 tablas, 2 figuras.Elliptic Curve Cryptography (ECC) can be considered an\ud
approach to public-key cryptography based on the arithmetic of elliptic\ud
curves and the Elliptic Curve Discrete Logarithm Problem (ECDLP).\ud
Regarding encryption, the best-known scheme based on ECC is the Ellip-\ud
tic Curve Integrated Encryption Scheme (ECIES), included in standards\ud
from ANSI, IEEE, and also ISO/IEC. In the present work, we provide\ud
a comparison of two Java Card implementations of ECIES that we have\ud
developed using prime and binary fields, respectively.This work has been partially supported by the “Fundación\ud
Memoria D. Samuel Solórzano Barruso” under the Project FS/7-2010.Peer reviewe
A multisignature scheme based on the SDLP and on the IFP

8 páginasMultisignature schemes are digital signature schemes that\ud
permit one to determine a unique signature for a given message, depending\ud
on the signatures of all the members of a speci c group. In this\ud
work, we present a new semi-short multisignature scheme based on the\ud
Subgroup Discrete Logarithm Problem (SDLP) and on the Integer Factorization\ud
Problem (IFP). The scheme can be carried out in an on- and\ud
o -line basis, is efficient, and the bitlength of the multisignature does\ud
not depend on the number of signers.This work has been partially supported by the \Fundación\ud
Memoria D. Samuel Solórzano Barruso" under the Project FS/7-2010.Peer reviewe
A group signature scheme based on the integer factorization and the subgroup discrete logarithm problems

8 pagesGroup signature schemes allow a user, belonging to a speci c\ud
group of users, to sign a message in an anonymous way on behalf of the\ud
group. In general, these schemes need the collaboration of a Trusted\ud
Third Party which, in case of a dispute, can reveal the identity of the\ud
real signer. A new group signature scheme is presented whose security is\ud
based on the Integer Factorization Problem (IFP) and on the Subgroup\ud
Discrete Logarithm Problem (SDLP).This work has been partially supported by the \Fundaci on\ud
Memoria D. Samuel Sol orzano Barruso" under the Project FS/7-2010.Peer reviewe
Bayesian Conditioning, the Reflection Principle, and Quantum Decoherence

The probabilities a Bayesian agent assigns to a set of events typically
change with time, for instance when the agent updates them in the light of new
data. In this paper we address the question of how an agent's probabilities at
different times are constrained by Dutch-book coherence. We review and attempt
to clarify the argument that, although an agent is not forced by coherence to
use the usual Bayesian conditioning rule to update his probabilities, coherence
does require the agent's probabilities to satisfy van Fraassen's [1984]
reflection principle (which entails a related constraint pointed out by
Goldstein [1983]). We then exhibit the specialized assumption needed to recover
Bayesian conditioning from an analogous reflection-style consideration.
Bringing the argument to the context of quantum measurement theory, we show
that "quantum decoherence" can be understood in purely personalist
terms---quantum decoherence (as supposed in a von Neumann chain) is not a
physical process at all, but an application of the reflection principle. From
this point of view, the decoherence theory of Zeh, Zurek, and others as a story
of quantum measurement has the plot turned exactly backward.Comment: 14 pages, written in memory of Itamar Pitowsk
An agent-based architecture for multifaceted online dispute resolution tools

The Twenty-fourth International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2011), 2011Online Dispute Resolution (ODR) tools are being seen as a way to settle disputes out of courts, namely under virtual environments. However, the acceptance of these alternative methods is still relatively restricted, once existing tools are relatively undemanding and domain-centered. Indeed, there is the need for conceptual tools whose parts may be arranged for particular use, i.e., to operate in different domains. Following this line of attack, in this paper it will be presented a new agent-based approach to ODR. It comes in an abstract and formal form, in order to be independent of the legal domains, but specific enough to be applied to concrete ones. The main advantage is that functionality reuse is maximized, making architectures simpler to implement and to expandThe work described in this paper was developed under the TIARAC - Telematics and Artificial Intelligence in Alternative Conflict Resolution Project (PTDC/JUR/71354/2006), a research project supported by FCT (Science & Technology Foundation), Portugal
Particle swarm optimisation for open shop problems with fuzzy durations

4th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2011, La Palma, Canary Islands, Spain, May 30 - June 3, 2011. Proceedings, Part ILa publicación final está disponible en Springer http://dx.doi.org/10.1007/978-3-642-21344-1_38In this paper we confront a variation of the open shop problem where task durations are allowed to be uncertain and where uncertainty is modelled using fuzzy numbers. We propose a particle swarm optimization (PSO) approach to minimise the expected makespan using priorities to represent particle position, as well as a decoding algorithm to generate schedules in a subset of possibly active ones. Finally, the performance of the PSO is tested on several benchmark problems, modified so as to have fuzzy durations, compared with a memetic algorithm from the literatur
Multicamera Action Recognition with Canonical Correlation Analysis and Discriminative Sequence Classification

Proceedings of: 4th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2011, La Palma, Canary Islands, Spain, May 30 - June 3, 2011.This paper presents a feature fusion approach to the recognition of human actions from multiple cameras that avoids the computation of the 3D visual hull. Action descriptors are extracted for each one of the camera views available and projected into a common subspace that maximizes the correlation between each one of the components of the projections. That common subspace is learned using Probabilistic Canonical Correlation Analysis. The action classification is made in that subspace using a discriminative classifier. Results of the proposed method are shown for the classification of the IXMAS dataset.Publicad
Capability assessment for introducing component reuse

Despite initial technical barriers having been overcome, organizational wide component reuse has not enjoyed universal acceptance. Research has identified social and organizational factors as probable causes. This paper describes the Social Factors for Reuse Model (SFR Model), a predictive capability model based on Keidel's triadic model of the organization. It determines an organization's readiness for the introduction of Component Based Software Engineering (CBSE); describing the social and organizational conditions that should be met to maximize the chances of successful implementation. A sample application of the Model is described.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Logic training through algorithmic problem solving

Available for individual study only.Although much of mathematics is algorithmic in nature, the skills needed to formulate and solve algorithmic problems do not form an integral part of mathematics education. In particular, logic, which is central to algorithm development, is rarely taught explicitly at preuniversity level, under the justification that it is implicit in mathematics and therefore does not need to be taught as an independent topic. This paper argues in the opposite direction, describing a one-week workshop done at the University of Minho, in Portugal, whose goal was to introduce to high-school students calculational principles and techniques of algorithmic problem solving supported by calculational logic. The workshop resorted to recreational problems to convey the principles and to software tools, the Alloy Analyzer and Netlogo, to animate models.On- going collaboration with Roland Backhouse is deeply acknowledged. This research was supported by the MathIS project under contract PTDC/ EIA/ 73252/ 2006. The first two authors were further supported by FCT grants SFRH/ BD/ 24269/ 2005 and SFRH/ BD/ 29553/ 2006, respectively
What future, which technology? On the problem of describing relevant futures.

Doing research on future and emerging technologies raises a number of\ud
significant ontological and epistemological challenges. The fundamental uncertainty\ud
of the future, combined with problems of appropriate descriptions of technology\ud
in general, render it difficult to come to an appropriate account of the likely\ud
shape and use of future technologies. This paper discusses several streams of\ud
research that address this issue, including the question of relevant description and\ud
context, interpretive flexibility, affordances of technology, and multi-stability of\ud
technological trajectories. The paper proposes that some of these problems may be\ud
addressed by using a democratic and participative approach to technology research\ud
and development. Participative technology assessment is then discussed as an\ud
example of an established way of democratically engaging with technology\ud
stakeholders during research and development. The paper concludes by discussing\ud
the promises and limitations of such a participative approach with regard to the\ud
question of understanding and researching future technologies
Improving the scalability of cloud-based resilient database servers

Many rely now on public cloud infrastructure-as-a-service for
database servers, mainly, by pushing the limits of existing pooling and
replication software to operate large shared-nothing virtual server clusters.
Yet, it is unclear whether this is still the best architectural choice,
namely, when cloud infrastructure provides seamless virtual shared storage
and bills clients on actual disk usage.
This paper addresses this challenge with Resilient Asynchronous Commit
(RAsC), an improvement to awell-known shared-nothing design based
on the assumption that a much larger number of servers is required for
scale than for resilience. Then we compare this proposal to other database
server architectures using an analytical model focused on peak throughput
and conclude that it provides the best performance/cost trade-off while at
the same time addressing a wide range of fault scenarios
A correlation-aware data placement strategy for key-value stores

Key-value stores hold the unprecedented bulk of the data
produced by applications such as social networks. Their scalability and
availability requirements often outweigh sacri cing richer data and pro-
cessing models, and even elementary data consistency. Moreover, existing
key-value stores have only random or order based placement strategies.
In this paper we exploit arbitrary data relations easily expressed by the
application to foster data locality and improve the performance of com-
plex queries common in social network read-intensive workloads.
We present a novel data placement strategy, supporting dynamic tags,
based on multidimensional locality-preserving mappings.
We compare our data placement strategy with the ones used in existing
key-value stores under the workload of a typical social network appli-
cation and show that the proposed correlation-aware data placement
strategy o ers a major improvement on the system's overall response
time and network requirements
Session-Based Role Programming for the Design of Advanced Telephony Applications

International audienceStimulated by new protocols like SIP, telephony applications are rapidly evolving to o er and combine a variety of communications forms including presence status, instant messaging and videoconferencing. This situation changes and complicates significantly the programming of telephony applications that consist now of distributed entities involved into multiple heterogeneous, stateful and long-running interactions. This paper proposes an approach to support the development of SIP-based telephony applications based on general programming language. Our approach combines the concepts of Actor, Session and Role. Role is the part an actor takes in a session and we consider a session as a collaboration between roles. By using these concepts, we are able to break the complexity of SIP entities programming and provide flexibility for defi ning new ones. Our approach is implemented as a coding framework above JAIN-SIP
Ceremony analysis : strengths and weaknesses

We investigate known security flaws in the context of security ceremonies to gain an understanding of the ceremony analysis process. The term security ceremonies is used to describe a system of protocols and humans which interact for a specific purpose. Security ceremonies and ceremony analysis is an area of research in its infancy, and we explore the basic principles involved to better understand the issues involved.We analyse three ceremonies, HTTPS, EMV and Opera Mini, and use the information gained from the experience to establish a list of typical flaws\ud
in ceremonies. Finally, we use that list to analyse a protocol proven secure for human use. This leads to a realisation of the strengths and weaknesses of ceremony analysis
Verification of unloadable modules

Programs in unsafe languages, like C and C++, may dynamically
load and unload modules. For example, some operating system
kernels support dynamic loading and unloading of device
drivers. This causes specific difficulties in the verification
of such programs and modules; in particular, it must be
verified that no functions or global variables from the module
are used after the module is unloaded.

We present the approach we used to add support for loading and
unloading modules to our separation-logic-based program
verifier VeriFast. Our approach to the specification and
verification of function pointer calls, based on parameterizing
function types by predicates, is sound in the presence of
unloading, but at the same time does not complicate the
verification of programs that perform no unloading, and does
not require callers to distinguish between function pointers
that point into unloadable modules and ones that do not.

We offer a machine-checked formalization and soundness proof
and we report on verifying a small kernel-like program using
VeriFast. To the best of our knowledge, ours is the first
approach for sound modular verification of C programs that load
and unload modules.status: publishe
On combining state space reductions with global fairness assumptions

Model checking has established itself as an effective system analysis method, as it is capable of proving/dis-proving properties automatically. Its application to practical systems is however limited by state space explosion. Among effective state reduction techniques are symmetry reduction and partial order reduction. Global fairness often plays a vital role in designing self-stabilizing population protocols. It is known that combining fairness and symmetry reduction is nontrivial. In this work, we first show that global fairness, unlike weak/strong fairness, can be combined with symmetry reduction. We extend the PAT model checker with the technique and demonstrate its usability by verifying recently proposed population protocols. Second, we show that partial order reduction is not property-preserving with global fairness.Full Tex