Search

This research is part of the Artificial Intelligence Virtual Trainer (AI-VT) project which aims to create a system that can identify the user's skills from a text by means of machine learning. AI-VT is a case-based reasoning learning support system can generate customized exercise lists that are specially adapted to user needs. To attain this outcome, the relevance of the first proposed exercise must be optimized to assist the system in creating personalized user profiles. To solve this problem, this project was designed to include a preliminary testing phase. As a generic tool, AI-VT was designed to be adapted to any field of learning. The most recent application of AI-VT was in the field of computer science specifically in the context of the fundamentals of algorithmic learning. AI-VT can and will also be useful in other disciplines. Developed in Python with the Keras API and the Tensorflow framework, this artificial intelligence-based tool encompasses a supervised learning environment, multi-label text classification techniques and deep neural networks. This paper presents and compares the performance levels of the different models tested on two different data sets in the context of computer programming and algorithms.

Social media have established a new way of communicating and understanding social relationships. At the same time, there are downsides, especially, their use of algorithms that have been built and developed under their umbrella and their potential to alter public opinion. This paper tries to analyse the YouTube recommendation system from the perspectives of reverse engineering and semantic mining. The first result is that, contrary to expectations, the issues do not tend to be extreme from the point of view of polarisation in all cases. Next, and through the study of the selected themes, the results do not offer a clear answer to the proposed hypotheses, since, as has been shown in similar works, the factors that shape the recommendation system are very diverse. In fact, results show that polarising content does not behave in the same way for all the topics analysed, which may indicate the existence of moderators --or corporate actions-- that alter the relationship between the variables. Another contribution is the confirmation that we are dealing with non-linear, but potentially systematic, processes. Nevertheless, the present work opens the door to further academic research on the topic to clarify the unknowns about the role of these algorithms in our societies.

Embedding a pairwise key distribution approach in IoT systems is challenging as IoT devices have limited resources, such as memory, processing power, and battery life. This paper presents a secure and lightweight approach that is applied to IoT devices that are divided into Voronoi clusters. This proposed algorithm comprises XOR and concatenation operations for interactive authentication between the server and the IoT devices. Predominantly, the authentication is carried out by the server. It is observed that the algorithm is resilient against man-in-the-middle attacks, forward secrecy, Denial of Service (DoS) attacks, and offers mutual authentication. It is also observed that the given scheme has low communication and computing overheads compared to some existing methods.

This paper leverages cluster analysis to provide insight into how traditionally underrepresented learners engage with entry-level massive open online courses (MOOCs) intended to lower the barrier to university enrolment, produced by a major research university in the United States. From an initial sample of 260,239 learners, we cluster analyze a subset of data from 29,083 participants who submitted an assignment in one of nine entry-level MOOC courses. Manhattan distance and Gower distance measures are computed based on engagement, achievement, and demographic data. To our knowledge, this marks one of the first such uses of Gower distance to cluster mixed variable data to explore fairness and equity in the MOOC literature. The clusters are derived from CLARA and PAM algorithms, enriched by demographic data, with a particular focus on education level, as well as approximated socioeconomic status (SES) for a smaller subset of learners. Results indicate that learners without a college degree are more likely to be high-performing compared to college-educated learners. Learners from lower SES backgrounds are just as likely to be successful as learners from middle and higher SES backgrounds. While MOOCs have struggled to improve access to learning, more fair and equitable outcomes for traditionally underrepresented learners are possible.

The focus of ethics in learning analytics (LA) frameworks and guidelines is predominantly on procedural elements of data management and accountability. Another, less represented focus is on the duty to act and LA as a moral practice. Data feminism as a critical theoretical approach to data science practices may offer LA research and practitioners a valuable lens through which to consider LA as a moral practice. This paper examines what data feminism can offer the LA community. It identifies critical questions for further developing and enabling a responsible stance in LA research and practice taking one particular case -- algorithmic decision-making -- as a point of departure.

A critical part of supporting the development of students' algorithmic thinking is understanding the challenges that emerge when students engage with algorithmatizing tasks--tasks that require the creation of an algorithm. Knowledge of these challenges can serve as a basis upon which educators can build effective strategies for enhancing students' algorithmic thinking skills. This paper presents three illustrative cases of emergent challenges evident as students grapple with the process of creating an algorithm. The first challenge highlights discrepancies between the method with which students solve a problem and the algorithm they create, and claim would, when implemented, solve the same problem. The second challenge pertains to the persistence of students' normatively incorrect algorithms, despite going through multiple iterations of testing and revising. Finally, the third challenge concerns issues around the use of test problems for supporting students in their creation of generalized algorithms. These three challenges are discussed using student data (illustrative cases) from three different mathematical algorithmatizing tasks. Suggestions are put forth for addressing some of these challenges, with a particular emphasis on practical pedagogical suggestions for cultivating students' mathematical thinking in the context of algorithmatizing tasks.

As we move further into the digital age, the acquisition of digital literacy (DL) and computational thinking (CT) skills is emerging internationally as an essential goal for students in contemporary school curricula. As the world becomes more uncertain and volatile due to impacts of artificial intelligence (AI), international unrest, climate change, global economic instability and unforeseen catastrophes such as the Coronavirus (COVID-19) pandemic, it is necessary to review, revise and refine school education curricula and policies. The issue of what is essential for students to learn, and how they learn it, is of growing importance to international organisations such as the Organisation for Economic Co-operation and Development (OECD) and the United Nations Educational, Scientific and Cultural Organisation (UNESCO) and is emerging as a significant driver for educational reform across the globe. The growing prominence of CT and DL skills across many industry sectors has prompted recent changes to international assessment frameworks such as the Programme for International Student Assessment (PISA) and the Trends in International Mathematics and Science Study (TIMSS). This paper will briefly discuss specific examples of alternative approaches to addressing CT in national curricula for the compulsory years of schooling and explain how CT has been adopted as a driver for mathematics curriculum change in Australia.

Students organize and manage their own learning time, choosing when, what, and how to study due to the flexibility of online learning. Each person has unique learning habits that define their behaviours and distinguish them from others. To investigate the temporal behaviour of students in online learning environments, we seek to identify suitable time-windows that could be used to investigate their temporal behaviour. First, we present a novel perspective for identifying different types of sessions based on individual needs. The majority of previous works address this issue by establishing an arbitrary session timeout threshold. In this paper, we propose an algorithm for determining the optimal threshold for a given session. Second, we use data-driven methods to support investigators in determining time-windows based on the identified sessions. To this end, we developed a visual tool that assists data scientists and researchers to determine the optimal settings for session identification and locating suitable time-windows.

Computational thinking (CT) is an important 21st-century skill. This paper aims at investigating predictors of CT self-efficacy among high-school students. The hypothesized predictors are grouped into three areas: (1) student characteristics, (2) home environment, and (3) learning opportunities. CT self-efficacy is measured with the Computational Thinking Scales (CTS) that comprises five dimensions: creativity, algorithmic thinking, cooperativity, critical thinking, and problem solving. N = 202 high-school students act as the sample, linear regression as the analysis method. The best prediction is possible for algorithmic thinking (R[superscript 2] = 0.511). For cooperativity, the explanatory power of our model it is weak (R[superscript 2] = 0.146). Across all five CTS dimensions, CT self-concept is the best predictor for CT self-efficacy. [For the full proceedings, see ED636095.]

This study investigated the influence of CThink4CS2 Module on computational thinking (CT) skills of form four chemistry students. The CThink4CS[superscript]2 Module integrated CT with the Engineering Design Process (EDP) in chemistry class. This study utilized quantitative research methods and quasi-experimental design. Quantitative data were collected using the Computational Thinking Skill Test (CTST) which consisted of algorithmic reasoning, abstraction, decomposition, and pattern recognition constructs. A total of 73 students were in the treatment group (n=39) and control group (n=34). Experimental data were described by means of descriptive analysis and inferential analysis employing two-way MANOVA analysis. The results of the analysis indicated significant differences in CT skills between groups; students in the treatment group demonstrated better results compared to those in the control group. The paper provides insight into the integration of CT and EDP as effective pedagogical strategies for inculcating CT skills.

The purpose of this article is to investigate how 5G and wireless communication technologies (5G+WCT) might be applied to English language classroom programs in higher education. The paper describes the complimentary roles of 5G and wireless communication technologies in English language teaching, includes student data collecting and standardization as part of the pre-processing, and optimizes the teaching system using an enhanced ant colony algorithm (BACO). Furthermore, the thesis delineates diverse approaches to verify and assess the program's efficacy. Through the creation of cutting-edge instructional strategies and data collection techniques, this study fosters innovation in English language instruction in higher education. The study offers promise for real-world application and is significant for raising student success, instructional quality, and educational efficacy. However, since 5G technology is still developing, the results of this study could not be applicable in the future or would need to be updated.

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.

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.

A common divide-and-conquer approach for Bayesian computation with big data is to partition the data, perform local inference for each piece separately, and combine the results to obtain a global posterior approximation. While being conceptually and computationally appealing, this method involves the problematic need to also split the prior for the local inferences; these weakened priors may not provide enough regularization for each separate computation, thus eliminating one of the key advantages of Bayesian methods. To resolve this dilemma while still retaining the generalizability of the underlying local inference method, we apply the idea of expectation propagation (EP) as a framework for distributed Bayesian inference. The central idea is to iteratively update approximations to the local likelihoods given the state of the other approximations and the prior. The present paper has two roles: we review the steps that are needed to keep EP algorithms numerically stable, and we suggest a general approach, inspired by EP, for approaching data partitioning problems in a way that achieves the computational benefits of parallelism while allowing each local update to make use of relevant information from the other sites. In addition, we demonstrate how the method can be applied in a hierarchical context to make use of partitioning of both data and parameters. The paper describes a general algorithmic framework, rather than a specific algorithm, and presents an example implementation for it.

The rapid accumulation of large-scale single-cell RNA-seq datasets from multiple institutions presents remarkable opportunities for automatically cell annotations through integrative analyses. However, the privacy issue has existed but being ignored, since we are limited to access and utilize all the reference datasets distributed in different institutions globally due to the prohibited data transmission across institutions by data regulation laws. To this end, we present scPrivacy, which is the first and generalized automatically single-cell type identification prototype to facilitate single cell annotations in a data privacy-preserving collaboration manner. We evaluated scPrivacy on a comprehensive set of publicly available benchmark datasets for single-cell type identification to stimulate the scenario that the reference datasets are rapidly generated and distributed in multiple institutions, while they are prohibited to be integrated directly or exposed to each other due to the data privacy regulations, demonstrating its effectiveness, time efficiency and robustness for privacy-preserving integration of multiple institutional datasets in single cell annotations., (© 2022. Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature.)

The authors offer observation on utilizing tables, figures, charts and graphs to help understand the research presented in a simple manner but also engage and sustain the reader's interest. Topics discussed include benefits provided by the use of tables/figures/charts/graphs, general methodology of design and submission, and copyright issues of using material from government publications/public domain.

Machine learning (ML), a form of artificial intelligence (AI), is being increasingly employed in neurology. Reported performance metrics often match or exceed the efficiency of average clinicians. The neurologist is easily baffled by the underlying concepts and terminologies associated with ML studies. The superlative performance metrics of ML algorithms often hide the opaque nature of its inner workings. Questions regarding ML model's interpretability and reproducibility of its results in real-world scenarios, need emphasis. Given an abundance of time and information, the expert clinician should be able to deliver comparable predictions to ML models, a useful benchmark while evaluating its performance. Predictive performance metrics of ML models should not be confused with causal inference between its input and output. ML and clinical gestalt should compete in a randomized controlled trial before they can complement each other for screening, triaging, providing second opinions and modifying treatment. [ABSTRACT FROM AUTHOR]

This paper explores digital marginalization, data marginalization, and algorithmic exclusions in the Souths. To this effect, it argues that underrepresented users and communities continue to be marginalized and excluded by digital technologies, by big data, and by algorithms employed by organizations, corporations, institutions, and governments in various data jurisdictions. Situating data colonialism within the Souths, the paper contends that data ableism, data disablism, and data colonialism are at play when data collected, collated, captured, configured, and processed from underrepresented users and communities is utilized by mega entities for their own multiple purposes. It also maintains that data coloniality, as opposed to data colonialism, is impervious to legal and legislative interventions within data jurisdictions. Additionally, it discusses digital citizenship (DC) and its related emerging regimes. Moreover, the paper argues that digital exclusion transcends the simplistic haves versus the have nots dualism as it manifests itself in multiple layers and in multiple dimensions. Furthermore, it characterizes how algorithmic exclusions tend to perpetuate historical human biases despite the pervasive view that algorithms are autonomous, neutral, rational, objective, fair, unbiased, and non-human. Finally, the paper advances a critical southern decolonial (CSD) approach to datafication, algorithms, and digital citizenship by means of which data coloniality, algorithmic coloniality, and the coloniality embodied in DC have to be critiqued, challenged, and dismantled. [ABSTRACT FROM AUTHOR]

Rough set theory (RST) was proposed by Zdzistaw Pawlak (Pawlak,1982) as a methodology for data analysis using the notion of discernibility of objects based on their attribute values. The main advantage of using RST approach is that it does not need additional assumptions--like data distribution in statistical analysis. Besides, it provides efficient algorithms and tools for finding hidden patterns. Despite its advantages, the adoption of RST in educational research is still limited, which may be due to limited quality software available for RST. Recently, the "RoughSets" package in R statistical system has been developed (Riza et al., 2014), providing various utilities of the RST methods. In the paper, we will first describe the basic RST concepts and steps of data analysis under RST. We will then apply RST to a study, which aimed to determine the relative significance of various SRL strategies used by student participants, so as to illustrate the steps of data analysis using the "RoughSets" R package. From the illustration, it is expected that more researchers in the field of education will be encouraged to try RST methods in their own studies.

The present paper is in two folds. In the first fold, we prove the Lipschitz continuity of the proximal mapping associated with a general strongly H-monotone mapping and compute an estimate of its Lipschitz constant under some mild assumptions imposed on the mapping H involved in the proximal mapping. We provide two examples to show that a maximal monotone mapping need not be a general H-monotone for a single-valued mapping H from a Banach space to its dual space. A class of multi-valued nonlinear variational inclusion problems is considered, and by using the notion of proximal mapping and Nadler's technique, an iterative algorithm with mixed errors is suggested to compute its solutions. Under some appropriate hypotheses imposed on the mappings and parameters involved in the multi-valued nonlinear variational inclusion problem, the strong convergence of the sequences generated by the proposed algorithm to a solution of the aforesaid problem is verified. The second fold of this paper investigates and analyzes the notion of Cn-monotone mappings defined and studied in [S.Z. Nazemi, A new class of monotone mappings and a new class of variational inclusions in Banach spaces, J. Optim. Theory Appl. 155(3)(2012) 785-795]. Several comments related to the results and algorithm appeared in the above mentioned paper are given. [ABSTRACT FROM AUTHOR]

This document is an editorial for a special issue of the journal AIMS Mathematics on the topic of discrete optimization. The issue includes 21 papers covering a range of subjects, including molecular trees, network systems, variational inequality problems, scheduling, image restoration, spectral clustering, integral equations, convex functions, graph products, optimization algorithms, air quality prediction, humanitarian planning, inertial methods, neural networks, transportation problems, emotion identification, fixed-point problems, structural engineering design, single machine scheduling, and ensemble learning. The papers present new theoretical results, algorithms, and applications in these areas. The guest editor expresses gratitude to the journal staff and reviewers and hopes that readers will find inspiration for their own research. [Extracted from the article]

It has been the historic responsibility of the social sciences to investigate human societies. Fulfilling this responsibility requires social theories, measurement models and social data. Most existing theories and measurement models in the social sciences were not developed with the deep societal reach of algorithms in mind. The emergence of 'algorithmically infused societies'-societies whose very fabric is co-shaped by algorithmic and human behaviour-raises three key challenges: the insufficient quality of measurements, the complex consequences of (mis)measurements, and the limits of existing social theories. Here we argue that tackling these challenges requires new social theories that account for the impact of algorithmic systems on social realities. To develop such theories, we need new methodologies for integrating data and measurements into theory construction. Given the scale at which measurements can be applied, we believe measurement models should be trustworthy, auditable and just. To achieve this, the development of measurements should be transparent and participatory, and include mechanisms to ensure measurement quality and identify possible harms. We argue that computational social scientists should rethink what aspects of algorithmically infused societies should be measured, how they should be measured, and the consequences of doing so.

The application of big data, radiomics, machine learning, and artificial intelligence (AI) algorithms in radiology requires access to large data sets containing personal health information. Because machine learning projects often require collaboration between different sites or data transfer to a third party, precautions are required to safeguard patient privacy. Safety measures are required to prevent inadvertent access to and transfer of identifiable information. The Canadian Association of Radiologists (CAR) is the national voice of radiology committed to promoting the highest standards in patient-centered imaging, lifelong learning, and research. The CAR has created an AI Ethical and Legal standing committee with the mandate to guide the medical imaging community in terms of best practices in data management, access to health care data, de-identification, and accountability practices. Part 2 of this article will inform CAR members on the practical aspects of medical imaging de-identification, strengths and limitations of de-identification approaches, list of de-identification software and tools available, and perspectives on future directions. [ABSTRACT FROM AUTHOR]

In order to better solve the problem of automatic identification of quality control line and detection line in the detection of gold standard test strip, this paper proposes to collect the image information of gold standard test strip after color rendering through CMOS sensor, preprocess the obtained information, transform RGB image into gray image, build cloud model in the CIELAB/HSV/HSL space, and apply the improved AdaBoost algorithm to determine the position of detection line and quality control line Place. Compared with the traditional template matching method, it improves the accuracy and accuracy of recognition. [ABSTRACT FROM AUTHOR]

The intrinsic features of documents, such as paper color, texture, aging, translucency, the kind of printing, typing or handwriting, etc., are important with regard to how to process and enhance their image. Image binarization is the process of producing a monochromatic image having its color version as input. It is a key step in the document processing pipeline. The recent Quality-Time Binarization Competitions for documents have shown that no binarization algorithm is good for any kind of document image. This paper uses a sample of the texture of the scanned historical documents as the main document feature to select which of the 63 widely used algorithms, using five different versions of the input images, totaling 315 document image-binarization schemes, provides a reasonable quality-time trade-off. [ABSTRACT FROM AUTHOR]

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) software that analyzes medical images is becoming increasingly prevalent. Unlike earlier generations of AI software, which relied on expert knowledge to identify imaging features, machine learning approaches automatically learn to recognize these features. However, the promise of accurate personalized medicine can only be fulfilled with access to large quantities of medical data from patients. This data could be used for purposes such as predicting disease, diagnosis, treatment optimization, and prognostication. Radiology is positioned to lead development and implementation of AI algorithms and to manage the associated ethical and legal challenges. This white paper from the Canadian Association of Radiologists provides a framework for study of the legal and ethical issues related to AI in medical imaging, related to patient data (privacy, confidentiality, ownership, and sharing); algorithms (levels of autonomy, liability, and jurisprudence); practice (best practices and current legal framework); and finally, opportunities in AI from the perspective of a universal health care system. [ABSTRACT FROM AUTHOR]

To facilitate better interpretation of dielectric response measurements--thereby directing numerical evidence for condition assessments of oil-paper-insulated equipment in high-voltage alternating current (HVAC) transmission systems--a novel approach is presented to estimate the parameters in the extended Debye model (EDM) using wideband frequency domain spectroscopy (FDS). A syncretic algorithm that integrates a genetic algorithm (GA) and the Levenberg-Marquardt (L-M) algorithm is introduced in the present study to parameterize EDM using the FDS measurements of a real-life 126 kV oil-impregnated paper (OIP) bushing under different controlled temperatures. As for the uncertainty of the EDM structure due to variable branch quantity, Akaike's information criterion (AIC) is employed to determine the model orders. For verification, comparative analysis of FDS reconstruction and results of FDS transformation to polarization--depolarization current (PDC)/return voltage measurement (RVM) are presented. The comparison demonstrates good agreement between the measured and reconstructed spectroscopies of complex capacitance and tan δover the full tested frequency band (10-4 Hz-10³ Hz) with goodness of fit over 0.99. Deviations between the tested and modelled PDC/RVM from FDS are then discussed. Compared with the previous studies to parameterize the model using time domain dielectric responses, the proposed method solves the problematic matching between EDM and FDS especially in a wide frequency band, and therefore assures a basis for quantitative insulation condition assessment of OIP-insulated apparatus in energy systems. [ABSTRACT FROM AUTHOR]

The optimization of open pit mine production scheduling is not only a multistage decision-making problem but also involves space-time dynamic action among multiple factors, which makes it difficult to optimize production capacity, mining sequence, mining life, and other factors simultaneously in optimizing design. In addition, the production capacity is disorderly expanded, the calculation scale is large, and the optimization time is long. Therefore, this article designs a mobile capacity search domain method to improve computing efficiency without omitting the optimal production capacity. At the same time, taking the maximum net present value as the objective function, an enumeration method is used to optimize the possible paths in different capacity domains and calculate the infrastructure investment and facility idle cost required to meet the maximum production capacity on each possible path to control the disorderly expansion and violent fluctuation of production capacity. The research shows that the open pit mine production scheduling optimization algorithm proposed in this article can not only realize the simultaneous optimization of the three elements of production capacity, mining sequence, and mining life but also improve the computing efficiency by 200 times. Furthermore, the production capacity fluctuation is less than 1.4%. The mining life of the mine is extended by 13 years, and the overall economic benefit is increased by 18%., (© 2023. The Author(s).)

Smart communication has significantly advanced with the integration of the Internet of Things (IoT). Many devices and online services are utilized in the network system to cope with data gathering and forwarding. Recently, many traffic-aware solutions have explored autonomous systems to attain the intelligent routing and flowing of internet traffic with the support of artificial intelligence. However, the inefficient usage of nodes' batteries and long-range communication degrades the connectivity time for the deployed sensors with the end devices. Moreover, trustworthy route identification is another significant research challenge for formulating a smart system. Therefore, this paper presents a smart Random walk Distributed Secured Edge algorithm (RDSE), using a multi-regression model for IoT networks, which aims to enhance the stability of the chosen IoT network with the support of an optimal system. In addition, by using secured computing, the proposed architecture increases the trustworthiness of smart devices with the least node complexity. The proposed algorithm differs from other works in terms of the following factors. Firstly, it uses the random walk to form the initial routes with certain probabilities, and later, by exploring a multi-variant function, it attains long-lasting communication with a high degree of network stability. This helps to improve the optimization criteria for the nodes' communication, and efficiently utilizes energy with the combination of mobile edges. Secondly, the trusted factors successfully identify the normal nodes even when the system is compromised. Therefore, the proposed algorithm reduces data risks and offers a more reliable and private system. In addition, the simulations-based testing reveals the significant performance of the proposed algorithm in comparison to the existing work. [ABSTRACT FROM AUTHOR]

To date, a large number of active learning algorithms have been proposed, but active learning methods for ordinal classification are under-researched. For ordinal classification, there is a total ordering among the data classes, and it is natural that the cost of misclassifying an instance as an adjacent class should be lower than that of misclassifying it as a more disparate class. However, existing active learning algorithms typically do not consider the above ordering information in query selection. Thus, most of them do not perform satisfactorily in ordinal classification. This study proposes an active learning method for ordinal classification by considering the ordering information among classes. We design an expected cost minimization criterion that imbues the ordering information. Meanwhile, we incorporate it with an uncertainty sampling criterion to impose the query instance more informative. Furthermore, we introduce a candidate subset selection method based on the k-means algorithm to reduce the computational overhead led by the calculation of expected cost. Extensive experiments on nine public ordinal classification datasets demonstrate that the proposed method outperforms several baseline methods., (© 2022. The Author(s).)

One of the most important properties of classical neural networks is how surprisingly trainable they are, though their training algorithms typically rely on optimizing complicated, nonconvex loss functions. Previous results have shown that unlike the case in classical neural networks, variational quantum models are often not trainable. The most studied phenomenon is the onset of barren plateaus in the training landscape of these quantum models, typically when the models are very deep. This focus on barren plateaus has made the phenomenon almost synonymous with the trainability of quantum models. Here, we show that barren plateaus are only a part of the story. We prove that a wide class of variational quantum models-which are shallow, and exhibit no barren plateaus-have only a superpolynomially small fraction of local minima within any constant energy from the global minimum, rendering these models untrainable if no good initial guess of the optimal parameters is known. We also study the trainability of variational quantum algorithms from a statistical query framework, and show that noisy optimization of a wide variety of quantum models is impossible with a sub-exponential number of queries. Finally, we numerically confirm our results on a variety of problem instances. Though we exclude a wide variety of quantum algorithms here, we give reason for optimism for certain classes of variational algorithms and discuss potential ways forward in showing the practical utility of such algorithms., (© 2022. The Author(s).)

This paper presents an application of the Kalman filter in signal processing in instrumentation systems when the conditions of the environment generate a large amount of interference for the acquisition of signals from measurement systems. The unwanted interferences make important use of the instrumentation system resources and do not represent useful information under any aspect. A simulation is presented using the Matlab tool, which remarkably facilitates the information processing so that the corresponding actions are taken according to the information obtained, taking advantage of the current resources offered by the embedded systems and the required measurements are obtained with enough accuracy.

This paper analyses how pre-service teachers approach the notion of the infinite limit of a sequence from two perspectives: Specialized Content Knowledge and Advanced Mathematical Thinking. The aim of this study is to identify the difficulties associated with this notion and to classify them. In order to achieve this, an exploratory qualitative approach was applied using a sample of 12 future teachers. Among the results, we can affirm that pre-service teachers mainly use algorithmic procedures to solve tasks in which this type of limit is implicit, although they would consider a resolution that specifically involves the notion with an intuitive approach if they had to explain it to their students.

This study explores student flexibility in mathematics by examining the relationship between accuracy and strategy use for solving arithmetic and algebra problems. Core to procedural flexibility is the ability to select and accurately execute the most appropriate strategy for a given problem. Yet the relationship between strategy selection and accurate execution is nuanced and poorly understood. In this paper, this relationship was examined in the context of an assessment where students were asked to complete the same problem twice using different approaches. In particular, we explored (a) the extent to which students were more accurate when selecting standard or better-than-standard strategies, (b) whether this accuracy-strategy use relationship differed depending on whether the student solved a problem for the first time or the second time, and (c) the extent to which students were more accurate when solving algebraic versus arithmetic problems. Our results indicate significant associations between accuracy and all of these aspects--we found differences in accuracy based on strategy, problem type, and a significant interaction effect between strategy and assessment part. These findings have important implications both for researchers investigating procedural flexibility as well as secondary mathematics educators who seek to promote this capacity among their students.

Co-operative education is a form of work-integrated learning that includes academic study and paid work experience. This provides new learning opportunities for students and a talent pipeline for employers, but also requires participation in a competitive job market. This paper studies competition through a unique dataset from a large North American co-operative program, in which students and employers rank each other after a round of interviews, then a matching algorithm assigns students to jobs based on the ranks, and finally, they evaluate each other at the end of the work term. The results suggest that less experienced students and small employers are more strongly affected by competition and consider more options in their rankings, whereas senior students and large employers often only identify their top choice. Additionally, competition appears to affect satisfaction since students and employers give higher work term evaluations when matched with their top choice.

Within scientific debate on post-digital and education, we present a position paper to describe a research project aimed at the design of a predictive model for students' low achievements in mathematics in Italy. The model is based on the INVALSI data set, an Italian large-scale assessment test, and we use decision trees as the classification algorithm. In designing this tool, we aim to overcome the use of economic, social, and cultural context indices as main factors for the prediction of a learning gap occurrence. Indeed, we want to include a suitable representation of students' learning in the model, by exploiting the data collected through the INVALSI tests. We resort to a knowledge-based approach to address this issue and specifically, we try to understand what knowledge is introduced into the model through the representation of learning. In this sense, our proposal allows a students' learning encoding, which is transferable to different students' cohort. Furthermore, the encoding methods may be applied to other large-scale assessments test. Hence, we aim to contribute to a debate on knowledge representation in AI tool for education.

In order to improve the teaching effect of sports dance, this paper analyzes the traditional dance teaching motion capture, uses sensor motion perception algorithms to capture sports dance motion perception, and designs an intelligent sensor system that can be used for sports dance motion capture. Moreover, this paper combines the digital filter algorithm to design the hardware system structure of the sports dance motion capture system and builds a motion capture system for sports dance teaching based on the digital filter algorithm according to actual needs. In addition, this paper combines the simulation test to evaluate the performance of the system designed in this paper. The research results show that the motion capture system for sports dance teaching based on the digital filtering algorithm proposed in this paper can play an important role in sports dance teaching and effectively improve the efficiency of sports dance teaching. [ABSTRACT FROM AUTHOR]

At present, the monitoring of concrete cracks is still mainly carried out by engineering personnel using simple mechanical monitoring instruments. The human inspection will undoubtedly be interfered by the individual's psychological, physical, and external conditions, and there may also be unobjective emotions, so it is impossible to ensure that the quality of the detection is up to standard and accurate. This paper combines digital image processing technology and multiscale feature analysis automatic detection algorithm to construct an intelligent building structure crack detection system. Moreover, this paper proposes an enrichment scheme for the unknown partially entangled states of building microparticles and utilizes the entanglement exchange process based on the Raman interaction of two building microparticles. The experimental results show that the automatic detection method of building cracks based on digital image processing technology and multiscale feature analysis has a good effect. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is a scheme in which several consumers work collectively to unravel machine learning (ML) problems, with a dominant collector synchronizing the procedure. This decision correspondingly enables the training data to be distributed, guaranteeing that the individual device's data are secluded. The paper systematically reviewed the available literature using the Preferred Reporting Items for Systematic Review and Meta-analysis (PRISMA) guiding principle. The study presents a systematic review of appliable ML approaches for FL, reviews the categorization of FL, discusses the FL application areas, presents the relationship between FL and Blockchain Technology (BT), and discusses some existing literature that has used FL and ML approaches. The study also examined applicable machine learning models for federated learning. The inclusion measures were (i) published between 2017 and 2021, (ii) written in English, (iii) published in a peer-reviewed scientific journal, and (iv) Preprint published papers. Unpublished studies, thesis and dissertation studies, (ii) conference papers, (iii) not in English, and (iv) did not use artificial intelligence models and blockchain technology were all removed from the review. In total, 84 eligible papers were finally examined in this study. Finally, in recent years, the amount of research on ML using FL has increased. Accuracy equivalent to standard feature-based techniques has been attained, and ensembles of many algorithms may yield even better results. We discovered that the best results were obtained from the hybrid design of an ML ensemble employing expert features. However, some additional difficulties and issues need to be overcome, such as efficiency, complexity, and smaller datasets. In addition, novel FL applications should be investigated from the standpoint of the datasets and methodologies. [ABSTRACT FROM AUTHOR]

The Semantic Link Network is a general semantic model for modeling the structure and the evolution of complex systems. Various semantic links play different roles in rendering the semantics of complex system. One of the basic semantic links represents cause-effect relation, which plays an important role in representation and understanding. This paper verifies the role of the Semantic Link Network in representing the core of text by investigating the contribution of cause-effect link to representing the core of scientific papers. Research carries out with the following steps: (1) Two propositions on the contribution of cause-effect link in rendering the core of paper are proposed and verified through a statistical survey, which shows that the sentences on cause-effect links cover about 65% of key words within each paper on average. (2) An algorithm based on syntactic patterns is designed for automatically extracting cause-effect link from scientific papers, which recalls about 70% of manually annotated cause-effect links on average, indicating that the result adapts to the scale of data sets. (3) The effects of cause-effect link on four schemes of incorporating cause-effect link into the existing instances of the Semantic Link Network for enhancing the summarization of scientific papers are investigated. The experiments show that the quality of the summaries is significantly improved, which verifies the role of semantic links. The significance of this research lies in two aspects: (1) it verifies that the Semantic Link Network connects the important concepts to render the core of text; and, (2) it provides an evidence for realizing content services such as summarization, recommendation and question answering based on the Semantic Link Network, and it can inspire relevant research on content computing. [ABSTRACT FROM AUTHOR]

Research paper recommenders emerged over the last decade to ease finding publications relating to researchers’ area of interest. The challenge was not just to provide researchers with very rich publications at any time, any place and in any form but to also offer the right publication to the right researcher in the right way. Several approaches exist in handling paper recommender systems. However, these approaches assumed the availability of the whole contents of the recommending papers to be freely accessible, which is not always true due to factors such as copyright restrictions. This paper presents a collaborative approach for research paper recommender system. By leveraging the advantages of collaborative filtering approach, we utilize the publicly available contextual metadata to infer the hidden associations that exist between research papers in order to personalize recommendations. The novelty of our proposed approach is that it provides personalized recommendations regardless of the research field and regardless of the user’s expertise. Using a publicly available dataset, our proposed approach has recorded a significant improvement over other baseline methods in measuring both the overall performance and the ability to return relevant and useful publications at the top of the recommendation list. [ABSTRACT FROM AUTHOR]