Mariana Curado Malta

Abstract
Influential spreaders contribute substantially to managing and optimizing any spreading process in a network. Influential spreaders are nodes that hold importance within the network. Identifying them is a challenging task. Some encysting methods for such identification include local-structure-based, global-structure-based, semi-global-structure-based, and hybrid-structure-based methods. Semi-global structure-based methods show significant potential in identifying influential nodes in different network structures. However, existing semi-global structure-based methods often identify nodes from the network's periphery, where nodes are loosely connected, and their collective influence in spreading processes is minimal. This paper presents a novel method called Semi-global triangular and degree centrality (STC + K) to overcome this limitation by considering a node's degree, the number of triangles, and the third hop of neighbourhood connectivity information. The proposed novel method outperforms the existing noteworthy indexing methods regarding ranking performance. The experimental results show better performance, as indicated by two performance metrics: recognition rate and improvement percentage. By virtue of the fact that the empirically set free parameters are absent, our method eliminates the need for time-consuming preprocessing to select optimal parameter values for ranking nodes in large networks.

Abstract
Digital Transformation (DT) has become an important issue for organisations. It is proven that DT fuels Digital Innovation in organisations. It is well-known that technologies and practices such as distributed ledger technologies, open source, analytics, big data, and artificial intelligence (AI) enhance DT. Among those technologies, AI provides tools to support decision-making and automatically decide. Cooperatives are organisations with a mutualistic scope and are characterised by having participatory cooperative governance due to the principle of democratic control by the members. In a context where DT is here to stay, where the dematerialisation of processes can bring significant advantages to any organisation, this article presents a critical reflection on the dangers of using AI technologies in cooperatives. We base this reflection on the Portuguese cooperative code. We emphasise that this code is not very different from the ones of other countries worldwide as they are all based on the Statement of Cooperative Identity defined by the International Cooperative Alliance. We understand that we cannot stop the entry of AI technologies into the cooperatives. Therefore, we present a framework for using AI technologies in cooperatives to avoid damaging the principles and values of this type of organisations.

Abstract
Agricultural cooperatives remain a significant component of the food and agriculture industry to help the stakeholders to provide services and have opportunities for themselves. One of the aims of an agricultural cooperative is to answer to the needs within the communities of the farmers. Agricultural cooperatives enable individual farmers to increase productivity and maximise their social welfare. Together the farmer members of an agricultural cooperative can buy input supplies cheaper and sell more of their products in larger markets at higher prices, which is not possible for an individual smallholder farmer otherwise. Some studies have shown that farmers who were members of cooperatives have gained higher revenue for their products and spent less on input. However, organising the hundreds of farmers into smaller groups to perform collective farming and marketing is crucial to strengthening their position in the food and agriculture industry. Thereby, in our work, we consider an agricultural cooperative of smallholder farmers as a multi-agent based coalitional model, where coalitions are formed based on the similarity among the smallholder farmers. In this paper, we propose a model and implement a heuristic-based algorithm to find the disjoint partition of the agents set. We evaluate the model and the algorithm based on the following criteria: (i) individual gain, (ii) runtime analysis, (iii) solution quality, and (iv) scalability. We theoretically prove that our coalitional model of an agricultural cooperative has conciseness, expressiveness and efficiency properties. Experimental results confirm that our algorithm is time efficient and scalable. We show, both empirically and theoretically, that our algorithm generates a solution within a bound of the optimal solution. We also show that our coalition model generates positive revenue for the smallholder farmers and the payoff division rule is individual rational. In addition, we generate a new dataset in the context of an agricultural cooperative to show the effectiveness and efficiency of the proposed coalitional model of the cooperative.

Abstract
Covid-19 posed several challenges to all organisations in general and to social solidarity cooperatives in particular. However, the challenges faced by these cooperatives have unique features arising from their special characteristics compared to other types of cooperatives. Therefore it is vital to study these challenges and the impacts of covid-19. This study has as main goal to understand those challenges and their impact. An exploratory study was undertaken by applying 11 interviews to 11 social solidarity cooperatives. The cooperatives were chosen to be heterogeneous among the existent cooperatives in Portugal. This study corresponds to the first phase of a project that is still underway. This article presents the main results of the content analysis of the data collected from the interviews. Data show cooperatives could promptly adapt and continue their mission under pressure from the pandemic despite the first difficulties encountered in a new and unknown situation, showing a capacity to adapt and serve their members. However, these members were also submitted to several increasing and new challenges. The adaptations were possible due to legal changes in the work organisation law, from layoff to telework, government support involving financial programs, VAT, and other tax relaxation, as well as due to human resources reorganisation and the cooperatives' staff positive attitude towards the difficulties (both leaders and general workers). Differences between the social solidarity cooperatives under study concerning digital technologies showed that those already having some infrastructure had minor adapting difficulties.

Abstract
In the present-days complex networks modeled on real-world data contain millions of nodes and billions of links. Identifying super spreaders in such an extensive network is a challenging task. Super spreaders are the most important or influential nodes in the network that play the central role during an infection spreading or information diffusion process. Depending on the application, either the most influential node needs to be identified, or a set of initial seed nodes are identified that can maximize the collective influence or the total spread in the network. Many centrality measures have been proposed to rank nodes in a complex network such as 'degree', 'closeness', 'betweenness', 'coreness' or 'k-shell' centrality, among others. All have some kind of inherent limitations. Mixed degree decomposition or m-shell is an improvement over k-shell that yields better ranking. Many researchers have employed single node identification heuristics to select multiple seed nodes by considering top-k nodes from the ranked list. This approach does not results in the optimal seed nodeset due to the considerable overlap in total spreading influence. Influence overlap occurs when multiple nodes from the seed nodeset influence a specific node, and it is counted multiple times during total collective influence computation. In this paper, we exploit the 'node degree', 'closeness' and 'coreness' among the nodes and propose novel heuristic template to rank the super spreaders in a network. We employ k-shell and m-shell as a coreness measure in two variants for a comparative evaluation. We use a geodesic-based constraint (enforcing a minimum distance between seed nodes) to select an initial seed nodeset from that ranked nodes for influence maximization instead of selecting the top-k nodes naively. All models and metrics are updated to avoid overlapping influence during total spread computation. Experimental simulation with the SIR (Susceptible-Infectious-Recovered) spreading model and an evaluation with performance metrics like spreadability, monotonicity of ranking, Kendall's rank correlation on some benchmark real-world networks establish the superiority of the proposed methods and the improved seed node selection technique.