Search

The traditional method for transformer moisture diagnosis is to establish empirical equations between feature parameters extracted from frequency domain spectroscopy (FDS) and the transformer’s moisture content. However, the established empirical equation may not be applicable to a novel testing environment, resulting in an unreliable evaluation result. In this regard, it is acknowledged that FDS combined with machine learning is more suitable for estimating moisture content in a variety of test environments. Nonetheless, the accuracy of the estimation results obtained using the existing method is limited by the algorithm’s inability to generalize. To address this issue, we propose an AdaBoost algorithm-enhanced back-propagation neural network (BP_AdaBoost). This study creates a database by extracting feature parameters from the FDS that characterize the insulation states of the prepared samples. Then, using the BP_AdaBoost algorithm and the newly constructed database, the moisture estimation models are trained. Finally, the results of the estimation are discussed in terms of laboratory and field transformers. By comparing the proposed BP_AdaBoost algorithm to other intelligence algorithms, it is demonstrated that it not only performs better in generalization, but also maintains a high level of accuracy. [ABSTRACT FROM AUTHOR]

This article points out some of the shortcomings of a paper by Ceballos et al. In particular, representations of the indecomposable six‐dimensional complex nilpotent Lie algebras are corrected. In addition, the class of representations is extended so as to include all the indecomposable six‐dimensional real nilpotent Lie algebras. A test case is studied in detail in which it is shown that there is no representation of one of the six‐dimensional real nilpotent Lie algebras using 5 × 5 matrices. This test case points up some of the severe difficulties that one will encounter when implementing an algorithm such as the one developed by Ceballos et al. The case of the seven‐dimensional complex nilpotent Lie algebras is briefly touched upon and several representations are corrected. [ABSTRACT FROM AUTHOR]

Truck hoisting detection constitutes a key focus in port security, for which no optimal resolution has been identified. To address the issues of high costs, susceptibility to weather conditions, and low accuracy in conventional methods for truck hoisting detection, a non-intrusive detection approach is proposed in this paper. The proposed approach utilizes a mathematical model and an extreme gradient boosting (XGBoost) model. Electrical signals, including voltage and current, collected by Hall sensors are processed by the mathematical model, which augments their physical information. Subsequently, the dataset filtered by the mathematical model is used to train the XGBoost model, enabling the XGBoost model to effectively identify abnormal hoists. Improvements were observed in the performance of the XGBoost model as utilized in this paper. Finally, experiments were conducted at several stations. The overall false positive rate did not exceed 0.7% and no false negatives occurred in the experiments. The experimental results demonstrated the excellent performance of the proposed approach, which can reduce the costs and improve the accuracy of detection in container hoisting. [ABSTRACT FROM AUTHOR]

In this paper, an analysis of a mathematical model of the coronavirus is carried out by using two fractal-fractional parameters. This dangerous virus infects a person through the mouth, eyes, nose or hands. This makes it so dangerous that no one can get rid of it. One of the main factors contributing to increasing infections of this deadly virus is crowding. We believe that it is necessary to model this effect mathematically to predict the possible outcomes. Hence, the study of neural network-based models related to the spread of this virus can yield new results. This paper also introduces the use of artificial neural networks (ANNs) to approximate the solutions, which is a significant contribution in this regard. We suggest employing this new method to solve a system of integral equations that explain the dynamics of infectious diseases instead of the classical numerical methods. Our study shows that, compared to the Adams-Bashforth algorithm, the ANN is a reliable candidate for solving the problems. [ABSTRACT FROM AUTHOR]

In this paper, we demonstrate that the relation between two jobs defined by min{ai, bj} ≤ min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct. [ABSTRACT FROM AUTHOR]

Evaluating the impact of a scholarly article is of great significance and has attracted great attentions. Although citation-based evaluation approaches have been widely used, these approaches face limitations e.g. in identifying anomalous citations patterns. This negligence would inevitably cause unfairness and inaccuracy to the article impact evaluation. In this study, in order to discover the anomalous citations and ensure the fairness and accuracy of research outcome evaluation, we investigate the citation relationships between articles using the following factors: collaboration times, the time span of collaboration, citing times and the time span of citing to weaken the relationship of Conflict of Interest (COI) in the citation network. Meanwhile, we study a special kind of COI, namely suspected COI relationship. Based on the COI relationship, we further bring forward the COIRank algorithm, an innovative scheme for accurately assessing the impact of an article. Our method distinguishes the citation strength, and utilizes PageRank and HITS algorithms to rank scholarly articles comprehensively. The experiments are conducted on the American Physical Society (APS) dataset. We find that about 80.88% articles contain contributed citations by co-authors in 26,366 articles and 75.55% articles among these articles are cited by the authors belonging to the same affiliation, indicating COI and suspected COI should not be ignored for evaluating impact of scientific papers objectively. Moreover, our experimental results demonstrate COIRank algorithm significantly outperforms the state-of-art solutions. The validity of our approach is verified by using the probability of Recommendation Intensity. [ABSTRACT FROM AUTHOR]

Purpose. As a scientific field, bioinformatics has drawn remarkable attention from various fields, such as information technology, mathematics, and modern biological sciences, in recent years. The topic models originating from the field of natural language processing have become the focus of attention with the rapid accumulation of biological datasets. Thus, this research is aimed at modeling the topic content of the bioinformatics literature presented by Iranian researchers in the Scopus Citation Database. Methodology. This research was a descriptive-exploratory study, and the studied population included 3899 papers indexed in the Scopus database, which had been indexed in this database until March 9, 2022. The topic modeling was then performed on the abstracts and titles of the papers. A combination of LDA and TF-IDF was utilized for topic modeling. Findings. The data analysis with topic modeling resulted in identifying seven main topics "Molecular Modeling," "Gene Expression," "Biomarker," "Coronavirus," "Immunoinformatics," "Cancer Bioinformatics," and "Systems Biology." Moreover, "Systems Biology" and "Coronavirus" had the largest and smallest clusters, respectively. Conclusion. The present investigation demonstrated an acceptable performance for the LDA algorithm in classifying the topics included in this field. The extracted topic clusters indicated excellent consistency and topic connection with each other. [ABSTRACT FROM AUTHOR]

Detecting small targets and handling target occlusion and overlap are critical challenges in weld defect detection. In this paper, we propose the S-YOLO model, a novel weld defect detection method based on the YOLOv8-nano model and several mathematical techniques, specifically tailored to address these issues. Our approach includes several key contributions. Firstly, we introduce omni-dimensional dynamic convolution, which is sensitive to small targets, for improved feature extraction. Secondly, the NAM attention mechanism enhances feature representation in the region of interest. NAM computes the channel-wise and spatial-wise attention weights by matrix multiplications and element-wise operations, and then applies them to the feature maps. Additionally, we replace the SPPF module with a context augmentation module to improve feature map resolution and quality. To minimize information loss, we utilize Carafe upsampling instead of the conventional upsampling operations. Furthermore, we use a loss function that combines IoU, binary cross-entropy, and focal loss to improve bounding box regression and object classification. We use stochastic gradient descent (SGD) with momentum and weight decay to update the parameters of our model. Through rigorous experimental validation, our S-YOLO model demonstrates outstanding accuracy and efficiency in weld defect detection. It effectively tackles the challenges of small target detection, target occlusion, and target overlap. Notably, the proposed model achieves an impressive 8.9% improvement in mean Average Precision (mAP) compared to the native model. [ABSTRACT FROM AUTHOR]

Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). To evaluate FSAs effectively, controlled environments are required, and the use of synthetic datasets offers significant advantages. We introduce a set of ten synthetically generated datasets with known relevance, redundancy, and irrelevance of features, derived from various mathematical, logical, and geometric sources. Additionally, eight FSAs are evaluated on these datasets based on their relevance and novelty. The paper first introduces the datasets and then provides a comprehensive experimental analysis of the performance of the selected FSAs on these datasets including testing the FSAs' resilience on two types of induced data noise. The analysis has guided the grouping of the generated datasets into four groups of data complexity. Lastly, we provide public access to the generated datasets to facilitate bench-marking of new feature selection algorithms in the field via our Github repository. The contributions of this paper aim to foster the development of novel feature selection algorithms and advance their study. [ABSTRACT FROM AUTHOR]

The multi-objective optimisation of high-speed rail profile with small radius curve is studied in the paper. A multi-objective mathematical model for rail profile optimisation of high-speed railway is established. The CN60 rail profile is parameterised into a series of generalised functions of design variables. In order to guarantee the smoothness of the rail profile and meet the maximum grinding depth of rail in China, the constraints are employed. The wheel-rail vertical clearance and equivalent conicity of wheelset are taken as objective functions, and a rail wear prediction programme is compiled. Contact line method is employed to complete the detection algorithm of wheel-rail contact points. Finally, NSGA-II Algorithm is adopted to solve the Pareto-optimal front of the optimisation model. A set of solutions are retrieved from the Pareto optimal front solution as the optimised profile. The optimised rail profile and the original rail profile are matched with the LMA wheel profile (a certain worn type of wheel profiles for EMU in China) respectively. It is testified that the rail profile could effectively reduce the rail wear and improve curving performance. The new method proposed in this paper can provide some reference for the optimisation design of high-speed rail profile with small radius curve. [ABSTRACT FROM AUTHOR]

This paper reflects on the paradigmatic assumptions and ideologies that have shaped algorithmic management research. We identify two sets of assumptions: one about the "ontology of algorithms" (which holds that human resource management [HRM] algorithms are non‐human entities with material agency) and one about the "ontology of management" that HRM algorithms afford (which understands algorithmic management as a form of control for maximizing economic/shareholder value). We explain how these core assumptions underpin existing research of HRM algorithms, causing blind spots that hinder new ways of understanding and studying algorithmic management. After identifying and unpacking the assumptions and blind spots, we offer avenues to overcome these blind spots, allowing for future research based on new ideological assumption grounds that will help move algorithmic management scholarship further in significant ways. [ABSTRACT FROM AUTHOR]

Splicing the shredded paper means the technology that, according the paper, which has been shredded to design a particular Algorithm to splice and recover the original paper. This paper introduced the algorithm of splicing the shredded paper based on the matching to texture feature. By means of this algorithm, we modeled for the problem of splicing the shredded paper and solved it. And, we used the algorithm to splice both pieces of English shredded paper and Chinese shredded paper. The recovered paper had proved the accuracy of the algorithm. [ABSTRACT FROM AUTHOR]

In modern converter-dominated power systems, total inertia is very variable and depends on the share of power generated by renewable-based converter-interfaced generation (CIG) at each specific moment. As a result, the limits required by the grid codes on the rate of change of frequency and its nadir or zenith during disturbances become challenging to achieve with conventional control approaches. Therefore, the transition to a novel control strategy of CIG with a grid-forming power converter is relevant. For this purpose, a control algorithm based on a virtual synchronous generator (VSG) is used, which simulates the properties and capabilities of a conventional synchronous generation. However, due to continuously changing operating conditions in converter-dominated power systems, the virtual inertia formed by VSG must be adaptive. At the same time, the efficiency of adaptive algorithms strongly depends on the used VSG structure. In this connection, this paper proposes an enhanced VSG structure for which the transfer function of the active power control loop was formed. With the help of it, the advantages over the conventional VSG structure were proven, which are necessary for the effective adaptive control of the VSG parameters. Then, the analysis of the impact of the VSG parameters on the dynamic response using the transient characteristics in the time domain was performed. Based on the results obtained, adaptive algorithms for independent control of the virtual inertia and the parameters of the VSG damper winding were developed. The performed mathematical modeling confirmed the reliable and effective operation of the developed adaptive control algorithms and the enhanced VSG structure. The theoretical and experimental results obtained in this paper indicate the need for simultaneous development and improvement of both adaptive control algorithms and VSG structures used for this purpose. [ABSTRACT FROM AUTHOR]

In this paper, we propose three self-adaptive relaxed CQ-algorithms with projections onto halfspaces for solving a split equality problem. The stepsize of the algorithms is dynamically calculated without any prior information regarding operator norms. Moreover, we prove the strong convergence to the minimum-norm solution of the split equality problem. Finally, we test the validity of our results by conducting some numerical experiments and consider signal recovery problems as applications. [ABSTRACT FROM AUTHOR]

Service composition is a core issue of cloud manufacturing (CMfg) to integrate distributed manufacturing services for customised manufacturing tasks. Existing studies focus on the quality of service (QoS) in composition by assuming that each service is independent with each other. However, the correlation between services determines whether a composition is feasible in practice and is a primary factor of its QoS. This paper considers two typical correlations, composability-oriented correlation and quality-oriented correlation. The composability-oriented correlation is modelled as a group of constraints to decide whether a solution is feasible. The influence of the quality-oriented correlation between two services on the overall QoS of a composition is quantified by a discount percentage based on their correlation degrees. A mathematical model of correlation-aware service composition is then established. To solve this problem, a many-objective memetic algorithm termed HypE-C (Hypervolume Estimation Algorithm for Multiobjective Optimisation involving Correlation) is designed. Three correlation-based local search strategies are established in the frame of HypE (Hypervolume Estimation Algorithm for Multiobjective Optimisation) to achieve better trade-off among multiple conflicting QoS criteria. Experiments demonstrate the effectiveness of the proposed algorithm HypE-C compared with five many-objective algorithms on eliminating infeasible search space and providing high QoS service composition solutions. [ABSTRACT FROM AUTHOR]

There is a trend to deploy neural network on edge devices in recent years. While the mainstream of research often concerns with single edge device processing and edge-cloud two-layer neural network collaborative computing, in this paper, we propose partitioning multi-layer edge network for neural network collaborative computing. With the proposed method, sub-models of neural network are deployed on multi-layer edge devices along the communication path from end users to cloud. Firstly, we propose an optimal path selection method to form a neural network collaborative computing path with lowest communication overhead. Secondly, we establish a time-delay optimization mathematical model to evaluate the effects of different partitioning solutions. To find the optimal partition solution, an ordered elitist genetic algorithm (OEGA) is proposed. The experimental results show that, compared with traditional cloud computing, single-device edge computing and edge-cloud collaborative computing, the proposed multi-layer edge network collaborative computing has a smaller runtime delay with limited bandwidth resources, and because of the pipeline computing characteristics, the proposed method has a better response speed when processing large number of requests. Meanwhile, the OEGA algorithm has better performance than conventional methods, and the optimized partitioning method outperforms other methods like random and evenly partition. [ABSTRACT FROM AUTHOR]

The performance growth in processors has been continuing toward increasing the number of processing cores on the chip and scaling the feature size of transistors. However, in the nanoera, side effects of the scaling, such as induced heterogeneities in the performance, power, and soft error rate of identically designed cores, prevent the potential performance from being fully utilized. In this paper, we harness the mentioned side effects in shared-memory multicore processors with unknown workloads by a dynamic heuristic scheduling algorithm called HDSAP. HDSAP aims to maximize performance, i.e., the average response time, under power and reliability constraints in presence of induced heterogeneities. In this regard, we use a mathematical model to quantify task to core assignments based on performance variation. We also consider the variation in power to change selected cores when the power constraint is missed. To meet the reliability constraint, we use N-modular redundancy while being aware of the variation in the soft error rate of cores to prevent under/over reliability estimation. To evaluate HDSAP, we run SPLASH benchmark suite on Sniper and MACPat simulators. As a result, the response time of HDSAP reduces by 6%, 8%, and 25% in comparison with similar algorithms under the same power and reliability constraints. [ABSTRACT FROM AUTHOR]

The article presents a study on an enhanced detection algorithm for cirrus clouds, validated using Moderate Resolution Imaging Spectroradiometer (MODIS). The study used various methods such as the estimation of the effects of stratospheric ozone amount on brightness temperature, remote sensing and Gaussian convolution kernel. It concludes that it is vital to monitor cirrus coverage due to its role in climate.

Aeroengine surge fault is one of the main causes of flight accidents. When a surge occurs, it is hard to detect it in time and take anti-surge measures correctly. Recently, people have been applying detection methods based on mathematical models and expert knowledge. Due to difficult modeling and limited failure-mode coverage of these methods, early surge detection cannot be achieved. To address these problems, firstly, this paper introduced the data of six main sensors related to the aeroengine surge fault, such as, total pressure at compressor (high pressure rotor) outlet (Pt3), high pressure compressor rotor speed (N2), power level angle (PLA), etc. Secondly, aiming at preprocessing of data sets, this paper proposed a data standardization preprocessing algorithm based on batch sliding window (DSPABSW) to build a training set, validation set and test set. Thirdly, aeroengine surge fault detection fusion neural network (ASFDFNN) was provided and optimized to improve the detection accuracy of aeroengine surge faults. Finally, the experimental results showed that the model achieved 95.7%, 93.6% and 94.7% in precision rate, recall rate and F1_Score respectively and consequently it can detect the aeroengine surge fault 260 ms in advance. [ABSTRACT FROM AUTHOR]

This paper deals with parameter estimation problem of large‐scale systems. A recursive distributed parameter estimation algorithm, based on the minimization of the prediction estimation error method, is developed. Specifically, the class of large‐scale systems that are composed of several interconnected sub‐systems is considered. Each interconnected sub‐system is modelled by a linear discrete‐time state space mathematical model with unknown parameters. The convergence analysis is then achieved using the Lyapunov approach. The theoretical analysis and simulation results prove the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In order to improve the scientificity of sports action analysis, this paper constructs a sports action analysis model based on machine learning based on the greedy algorithm and the bat algorithm. According to the structural characteristics of the model, the structure of the model is reflected in the form of face order, that is, the face neighborhood structure. Moreover, this paper judges the degree of similarity between model faces through the pros and cons of the order and applies it to the structural similarity matrix between models. In addition, this paper establishes corresponding mathematical models for the shape and structure of the model and constructs the shape similarity matrix, the surface neighborhood structure similarity matrix, and the structure similarity matrix between the source model and the target model. Finally, this paper designs and implements CAD model retrieval methods based on greedy algorithm and bat algorithm and designs experiments to compare the performance of the algorithm proposed in this paper with traditional algorithms. The result of the experiment shows that the algorithm proposed in this paper has obvious advantages in sports action analysis compared with the traditional algorithm. [ABSTRACT FROM AUTHOR]

Simple Summary: Neuroblastoma is a rare type of cancer that usually affects children. The high-risk patients' expected survival rate is less than 50%. One reason is the lack of precision in the standard treatment protocol: a one-size-fits-all multi-modal therapy. The study presented in this paper was designed to address this deficit by optimising the use of two chemotherapeutic agents—vincristine and cyclophosphamide—during induction chemotherapy—the part of the protocol that shrinks the primary tumour before surgical removal. We combined a mathematical model and an optimisation algorithm to identify the best chemotherapy schedules for a cohort of virtual patients with different initial tumour compositions. Our results reveal novel strategies to exploit a pair of drugs with different levels of efficacy, provide a platform on which to individualise induction chemotherapy, and lay the foundation for a personalised therapy that leverages targeted therapies, multi-region sequencing, liquid biopsies, and modern computational methods to improve today's multi-modal therapy. Neuroblastoma is the most common extra-cranial solid tumour in children. Despite multi-modal therapy, over half of the high-risk patients will succumb. One contributing factor is the one-size-fits-all nature of multi-modal therapy. For example, during the first step (induction chemotherapy), the standard regimen (rapid COJEC) administers fixed doses of chemotherapeutic agents in eight two-week cycles. Perhaps because of differences in resistance, this standard regimen results in highly heterogeneous outcomes in different tumours. In this study, we formulated a mathematical model comprising ordinary differential equations. The equations describe the clonal evolution within a neuroblastoma tumour being treated with vincristine and cyclophosphamide, which are used in the rapid COJEC regimen, including genetically conferred and phenotypic drug resistance. The equations also describe the agents' pharmacokinetics. We devised an optimisation algorithm to find the best chemotherapy schedules for tumours with different pre-treatment clonal compositions. The optimised chemotherapy schedules exploit the cytotoxic difference between the two drugs and intra-tumoural clonal competition to shrink the tumours as much as possible during induction chemotherapy and before surgical removal. They indicate that induction chemotherapy can be improved by finding and using personalised schedules. More broadly, we propose that the overall multi-modal therapy can be enhanced by employing targeted therapies against the mutations and oncogenic pathways enriched and activated by the chemotherapeutic agents. To translate the proposed personalised multi-modal therapy into clinical use, patient-specific model calibration and treatment optimisation are necessary. This entails a decision support system informed by emerging medical technologies such as multi-region sequencing and liquid biopsies. The results and tools presented in this paper could be the foundation of this decision support system. [ABSTRACT FROM AUTHOR]

The article focuses on the Model of Emissions of Gases and Aerosols from Nature version 2.1 (MEGAN2.1) which estimates fluxes of 147 biogenic compounds between terrestrial ecosystems and the atmosphere using mechanistic algorithms. It says that emission estimates from MEGAN2.1 are within the range of estimates reported by other approaches. Moreover, the offline version of MEGAN2.1 driving variables and source code is available from http://acd.ucar.edu/guenther/MEGAN/MEGAN.htm.

The development of artificial intelligence has brought rapid changes to human life and brought great convenience to human activities. The development of various modes of transportation has also brought convenience to people's travel and commodity transactions, but it has also added more issues that need to be carefully considered. Because of the diversification of transportation methods, transportation problems also arise many fields, such as air transportation, water transportation, and land transportation. The development of mathematical models and algorithms for transportation problems is also in full swing, and it is a major trend to introduce mathematical models and algorithms into the solution of transportation problems. This paper deals with the multi-index transportation problem by establishing a multi-index mathematical model and algorithm to find a scientific transportation method for the goods to be transported, so as to save the cost and time of transportation. Experiments show that the mathematical model established in this paper has high efficiency for solving the multi-index transportation problem. At the same time, the most suitable transportation method can also be selected for the transportation of goods, and the route planned by the mathematical model and algorithm can reduce the risk to 12.34%. [ABSTRACT FROM AUTHOR]

Combining computational technologies and humanities is an ongoing effort aimed at making resources such as texts, images, audio, video, and other artifacts digitally available, searchable, and analyzable. In recent years, deep neural networks (DNN) dominate the field of automatic text analysis and natural language processing (NLP), in some cases presenting a super‐human performance. DNNs are the state‐of‐the‐art machine learning algorithms solving many NLP tasks that are relevant for Digital Humanities (DH) research, such as spell checking, language detection, entity extraction, author detection, question answering, and other tasks. These supervised algorithms learn patterns from a large number of "right" and "wrong" examples and apply them to new examples. However, using DNNs for analyzing the text resources in DH research presents two main challenges: (un)availability of training data and a need for domain adaptation. This paper explores these challenges by analyzing multiple use‐cases of DH studies in recent literature and their possible solutions and lays out a practical decision model for DH experts for when and how to choose the appropriate deep learning approaches for their research. Moreover, in this paper, we aim to raise awareness of the benefits of utilizing deep learning models in the DH community. [ABSTRACT FROM AUTHOR]

Image inpainting is an effective method to repair damaged image. In this paper, we mainly studied some typical image inpainting models and analyzed these corresponding repair qualities. Firstly, we studied three typical algorithms based on PDE (Partial Differential Equation) model to repair images whose damaged areas are relative small. And then we studied the image inpainting algorithm based on texture synthesis. This kind of inpainting algorithm is suitable for image with large damaged area. Finally, we studied Criminisi inpainting algorithm based on image segmentation in detail, on which we proposed an improved priority formula image repair algorithm, the simulation results indicate that the improved algorithm of this paper showed better performance in repair quality from both subjective and objective aspects. [ABSTRACT FROM AUTHOR]

This paper introduces a new metaheuristic algorithm called Migration Algorithm (MA), which is helpful in solving optimization problems. The fundamental inspiration of MA is the process of human migration, which aims to improve job, educational, economic, and living conditions, and so on. The mathematical modeling of the proposed MA is presented in two phases to empower the proposed approach in exploration and exploitation during the search process. In the exploration phase, the algorithm population is updated based on the simulation of choosing the migration destination among the available options. In the exploitation phase, the algorithm population is updated based on the efforts of individuals in the migration destination to adapt to the new environment and improve their conditions. MA’s performance is evaluated on fifty-two standard benchmark functions consisting of unimodal and multimodal types and the CEC 2017 test suite. In addition, MA’s results are compared with the performance of twelve well-known metaheuristic algorithms. The optimization results show the proposed MA approach’s high ability to balance exploration and exploitation to achieve suitable solutions for optimization problems. The analysis and comparison of the simulation results show that MA has provided superior performance against competitor algorithms in most benchmark functions. Also, the implementation of MA on four engineering design problems indicates the effective capability of the proposed approach in handling optimization tasks in real-world applications. [ABSTRACT FROM AUTHOR]

In this paper, the object of the study is determining air traffic scheduling management by optimizing mathematical models. The problem in this study is that the COVID-19 pandemic has significantly disrupted air traffic, resulting in changes to regulations, travel restrictions and a decrease in passenger demand. One of the problems that must be resolved is how to organize and adapt flight schedules to current conditions by focusing on mathematical models that are used to optimize or increase the efficiency of managing flight schedules or air traffic. Mathematical models can help find ways to optimize the use of available resources, such as airport capacity, flight routes and flight frequency. The results obtained in this research are a mathematical model that specifically takes into account the variables involved in setting air traffic schedules during the COVID-19 pandemic so that capacity limits at airports and airspace are always normal. An optimization model was developed from previous research, namely the model that takes into account ground and air delays as well as the use of alternative paths and avoids deviations from the initial more accurate flight plan, which overall indicates that the maximum time and maximum distance values for each item have been optimized to achieve better values. This research has the novelty of producing a mathematical model using variables, objective functions, capacity limits, flight structure limits and variable domains, which then produces an algorithm with data input processes, determining optimization models, determining variables, determining objective functions, determining problems. The results of this model can be recommended to airlines in scheduling flights during the pandemic [ABSTRACT FROM AUTHOR]

Numerous studies on project scheduling only consider a single factor, which fails to reflect the actual environment of project operations. In light of this issue, the article synthesizes multiple perspectives and proposes a multi-skill resource-based multi-modal project scheduling problem (MRCMPSP). This problem is described, modeled, and solved using the resource capability matrix and other constraints to minimize the project duration. To effectively solve MRCMPSP and enrich scheduling algorithms, the paper selects the hybrid quantum algorithm (HQPSO) based on the quantum particle swarm algorithm (QPSO). The HQPSO introduces various improvements such as the JAYA optimization search to improve the algorithm's performance. In order to verify the generality, superiority, and effectiveness of the algorithm, independent operation comparison experiments and practical application experiments of the algorithm are designed based on different case sizes and resource quantities. The experimental results demonstrate that the proposed algorithm has superior convergence performance and solution accuracy and can provide an effective scheduling solution for real cases. Additionally, the article provides targeted management suggestions based on the research findings. Overall, this study contributes a novel mathematical model, solution algorithm, optimization strategies, and managerial insights, advancing the field of project management research. [ABSTRACT FROM AUTHOR]

This paper mainly provides a group decision-making (GDM) method based on linguistic interval-valued intuitionistic fuzzy preference relations (LIVIFPRs), where consistency and consensus analysis is conducted. The multiplicative consistency of LIVIFPRs is first introduced, and a consistency-based model is built to ascertain the missing values of an incomplete LIVIFPR. Considering the smallest distance, an optimization model is established to repair the unacceptably multiplicatively consistent LIVIFPR to have acceptable consistency. Meanwhile, the linguistic interval-valued intuitionistic fuzzy priority weights of LIVIFPR are constructed via the optimal solutions of a programming model. Then, Algorithm I for decision-making with one incomplete LIVIFPR is presented. For the GDM problem, the weights of experts are determined before aggregating the individual LIVIFPRs. Moreover, when the consensus of an individual LIVIFPR is unacceptable, a mathematical model is utilized to reach the consensus requirement. Subsequently, Algorithm II for GDM with incomplete LIVIFPRs is proposed step-by-step. Finally, the new GDM method is used to evaluate four Chinese express companies, and the advantages of this approach are demonstrated by performing a comparison analysis. [ABSTRACT FROM AUTHOR]

Legalized routing is an essential part of PCB automatic routing. It solves the problem of wiring conflicts and obtains routing results that comply with the constraints of design rules. Traditional legalized routing problems mostly use trial backtracking methods, but with increasing design complexity and design rules, avoiding wiring conflicts between networks has become increasingly challenging. This paper proposes a legalized routing algorithm based on linear programming to obtain the optimal wiring trajectory under specified topological constraints. First, the corresponding routing model was established based on numerous routing rules, and a routing grid diagram was found using obstacles as grid points. Secondly, a global routing algorithm was used to obtain the estimated wiring path, and integer linear programming was used to realize the mathematical modeling of the legalized routing problem. Finally, a multi-line simultaneous routing strategy was used to design and implement a detailed routing algorithm, optimizing the routing results. We use C++ to complete the coding work and thoroughly test the PCB use cases of different sizes. The experimental results show that our algorithm still maintains a 100% routing success rate, good time performance, and excellent routing quality with large-scale use cases compared with the trial backtracking method. [ABSTRACT FROM AUTHOR]

The quality of scientific publications can be measured by quantitative indices such as the h‐index, Source Normalized Impact per Paper, or g‐index. However, these measures lack to explain the function or reasons for citations and the context of citations from citing publication to cited publication. We argue that citation context may be considered while calculating the impact of research work. However, mining citation context from unstructured full‐text publications is a challenging task. In this paper, we compiled a data set comprising 9,518 citations context. We developed a deep learning‐based architecture for citation context classification. Unlike feature‐based state‐of‐the‐art models, our proposed focal‐loss and class‐weight‐aware BiLSTM model with pretrained GloVe embedding vectors use citation context as input to outperform them in multiclass citation context classification tasks. Our model improves on the baseline state‐of‐the‐art by achieving an F1 score of 0.80 with an accuracy of 0.81 for citation context classification. Moreover, we delve into the effects of using different word embeddings on the performance of the classification model and draw a comparison between fastText, GloVe, and spaCy pretrained word embeddings. [ABSTRACT FROM AUTHOR]

The problem of sparse-view computed tomography (SVCT) reconstruction has become a popular research issue because of its significant capacity for radiation dose reduction. However, the reconstructed images often contain serious artifacts and noise from under-sampled projection data. Although the good results achieved by the prior image constrained compressed sensing (PICCS) method, there may be some unsatisfactory results in the reconstructed images because of the image gradient L1-norm used in the original PICCS model, which leads to the image suffering from step artifacts and over-smoothing of the edge as a result. To address the above-mentioned problem, this paper proposes a novel improved PICCS algorithm (NPICCS) for SVCT reconstruction. The proposed algorithm utilizes the advantages of PICCS, which could recover more details. Moreover, the algorithm introduces the L0-norm of image gradient regularization into the framework, which overcomes the disadvantage of conventional PICCS, and enhances the capability to retain edge and fine image detail. The split Bregman method has been used to resolve the proposed mathematical model. To verify the effectiveness of the proposed method, a large number of experiments with different angles are conducted. Final experimental results show that the proposed algorithm has advantages in edge preservation, noise suppression, and image detail recovery. [ABSTRACT FROM AUTHOR]

This paper explores the problem of formalizing the development of autonomous artificial intelligence systems (AAIS), whose mathematical models may be complex or non-identifiable. Using the value-iterations method for Q-functions of rewards, a methodology for constructing of ε-optimal strategies with a given accuracy has been developed. The results allow us to outline classes (including dual-use), for which it is possible to rigorously justify the construction of optimal and ε-optimal strategies even in cases where the models are identifiable but the computational complexity of standard dynamic programming algorithms may not be strictly polynomial. [ABSTRACT FROM AUTHOR]

The article discusses the mathematical models used to analyze and simulate the U.S. kidney transplant system. It focuses on algorithms for matching donors to kidneys. It mentions that kidneys became available when a person dies and must be transplanted quickly. A proper scheme should be developed to find a compatible recipient for the kidney. The article also discusses using a bipartite graph to pair off living donors and recipients. It describes the problem of matching kidney donors and recipients as dynamic. It also analyzes the feasibility and effectiveness of the kidney paired donation model.

Workshop resource scheduling is an important link in manufacturing scheduling, it has great significance for reducing production cost and enhancing market competitiveness of the manufacturing industry. To this end, this paper studied an intelligent optimization method for workshop resource scheduling considering order outsourcing based on the MTO production mode, and constructed a mathematical model for this problem; in the paper, an improved Artificial Bee Colony algorithm (ABC algorithm) was proposed and verified by comparative analysis and simulation experiments, and the research results showed that: as the number of orders gradually increased, compared with the basic ABC algorithm, the optimal and average solutions obtained by the improved ABC algorithm were obviously smaller, indicating that the improved ABC algorithm had excellent optimization capability. This research enriched the theoretical achievements of the intelligent optimization methods for workshop resource scheduling under the MTO production mode. [ABSTRACT FROM AUTHOR]

We present an algorithm for passivity verification and enforcement of multivariate macromodels whose state-space matrices depend in closed form on a set of external or design parameters. Uniform passivity throughout the parameter space is a fundamental requirement of parameterized macromodels of physically passive structures, that must be guaranteed during model generation. Otherwise, numerical instabilities may occur, due to the ability of nonpassive models to generate energy. In this paper, we propose the first available algorithm that, starting from a generic parameter-dependent state-space model, identifies the regions in the frequency-parameter space where the model behaves locally as a nonpassive system. The approach we pursue is based on an adaptive sampling scheme in the parameter space, which iteratively constructs and perturbs the eigenvalue spectrum of suitable skew-Hamiltonian/Hamiltonian pencils, with the objective of identifying the regions where some of these eigenvalues become purely imaginary, thus pinpointing local passivity violations. The proposed scheme is able to detect all relevant violations. An outer iterative perturbation method is then applied to the model coefficients in order to remove such violations and achieve uniform passivity. Although a formal proof of global convergence is not available, the effectiveness of the proposed implementation of the passivity verification and enforcement schemes is demonstrated on several examples. [ABSTRACT FROM AUTHOR]

The indoor positioning technology of an ultra-wideband (UWB) can play an excellent supplementary role in satellite navigation and has broad application prospects. However, if strong interference exists, the measurement data based on UWB will fluctuate abnormally, which seriously affects the accuracy of positioning. In view of the above problems, based on the combination of mathematical modeling, this paper starts from the subject data, and proposes a positioning method suitable for non-interference/interference conditions and an abnormal data identification method to improve the positioning accuracy. The specific scheme includes data preprocessing model establishment and solution, positioning model establishment and solution, migration application of positioning model, interfering data identification model establishment and solution, and movement track positioning model establishment and solution. [ABSTRACT FROM AUTHOR]

This paper proposes a reconstruction algorithm for the geometric shapes of static overhead transmission lines that is based on the spatial coordinate data (obtained by field mapping) and the corresponding inclination data (obtained by attitude sensors). The algorithm takes the piecewise cubic Hermite interpolation function as the basic framework and corrects the aforementioned two types of data based on the “minimum energy principle” of the transmission line system. The introduction of a new energy function in modified energy method (MEM) overcame the shortcomings of conventional energy method (CEM) in fairing strategy, and the new Fairing Criterion made result curves more consistent with the mechanical properties of transmission lines. In the numerical simulation tests, the two energy methods were compared in terms of load type, horizontal span, elevation difference, and anti-disturbance ability, which showed that MEM has a higher reconstruction accuracy (average Euclidean distance is less than 1 cm) and better robustness than CEM. Meanwhile, the key parameters involved in the algorithm were discussed to guide the application in practical engineering. In addition, measurement tests under non-uniform icing were carried out in the field test station, and the results showed that the maximum relative error is less than 0.1%. [ABSTRACT FROM AUTHOR]

Computational and mathematical models are research subjects for solving engineering, computer science, and computer vision problems. Image preprocessing usually needs to efficiently compute polygons related to some previously delimited region of interest. Most of the solved problems are limited to the search for some type of polygon with k sides (triangles, rectangles, squares, etc.) with maximum area, maximum perimeter, or similar. This paper presents a generic algorithm that computes in O(n5k) computational time the polygon of any number of sides (any simple k-gon) inscribed in a region of interest (in any closed contour without restrictions). The polygon obtained fulfills the requirements specified by the user: maximum area or perimeter or minimum area or perimeter. No previous work has been proposed to obtain any k-gon inscribed in any unconstrained contour. The algorithms and mathematical models are presented and explained, and the source code is available in a GitHub repository for research purposes. [ABSTRACT FROM AUTHOR]

Collision avoidance (COLAV) is a prerequisite for the navigation safety of unmanned surface vehicles (USVs). Since USVs have to avoid obstacles clearly and timely, i.e. the COLAV should be agile, the COLAV algorithm should have low computation complexity and make efficient COLAV decisions. However, balancing between the computation complexity and the COLAV decision optimality is still intractable at present. This paper innovatively proposes a COLAV algorithm for USVs by combining the velocity obstacle method with the predictive model method, named the collision shielded model predictive control (CS-MPC) algorithm, such that the agility of USVs COLAV is improved. The runtime of the proposed COLAV algorithm is shortened by shielding the dangerous parts of the search space of the COLAV decisions, and the COLAV decision is efficient with the aid of the accurately predicted motion trajectory by the motion mathematical model of USVs. As such, the USV can safely navigate in complex water areas where multiple vessels and obstacles exist. A series of simulations on a yacht in different kinds of encounter situations were carried out to verify the effectiveness and the agility of the proposed CS-MPC COLAV algorithm. [ABSTRACT FROM AUTHOR]

Copyright of Przeglad Elektrotechniczny is the property of Przeglad Elektrotechniczny and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Given that a U-shaped assembly line is usually regarded as a serial flow production system, preventive maintenance (PM) on machines in any station of the line may lead to stoppage of the whole line and sequentially cause great loss of production cost. To improve production continuity during PM, this paper proposes multiple alternative assignment plans with interchangeable abilities to ascertain the production recovery from changes of line structure. A mixed-integer mathematical model is further formulated to make decisions on alternative assignment plans. In this model, cycle time and total assignment plan alteration cost are minimised simultaneously. And an enhanced JAYA algorithm is developed to obtain well-distributed Pareto frontier solutions effectively and efficiently. The proposed algorithm suggests a similarity-based selection and various crossover/neighbourhood search operators to enhance its search ability for global optima. Numerical experiment results prove the effectiveness of the proposed model and enhanced JAYA. This novel methodology of integration optimisation bridges assembly line balancing and PM, and thus promotes production continuity and achieves economic benefits under maintenance within large-scaled assembly lines in real situations. Furthermore, a real-world case study is conducted to illustrate the significance of this novel methodology. [ABSTRACT FROM AUTHOR]

The article presents comments on the management science paper "On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs," by William L. Maxwell. The paper focused on an integer programming formulation of a one-machine job shop problem. The author contends that Maxwell made in error in proving the validity of an optimal algorithm by applying cutting plane constraints to the problem. The author explains that the problem cannot be solved through traditional cutting plane procedures. The author provides a mathematical model in an attempt to correct the proof.

The assembly line balancing problem can completely vary from one production line to the other. This paper deals with a realistic assembly line for the automotive industry inspired by Fiat Chrysler Automotive in North America and Parskhodro in Iran (both large-scale automotive companies). This problem includes some specific requirements that have not been studied in the literature. For example, the assembly line is five-sided, and workers can move along these sides. Due to the limited workspace, all the sides cannot work simultaneously at one station. First, a mixed integer linear programming model is proposed for the problem. Then, the model is improved to have a tighter linear relaxation. Moreover, an effective logic-based Benders' decomposition algorithm is developed. After careful analysis of problem's structure, three propositions are introduced. The master problem is well restricted by eight valid inequalities. Two different sub-problem types are defined to extract more information from the master problem's solution. In this case, the algorithm adds effective cuts that reduce the solution space to the extent possible at each iteration. Thus, the number of iterations is significantly cut down. The performance of the model and algorithm, as well as improvement made on both, is evaluated. [ABSTRACT FROM AUTHOR]

In this paper, we consider multi-party coordination in a supply chain (SC) that consists of a set of independent producers and a set of resource managers. A decentralised decision-making approach is proposed for a coal SC, with three independent parties – multiple mines, a rail operator and a terminal. The rail operator and the terminal act as common resource managers and connects the independent mines via a rail network. The objective of this SC is to efficiently use an independent rail operator to transport coal from different mines to meet the shipping demand at the terminal. The underlying coordination problem can be seen as a multi-resource constrained scheduling problem. A major part of this paper addresses the key challenges in a decentralised approach based on column generation (CG), which are to compute the value of a column, better upper bounds and to update the multipliers using decentralised methods. We have also discussed the mathematical models for different decision units, the CG algorithm and different strengthening methods. A comprehensive computational experiment based on randomly generated instances highlights the effect of decentralisation and the value of information-sharing. The proposed solution approaches can be extended to a multi-party case with any number of common resources. [ABSTRACT FROM AUTHOR]

This paper reports an analysis of the software (SW) safety testing techniques, as well as the models and methods for identifying vulnerabilities. An issue has been revealed related to the reasoned selection of modeling approaches at different stages of the software safety testing process and the identification of its vulnerabilities, which reduces the accuracy of the modeling results obtained. Two steps in the process of identifying software vulnerabilities have been identified. A mathematical model has been built for the process of preparing security testing, which differs from the known ones by a theoretically sound choice of the moment-generating functions when describing transitions from state to state. In addition, the mathematical model takes into consideration the capabilities and risks of the source code verification phase for cryptographic and other ways to protect data. These features generally improve the accuracy of modeling results and reduce input uncertainty in the second phase of software safety testing. An advanced security compliance algorithm has been developed, with a distinctive feature of the selection of laws and distribution parameters that describe individual state-to-state transitions for individual branches of Graphical Evaluation and Review Technique networks (GERT-networks). A GERT-network has been developed to prepare for security testing. A GERT-network for the process of checking the source code for cryptographic and other data protection methods has been developed. A graphic-analytical GERT model for the first phase of software safety testing has been developed. The expressions reported in this paper could be used to devise preliminary recommendations and possible ways to improve the effectiveness of software safety testing algorithms [ABSTRACT FROM AUTHOR]