Search results for "architecture"

Does culture affect sentiments expressed in cruise tours’ eWOM?

2018

ABSTRACTThe study aims to examine the sentiment differences in the content of cruise tour online reviews across North Americans and Europeans, as representing the two largest cruise markets. Dictionary-based sentiment analysis has been carried out on 1127 reviews on guided tours retrieved from TripAdvisor. The results indicate significant differences in the sentiment score of the reviews, with North Americans’ texts being more emotionally charged than the European ones. In addition, North Americans’ reviews conveyed a more positive affect and had a more subjective and intimate tone, while those written by Europeans contained a smaller amount of sentiment-bearing words and their tone was mor…

The Self-expression Motivational System

2016

The main aim of this chapter is to introduce and promote the concept of self-expression as a basic motivation. Considering that the amount of literature on self-expression, matched with the concepts of control and affiliation, is practically non-existent, the chapter starts by attempting to provide a viable definition of self-expression motivation. Furthermore, the concept of art as a domain in which the underlying tendency for self-expression is clearly manifested is also considered. The chapter also includes a literature review to show whether or not self-expression motivation is able to fulfil the criteria suggested by Baumeister and Leary (Psychological Bulletin, 117, 497–529, 1995). Th…

The Senate Territorial Groups

2013

Since the adoption of the Senate Rules in 1982 alongside the traditional parliamentary Groups (where Senators are associated by ideological affinity), there exist territorial Groups that try to reflect the autonomous organization of the State. The purpose of this work is to make a concise study of these Groups, which are undoubtedly one of the effects of the expression that the Upper House is the House of territorial representation, as contained in article 69 of the Constitution.

HSP60 expression during carcinogenesis: where is the pilot?

2006

Finding optimal finite biological sequences over finite alphabets: the OptiFin toolbox

2017

International audience; In this paper, we present a toolbox for a specific optimization problem that frequently arises in bioinformatics or genomics. In this specific optimisation problem, the state space is a set of words of specified length over a finite alphabet. To each word is associated a score. The overall objective is to find the words which have the lowest possible score. This type of general optimization problem is encountered in e.g 3D conformation optimisation for protein structure prediction, or largest core genes subset discovery based on best supported phylogenetic tree for a set of species. In order to solve this problem, we propose a toolbox that can be easily launched usin…

On the Number of Closed Factors in a Word

2015

A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of closed factors of words. We show that a word of length $n$ contains at least $n+1$ distinct closed factors, and characterize those words having exactly $n+1$ closed factors. Furthermore, we show that a word of length $n$ can contain $\Theta(n^{2})$ many distinct closed factors.

FIRST

2018

Thanks to the collective action of participating smartphone users, mobile crowdsensing allows data collection at a scale and pace that was once impossible. The biggest challenge to overcome in mobile crowdsensing is that participants may exhibit malicious or unreliable behavior, thus compromising the accuracy of the data collection process. Therefore, it becomes imperative to design algorithms to accurately classify between reliable and unreliable sensing reports. To address this crucial issue, we propose a novel Framework for optimizing Information Reliability in Smartphone-based participaTory sensing (FIRST) that leverages mobile trusted participants (MTPs) to securely assess the reliabil…

Hybrid blind robust image watermarking technique based on DFT-DCT and Arnold transform

2018

In this paper, a robust blind image watermarking method is proposed for copyright protection of digital images. This hybrid method relies on combining two well-known transforms that are the discrete Fourier transform (DFT) and the discrete cosine transform (DCT). The motivation behind this combination is to enhance the imperceptibility and the robustness. The imperceptibility requirement is achieved by using magnitudes of DFT coefficients while the robustness improvement is ensured by applying DCT to the DFT coefficients magnitude. The watermark is embedded by modifying the coefficients of the middle band of the DCT using a secret key. The security of the proposed method is enhanced by appl…

Constrained Role Mining

2013

Role Based Access Control (RBAC) is a very popular access control model, for long time investigated and widely deployed in the security architecture of different enterprises. To implement RBAC, roles have to be firstly identified within the considered organization. Usually the process of (automatically) defining the roles in a bottom up way, starting from the permissions assigned to each user, is called {\it role mining}. In literature, the role mining problem has been formally analyzed and several techniques have been proposed in order to obtain a set of valid roles. Recently, the problem of defining different kind of constraints on the number and the size of the roles included in the resu…

Functions definable by numerical set-expressions

2011

A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of "additive circuits". If they are confined to the usual Boolean operations together with the result of lifting addition and multiplication to the level of sets, we speak of "arithmetic circuits". In this paper, we investigate the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations.