Search

This article is an extension of a work in progress paper originally presented at the conference FiE 2020, Frontiers in Education by (Schirichian et al., 2020), as a result of Schirichian’s master’s in science dissertation. It studies the relations between academic performance, protection factors, life at university, and personal characteristics to understand how they influence students’ academic success in undergraduate engineering programs in Brazil. In this challenging environment, several students overcome these issues and graduate, which indicates that some protection structures allow students to face challenging situations and be successful in their studies. Current research studied the relationships between academic performance, self-efficacy, causal attributions, personal characteristics, and life at university, with a group of 30 students. Models were studied by combining the different variables and aspects evaluated in the research, and the findings show relationship between academic performance and: 1) self-efficacy, causal attributions, and personal characteristics (such as leisure activities, living with their parents, or college accommodations) and those who attended private schools during basic education; 2 protection factors self-efficacy and causal attributions with advancing in the program and the time of enrolment in the university; and 3) the dimensions initiation and persistence, success/internality and failure/internality, indicating that those who perceive themselves as playing a major role in their academic journey tend to have better outcomes. Further results show the influence of social inequalities, particularly for those students who declared themselves brown and who conducted their basic education in public schools (which are generally of lower quality than private ones in Brazil). [ABSTRACT FROM AUTHOR]

Secret sharing schemes allow a dealer to distribute a secret piece of information among several parties such that only qualified subsets of parties can reconstruct the secret. The collection of qualified subsets is called an access structure. The best known example is the k -threshold access structure, where the qualified subsets are those of size at least k . When k=2 and there are n parties, there are schemes for sharing an \ell bits, and this is tight even for secrets of 1 b. In these schemes, the number of parties n must be given in advance to the dealer. In this paper, we consider the case where the set of parties is not known in advance and could potentially be infinite. Our goal is to give the {t} {^{\mathrm{ th}}} party arriving the smallest possible share as a function of t$ . Our main result is such a scheme for the k$ -threshold access structure and 1-bit secrets where the share size of party t$ is . For k=2$ we observe an equivalence to prefix codes and present matching upper and lower bounds of the form \log t + \log \log t + \log \log \log t + O(1)$ . Finally, we show that for any access structure there exists such a secret sharing scheme with shares of size . [ABSTRACT FROM AUTHOR]

Knowledge contribution in virtual communities is an important issue in the field of knowledge management. Based on Ames's theoretical framework on motivation, we propose a model for knowledge contribution in problem-solving virtual communities (PSVCs). The model includes two second-order individual motivations, with four major mechanisms in PSVCs that are associated with these motivations. Results confirm that only egoistic motives affect members' knowledge contribution in PSVCs. Further, knowledge repository and social identity are found to be important mechanisms for promoting knowledge contribution through egoistic motives. This paper concludes with theoretical and practical implications and provides insights for future research. [ABSTRACT FROM PUBLISHER]