Search

In an era overwhelmed by academic big data, students grapple with identifying academic papers that resonate with their learning objectives and research interests, due to the sheer volume and complexity of available information. This study addresses the challenge by proposing a novel academic paper recommendation system designed to enhance personalized learning through the nuanced understanding of academic social networks. Utilizing the theory of social homogeneity, the research first constructs a sophisticated academic social network, capturing high-order social relationships, such as co-authorship and advisor–advisee connections, through hypergraph modeling and advanced network representation learning techniques. The methodology encompasses the development and integration of a hypergraph convolutional neural network and a contrastive learning framework to accurately model and recommend academic papers, focusing on aligning with students' unique preferences and reducing reliance on sparse interaction data. The findings, validated across multiple real-world datasets, demonstrate a significant improvement in recommendation accuracy, particularly in addressing the cold-start problem and effectively mapping advisor–advisee relationships. The study concludes that leveraging complex academic social networks can substantially enhance the personalization and precision of academic paper recommendations, offering a promising avenue for addressing the challenges of academic information overload and fostering more effective personalized learning environments. [ABSTRACT FROM AUTHOR]

Predicting breakthrough papers holds great significance; however, prior studies encountered challenges in this task, indicating a need for substantial improvement. We propose that the failure to capture the dynamic structural-evolutionary features of citation networks is one of the major reasons. To overcome this limitation, this paper introduces a new method for constructing citation cascades of focus papers, allowing the creation of a time-series-like set of citation cascades. Then, through a thorough review, three types of structural indicators in these citation networks that could reflect breakthroughs are identified, including certain basic topological metrics, PageRank values, and the von Neumann graph entropy. Based on the time-series-like set of citation cascades, the dynamic trajectories of these indicators are calculated and employed as predictors. Using the Nobel Prize-winning papers as a landmark dataset, our prediction method yields approximately a 7% improvement in the ROC-AUC score compared to static-based prior methods. Additionally, our method advances in achieving earlier predictions than other previous methods. The main contribution of this paper is proposing a novel method for creating citation cascades in chronological order and confirming the significance of predicting breakthroughs from a dynamic structural perspective. [ABSTRACT FROM AUTHOR]

With the proliferation of blockchain technology in decentralized applications like decentralized finance and supply chain and identity management, smart contracts operating on a blockchain frequently encounter security issues such as reentrancy vulnerabilities, timestamp dependency vulnerabilities, tx.origin vulnerabilities, and integer overflow vulnerabilities. These security concerns pose a significant risk of causing substantial losses to user accounts. Consequently, the detection of vulnerabilities in smart contracts has become a prominent area of research. Existing research exhibits limitations, including low detection accuracy in traditional smart contract vulnerability detection approaches and the tendency of deep learning-based solutions to focus on a single type of vulnerability. To address these constraints, this paper introduces a smart contract vulnerability detection method founded on multimodal feature fusion. This method adopts a multimodal perspective to extract three modal features from the lifecycle of smart contracts, leveraging both static and dynamic features comprehensively. Through deep learning models like Graph Convolutional Networks (GCNs) and bidirectional Long Short-Term Memory networks (bi-LSTMs), effective detection of vulnerabilities in smart contracts is achieved. Experimental results demonstrate that the proposed method attains detection accuracies of 85.73% for reentrancy vulnerabilities, 85.41% for timestamp dependency vulnerabilities, 83.58% for tx.origin vulnerabilities, and 90.96% for integer Overflow vulnerabilities. Furthermore, ablation experiments confirm the efficacy of the newly introduced modal features, highlighting the significance of fusing dynamic and static features in enhancing detection accuracy. [ABSTRACT FROM AUTHOR]

Paper waste in the mockups design with regular, irregular, and amorphous patterns is a critical problem in digital printing presses. Paper waste reduction directly impacts production costs, generating business and environmental benefits. This problem can be mapped to the two-dimensional irregular bin-packing problem. In this paper, an iterated local search algorithm using a novel neighborhood structure to detect overlaps between amorphous shapes is introduced. This algorithm is used to solve the paper waste problem, modeled as one 2D irregular bin-packing problem. The experimental results show that this approach works efficiently and effectively to detect and correct the overlaps between regular, irregular, and amorphous figures. [ABSTRACT FROM AUTHOR]

The current media digitization and artistic strength are more powerful than the previous application. Using its advanced information display methods and technologies, this paper proposed a digital museum built by integrating digital media art with AR technology, which was helpful to analyze and solve the objective problems of current museums' ecological imbalance and single-system function. Based on the principles and laws of augmented reality technology, the museum guide system is optimized. In the system evaluation experiment, firstly, the cultural relics of six kinds of materials are used as the target image to extract and identify the features of the image. In experiments, the recognition performance of three feature algorithms, Binary Robust Invariant Scalable Keypoints (BRISK), organizational retaliatory behavior (ORB), and Accelerated-KAZE (AKAZE), is compared. Among them, the ORB algorithm is superior to other algorithms in feature richness and recognition speed but is inferior to the other two algorithms in recognition accuracy. Therefore, this paper optimized the ORB algorithm based on the characteristics of the ORB algorithm. The ORB algorithm must calculate the orientation of the feature points before constructing the feature descriptor. After optimizing the parameters, the improved ORB algorithm not only has advantages in feature richness and recognition time but also improves the recognition accuracy up to 98.3%, which is 16% higher than the traditional ORB algorithm. Therefore, the application prospects of AR technology in digital media design are very important. [ABSTRACT FROM AUTHOR]

This document is a preface to a special issue of the journal "Mathematics" that focuses on mathematical modeling and optimization of service supply chains. The special issue includes 14 papers that cover a wide range of topics within this field. The papers provide valuable insights for researchers, students, and practitioners in supply chain management, operations research, industrial engineering, and business management. They address areas such as customer preferences, optimization of supply chain decisions, coordination mechanisms, and the effects of the external environment. The findings can assist in addressing current issues and challenges in service supply chains, ultimately enhancing performance and efficiency. [Extracted from the article]

This document is a summary of a special issue of the journal "Mathematics" that focuses on new trends in complex analysis research. The issue includes 14 papers that cover various aspects of complex-valued functions of one or several complex variables. The papers explore topics such as coefficient estimates, starlikeness and convexity of analytic functions, holomorphic and bi-univalent functions, and integral operators. The research presented in the papers aims to contribute to the development of complex analysis and inspire further studies in the field. The document also acknowledges the authors and reviewers who contributed to the special issue's success. [Extracted from the article]

We survey the literature on the use of Benford's distribution digit analysis applied to COVID-19 case data reporting. We combine a bibliometric analysis of 32 articles with a survey of their content and findings. In spite of combined efforts from teams of researchers across multiple countries and universities, using large data samples from a multitude of sources, there is no emerging consensus on data misreporting. We believe we are nevertheless able to discern a faint pattern in the segregation of findings. The evidence suggests that studies using very large, aggregate samples and a methodology based on hypothesis testing are marginally more likely to identify significant deviations from Benford's distribution and to attribute this deviation to data tampering. Our results are far from conclusive and should be taken with a very healthy dose of skepticism. Academics and policymakers alike should remain mindful that the misreporting controversy is still far from being settled. [ABSTRACT FROM AUTHOR]

10.3390/math10091364 18 Wang Y., Yang L., Wu J., Song Z., Shi L. Mining Campus Big Data: Prediction of Career Choice Using Interpretable Machine Learning Method. 10.3390/math10193659 6 Cao X., Luo Q., Wu P. Filter-GAN: Imbalanced Malicious Traffic Classification Based on Generative Adversarial Networks with Filter. With the emergence of big data and the resulting information explosion, computational and mathematical methods provide effective tools to handle the vast amounts of data and information used in big data analytics, knowledge discovery and distillation, and decision-making for solving complex problems in the world. The results show that the feature image representation method can effectively characterize the original session traffic, and Filter-GAN can generate more efficient samples. [Extracted from the article]

Applied computing and artificial intelligence methods have been attracting growing interest in recent years due to their effectiveness in solving technical problems. Hao et al. [[14]] present an unsupervised fault diagnosis methodology to leverage the generated MPCs of different working conditions to diagnose the actual unlabeled MPCs. The paper by Ainapure et al. [[17]] proposes a new cross-domain fault diagnosis method with enhanced robustness. The paper by Saeed et al. [[1]] proposes an approach to building an AutoML data-dependent CNN model (DeepPCANet) customized for DR screening automatically. [Extracted from the article]

This document provides a summary of a special issue of the journal Mathematics, which features research papers in the field of algebraic, analytic, and computational number theory. The papers cover a wide range of topics, including generalized Lucas pseudoprimality, Fibonacci numbers, piecewise linear difference equations, properties of Euler's function, regularities in ordered semihypergroups, zero-density results for automorphic functions, properties of Fibonacci finite operator quaternions, and more. The authors of the special issue believe that the techniques used in these papers have the potential to yield new results in these areas of mathematics. [Extracted from the article]

The paper by Feng et al. [[11]] proposes an image encryption algorithm, IEA-IF-DLT, that utilizes plane-level image filtering and discrete logarithmic transformation to achieve a balance between security and efficiency. In the last few decades, the relationship between mathematics and algorithms has become increasingly important and influential in computer science. The scheme utilizes versatile bit-depth management, encrypting the most significant bits of each pixel with the AES-CTR cipher algorithm and embedding additional data in the least significant bit planes of the encrypted pixels using code division multiplexing. [Extracted from the article]

This paper undertakes a revisit of the sunk cost fallacy, which refers to the tendency of people to persist investing resources into something, even if it is destined to have no good outcome. We emphasize that the utilities associated with different alternatives are not static for decision makers, which is exactly opposite to the traditional perspective. This paper argues that the utility of an option may change due to the choice of another option, suggesting that decisions considered irrational by the traditional analytical method, i.e., sunk cost fallacy, may be rational. We propose a novel analytical method for decision making with sunk cost when considering the utility change and validate the effectiveness of this method through mathematical modeling and computational experiments. This paper mathematically describes such decision-making problems, analyzing the impact of changes in the utilities across different alternatives on decision making with a real-world example. Furthermore, we develop a two-stage stochastic optimization model for such decision-making problems and employ the sample average approximation (SAA) method to solve them. The results from computational experiments indicate that some decisions traditionally considered irrational are, in fact, rational when the utility of an option changes as a result of choosing another option. This paper, therefore, highlights the significance of incorporating utility changes into the decision-making process and stands as a valuable addition to the literature, offering a refreshed and effective decision-making method for improved decision making. [ABSTRACT FROM AUTHOR]

Most of the deep-learning algorithms on stock price volatility prediction in the existing literature use data such as same-frequency market indicators or technical indicators, and less consider mixed-frequency data, such as macro-data. Compared with the traditional model that only inputs the same-frequency data such as technical indicators and market indicators, this study proposes an improved deep-learning model based on mixed-frequency big data. This paper first introduces the reserve restricted mixed-frequency data sampling (RR-MIDAS) model to deal with the mixed-frequency data and, secondly, extracts the temporal and spatial features of volatility series by using the parallel model of CNN-LSTM and LSTM, and finally utilizes the Optuna framework for hyper-parameter optimization to achieve volatility prediction. For the deep-learning model with mixed-frequency data, its RMSE, MAE, MSLE, MAPE, SMAPE, and QLIKE are reduced by 18.25%, 14.91%, 30.00%, 12.85%, 13.74%, and 23.42%, respectively. This paper provides a more accurate and robust method for forecasting the realized volatility of stock prices under mixed-frequency data. [ABSTRACT FROM AUTHOR]

This document is a special issue of the journal Mathematics dedicated to recent advances in discrete optimization and scheduling. The issue includes 10 papers covering a range of topics such as batch loading and scheduling, optimization algorithms, scheduling surgeries, routing problems, and mathematical models for simplification. The papers present various approaches and algorithms for solving these problems, and they have been reviewed by experts in the field. The authors express their gratitude to the contributors, reviewers, and editorial staff, and hope that the readers will find stimulating ideas for further research in this area. [Extracted from the article]

Investigating the research trends within a scientific domain by analyzing semantic information extracted from scientific journals has been a topic of interest in the natural language processing (NLP) field. A research trend evaluation is generally based on the time evolution of the term occurrence or the term topic, but it neglects an important aspect—research publication latency. The average time lag between the research and its publication may vary from one month to more than one year, and it is a characteristic that may have significant impact when assessing research trends, mainly for rapidly evolving scientific areas. To cope with this problem, the present paper is the first work that explicitly considers research publication latency as a parameter in the trend evaluation process. Consequently, we provide a new trend detection methodology that mixes auto-ARIMA prediction with Mann–Kendall trend evaluations. The experimental results in an electronic design automation case study prove the viability of our approach. [ABSTRACT FROM AUTHOR]

This paper strives to achieve a comprehensive review of chaos in analog circuits and lumped electronic networks. Readers will be guided from the beginning of the investigations of simple electronic circuits to the current trends in the research into chaos. The author tries to provide the key references related to this issue, including papers describing modern numerical algorithms capable of localizing chaotic and hyperchaotic motion in complex mathematical models, interesting full on-chip implementations of chaotic systems, possible practical applications of entropic signals, fractional-order chaotic systems and chaotic oscillators with mem-elements. [ABSTRACT FROM AUTHOR]

We study the problem of controllable citation text generation by introducing a new concept to generate citation texts. Citation text generation, as an assistive writing approach, has drawn a number of researchers' attention. However, current research related to citation text generation rarely addresses how to generate the citation texts that satisfy the specified citation intents by the paper's authors, especially at the beginning of paper writing. We propose a controllable citation text generation model that extends a pre-trained sequence to sequence models, namely, BART and T5, by using the citation intent as the control code to generate the citation text, meeting the paper authors' citation intent. Experimental results demonstrate that our model can generate citation texts semantically similar to the reference citation texts and satisfy the given citation intent. Additionally, the results from human evaluation also indicate that incorporating the citation intent may enable the models to generate relevant citation texts almost as scientific paper authors do, even when only a little information from the citing paper is available. [ABSTRACT FROM AUTHOR]

Mathematical data science combines mathematical techniques with data science methods to extract insights from data. It involves working with data at all stages of the data life cycle and using various tools and techniques to analyze data. This field is applied in business, industry, and medicine to make predictions, identify patterns, and draw conclusions from data. The special issue of Mathematics presents ten papers that showcase innovative mathematical data science techniques in solving complex problems across different domains. These papers cover topics such as modeling failure times, time series analysis, process capability indices, control charts, internet usage monitoring, and more. The authors emphasize the importance of integrating advanced mathematical techniques with emerging technologies to drive innovation in data science. [Extracted from the article]

The administration of A/B exams usually involves the use of items. Issues arise when the pre-establishment of a question bank is necessary and the inconsistency in the knowledge points to be tested (in the two exams) reduces the exams 'fairness'. These are critical for a large multi-teacher course wherein the teachers are changed such that the course and examination content are altered every few years. However, a fair test with randomly participating students should still be a guaranteed subject with no item pool. Through data-driven decision-making, this study collected data related to a term test for a compulsory general course for empirical assessments, pre-processed the data and used item response theory to statistically estimate the difficulty, discrimination and lower asymptotic for each item in the two exam papers. Binary goal programing was finally used to analyze and balance the fairness of A/B exams without an item pool. As a result, pairs of associated questions in the two exam papers were optimized in terms of their overall balance in three dimensions (as the goals) through the paired exchanges of items. These exam papers guarantee their consistency (in the tested knowledge points) and also ensure the fairness of the term test (a key psychological factor that motivates continued studies). Such an application is novel as the teacher(s) did not have a pre-set question bank and could formulate the fairest strategy for the A/B exam papers. The model can be employed to address similar teaching practice issues. [ABSTRACT FROM AUTHOR]

In order to address the challenge of the small-scale, small-target, and complex scenes often encountered in offshore remote sensing image datasets, this paper employs an interpolation method to achieve super-resolution-assisted target detection. This approach aligns with the logic of popular GANs and generative diffusion networks in terms of super-resolution but is more lightweight. Additionally, the image count is expanded fivefold by supplementing the dataset with DOTA and data augmentation techniques. Framework-wise, based on the Faster R-CNN model, the combination of a residual backbone network and pyramid balancing structure enables our model to adapt to the characteristics of small-target scenarios. Moreover, the attention mechanism, random anchor re-selection strategy, and the strategy of replacing quantization operations with bilinear interpolation further enhance the model's detection capability at a low cost. Ablation experiments and comparative experiments show that, with a simple backbone, the algorithm in this paper achieves a mAP of 71.2% on the dataset, an improvement in accuracy of about 10% compared to the Faster R-CNN algorithm. [ABSTRACT FROM AUTHOR]

Time-of-use pricing of electric energy, as an important part of the national policy of energy conservation and emission reduction, requires accurate electric energy data as support. However, due to various reasons, the electric energy data are often missing. To address this thorny problem, this paper constructs a CNN and GRU-based recovery model (RCNN-BiGRU) for electric energy data by taking the missing data as the output and the historical data of the neighboring moments as the input. Firstly, a convolutional network with a residual structure is used to capture the local dependence and periodic patterns of the input data, and then a bidirectional GRU network utilizes the extracted potential features to model the temporal relationships of the data. Aiming at the difficult selection of network structure parameters and training process parameters, an accelerated adaptive differential evolution (AADE) algorithm is proposed to optimize the electrical energy data recovery model. The algorithm designs an accelerated mutation operator and at the same time adopts an adaptive strategy to set the two key parameters. A large amount of real grid data are selected as samples to train the network, and the comparison results verify that the proposed combined model outperforms the related CNN and GRU networks. The comparison experimental results with other optimization algorithms also show that the AADE algorithm proposed in this paper has better data recovery performance on the training set and significantly better performance on the test set. [ABSTRACT FROM AUTHOR]

Most image quality assessment (IQA) algorithms based on sparse representation primarily focus on amplitude information, often overlooking the structural composition of images. However, structural composition is closely linked to perceived image quality, a connection that existing methods do not adequately address. To fill this gap, this paper proposes a novel distorted-image quality assessment algorithm based on a sparse structure and subjective perception (IQA-SSSP). This algorithm evaluates the quality of distorted images by measuring the sparse structure similarity between a reference and distorted images. The proposed method has several advantages. First, the sparse structure algorithm operates with reduced computational complexity, leading to faster processing speeds, which makes it suitable for practical applications. Additionally, it efficiently handles large-scale data, further enhancing the assessment process. Experimental results validate the effectiveness of the algorithm, showing that it achieves a high correlation with human visual perception, as reflected in both objective and subjective evaluations. Specifically, the algorithm yielded a Pearson correlation coefficient of 0.929 and a mean squared error of 8.003, demonstrating its robustness and efficiency. By addressing the limitations of existing IQA methods and introducing a more holistic approach, this paper offers new perspectives on IQA. The proposed algorithm not only provides reliable quality assessment results but also closely aligns with human visual experience, thereby enhancing both the objectivity and accuracy of image quality evaluations. This research offers significant theoretical support for the advancement of sparse representation in IQA. [ABSTRACT FROM AUTHOR]

This document is an editorial for a special issue of the journal Mathematics titled "Differential Equations of Mathematical Physics and Related Problems of Mechanics." The special issue covers a range of topics related to differential equations in mathematical physics and mechanics, including wave equations, spectral theory, scattering, and inverse problems. The editorial provides a summary of the published papers in the special issue, highlighting their contributions to the field. The document emphasizes the importance of the special issue in covering both applied and fundamental aspects of mathematics, physics, and their applications in various fields. The author expresses gratitude to the authors, reviewers, assistants, associate editors, and editors for their contributions to the special issue. The report does not provide specific details about the content of the papers or the nature of the special issue. [Extracted from the article]

The paper authored by Alkahtani [[8]] formulates mathematical models and provides an optimization algorithm for process outsourcing, considering imperfect production with variable quantities for effective supply chain management. The WPP-SCND decision system minimizes the total supply chain (SC) cost of the system while also reducing carbon emissions associated with wood pellet SC activities. In the last decade, the Industrial Revolution 4.0 brought flexible supply chains and flexible design projects to the fore. [Extracted from the article]

The paper by K. Zhang et al. [[6]] studies calcium leaching in hydraulics applications, formulated as an inverse problem, which is studied using genetic algorithms and the finite element method. The continuing achievements in Information Technology and Computer science in recent decades provide new tools for engineers in the design of devices and systems, with significant advances both in numerical and in analytical methods of analysis. 10.3390/math10101619 3 Feng F., Yuan M., Xia Y., Xu H., Feng P., Li X. Roughness Scaling Extraction Accelerated by Dichotomy-Binary Strategy and Its Application to Milling Vibration Signal. [Extracted from the article]

The study introduces a novel approach to identify potential citation manipulation within academic papers. This method utilizes perturbations of a deep embedding model, integrating Graph-Masked Autoencoders to merge textual information with evidence of graph connectivity. Consequently, it yields a more intricate model of citation distribution. By training a deep network with partial data and reconstructing masked connections, the approach capitalizes on the inherent characteristics of central connections amidst network perturbations. It demonstrates its ability to pinpoint trustworthy citations within the analyzed dataset through comprehensive quantitative evaluations. Additionally, it raises concerns regarding the reliability of specific references, which may be subject to manipulation. [ABSTRACT FROM AUTHOR]

This paper presents our research on a traffic signal control system (TSCS) at V2X intersections. The overall objective of the study is to create an implementable TSCS. The specific objective of this paper is to investigate a distributed system towards implementation. The objective function of minimizing queue delay is formulated as the integral of queue lengths. The discrete queueing estimation is mixed with macro and micro traffic flow models. The novel proposed architecture alleviates the communication network bandwidth constraint by processing BSMs and computing queue lengths at the local intersection. In addition, a two-stage distributed system is designed to optimize offsets, splits, and cycle length simultaneously and in real time. The paper advances TSCS theories by contributing a novel analytic formulation of delay functions and their first degree of derivatives for a two-stage optimization model. The open-source traffic simulation engine Enhanced Transportation Flow Open-Source Microscopic Model (ETFOMM version 1.2) was selected as a simulation environment to develop, debug, and evaluate the models and the system. The control delay of the major direction, minor direction, and the total network were collected to assess the system performance. Compared with the optimized TSCS timing plan by the Virginia Department of Transportation, the system generated a 21% control delay reduction in the major direction and a 7% control delay reduction in the minor direction at just a 10% penetration rate of connected vehicles. Finally, the proposed distributed and centralized systems present similar performances in the case study. [ABSTRACT FROM AUTHOR]

This paper examines the added value of a digital tool that constitutes a new model to introduce students to multiplication. Drawing on the theory of semiotic mediation, the semiotic potential of this new model is analysed with respect to the same task that can be solved in two different settings (the digital tool and pencil and paper). The analysis shows that the task solutions undergo significant changes depending on to the technological settings. Even though the end product of the model–task dyads might look the same in both settings, the product emerges from the different processes that would mediate quite different meanings for multiplication. This suggests that while designing tasks that involve mathematical models, rather than focusing only on the end product, considering the whole process would reveal the extensive potential meanings the model–task dyad can mediate. [ABSTRACT FROM AUTHOR]

A. Montisci, S. Cargangiu, G. Sias, B. Cannas and A. Fanni, in [[16]], present a real time bolometer tomographic reconstruction algorithm in nuclear fusion reactors based on the combination of highly correlated grid elements to yield a square coefficient matrix with sufficiently low condition number. The procedure was derived from the polynomial reproduction properties satisfied by the Hermite splines without requiring the explicit construction/evaluation of the basic functions. The paper authored by Y.E. Shao and S.C. Lin [[1]] presents an innovative time-delay neural network-based classifier to diagnose the quality variables that cause out-of-control signals for a normal multivariate process with variance shifts. It is now clear that cooperation between academia and industries is crucial for social, cultural, technological and economic progress and innovation. [Extracted from the article]

This document is a preface to a special issue of the journal Mathematics titled "State-of-the-Art Mathematical Applications in Europe." The special issue features twelve original research papers and one review paper from European researchers and their collaborators in various fields of mathematics. The papers cover topics such as mathematical physics, applied mathematics, algebra, navigation algorithms, decision-making models, Lagrange interpolation polynomials, and nonlinear fractional differential equations. The preface provides a brief overview of each paper and expresses gratitude to the authors and reviewers. The special issue has received significant interest and demonstrates the importance of open access research in applied mathematics. [Extracted from the article]

Accurately predicting the trajectory of carbon emissions is vital for achieving a sustainable shift toward a green and low-carbon future. Hence, this paper created a novel model to examine the driver analysis and integrated prediction for Chinese carbon emission, a large carbon-emitting country. The logarithmic mean divisia index (LMDI) approach initially served to decompose the drivers of carbon emissions, analyzing the annual and staged contributions of these factors. Given the non-stationarity and non-linear characteristics in the data sequence of carbon emissions, a decomposition–integration prediction model was proposed. The model employed the empirical mode decomposition (EMD) model to decompose each set of data into a series of components. The various carbon emission components were anticipated using the long short-term memory (LSTM) model based on the deconstructed impacting factors. The aggregate of these predicted components constituted the overall forecast for carbon emissions. The result indicates that the EMD-LSTM model greatly decreased prediction errors over the other comparable models. This paper makes up for the gap in existing research by providing further analysis based on the LMDI method. Additionally, it innovatively incorporates the EMD method into the carbon emission study, and the proposed EMD-LSTM prediction model effectively addresses the volatility characteristics of carbon emissions and demonstrates excellent predictive performance in carbon emission prediction. [ABSTRACT FROM AUTHOR]

The question of whether there is a true isometry that approximates the ε -isometry defined on a bounded set has long interested mathematicians. The first paper on this topic was published by Fickett, whose result was subsequently greatly improved by Alestalo et al., Väisälä and Vestfrid. Recently, the authors published some papers improving the previous results. The main purpose of this paper is to improve all of the abovementioned results by utilizing the properties of the norm and inner product for Euclidean space. [ABSTRACT FROM AUTHOR]

The rapid development of supply chain finance (SCF) has significantly alleviated the financing difficulties of small and medium-sized enterprises (SMEs). However, it is important to recognize that within the accounts receivable financing segment of the SCF credit market, the credit risk associated with SMEs poses a serious challenge and potential threat to the stability, health, and sustainable development of the SCF system. This paper pays special attention to the stability of the two-party evolutionary game between SMEs and financial institutions (FIs) within the context of the Chinese SCF credit market. To identify a pathway to reduce credit risks for SMEs while simultaneously enhancing system stability, this paper adopts the stochastic evolutionary game (SEG) model and combines the fixed-point method to determine the conditions that satisfy the stability of the system's index p mean square of the system. This study has made attempts in various aspects, such as the innovative construction and investigation of a nonlinear SEG model, the endeavor to study the stability of SEG systems using fixed-point methods, and the innovative construction of a more realistic two-player SEG system. The data and simulation results generated from hypothetical scenarios show that the conclusions of the article are credible and feasible. Through the study, we conclude that the higher credit ratio from FI and the higher penalty intensity from core enterprises (CEs) will accelerate the stability of the system. Based on solid data and modeling analysis, insights into the regulation of FI are provided. [ABSTRACT FROM AUTHOR]

Health status detection for motor drive systems includes detecting the working status of the motor and diagnosing open-circuit (OC) faults in the inverter. This paper proposes a generalized-layer-added principle component analysis (GPCA) to determine the load-up/load-shedding status of a motor and diagnose faults in its inverter. Most current methods for detecting OC faults are constrained by changes in the current amplitude and frequency, potentially leading to misjudgments during load-up/load-shedding transient states. The proposed method addresses this issue. Initially, this paper employs a homogenization method to process current data, eliminating the impact of transient processes during motor load-up/load-shedding states on inverter fault diagnosis. Subsequently, the fast Fourier transform (FFT) is used to extract the frequency domain characteristics of the data. If the PCA method is trained with a singular matrix, this can lead to an unreliable result. This paper introduces a generalization layer based on the PCA method, leading to the GPCA method, which enables training with singular matrices. The GPCA method is then developed to compute data features. By presetting thresholds and utilizing the prediction error value and contribution rate index of the GPCA method, the relevant state of the motor drive system can be determined. Finally, through simulations and experiments, it has been demonstrated that the method, using data from the stable working state, can effectively detect the working status of a motor and diagnose OC faults in its inverter, with a diagnostic time of 0.05 current cycles. [ABSTRACT FROM AUTHOR]

The prediction of the ultimate bearing capacity (UBC) of composite foundations represents a critical application of test monitoring data within the field of intelligent geotechnical engineering. This paper introduces an effective combinational prediction algorithm, namely SA-IRMO-BP. By integrating the Improved Radial Movement Optimization (IRMO) algorithm with the simulated annealing (SA) algorithm, we develop a meta-heuristic optimization algorithm (SA-IRMO) to optimize the built-in weights and thresholds of backpropagation neural networks (BPNN). Leveraging this integrated prediction algorithm, we forecast the UBC of soil–cement mixed (SCM) pile composite foundations, yielding the following performance metrics: RMSE = 3.4626, MAE = 2.2712, R = 0.9978, VAF = 99.4339. These metrics substantiate the superior predictive performance of the proposed model. Furthermore, we utilize two distinct datasets to validate the generalizability of the prediction model presented herein, which carries significant implications for the safety and stability of civil engineering projects. [ABSTRACT FROM AUTHOR]

This paper proposes an improved dual-center particle swarm optimization (IDCPSO) algorithm which can effectively improve some inherent defects of particle swarm optimization algorithms such as being prone to premature convergence and low optimization accuracy. Based on the in-depth analysis of the velocity updating formula, the most innovative feature is the vectorial decomposition of the velocity update formula of each particle to obtain three different flight directions. After combining these three directions, six different flight paths and eight intermediate positions can be obtained. This method allows the particles to search for the optimal solution in a wider space, and the individual extreme values are greatly improved. In addition, in order to improve the global extreme value, it is designed to construct the population virtual center and the optimal individual virtual center by using the optimal position and the current position searched by the particle. Combining the above strategies, an adaptive mutation factor that accumulates the coefficient of mutation according to the number of iterations is added to make the particle escape from the local optimum. By running the 12 typical test functions independently 50 times, the results show an average improvement of 97.9% for the minimum value and 97.7% for the average value. The IDCPSO algorithm in this paper is better than other improved particle swarm optimization algorithms in finding the optimum. [ABSTRACT FROM AUTHOR]

Self-supervised learning is a new machine learning method that does not rely on manually labeled data, and learns from rich unlabeled data itself by designing agent tasks using the input data as supervision to obtain a more generalized representation for application in downstream tasks. However, the current self-supervised learning suffers from the problem of relying on the selection and number of negative samples and the problem of sample bias phenomenon after graph data augmentation. In this paper, we investigate the above problems and propose a corresponding solution, proposing a graph contrastive learning algorithm without negative samples. The model uses matrix sketching in the implicit space for feature augmentation to reduce sample bias and iteratively trains the mutual correlation matrix of two viewpoints by drawing closer to the distance of the constant matrix as the objective function. This method does not require techniques such as negative samples, gradient stopping, and momentum updating to prevent self-supervised model collapse. This method is compared with 10 graph representation learning algorithms on four datasets for node classification tasks, and the experimental results show that the algorithm proposed in this paper achieves good results. [ABSTRACT FROM AUTHOR]

In this paper, we address scheduling methods for queue stabilization and appropriate power allocation techniques in downlink dense user-centric scalable cell-free multiple-input multiple-output (CF-MIMO) networks. Scheduling is performed by the central processing unit (CPU) scheduler using Lyapunov optimization for queue stabilization. In this process, the drift-plus-penalty is utilized, and the control parameter V serves as the weighting factor for the penalty term. The control parameter V is fixed to achieve queue stabilization. We introduce the dynamic V method, which adaptively selects the control parameter V considering the current queue backlog, arrival rate, and effective rate. The dynamic V method allows flexible scheduling based on traffic conditions, demonstrating its advantages over fixed V scheduling methods. In cases where UEs scheduled with dynamic V exceed the number of antennas at the access point (AP), the semi-orthogonal user selection (SUS) algorithm is employed to reschedule UEs with favorable channel conditions and orthogonality. Dynamic V shows the best queue stabilization performance across all traffic conditions. It shows a 10% degraded throughput performance compared to V = 10,000. Max-min fairness (MMF), sum SE maximization, and fractional power allocation (FPA) are widely considered power allocation methods. However, the power allocation method proposed in this paper, combining FPA and queue-based FPA, achieves up to 60% better queue stabilization performance compared to MMF. It is suitable for systems requiring low latency. [ABSTRACT FROM AUTHOR]

The level of difficulty of mathematical test items is a critical aspect for evaluating test quality and educational outcomes. Accurately predicting item difficulty during test creation is thus significantly important for producing effective test papers. This study used more than ten years of content and score data from China's Henan Provincial College Entrance Examination in Mathematics as an evaluation criterion for test difficulty, and all data were obtained from the Henan Provincial Department of Education. Based on the framework established by the National Center for Education Statistics (NCES) for test item assessment methodology, this paper proposes a new framework containing eight features considering the uniqueness of mathematics. Next, this paper proposes an XGBoost-based SHAP model for analyzing the difficulty of mathematics tests. By coupling the XGBoost method with the SHAP method, the model not only evaluates the difficulty of mathematics tests but also analyzes the contribution of specific features to item difficulty, thereby increasing transparency and mitigating the "black box" nature of machine learning models. The model has a high prediction accuracy of 0.99 for the training set and 0.806 for the test set. With the model, we found that parameter-level features and reasoning-level features are significant factors influencing the difficulty of subjective items in the exam. In addition, we divided senior secondary mathematics knowledge into nine units based on Chinese curriculum standards and found significant differences in the distribution of the eight features across these different knowledge units, which can help teachers place different emphasis on different units during the teaching process. In summary, our proposed approach significantly improves the accuracy of item difficulty prediction, which is crucial for intelligent educational applications such as knowledge tracking, automatic test item generation, and intelligent paper generation. These results provide tools that are better aligned with and responsive to students' learning needs, thus effectively informing educational practice. [ABSTRACT FROM AUTHOR]

This document discusses the challenges faced in mathematical modeling and controlling COVID-19 epidemics. It highlights the global impact of the pandemic on the economy and health, as well as the uneven effects on different age groups. The availability of vaccines led to mass vaccination campaigns, prompting researchers to implement new strategies and innovative approaches. The document also mentions various journals that have published special issues on COVID-19, covering topics such as forecasting, vaccination strategies, and control measures. The special issue presented in this document consists of eleven papers that analyze clinical characteristics, variant spread, economic recovery, mortality rates, non-pharmaceutical interventions, and coordinated actions. The papers propose mathematical models and control strategies to minimize disease spread and prioritize vaccination. The document emphasizes the multidisciplinary nature of the research, involving fields such as applied mathematics, data science, engineering, biology, and economics. Overall, this special issue provides valuable insights into the mathematical modeling and control of COVID-19 epidemics. [Extracted from the article]

In this paper, we construct an academic literature knowledge graph based on the relationship between documents to facilitate the storage and research of academic literature data. Keywords are an important type of node in the knowledge graph. To solve the problem that there are no keywords in some documents for several reasons in the process of knowledge graph construction, an improved keyword extraction algorithm called TP-CoGlo-TextRank is proposed by using word frequency, position, word co-occurrence frequency, and a word embedding model. By combining the word frequency and position in the document, the importance of words is distinguished. By introducing the GloVe word-embedding model, which brings the external knowledge of documents into the TextRank algorithm, and combining the internal word co-occurrence frequency in the documents, the word-adjacency relationship is transferred non-uniformly. Finally, the words with the highest scores are combined into phrases if they are adjacent in the original text. The validity of the TP-CoGlo-TextRank algorithm is verified by experiments. On this basis, the Neo4j graph database is used to store and display the academic literature knowledge graph, to provide data support for research tasks such as text clustering, automatic summarization, and question-answering systems. [ABSTRACT FROM AUTHOR]

Techniques applied for the analytical modeling span from integral equation/differential equation-based methods to the generalized separation of variables and Fourier and eigenfunction series expansions, as well as to Galerkin-type methods. The paper co-authored by Golub and Doroshenko [[5]] develops a boundary integral equation method, by employing the Hankel transform of Green's matrices, for modelling wave scattering and analysis of the eigenfrequencies of circular, partially closed interface delaminations between dissimilar media. An integral equation is obtained by imposing the impedance boundary condition on the disk surface, assuming the graphene surface conductivity is given by the Kubo formalism. Boundary value problems (BVPs) pertaining to scattering and radiation by devices that support novel wave phenomena are of primary importance in applied and computational mathematics, computational physics and engineering. [Extracted from the article]

The time and spatial complexities are HT ht and HT ht , respectively. Published Papers This is a Special Issue of I Mathematics i belonging to the section "Mathematics and Computer Science", which was closed on 30 June 2022. This Special Issue was mainly concerned with quantum algorithms, the mathematics underlying them, and those complexity issues arising from them. [Extracted from the article]

With the development of the Internet, the types and quantities of malware have grown rapidly, and how to identify unknown malware is becoming a new challenge. The traditional malware detection method based on fixed features is becoming more and more difficult. In order to improve detection accuracy and efficiency for mobile terminals, this paper proposed a malware detection method for mobile terminals based on application programming interface (API) call sequence, which was characterized by the API call sequence and used a series of feature preprocessing techniques to remove redundant processing of the API call sequence. Finally, the recurrent neural network method (RNN) was used to build the model and perform detection and verification. Furthermore, this paper constructed a malware detection model based on a two-way recurrent neural network and used the two-way long short-term memory network model (LSTM) to train the data set containing 5986 malware samples and 5065 benign software samples to obtain the final detection model and its parameters. Finally, the feature vector of the APK file to be detected was passed into the model and obtained the detection results. The experimental results indicated that the detection accuracy of this method can reach 93.68%. [ABSTRACT FROM AUTHOR]

With continuous progress in science and technology, a large amount of data are produced in all fields of the world at anytime and anywhere. These data are unmarked and lack marking information, while manual marking is time-consuming and laborious. Herein, this paper introduces a distributed semi-supervised labeling framework. This framework addresses the issue of missing data by proposing an attribute-filling method based on subspace learning. Furthermore, this paper presents a distributed semi-supervised learning strategy that trains sub-models (private models) within each sub-system. Finally, this paper develops a distributed graph convolutional neural network fusion technique with enhanced interpretability grounded on the attention mechanism. This paper assigns weights of importance to the edges of each layer in the graph neural network based on sub-models and public data, thereby enabling distributed and interpretable graph convolutional attention. Extensive experimentation using public datasets demonstrates the superiority of the proposed scheme over other state-of-the-art baselines, achieving a reduction in loss of 50% compared to the original approach. [ABSTRACT FROM AUTHOR]

10.3390/math9172145 12 Oros G.I. Fuzzy Differential Subordinations Obtained Using a Hypergeometric Integral Operator. In accordance with Zadeh's definition, soft computing (SC) consists of computational techniques in computer science, machine learning, and some engineering disciplines to study, model, and analyze very complex realities, for which more traditional methods have been either unusable or inefficient. HC is bound by a computer science (CS) concept called NP-complete, which means that there is a direct connection between the size of a problem and the amount of resources needed to solve it called the "grand challenge problem". SC uses soft techniques, contrasting it with classical artificial intelligence hard computing (HC) techniques, and includes fuzzy logic, neural computing, evolutionary computation, machine learning, and probabilistic reasoning. [Extracted from the article]

The problem of information security and copyright protection of video is becoming increasingly prominent. The current video watermarking algorithm does not have strong anti-compression, which has a significant impact on the visual effect of video. To solve this problem, this paper proposes a video watermarking algorithm based on H.264/AVC. The algorithm combines the non-zero quantization coefficient and the energy factor to select the appropriate chroma subblock, and then an optimized modulation is designed to embed the watermark into its DCT quantization coefficients in order to minimize the number of modifications of the subblocks. The invisibility and robustness experiments of the algorithm are conducted in the paper, and the Structural Similarity Indexes are above 0.99, and the False Bit Rates are all below 0.03. The results show that the algorithm has good invisibility, anti-compression performance and obvious advantages compared with other similar methods. [ABSTRACT FROM AUTHOR]

Motivated by recent investigations relating the sharpness of the Jensen inequality, this paper concerns with the sharpness of the converse of the Jensen inequality. For this reason, the Jensen inequality has become one of the most discussed developmental inequalities in the current literature on mathematical inequalities. In this Special Issue, we present new results related to classical inequalities, such as the Jensen inequality, Jensen-Steffensen inequality, Jessen inequality, Grüss inequality, Chebyshev inequality, etc. [Extracted from the article]