Search results for " Computer Science"

Extending the semiotics of embodied interaction to blended spaces.

2015

In this paper, we develop a new way of understanding interactions in blended spaces. We do this by developing ideas about embodied semiotics and then apply these ideas to the analysis of interaction in mixed-reality blended spaces (where the physical world and digital world are blended deliberately to provide new forms of interaction). We discuss how blended spaces provide a new medium within which people have experiences. The semiotic analysis reveals how blended spaces are constructed across the physical and the digital, highlighting the ontology, topology, volatility, and agency present within them. It shows how people move between the physical and digital spaces through the objects and …

Overlapping Community Structure in Co-authorship Networks: A Case Study

2014

Community structure is one of the key properties of real-world complex networks. It plays a crucial role in their behaviors and topology. While an important work has been done on the issue of community detection, very little attention has been devoted to the analysis of the community structure. In this paper, we present an extensive investigation of the overlapping community network deduced from a large-scale co-authorship network. The nodes of the overlapping community network represent the functional communities of the co-authorship network, and the links account for the fact that communities share some nodes in the co-authorship network. The comparative evaluation of the topological prop…

Impact of centrality on cooperative processes

2016

The solution of today's complex problems requires the grouping of task forces whose members are usually connected remotely over long physical distances and different time zones. Hence, understanding the effects of imposed communication patterns (i.e., who can communicate with whom) on group performance is important. Here, we use an agent-based model to explore the influence of the betweenness centrality of the nodes on the time the group requires to find the global maxima of NK-fitness landscapes. The agents cooperate by broadcasting messages, informing on their fitness to their neighbors, and use this information to copy the more successful agents in their neighborhood. We find that for ea…

Clique Percolation Method: Memory Efficient Almost Exact Communities

2022

Automatic detection of relevant groups of nodes in large real-world graphs, i.e. community detection, has applications in many fields and has received a lot of attention in the last twenty years. The most popular method designed to find overlapping communities (where a node can belong to several communities) is perhaps the clique percolation method (CPM). This method formalizes the notion of community as a maximal union of $k$-cliques that can be reached from each other through a series of adjacent $k$-cliques, where two cliques are adjacent if and only if they overlap on $k-1$ nodes. Despite much effort CPM has not been scalable to large graphs for medium values of $k$. Recent work has sho…

Correlations among Game of Thieves and other centrality measures in complex networks

2021

Social Network Analysis (SNA) is used to study the exchange of resources among individuals, groups, or organizations. The role of individuals or connections in a network is described by a set of centrality metrics which represent one of the most important results of SNA. Degree, closeness, betweenness and clustering coefficient are the most used centrality measures. Their use is, however, severely hampered by their computation cost. This issue can be overcome by an algorithm called Game of Thieves (GoT). Thanks to this new algorithm, we can compute the importance of all elements in a network (i.e. vertices and edges), compared to the total number of vertices. This calculation is done not in…

A privacy-aware framework for decentralized online social networks

2015

Online social networks based on a single service provider suffer several drawbacks, first of all the privacy issues arising from the delegation of user data to a single entity. Distributed online social networks (DOSN) have been recently proposed as an alternative solution allowing users to keep control of their private data. However, the lack of a centralized entity introduces new problems, like the need of defining proper privacy policies for data access and of guaranteeing the availability of user's data when the user disconnects from the social network. This paper introduces a privacy-aware support for DOSN enabling users to define a set of privacy policies which describe who is entitle…

Editorial: Robot-Assisted Learning and Education

2020

Soft computing-based aggregation methods for human resource management

2008

Abstract We are interested in the personnel selection problem. We have developed a flexible decision support system to help managers in their decision-making functions. This DSS simulates experts’ evaluations using ordered weighted average (OWA) aggregation operators, which assign different weights to different selection criteria. Moreover, we show an aggregation model based on efficiency analysis to put the candidates into an order.

Artificial Vision and Soft Computing

1999

The term soft-computing has been introduced by Zadeh in 1994. Soft-computing provides an appropriate paradigm to program malleable and smooth concepts. For example, it can be used to introduce flexibility in artificial systems to improve their Intelligent Quotient. The aim of this paper is to describe the applicability of soft-computing to artificial vision problems. Good performance of this approach is assured by the fact that digital images are examples of fuzzy entities, where shapes are not always describable by exact equations and their approximation can be very complex.

Some reflections on Fuzzy Set Theory as an Experimental Science

2014

The aim of this paper is to open a critical discussion on the claim, recently presented in the community and especially heralded by Enric Trillas, that fuzzy logic should be seen as an “experimental science”. The first interesting aspect of such remark is whether and in which way such position has consequences on the real development of the research, or if it is simply a (different) way of looking at the same phenomenon. As a consequence, we investigate the possible connection to Zadeh’s distiction between Fuzzy logic in a restricted sense and in a general sense. We shall argue that Trillas’s claim not only strongly supports the necessity for such a distinction, but provides a path of inves…