Abstract
Current methods for optimization of low-density parity-check (LDPC) codes analyze the degree distribution pair asymptotically as block length approaches infinity. This effectively ignores the discrete nature of the space of valid degree distribution pairs for LDPC codes of finite block length. While large codes are likely to conform reasonably well to the infinite block length analysis, shorter codes have no such guarantee. We present and analyze an algorithm for completely enumerating the space of all valid degree distribution pairs for a given block length, code rate, maximum variable node degree, and maximum check node degree. We then demonstrate this algorithm on an example LDPC code of finite block length. Finally, we discuss how the result of this algorithm can be utilized by discrete optimization routines to form novel methods for the optimization of small block length LDPC codes.

Abstract
Due to the pervasiveness of Interconnected devices, large amounts of heterogeneous data types are being continuously collected. Regardless of the benefits that come from sharing data, exposing sensitive and private information arises serious privacy concerns. To prevent unwanted disclosures and, hence, to protect users' privacy, several privacy-preserving mechanisms have been proposed. However, the data heterogeneity and the inherent correlations among the different data types have been disregarded when developing such mechanisms. Our goal is to develop privacy-preserving mechanisms that are suitable for data heterogeneity and data correlation. These aspects will also be considered to develop mechanisms to achieve private learning. © 2021 Owner/Author.

Abstract
Byzantine fault tolerant (BFT) protocols are designed to increase system dependability and security. They guarantee liveness and correctness even in the presence of arbitrary faults. However, testing and validating BFT systems is not an easy task. As is the case for most concurrent and distributed applications, the correctness of these systems is not solely dependant on algorithm and protocol correctness. Ensuring the correct behaviour of BFT systems requires exhaustive testing under real-world scenarios. An approach is to use fault injection tools that deliberate introduce faults into a target system to observe its behaviour. However, existing tools tend to be designed for specific applications and systems, thus cannot be used generically. We argue that more advanced and powerful tools and frameworks are needed for testing the security and safety of distributed applications in general, and BFT systems in particular. Specifically, a fault injection framework that can be integrated into both client and server side applications, for testing them exhaustively. We present ZERMIA, a modular and extensible fault injection framework, designed for testing and validating concurrent and distributed applications. We validate ZERMIA’s principles by conduction a series of experiments on a distributed applications and a state of the art BFT library, to show the benefits of ZERMIA for testing and validating applications. © 2021, Springer Nature Switzerland AG.

Abstract
Grade prediction has been for a long time a subject that interests both teachers and researchers. Before the digital age this type of predictions was something nearly impossible to achieve. With the increasing integration of Learning Management Systems in education, grade prediction seems to have become a viable option. The general adoption of this type of systems brings to the research area a database known as “registry”, or more simply known as logged data. Using this new source of information several attempts regarding the prediction of student grades have been proposed. The methodology proposed in this study is capable of, analyzing student online behavior, using the information collected by the Moodle system and making a prediction on what the final grade of the student will be, at any point in the semester. Our novel approach uses the gathered information to examine the academic path of the student in order to determine an interaction pattern, then it tries to establish a link with other, present or past, known successful paths. Making this comparison, the model can automatically determine if a student is going to fail or pass the course, which then would leave a space for the teacher or the student to circumvent the situation. Our results show that the system is not only viable, as it is also robust to make prediction at an early stage in the course.

Abstract
Social networks have provided the means for constant connectivity and fast information dissemination. In addition, real-time posting allows a new form of citizen journalism, where users can report events from a witness perspective. Therefore, information propagates through the network at a faster pace than traditional media reports it. However, relevant information is a small percentage of all the content shared. Our goal is to develop and evaluate models that can automatically detect journalistic relevance. To do it, we need solid and reliable ground truth data with a significantly large quantity of annotated posts, so that the models can learn to detect relevance over all the spectrum. In this article, we present and confront two different methodologies: an automatic and a human approach. Results on a test data set labelled by experts' show that the models trained with automatic methodology tend to perform better in contrast to the ones trained using human annotated data.

Abstract
In this article we discuss how social tagging can be used to improve the methodology used for clustering evaluation. We analyze the impact of the integration of tags in the clustering process and its effectiveness. Following the semiotic theory, the own nature of tags allows the reflection of which ones should be considered depending on the interpretant (community of users, or tag writer). Using a case with the community of users as the interpretant, our novel clustering algorithm (k-C), which is based on community detection on a network of tags, was compared with the standard k-means algorithm. The results indicate that the k-C algorithm created more effective clusters. © 2020, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG.