Search

The gig economy and gig work have grown quickly in recent years and have drawn much attention from researchers in different fields. Because the platform mediated gig economy is a relatively new phenomenon, studies have produced a range of interesting findings; of interest here are the socio‐technical issues that this work has surfaced. This systematic literature review (SLR) provides a snapshot of a range of socio‐technical issues raised in the last 12 years of literature focused on the platform mediated gig economy. Based on a sample of 515 papers gathered from nine databases in multiple disciplines, 132 were coded that specifically studied the gig economy, gig work, and gig workers. Three main socio‐technical themes were identified: (1) the digital workplace, which includes information infrastructure and digital labor that are related to the nature of gig work and the user agency; (2) algorithmic management, which includes platform governance, performance management, information asymmetry, power asymmetry, and system manipulation, relying on a diverse set of technological tools including algorithms and big data analytics; (3) ethical design, as a relevant value set that gig workers expect from the platform, which includes trust, fairness, equality, privacy, and transparency. A social informatics perspective is used to rethink the relationship between gig workers and platforms, extract the socio‐technical issues noted in prior research, and discuss the underexplored aspects of the platform mediated gig economy. The results draw attention to understudied yet critically important socio‐technical issues in the gig economy that suggest short‐ and long‐term opportunities for future research directions. [ABSTRACT FROM AUTHOR]

Methods to rank documents in large-scale citation data are increasingly assessed in terms of their ability to identify small sets of expert-selected papers. Here, we propose an algorithm for the accurate identification of milestone papers from citation networks. The algorithm combines an influence propagation process with game theory concepts. It outperforms state-of-the-art metrics in the identification of milestone papers in aggregate citation network data, while potentially mitigating the ranking's temporal bias compared with metrics that have similar milestone identification performance. The proposed method sheds light on the interplay between ranking accuracy and temporal bias. • We transform citation networks into influence propagation networks by reversing the citation relationships. • We propose a novel diffusion-based metric for ranking papers, combining influence propagation and game theory. • Experiments on APS and DBLP datasets demonstrate the effectiveness of our metric in identifying milestone papers. [ABSTRACT FROM AUTHOR]

This research highlights the underestimated significance of cigarette paper as evidence at crime scenes. The primary objective is to distinguish cigarette paper from similar-looking alternatives, addressing the first research objective. The second objective involves identifying cigarette paper brands using attenuated total reflectance Fourier transform infrared (ATR-FTIR) spectroscopy and machine learning (ML) algorithms. Accurate differentiation of cigarette paper from normal paper is emphasized. ATR-FTIR spectroscopy, coupled with principal component analysis (PCA) for dimensionality reduction, is employed for brand identification. Among fifteen ML algorithms compared, the CatBoost classifier excels for both objectives. This research presents a non-destructive, effective method for studying cigarette paper, contributing valuable insights to crime scene investigations. [Display omitted] • Forensic evaluation of cigarette paper utilizing ATR-FTIR spectroscopy and Machine learning algorithms. • Peak characterization and differentiation-distinguishing cigarette paper from other types. • Machine learning algorithm comparison: assessing discrimination across nine cigarette brands. • External validation of the dominant algorithm using unknown samples. [ABSTRACT FROM AUTHOR]

Over the years the number of research publications per year is growing exponentially. Finding research papers of quality from the massive literature of relevant articles is a challenging and time-consuming task. The approaches in the latest literature address citation recommendation by utilizing large bibliographic information and use machine learning and deep learning methods for the task. These techniques clearly require a large amount of training data as well as machines with high processing power. To overcome these issues, we propose a novel method by modifying the popular hyperlink induced topic search (HITS), a web page ranking algorithm, as citation recommendation using hyperlink induced topic search (CR-HITS) that works on a directed and weighted heterogeneous bibliographic network containing diverse types of nodes and edges. We define effective scoring schemes for nodes and edges based on basic bibliographic information like citations of papers, number of publications of an author, etc. Given a few seed papers, the citation recommendation algorithm CR-HITS is run on small neighborhoods of the seed papers and hence the time taken by the execution is very small to yield the final recommendations. To the best of our knowledge, HITS has been used for the first time for the citation recommendation problem. We perform extensive experimentation on DBLP (version-11) and ACM (version-9) datasets and compare the results with many baseline methods in terms of MAP, MRR, and recall@N measures. The performance of the proposed algorithms is superior with respect to the MAP metric and matches the second best for the other two metrics. Since the top two algorithms use deep learning methods and use much larger bibliographic information including abstracts of the papers, we claim that our approach utilizes very low resources, yet yields recommendations that are very close to the top recommendations. [ABSTRACT FROM AUTHOR]

Detecting plagiarism in academic papers is crucial for maintaining academic integrity, preserving the originality of published work, and safeguarding intellectual property. While existing applications excel at text plagiarism detection, they fall short when it comes to image plagiarism. This paper introduces a novel algorithm, named "VIBRANT-WALK," designed to detect image plagiarism in academic manuscripts. The challenge of identifying plagiarized images is formidable, requiring a unique approach. Traditional Computer Vision algorithms, proficient in image similarity tasks, face limitations in determining whether an image has been previously used in an article. To address this, the proposed algorithm leverages a repository of all published article pages, focusing on absolute identicality rather than image similarity. The algorithm comprises two stages. In the first stage, a "Vibrancy Matrix" is created through image preprocessing, aiding in contour determination. The second stage involves pixel-by-pixel comparison with images from published manuscripts. To enhance efficiency, the algorithm initiates comparisons from the pixel with the highest score in the Vibrancy Matrix, followed by pixel comparisons through random walks, significantly reducing complexity. To conduct the study, a custom dataset was compiled from 69 research articles, capturing snapshots of each page and figure. Overall, we present 485 unique test cases where we can test the accuracy and efficiency of the algorithm. The lack of publicly available datasets necessitated this approach. The proposed algorithm outperformed the existing models and algorithms in this field by achieving an overall accuracy of 94.8% on the collated dataset, identifying 460 instances of plagiarism out of the 485 test cases. The algorithm also demonstrated a 100% accuracy rate in avoiding false positives. [ABSTRACT FROM AUTHOR]

With the exponential growth in the number of academic researchers, it is crucial for editors of scientific journals to identify the highest-quality papers. While several measures exist to evaluate a paper's impact post-publication, the challenge of determining the potential impact of a manuscript during the review process remains an understudied issue. In this paper, we propose a reviewer-reputation ranking algorithm to identify high-quality papers based on paper citations, where a reviewer's reputation is computed from the correlation between their past ratings and the current number of citations received by the papers they have evaluated. During the review process, reviewers with high reputation scores are given more weight to determine the quality of papers. We test the algorithm on an artificial network with 200 reviewers and 600 papers, as well as on the American Physical Society (APS) data set, including in the analysis 308,243 papers and 274,154 mutual citations. We compare our approach with two existing methods, demonstrating that our algorithm significantly outperforms the others in identifying manuscripts with the highest quality. Our findings can help improve the impact of scientific journals, thereby contributing to academic and scientific progress. • We propose an algorithm to identify the papers with the highest quality from a large number of submissions. • We compare our new algorithm with other existing methods of aggregating user ratings in various online services. • We test our algorithm both with an artificial network and with the empirical data of the APS data set. • We show that our algorithm outperforms the other methods in identifying the papers with the highest quality. [ABSTRACT FROM AUTHOR]

Firstly, this paper analyzes the role of AI in the reading management of English language and literature, establishes the implicit knowledge base of neural network, designs the auxiliary reading system for learning English language and literature, and optimizes the English language and literature management model of AI. The experimental results show that its reading efficiency is increased by 0.48%, and the performance of the credibility model is improved by 0.53% compared with the original system, which greatly optimizes the running time of the system. To some extent, it helps users to manage their time in English language and literature reading, and greatly improves users' reading efficiency and quality. Based on this advantage of AI algorithm, this paper introduces that the algorithm optimizes the reading management model and the training process of neural grid, and constructs a model of English language and literature assisted reading system based on AI. The system can better meet the needs of users in English language and literature reading management.

In this paper, we continue describing the project and the experimentation of "Ricerca Operativa Applicazioni Reali" (ROAR; in English, Real Applications of Operations Research), a three-year project for higher secondary schools, introduced. ROAR is composed of three teaching units, addressed to Grades 10, 11, and 12, respectively, having the main aim to improve students' interest, motivation, and skills related to Science, Technology, Engineering, and Mathematics disciplines by integrating mathematics and computer science through operations research. In a previous paper, we reported on the design and implementation of the first unit, started in Spring 2021 at the scientific high school IIS Antonietti in Iseo (Brescia, Italy), in a Grade-10 class. Here, we focus on the second unit, carried out in Winter/Spring 2022 with the same students, now in a Grade-11 class. In particular, we describe objectives, prerequisites, topics and methods, the organization of the lectures, digital technologies used, and a challenging final project. Moreover, we analyze the feedback from students and teachers involved in the experimentation.

The innovation capability largely determines the initiative for future development of a region. Higher school is the main position for training innovative talents. Accurate and comprehensive assessment of innovation cultivation capability is an important basis of higher schools for continuous improvement. Thus, this paper focuses on assessing innovative talent cultivation capability. First, by CIPP model (Context, Input, Process and Product Evaluation), an assessment indicator system is built, consisting of 89 indicators in 21 categories. Then, based on indicator characteristics, this paper uses public data statistics, database retrieving, student survey, teacher survey, support personnel and expert investigation, to collect indicator values. After this, by a powerful machine learning algorithm, gradient Boosting regression tree, a capability assessment model is established. And based on collected data, established model is compared with several regression models in innovative talent cultivation capability assessing. Results confirm the performance superiority of our solution.

Systematic reviews and meta-analyses are crucial for advancing research, yet they are time-consuming and resource-demanding. Although machine learning and natural language processing algorithms may reduce this time and these resources, their performance has not been tested in education and educational psychology, and there is a lack of clear information on when researchers should stop the reviewing process. In this study, we conducted a retrospective screening simulation using 27 systematic reviews in education and educational psychology. We evaluated the sensitivity, specificity, and estimated time savings of several learning algorithms and heuristic stopping criteria. The results showed, on average, a 58% (SD = 19%) reduction in the screening workload of irrelevant records when using learning algorithms for abstract screening and an estimated time savings of 1.66 days (SD = 1.80). The learning algorithm random forests with sentence bidirectional encoder representations from transformers outperformed other algorithms. This finding emphasizes the importance of incorporating semantic and contextual information during feature extraction and modeling in the screening process. Furthermore, we found that 95% of all relevant abstracts within a given dataset can be retrieved using heuristic stopping rules. Specifically, an approach that stops the screening process after classifying 20% of records and consecutively classifying 5% of irrelevant papers yielded the most significant gains in terms of specificity (M = 42%, SD = 28%). However, the performance of the heuristic stopping criteria depended on the learning algorithm used and the length and proportion of relevant papers in an abstract collection. Our study provides empirical evidence on the performance of machine learning screening algorithms for abstract screening in systematic reviews in education and educational psychology.

Purpose: This paper aims to center the experiences of three cohorts (n = 40) of Black high school students who participated in a critical race technology course that exposed anti-blackness as the organizing logic and default setting of digital and artificially intelligent technology. This paper centers the voices, experiences and technological innovations of the students, and in doing so, introduces a new type of digital literacy: critical race algorithmic literacy. Design/methodology/approach: Data for this study include student interviews (called "talk backs"), journal reflections and final technology presentations. Findings: Broadly, the data suggests that critical race algorithmic literacies prepare Black students to critically read the algorithmic word (e.g. data, code, machine learning models, etc.) so that they can not only resist and survive, but also "rebuild" and "reimagine" the algorithmic world. Originality/value: While critical race media literacy draws upon critical race theory in education - a theorization of race, and a critique of white supremacy and multiculturalism in schools - critical race algorithmic literacy is rooted in critical race technology theory, which is a theorization of blackness as a technology and a critique of algorithmic anti-blackness as the organizing logic of schools and AI systems.

This paper proposes an online learning platform learner DM method based on the improved fuzzy C clustering (FCM) algorithm, constructs a learner feature database, and combines clustering analysis and SPSS statistical methods to statistically summarize the big data of law, thus improving the deficiencies of static and absolute classification of students in the student model. In the experiment paper, the improved algorithm is implemented and the experimental data is analyzed. The results show that the learner behavior feature extraction model in this paper has fewer errors and higher recall rate. Compared with the traditional CF algorithm, the error rate is reduced by 19.64% and the recall rate is increased by 22.85%. This study provides better targeted teaching programs and case resources for legal case teaching and promotes the innovation of legal case teaching mode.

The application of computer technology has revolutionized and promoted the traditional mode of piano teaching. Nowadays, many companies and institutions have begun to apply computer technology to online piano teaching. This paper analyzes the difficulties faced by students in piano teaching and the development of piano assistant practice and summarizes the demands of parents, teachers, students, and principals for online piano teaching system. Based on this, this paper designs and implements an online piano teaching system without special hardware. This system improves the existing maximum logarithm MPa algorithm and improves the detection performance while keeping the complexity low. Combined with the special structure of parallel projection, a generalized automaton model of hybrid system is proposed, and five elements are used to describe the continuous and discrete behaviors in the hybrid subsystem. It not only keeps the advantage of low complexity of the original Max log MPa algorithm, but also obtains better detection performance.

Modern e-learning system is a representative service form in innovative service industry. This paper designs a personalized service domain system, optimizes various parameters and can be applied to different education quality evaluation, and proposes a decision tree recommendation algorithm. Information gain is carried out through many existing principles of improved decision tree algorithm, and the information gain of the algorithm determines the inheritance of information. The process of modern e-learning system is based on personalized teaching and humanized intelligent interaction. This paper theoretically analyzes the improvement performance of the existing e-learning system in teaching quality evaluation and shows a good classification effect. This model provides reference materials for the expansion of education and teaching and provides a feasible practical model for personalized teaching in online schools. The authors provide good educational conditions and environment for students and cultivate all-around talents for the society.

As the cradle of cultivating talents, universities are facing great opportunities and challenges in their education. Among them, IPE (ideological and political education), as an important foundation for the future growth of university students, is of great significance. This paper discusses the relationship between IPE and psychological fitness education in university teaching. This paper expounds the necessity and feasibility of playing the role of psychological fitness education in IPECU (ideological and political education in colleges and universities). Based on this, this paper gives the strategy of infiltrating psychological fitness education into IPE. This paper combines NN (neural network) method to construct an assessment model of IPE quality. In this paper, MATLAB is used for simulation and comparative analysis. The final experiment shows that the RMSE of this algorithm is 0.512, MAE is 1.089, and the accuracy of the algorithm is 0.958.

This study explores the transformative potential of Generative AI (GenAI) and ChatBots in educational interaction, communication, and the broader implications of human-GenAI collaboration. By examining the related literature through data mining and analytical methods, the paper identifies three main research themes: the revolutionary role of GenAI-powered ChatBots in educational interactions, their capability to enrich social learning, and their dual role as both support and assistance within educational settings. This research further highlights the impact of human-GenAI interaction in education from social, psychological, and cultural perspectives, focusing on social presence as a fundamental component of the teaching and learning process. It discusses the integration of GenAI and ChatBots into education and considers whether this marks the dawn of an algorithmic renaissance that elevates educational experiences or an apocalypse that threatens the very essence of human learning and interaction.

Predictive student models are increasingly used in learning environments due to their ability to enhance educational outcomes and support stakeholders in making informed decisions. However, predictive models can be biased and produce unfair outcomes, leading to potential discrimination against certain individuals and harmful long-term implications. This has prompted research on fairness metrics meant to capture and quantify such biases. Nonetheless, current metrics primarily focus on predictive performance comparisons between groups, without considering the behavior of the models or the severity of the biases in the outcomes. To address this gap, we proposed a novel metric in a previous work (Verger et al., 2023) named "Model Absolute Density Distance" (MADD), measuring algorithmic unfairness as the difference of the probability distributions of the model's outcomes. In this paper, we extended our previous work with two major additions. Firstly, we provided theoretical and practical considerations on a hyperparameter of MADD, named "bandwidth," useful for optimal measurement of fairness with this metric. Secondly, we demonstrated how MADD can be used not only to measure unfairness but also to mitigate it through postprocessing of the model's outcomes while preserving its accuracy. We experimented with our approach on the same task of predicting student success in online courses as our previous work, and obtained successful results. To facilitate replication and future usages of MADD in different contexts, we developed an open-source Python package called maddlib (https://pypi.org/project/maddlib/). Altogether, our work contributes to advancing the research on fair student models in education.

In this paper, we present an extended evaluation of a course recommender system designed to support students who struggle in the first semesters of their studies and are at risk of dropping out. The system, which was developed in earlier work using a student-centered design, is based on the explainable k-nearest neighbor algorithm and recommends a set of courses that have been passed by the majority of successful neighbors, that is, students who graduated from the study program. In terms of the number of recommended courses, we found a discrepancy between the number of courses that struggling students are recommended to take and the actual number of courses they take. This indicates that there may be an alternative path that these students could consider. However, the recommended courses align well with the courses taken by students who successfully graduated. This suggests that even students who are performing well could still benefit from the course recommender system designed for at-risk students. In the present work, we investigate a second type of success--a specific minimum number of courses passed--and compare the results with our first approach from previous work. With the second type, the information about success might be already available after one semester instead of after graduation which allows faster growth of the database and faster response to curricular changes. The evaluation of three different study programs in terms of dropout risk reduction and recommendation quality suggests that course recommendations based on students passing at least three courses in the following semester can be an alternative to guide students on a successful path.

The impact of text length on the estimation of lexical diversity has captured the attention of the scientific community for more than a century. Numerous indices have been proposed, and many studies have been conducted to evaluate them, but the problem remains. This methodological review provides a critical analysis not only of the most commonly used indices in language learning studies, but also of the length problem itself, as well as of the methodology for evaluating the proposed solutions. Analysis of three data sets of texts produced by English language learners revealed that indices that reduce all texts to the same length using a probabilistic or an algorithmic approach solve the length-dependency problem; however, all these indices failed to address the second problem, which is their sensitivity to the parameter that determines the length to which the texts are reduced. The paper concludes with recommendations for optimizing lexical diversity analysis.

The estimation of RxC ecological inference contingency tables from aggregate data is one of the most salient and challenging problems in the field of quantitative social sciences, with major solutions proposed from both the ecological regression and the mathematical programming frameworks. In recent decades, there has been a drive to find solutions stemming from the former, with the latter being less active. From the mathematical programming framework, this paper suggests a new direction for tackling this problem. For the first time in the literature, a procedure based on linear programming is proposed to attain estimates of local contingency tables. Based on this and the homogeneity hypothesis, we suggest two new ecological inference algorithms. These two new algorithms represent an important step forward in the ecological inference mathematical programming literature. In addition to generating estimates for local ecological inference contingency tables and amending the tendency to produce extreme transfer probability estimates previously observed in other mathematical programming procedures, these two new algorithms prove to be quite competitive and more accurate than the current linear programming baseline algorithm. Their accuracy is assessed using a unique dataset with almost 500 elections, where the real transfer matrices are known, and their sensitivity to assumptions and limitations are gauged through an extensive simulation study. The new algorithms place the linear programming approach once again in a prominent position in the ecological inference toolkit. Interested readers can use these new algorithms easily with the aid of the R package lphom.

Artificial intelligence (AI) has the potential to positively impact library and archives collections and services--enhancing reference, instruction, metadata creation, recommendations, and more. However, AI also has ethical implications. This paper presents an extensive literature and review analysis that examines AI projects implemented in library and archives settings, asking the following research questions: RQ1: How is artificial intelligence being used in libraries and archives practice? RQ2: What ethical concerns are being identified and addressed during AI implementation in libraries and archives? The results of this literature review show that AI implementation is growing in libraries and archives and that practitioners are using AI for increasingly varied purposes. We found that AI implementation was most common in large, academic libraries. Materials used in AI projects usually involved digitized and born digital text and images, though materials also ranged to include web archives, electronic theses and dissertations (ETDs), and maps. AI was most often used for metadata extraction and reference and research services. Just over half of the papers included in the literature review mentioned ethics or values related issues in their discussions of AI implementation in libraries and archives, and only one-third of all resources discussed ethical issues beyond technical issues of accuracy and human-in-the-loop. Case studies relating to AI in libraries and archives are on the rise, and we expect subsequent discussions of relevant ethics and values to follow suit, particularly growing in the areas of cost considerations, transparency, reliability, policy and guidelines, bias, social justice, user communities, privacy, consent, accessibility, and access. As AI comes into more common usage, it will benefit the library and archives professions to not only consider ethics when implementing local projects, but to publicly discuss these ethical considerations in shared documentation and publications. [ABSTRACT FROM AUTHOR]

The use of algorithms and automation of public services is not new, but in recent years there has been a step change in processing power and a decrease in the price of these technologies, which means we are seeing more widespread use. These advances are reframing our perception of what matters in ways that impact the ethical dimensions of day-to-day life. In turn, these changes challenge long-standing assumptions about public service ethics and how it is taught. In this multidisciplinary authored paper, we argue that public service leaders must be attentive to ethical questions that converge around adopting "data-driven" techniques, including algorithmic decision-making. Algorithmic and technology focused ethics question assumptions about the current deficits within public service ethics pedagogy in public service programs and university programs and the future direction of the discipline. To do so raises longstanding but neglected questions about the public services' role in the state and recovering what Rohr refers to as the 'ethics of the office.' This, we argue, will have implications for teaching public service ethics.

Simulation is a powerful approach that plays a significant role in science and technology. Computational models that simulate learner interactions and data hold great promise for educational technology as well. Amongst others, simulated learners can be used for teacher training, for generating and evaluating hypotheses on human learning, for developing adaptive learning algorithms, for building virtual worlds in which students can practice collaboration skills with simulated pals, and for testing learning environments. This paper provides the first systematic literature review on simulated learners in the broad area of artificial intelligence in education and related fields, focusing on the decade 2010-19. We analyze the trends regarding the use of simulated learners in educational technology within this decade, the purposes for which simulated learners are being used, and how the validity of the simulated learners is assessed. We find that simulated learner models tend to represent only narrow aspects of student learning. And, surprisingly, we also find that almost half of the studies using simulated learners do not provide "any" evidence that their modeling addresses the most fundamental question in simulation design -- is the model valid? This poses a threat to the reliability of results that are based on these models. Based on our findings, we propose that future research should focus on developing more complete simulated learner models. To validate these models, we suggest a standard and universal criterion, which is based on the lasting idea of Turing's Test. We discuss the properties of this test and its potential to move the field of simulated learners forward.

Interpreting a seemingly simple function word like "or," "behind," or "more" can require logical, numerical, and relational reasoning. How are such words learned by children? Prior acquisition theories have often relied on positing a foundation of innate knowledge. Yet recent neural-network-based visual question answering models apparently can learn to use function words as part of answering questions about complex visual scenes. In this paper, we study what these models learn about function words, in the hope of better understanding how the meanings of these words can be learned by both models and children. We show that recurrent models trained on visually grounded language learn gradient semantics for function words requiring spatial and numerical reasoning. Furthermore, we find that these models can learn the meanings of logical connectives and and or without any prior knowledge of logical reasoning as well as early evidence that they are sensitive to alternative expressions when interpreting language. Finally, we show that word learning difficulty is dependent on the frequency of models' input. Our findings offer proof-of-concept evidence that it is possible to learn the nuanced interpretations of function words in a visually grounded context by using non-symbolic general statistical learning algorithms, without any prior knowledge of linguistic meaning.

Literature screening is the process of identifying all relevant records from a pool of candidate paper records in systematic review, meta-analysis, and other research synthesis tasks. This process is time consuming, expensive, and prone to human error. Screening prioritization methods attempt to help reviewers identify most relevant records while only screening a proportion of candidate records with high priority. In previous studies, screening prioritization is often referred to as automatic literature screening or automatic literature identification. Numerous screening prioritization methods have been proposed in recent years. However, there is a lack of screening prioritization methods with reliable performance. Our objective is to develop a screening prioritization algorithm with reliable performance for practical use, for example, an algorithm that guarantees an 80% chance of identifying at least 80% of the relevant records. Based on a target-based method proposed in Cormack and Grossman, we propose a screening prioritization algorithm using sampling with replacement. The algorithm is a wrapper algorithm that can work with any current screening prioritization algorithm to guarantee the performance. We prove, with mathematics and probability theory, that the algorithm guarantees the performance. We also run numeric experiments to test the performance of our algorithm when applied in practice. The numeric experiment results show this algorithm achieve reliable performance under different circumstances. The proposed screening prioritization algorithm can be reliably used in real world research synthesis tasks.

In 3D building models, a large number of texture maps with different sizes increase the number of model data loading and drawing batches, which greatly reduces the drawing efficiency of the model. Therefore, this paper proposes a texture set mapping method based on vertex importance. Firstly, based on the 2D space boxing algorithm, the texture maps are merged and a series of Mipmap texture maps are generated, and then the vertex curvature, texture variability and location information of each vertex are calculated, normalized, and weighted to get the importance of each vertex, and then finally, different Mipmap-level textures are remapped according to the importance of the vertices. The experiment proves that the algorithm in this paper can reduce the amount of texture data on the one hand, and avoid the rendering pressure brought by the still large amount of data after merging on the other hand, so as to improve the rendering efficiency of the model. [ABSTRACT FROM AUTHOR]

We have developed a "Kirameki display" that can represent a real texture of materials. ("Kirameki" means a shining/glittering sense in Japanese.) In addition, we have investigated an improvement of "texture representation" by optimization of both an optical design and a software algorithm. Lastly, we discuss the future technical fields for texture representation on displays. [ABSTRACT FROM AUTHOR]

Technology Enabled Learning (TEL) has a major impact on the learning adaptability of the learners. During the COVID-19 pandemic, there has been a drastic change in the learning methodology. The adaptability of learners from the various domains, levels and age has been a significant component of research in context to education. In this paper, the authors have proposed a machine learning and explainable AI based solution to identify critical learning parameters for students' adaptability level in online education. In this research the authors have employed various explainable AI (XAI) algorithms namely Local Interpretable Model-agnostic Explanations (LIME), SHapley Additive exPlanations (SHAP), FEature iMportance based eXplanable AI algorithm (FAMeX) for identifying the critical learning parameters to decide the adaptability level of a student. To test the efficacy of the solution, a dataset of students of several education levels of Bangladesh, collected from both online and offline surveys has been used. The results revealed are quite interesting, and counter intuitive.

The AUD2IT-algorithm is a tool to structure the data, which is collected during an emergency treatment. The goal is on the one hand to structure the documentation of the data and on the other hand to give a standardised data structure for the report during handover of an emergency patient. AUD2IT-algorithm was developed to provide residents a documentation aid, which helps to structure the medical reports without getting lost in unimportant details or forgetting important information. The sequence of anamnesis, clinical examination, considering a differential diagnosis, technical diagnostics, interpretation and therapy is rather an academic classification than a description of the real workflow. In a real setting, most of these steps take place simultaneously. Therefore, the application of the AUD2IT-algorithm should also be carried out according to the real processes. A big advantage of the AUD2IT-algorithm is that it can be used as a structure for the entire treatment process and also is entirely usable as a handover protocol within this process to make sure, that the existing state of knowledge is ensured at each point of a team-timeout. PR-E-(AUD2IT)-algorithm makes it possible to document a treatment process that, in principle, does not have to be limited to the field of emergency medicine. Also, in the outpatient treatment the PR-E-(AUD2IT)-algorithm could be used and further developed. One example could be the preparation and allocation of needed resources at the general practitioner. The algorithm is a standardised tool that can be used by healthcare professionals of any level of training. It gives the user a sense of security in their daily work. [ABSTRACT FROM AUTHOR]

In today's world, where data and information are increasingly proliferating, text summarization and technologies play a critical role in making large amounts of text data more accessible and meaningful. In business, the news industry, academic research, and many other fields, text summarization helps make quick decisions, access information faster, and manage resources more effectively. Additionally, text summarization research is conducted to further improve these technologies and develop new methods and algorithms to provide better summarization of texts. Therefore, text summarization and research in this field are of great importance in the information age. In this study, a new operating model for text summarization that can be applied to different algorithms is proposed and evaluated. Sixteen summarization algorithms covering six approaches (statistical, graph-based, content-based, pointer-based, position-based, and user-oriented) were implemented and tested on 50 different full-text article datasets. Four evaluation criteria (BLEU, Rouge-N, Rouge-L, METEOR) were used to assess the similarity between the generated summaries and the original summaries. The performance of the algorithms within each approach was averaged and the overall best-performing algorithm was selected. This best algorithm was subjected to further analysis through Topic Modelling and Keyword Extraction to identify key topics and keywords within the summarised text. The proposed model provides a standardized workflow for developing and thoroughly testing summarization algorithms across datasets and evaluation metrics to determine the most appropriate summarization approach. This study demonstrates the effectiveness of the model on a variety of algorithm types and text sources. [ABSTRACT FROM AUTHOR]

The technology of automated short answer grading (ASAG) can efficiently process answers according to human-prepared grading examples. Computer-assisted acquisition of grading examples uses a computer algorithm to sample real student responses for potentially good examples. The process is critical for optimizing the grading accuracy of machine learning models given a budget of human effort and the appeal of ASAG to online learning providers. This paper presents a novel method called short answer grading with active learning (SAGAL) that features a unified formulation comprising the heuristics for identifying potentially optimal examples of representative answers, borderline answers, and anomalous answers. The method is based on active learning, which iteratively samples good examples and queries for annotation to increase the sampling accuracy. SAGAL has been evaluated with three different public datasets of distinctive characteristics. The results show that the resulting models generally outperform the baseline semi-supervised learning methods on the same number of grading examples.

Today computing is intricate in all aspects of our lives, beginning with communications and education to banking, information security, health, shopping, and social media. Development of the computing is proportional to the development of software which is becoming a serious part of all daily lives. This paper, therefore, assessed the impact of teaching Computer Programming Language in Tanzanian primary schools. To achieve this, a new tool for teaching and learning a computer programming language was developed. Furthermore, a two-tier approach was adopted where the training started on an algorithm first, then if, loops and case conditionals as the third concept inside the first tier. On the other hand, variables, lists, and functions are hooked on the second tier. Results indicate that students acquired together reasoning learning in a conceptual argument of view and skill performance. Students were able to accomplish the expertise to practice or apply the theories of programming knowledge in programming-connected tasks.

A crucial bottleneck in medical artificial intelligence (AI) is high-quality labeled medical datasets. In this paper, we test a large variety of wisdom of the crowd algorithms to label medical images that were initially classified by individuals recruited through an app-based platform. Individuals classified skin lesions from the International Skin Lesion Challenge 2018 into 7 different categories. There was a large dispersion in the geographical location, experience, training, and performance of the recruited individuals. We tested several wisdom of the crowd algorithms of varying complexity from a simple unweighted average to more complex Bayesian models that account for individual patterns of errors. Using a switchboard analysis, we observe that the best-performing algorithms rely on selecting top performers, weighting decisions by training accuracy, and take into account the task environment. These algorithms far exceed expert performance. We conclude by discussing the implications of these approaches for the development of medical AI.

QR decomposition is widely used for solving the least squares problem. However, existing materials about it may be too abstract for non-mathematicians, especially STEM students, and/or require serious background in linear algebra. The paper describes theoretical background and examples of GNU Octave compatible MATLAB scripts that give relatively simple but complete explanations about how to use QR decomposition for the least squares problem solution. Only basic knowledge of linear algebra and calculus are required. Both Givens rotations and Householder reflections usage for the linear least squares problem were considered. It was shown that the algorithm based on Givens rotations is even easier to program than explicit formation of the normal equations with subsequent usage of Gaussian elimination.

Recently, deep learning has become a pervasive tool in prediction problems for structured and/or unstructured big data in various areas including science and engineering. In particular, deep neural network models (i.e. a basic core model of deep learning) can be viewed as an extension of statistical models by going through the incorporation of hidden layers. In this paper, we study the relationship between both models in terms of model structures and model learning. For this purpose, we also compare the predictive performances of both models, with two practical examples.

Self-regulated learning is an essential skill that can help students plan, monitor, and reflect on their learning in order to achieve their learning goals. However, in situations where there is a lack of effective feedback and recommendations, it becomes challenging for students to self-regulate their learning. In this paper, we propose an explainable AI-based approach to provide automatic and intelligent feedback and recommendations that can support the self-regulation of students' learning in a data-driven manner, with the aim of improving their performance on their courses. Prior studies have predicted students' performance and have used these predicted outcomes as feedback, without explaining the reasons behind the predictions. Our proposed approach is based on an algorithm that explains the root causes behind a decline in student performance, and generates data-driven recommendations for taking appropriate actions. The proposed approach was implemented in the form of a dashboard to support self-regulation by students on a university course, and was evaluated to determine its effects on the students' academic performance. The results revealed that the dashboard significantly enhanced students' learning achievements and improved their self-regulated learning skills. Furthermore, it was found that the recommendations generated by the proposed approach positively affected students' performance and assisted them in self-regulation

Purpose: Course evaluations are formative and are used to evaluate learnings of the students for a course. Anomalies in the evaluation process can lead to a faulty educational outcome. Learning analytics and educational data mining provide a set of techniques that can be conveniently applied to extensive data collected as part of the evaluation process to ensure remedial actions. This study aims to conduct an experimental research to detect anomalies in the evaluation methods. Design/methodology/approach: Experimental research is conducted with scientific approach and design. The researchers categorized anomaly into three categories, namely, an anomaly in criteria assessment, subject anomaly and anomaly in subject marks allocation. The different anomaly detection algorithms are used to educate data through the software R, and the results are summarized in the tables. Findings: The data points occurring in all algorithms are finally detected as an anomaly. The anomaly identifies the data points that deviate from the data set's normal behavior. The subject which is consistently identified as anomalous by the different techniques is marked as an anomaly in evaluation. After identification, one can drill down to more details into the title of anomalies in the evaluation criteria. Originality/value: This paper proposes an analytical model for the course evaluation process and demonstrates the use of actionable analytics to detect anomalies in the evaluation process.

This paper describes Alkaline, a size-reduced version of Kyber, which has recently been announced as a prototype NIST standard for post-quantum public-key cryptography. While not as simple as RSA, I believe that Alkaline can be used in an undergraduate classroom to effectively teach the techniques and principles behind Kyber and post-quantum cryptography in general. Classroom experiences with individual concepts used in Alkaline support this belief. In addition to cryptography, linear algebra and abstract algebra classes would be good candidates for the use of Alkaline. A few exercises suitable for use in these classes are included.

In this paper, several research topics are presented that provide productive avenues of exploration for students in an undergraduate cryptography course. The topics are intended for a variety of skill levels and interests. In some cases, a student might be inspired to try to solve the proposed problem or write computer code. Other topics might motivate them to learn new mathematics or algorithms, or research a historical event or person. In all cases, a short description of the topic is given along with several references that can be used as a starting point for student research. The author also describes some challenges and recommendations when teaching a course where a project is a main component.

The Miller-Rabin test is a useful probabilistic method for finding large primes. In this paper, we explain the method in detail and give three variations on this test. These variations were originally developed as student projects to supplement a course in error correcting codes and cryptography.

The last decade has seen a rise in big data approaches, including in the humanities, whereby large quantities of data are collected and analysed. In this paper, we discuss long-form audio recordings that result from individuals wearing a recording device for many hours. Linguists, psychologists and anthropologists can use them, for example, to study infants' or adults' linguistic behaviour. In the past, recorded individuals and communities have resided in high-income countries (HICs) almost exclusively. Recognising the need for better representation of all cultures and linguistic experiences, researchers have more recently started to collect long-form audio recordings in low- and middle-income countries (LMICs). We aim to help researchers to collect, analyse and use these recordings ethically. To do so, we identify four main ethical challenges linked to research that relies on long-form recordings in LMICs. We provide recommendations to overcome these challenges. These considerations should be useful to researchers employing other big data techniques collected via wearables.

Various studies have been conducted on applying intelligent recognition technology, especially speech recognition technology to improve English learning ability, mostly listening and speaking. However, few studies have touched on how image-to-text recognition technology can be used for writing. The present research was conducted to fill this gap by exploring the optimization of a deep-learning-based image captioning algorithm to facilitate English writing, so as to enable learners to break the time and space limitations and learn English writing (including sentence patterns, spelling, vocabulary, and grammar) anytime and anywhere by taking pictures. Therefore, this paper focused on image captioning based on CNN(Convolutional Neural Networks) and LSTM (Long Short-Term Memory), using DenseNet201 or Vision Transformer trained on the ImageNet-1K image classification dataset as the image encoder and LSTM as the decoder. First, pre-training was performed on the Flickr8k dataset. After selecting the best-trained model as the pre-trained weight model for the COCO dataset, fine-tuning optimization was performed on the COCO dataset, and the attention mechanism was used to design the ablation experiment. The BLEU-4, CIDEr, METEOR, and ROUGE evaluation indexes of the optimized model on the test set were 0.3437,1.121,0.2750, and 0.5117, respectively. The study results showed that the convergence of the model was accelerated and had better performance. The model was used to automatically caption 12 images that had never been used during the training process. The descriptions generated by the optimized image captioning algorithm have lexical and syntactic accuracy, and matched what the images expressed, showing that this improved algorithm could be used as a learning tool to help English learners improve lexical and syntactic acquisition to promote writing through the generated descriptions of the pictures taken anytime and anywhere in real-life situations.

In this paper, we develop a mixed stochastic approximation expectation-maximization (MSAEM) algorithm coupled with a Gibbs sampler to compute the marginalized maximum a posteriori estimate (MMAPE) of a confirmatory multidimensional four-parameter normal ogive (M4PNO) model. The proposed MSAEM algorithm not only has the computational advantages of the stochastic approximation expectation-maximization (SAEM) algorithm for multidimensional data, but it also alleviates the potential instability caused by label-switching, and then improved the estimation accuracy. Simulation studies are conducted to illustrate the good performance of the proposed MSAEM method, where MSAEM consistently performs better than SAEM and some other existing methods in multidimensional item response theory. Moreover, the proposed method is applied to a real data set from the 2018 Programme for International Student Assessment (PISA) to demonstrate the usefulness of the 4PNO model as well as MSAEM in practice.