Use of partial least squares structural equation modelling (PLS-SEM) in privacy and disclosure research on social network sites: A systematic review

Structural equation modelling (SEM) is a statistical technique used in the field of Information Systems amongst others. The technique has been paid attention thanks to its flexibility and predictive power. However, there is a paucity of guidelines in the application of the technique in the field of Behavioural Information Security. Hence, this paper aims to provide a comprehensive guide of using PLS-SEM in disclosure and privacy studies on Social Network Sites (SNSs). Data has been gathered using papers (n=21) published between 2006 and 2022 from scholarly databases such as Google Scholar, Association for Information Systems eLibrary (AISeL), IEEE Xplore and Science Direct. The Preferred Reporting Items for Systematic reviews and Meta-Analyses (PRISMA 2020) was used to analyse and synthesize the status of the field. Our systematic review covers data characteristics, reasons for using PLS-SEM, the evaluation of measurement models, the evaluation of the structural model and reporting best practices. The review proposed guidelines for the use of PLS-SEM in the discipline of Behavioural Information Security with a focus on disclosure and privacy on SNSs studies and other fields as well

Mise en oeuvre de tests unitaires dans un contexte de programmation eXtrème répartie

International audienceeXtreme Programming (XP) is a methodology based on principles and practices for quickly developing software. However this approach requires the programmers to be co-located. Many research projects investigate how to extend XP to a distributed environment. However the challenge is to carry out the XP approach without conflicting with the distributed constraints. Our work takes place in this way. More precisely, we propose an extension based on assistance for supporting distributed unit testing, one of the key principles of XP methodology.La programmation eXtrème dite XP (eXtreme Programming) est une méthodologie efficace de développement rapide de logiciels qui exige que les membres d'une équipe de développeurs soient physiquement proches les uns des autres. Des travaux de recherche tentent d'étendre les principes de cette méthodologie à un contexte réparti. Le défi est alors de préserver les qualités fondamentales de l'approche tout en s'affranchissant de la contrainte de proximité physique des développeurs. Notre travail s'inscrit dans cette logique. De façon plus précise, nous proposons de fonder cette extension de XP à un environnement réparti sur l'assistance à la réalisation des tests unitaires, pierre angulaire de la méthodologie XP

Mise en oeuvre de tests unitaires dans un contexte de programmation eXtrème répartie

eXtreme Programming (XP) is a methodology based on principles and practices for quickly developing software. However this approach requires the programmers to be co-located. Many research projects investigate how to extend XP to a distributed environment. However the challenge is to carry out the XP approach without conflicting with the distributed constraints. Our work takes place in this way. More precisely, we propose an extension based on assistance for supporting distributed unit testing, one of the key principles of XP methodology.La programmation eXtrème dite XP (eXtreme Programming) est une méthodologie efficace de développement rapide de logiciels qui exige que les membres d'une équipe de développeurs soient physiquement proches les uns des autres. Des travaux de recherche tentent d'étendre les principes de cette méthodologie à un contexte réparti. Le défi est alors de préserver les qualités fondamentales de l'approche tout en s'affranchissant de la contrainte de proximité physique des développeurs. Notre travail s'inscrit dans cette logique. De façon plus précise, nous proposons de fonder cette extension de XP à un environnement réparti sur l'assistance à la réalisation des tests unitaires, pierre angulaire de la méthodologie XP

Tree reconfiguration without lightpath interruption in WDM optical networks

International audienceEfficient reconfiguration of optical multicast trees in wavelength division multiplexing (WDM) networks is required. Multimedia applications which consume a huge bandwidth, require multicasting. So, multicast concept is extended to optical networks to improve performance. Today, networks are facing many phenomena such as changes in the traffic model, failures, additions or deletions of some network resources due to a maintenance operation. To cope with these phenomena, network operators compute new topology according to the applications requirements. Some real-time multicast applications are not indulgent with lightpath interruptions. So the configuration of the network must be done as quickly as possible to be spontaneously deal with the problem before other events appear and without connection interruption. To the best of our knowledge, there is no work in the literature that considers the reconfiguration of an optical multicast tree to another one without connection interruption. We prove that it is impossible to reconfigure any initial tree into any final tree using only one wavelength and without connection interruption. We propose in this paper BpBAR_2 method, using several wavelengths to reconfigure optical WDM network. This algorithm does tree reconfiguration without lightpath interruption, reduce the reconfiguration setup time and the cost of wavelengths used

Tree Reconfiguration without Lightpath Interruption in Wavelength Division Multiplexing Optical Networks with Limited Resources

International audienceToday, operators use reconfiguration to improve the performance of connection oriented networks. In our previous work, we studied tree reconfiguration without data flow interruption in wavelength division multiplexing optical networks. In our previous approach, the available resources of the network (wavelengths) are not considered as limited. In this work, we study tree reconfiguration in a network which has a limited number of wavelengths per link. This paper proposes an algorithm called TRwRC (Tree reconfiguration with resources constraint). TRwRC reconfigures a tree without data flow interruption in a network with a limited number of wavelengths