Search

Summarizes the construction of paper folding. Method for approximating rational subdivisions or arbitrary angles and line segments; Angle-folding algorithm; Approximating angles, regular polygons and star polygons; Dissection of angles into equal parts.

The article focuses on the number theory of Gaussian integers. Within the complex numbers, the analogues of the integers are the Gaussian integers, those complex numbers whose real and imaginary parts are both integers. There is a theory of divisibility, including greatest common divisors, and the purpose of this article is to present a new gcd algorithm for Gaussian integers. The standard algorithm is a straightforward extension of the Euclidean algorithm for ordinary integers. The gcd algorithm is better suited to paper-and-pencil computation, and it is less error-susceptible than the standard one. Another attractive feature is that it is based on a simple parity argument. The basic divisibility definitions for Gaussian integers are simply restatements of those for ordinary integers. There are many interesting results which can be proved using parity arguments. The gcd algorithm establishes that any two Gaussian integers have a greatest common divisor, and it is interesting to see that this result has an odd-even proof.

Copyright of Journal of Natural Fibers is the property of Taylor & Francis Ltd 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.)

In feature based image matching, distinctive features in images are detected and represented by feature descriptors. Matching is then carried out by assessing the similarity of the descriptors of potentially conjugate points. In this paper, we first shortly discuss the general framework. Then, we review feature detection as well as the determination of affine shape and orientation of local features, before analyzing feature description in more detail. In the feature description review, the general framework of local feature description is presented first. Then, the review discusses the evolution from hand-crafted feature descriptors, e.g. SIFT (Scale Invariant Feature Transform), to machine learning and deep learning based descriptors. The machine learning models, the training loss and the respective training data of learning-based algorithms are looked at in more detail; subsequently the various advantages and challenges of the different approaches are discussed. Finally, we present and assess some current research directions before concluding the paper. [ABSTRACT FROM AUTHOR]

This research introduces innovative approaches to enhance intrusion detection systems (IDSs) by addressing critical challenges in existing methods. Various machine-learning techniques, including nature-inspired metaheuristics, Bayesian algorithms, and swarm intelligence, have been proposed in the past for attribute selection and IDS performance improvement. However, these methods have often fallen short in terms of detection accuracy, detection rate, precision, and F-score. To tackle these issues, the paper presents a novel hybrid feature selection approach combining the Bat metaheuristic algorithm with the Residue Number System (RNS). Initially, the Bat algorithm is utilized to partition training data and eliminate irrelevant attributes. Recognizing the Bat algorithm's slower training and testing times, RNS is incorporated to enhance processing speed. Additionally, principal component analysis (PCA) is employed for feature extraction. In a second phase, RNS is excluded for feature selection, allowing the Bat algorithm to perform this task while PCA handles feature extraction. Subsequently, classification is conducted using naive bayes, and k-Nearest Neighbors. Experimental results demonstrate the remarkable effectiveness of combining RNS with the Bat algorithm, achieving outstanding detection rates, accuracy, and F-scores. Notably, the fusion approach doubles processing speed. The findings are further validated through benchmarking against existing intrusion detection methods, establishing their competitiveness. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present mechanisms and algorithms implemented for improving Bitcoin cryptocurrency efficiency and security and to examine the block propagation times from a selected period before and after SegWit was introduced. In this paper, Segregated Witness Implementation issues were verified based both on the simulation and real data from the Bitcoin network. Based on the block propagation times calculated in the simulator, as well as bitcoin network real data, the efficiency and safety of Bitcoin have been analysed and validated. [ABSTRACT FROM AUTHOR]

Neighbourhood search algorithms are often the most effective known approaches for solving partitioning problems. In this paper, we consider the capacitated examination timetabling problem as a partitioning problem and present an examination timetabling methodology that is based upon the large neighbourhood search algorithm that was originally developed by Ahuja and Orlin. It is based on searching a very large neighbourhood of solutions using graph theoretical algorithms implemented on a so-called improvement graph. In this paper, we present a tabu-based large neighbourhood search, in which the improvement moves are kept in a tabu list for a certain number of iterations. We have drawn upon Ahuja-Orlin's methodology incorporated with tabu lists and have developed an effective examination timetabling solution scheme which we evaluated on capacitated problem benchmark data sets from the literature. The capacitated problem includes the consideration of room capacities and, as such, represents an issue that is of particular importance in real-world situations. We compare our approach against other methodologies that have appeared in the literature over recent years. Our computational experiments indicate that the approach we describe produces the best known results on a number of these benchmark problems. [ABSTRACT FROM AUTHOR]

The development of unmanned aerial vehicle (UAV) oblique photogrammetric technology provides a good foundation for the rapid construction of large-scale and high-definition real-scene 3D models. However, due to the limitations of the modeling process, irrelevant feature data cannot be eliminated in the modeling stage. The built models contain irrelevant features and model distortions caused by errors. At present, most existing clipping algorithms cannot effectively clip real-scene 3D models that are organized as a whole or with levels of detail (LODs). Therefore, this paper proposes a novel algorithm for clipping real-scene 3D models from any perspective based on clipping boundary lines that fit the surfaces of the models. The results of the clipping experiments for 3D models constructed with oblique UAV images show that this algorithm can effectively clip any part of the 3D models, that the clipping results of each level model closely fit the corresponding clipping boundary lines, and that the accuracy of the clipping results is very high. Additionally, the time complexity of the algorithm is O(n2). In conclusion, the algorithm proposed in this paper provides correct and effective clipping results for real-scene 3D models with LODs that are constructed with photogrammetric or 3D laser scanning data. [ABSTRACT FROM AUTHOR]

Inspired by classical feature descriptors in motion matching, this paper proposes a multimodal failure matching point collection method, which is defined as FMP. FMP is, in fact, a collection of unstable features with a low matching degree in the conventional matching task. Based on FMP, a novel model for the saliency detection of motion object is developed. Models are evaluated on the DAVIS and SegTrackv2 datasets and compared with recently advanced object detection algorithms. The comparison results demonstrate the availability and effectiveness of FMP in the detection of motion object saliency. [ABSTRACT FROM AUTHOR]

This paper introduces a new variant of the Bees Algorithm (BA) called Bees Algorithm with 2-parameter (BA2), which is a population-based metaheuristic algorithm designed to solve continuous and combinatorial optimisation problems. The proposed algorithm simplified the BA's parameters by combining exploration and exploitation strategies while preserving the algorithm's core principles to efficiently search for optimal solutions. The paper provides a detailed description of the algorithm's core principles and its application to two engineering problems, the air-cooling system design (ACSD) and the printed circuit board assembly sequence optimisation (PASO). The results show that BA2 outperforms previous versions of the basic BA in terms of convergence speed and solution quality. However, the authors acknowledge that further research is needed to test the scalability and generalisability of the algorithm to larger and more diverse optimisation problems. Overall, this paper provides valuable insights into the potential of metaheuristics for solving real-world optimisation problems. [ABSTRACT FROM AUTHOR]

A review of the article "Why Is Paper-and-Pencil Multiplication Difficult for Many People?" by Robert Speiser, Matthew H. Schneps, Amanda Heffner-Wong, Jaimie L. Miller, and Gerhard Sonnert, that appeared in December 2012 issue of the journal "The Journal of Mathematical Behavior", is presented.

The aim of this paper is to propose an algorithm to solve and enhance a multi-level multi-objective integer quadratic programming problem (MLMOIQPP) under a single-valued Pentagonal Neutrosophic environment applied to the objective functions. The suggested solution takes advantage of multi-objective optimization in addition to the fuzzy approach as well as the branch and bound technique, which is implemented at each decision level to develop a generalized maximization-minimization model for obtaining the integer satisfactory solution after applying the score and accuracy function in the first phase of the solution methodology to singlevalued Pentagonal Neutrosophic parameters to be converted into an equal crisp form. An illustrative example is demonstrated to validate the proposed solution algorithm. [ABSTRACT FROM AUTHOR]

Since thermodynamics can describe the energy of matter and its form of storage or transformation in the system, it is introduced to resolve the uncertain decision-making problems. The paper proposes the thermodynamic decision-making method which considers both the quantity and quality of the probabilistic linguistic decision information. The analogies for thermodynamical indicators: energy, exergy and entropy are developed under the probabilistic linguistic circumstance. The probabilistic linguistic thermodynamic method combines the regret theory which captures decision makers' regret-aversion and the objective weight of criterion obtained by the water-filling algorithm. The proposed method is applied to select the optimal solution to respond to the floods in Chongqing, China. The self-comparison is conducted to verify the effectiveness of the objective weight obtained by the water-filling algorithm and regret theory in the probabilistic linguistic thermodynamic method. The reliability and feasibility of the proposed method are verified by comparative analysis with other decision-making methods by some simulation experiments and non-parametric tests. [ABSTRACT FROM AUTHOR]

The planning and management of water resources are becoming more and more important, and the forecast of water demand as the prerequisite and foundation of the entire planning has become a very important task in agricultural development. This paper combines the particle swarm algorithm to construct the agricultural water resource demand forecasting model, analyzes the shortcomings of the traditional particle swarm algorithm, and makes appropriate improvements to the quantum particle swarm algorithm. Moreover, this paper constructs the functional structure of the agricultural water resource demand forecast model based on the forecast demand of water resources, and analyzes the application process of the particle swarm algorithm in the system of this paper. After the model is constructed, the performance of the model is verified, and the simulation test is designed to evaluate the effect of system forecast with actual data. At the same time, this paper uses the model constructed in this paper to analyze the factors affecting water resources forecast demand. From the results of the experimental analysis, it can be seen that the model constructed in this paper is more effective in the forecast of water resources demand. [ABSTRACT FROM AUTHOR]

Copyright of Tapuya: Latin American Science, Technology & Society is the property of Taylor & Francis Ltd 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.)

Due to the large amount of noise in pipeline leakage signal, the accuracy of the leakage detection device's judgment will be reduced by direct leakage detection. Therefore, the noise reduction of pipeline leakage signal is critical for preprocessing technology of pipeline leakage detection. A denoising method combining adaptive variational mode decomposition (AVMD) and singular value decomposition (SVD) is proposed in this paper. First, the mode number and the penalty factor of VMD are searched automatically by AVMD. The AVMD algorithm is coupled to a fitness function based on improved refine composite multiscale dispersion entropy (RCMDE). Subsequently, a time–frequency matrix which obtains time–frequency subspace after SVD is constructed for all mode components decomposed by VMD, and the number of effective time–frequency subspaces is determined by the relative change rate of singular values, thereby the denoised signal is achieved. Finally, the experimental results show that the AVMD-SVD method proposed in this paper has the significant denoising effect and strong robustness. [ABSTRACT FROM AUTHOR]

In order to improve the course control accuracy of unmanned surface vehicle (USV), a course control system based on improved active disturbance rejection control (ADRC) is proposed in this paper. The course controller designed in this paper can realize automatic course maintenance and achieve good stability of USV. The extended state observer of ADRC is used to estimate the unknown disturbance in real time and give appropriate compensation. It is difficult to set the ADRC parameters, so firefly algorithm (FA) is introduced into the ADRC algorithm to realize the self-setting of nonlinear feedback control law parameters. The simulation results show that the course control system designed in this paper can achieve precise control of the USV's course and the system is robust. [ABSTRACT FROM AUTHOR]

The premise of effective use of high-resolution remote sensing (HRRS) images is that the data integrity and authenticity of HRRS images must be guaranteed. This paper proposes a new subject-sensitive hashing algorithm for the integrity authentication of HRRS images. This algorithm takes AGIM-net (Attention Gate-based improved M-net) proposed in this paper to extract the subject-sensitive features of the HRRS images, and uses Principal Component Analysis (PCA) based method to compress and encode the extracted features. AGIM-net is an improved U-net based on attention mechanism, adding multi-scale input in the encoder stage to extract rich image features; adding multi-scale output in the decoder stage, and suppressing the features irrelevant to the subject through Attention Gate to improve the robustness of the algorithm. Experiments show that the proposed algorithm has improved robustness compared with existing algorithms, and the tamper sensitivity and security are basically equivalent to the existing algorithms. [ABSTRACT FROM AUTHOR]

A stroke is a medical disorder in which blood arteries in the brain rupture, causing brain damage. Symptoms may appear when the brain's blood supply and other nutrients are cut off. According to the World Health Organization, Stroke is the leading cause of death and disability globally. Early recognition of the multiple warning signs of a stroke helps reduce the severity of the stroke. The paper presents a modified version of the Genetic Folding algorithm to predict stroke based on symptoms. Considerable Machine Learning models, including Logistic Regression, Decision Tree, Random Forest, Naïve Bayes, Support Vector Machine, and the proposed Minimal Genetic Folding, were compared to forecast the probability of having a stroke in the brain using a variety of physiological characteristics. The proposed minimal Genetic Folding approach has been developed using the open-access Stroke Prediction dataset using minimal kernel operators. The datasets generated and/or analyzed during the current study are available in the Kaggle repository. With an accuracy of 83.2%, the proposed minimal Genetic Folding approach outperformed Logistic Regression by 4.2%, Naïve Bayes by 1.2%, Decision Tree by 17.2%, and Support Vector Machine by 83.2%. The area under the curve of the proposed model is much more significant than earlier research by 7%, demonstrating that this model is more dependable and was the top-performing algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the Levenberg-Marquardt (LM) algorithm can not train online radial basis function (RBF) neural network and the deficiency in the RBF network structure design methods, this paper proposes an online self-adaptive algorithm for constructing RBF neural network (OSA-RBFNN) based on LM algorithm. Thus, the ideas of the sliding window method and online structure optimization methods are adopted to solve the proposed problems. On the one hand, the sliding window method enables the RBF network to be trained online by the LM algorithm making the RBF network more robust to the changes in the learning parameters and faster convergence compared with the other investigated algorithms. On the other hand, online structure optimization can adjust the structure of the RBF network based on the information of training errors and hidden nodes to track the non-linear time-varying systems, which helps to maintain a compact network and satisfactory generalization ability. Finally, verified by simulation analysis, it is demonstrated that OSA-RBFNN exhibits a compact RBF network. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach for encrypting images using a Sudoku as its encryption key. This algorithm uses both symmetric and asymmetric key cryptography. It works with any type of data, Sudoku size, and keyspace. The image undergoes the process of modified thresholding, using a pseudo-random number generated from a Sudoku as the threshold. This image is then padded with zeros or the average pixel values to ensure the dimensions are multiples of the Sudoku's size and the image rows are shuffled randomly. For each iteration, the image rows are shuffled, followed by the columns, and finally, the image is rotated clockwise by 90 degrees. The resultant image is highly encrypted and resilient to brute-forcing methods. The algorithm requires roughly 25 milliseconds per iteration for a colored square image of dimensions 512 × 512 and has an NPCR value of 99.60% and a UACI value of 35.65%. The gargantuan keyspace offered by the Sudoku keys ensures obedience of Kirchoff's principle and Shannon's maxim. [ABSTRACT FROM AUTHOR]

The paper explores the potential study of artificial neural network (ANN) for prediction of response surface roughness (Ra) in face milling operation with respect to cryogenic approach. The model of Ra was expressed as the main factor in face milling of spindle speed, feed rate, depth of cut and coolant type. The ANN is trained using four various back propagation algorithms (BPA). The emphasis of the paper is to investigate the performance and the accuracy of the attained results depicts the effectiveness of the trained ANN in identifying the predicted Ra. The incorporated various BPA in predicting the Ra. The performance comparative study is made among statistical (Response Surface Methodology (RSM)) and ANN (BPA – training algorithm) methods. The various incorporated BPA algorithms are Gradient Descent (GD), Scaled Conjugate Gradient Descent (SCGD), Levenberg Marquardt (LM) and Bayesian Neural Network (BNN). Afterwards the best suitable BPA is identified in predicting Ra for AISI 316 in face milling operation using liquid nitrogen (LN2) as cutting fluid. The outperformed BPA is identified based on the attained deviation percentage and time required for the training the network. [ABSTRACT FROM AUTHOR]

The article presents information on minimum score separation, an open combinatorial problem associated with the cutting stock problem. An additional constraint is imposed on the software for the cutting stock problem in the paper and related industries. The algorithm for solving the cutting stock problem creates a large list of candidate patterns and then solves the associated mixed-integer programme. Typically, the list of candidate patterns is in the many hundreds, whereas only a few, in the low tens, will be used in the final solution.

In order to improve the recognition rate of weak annotation data in facial expression recognition task, this paper proposes a multi-scale and multi-region vector triangle texture feature extraction scheme based on weakly supervised clustering algorithm. According to the information gain rate of extracted features, combined with threshold selection and random dropout strategy, the best selection of vector triangle texture feature scale is explored, and the feature space is optimized under the premise of sufficient feature space information, the reduction of feature space is realized and the information redundancy is reduced. For the positive and negative expression units, the facial expression images in the data set are divided into two categories. The positive and negative facial expressions are taken to form the same kind of samples, the positive and negative facial expressions are taken to form the positive and negative samples, and the annotation labels are taken to form the weak annotation labels. The experimental results show that the best recognition rate of the proposed scheme is 84.1%, which is 5.8% higher than the unoptimized texture feature scheme. [ABSTRACT FROM AUTHOR]

This paper is concerned with the distributed filtering problem for a class of delayed nonlinear systems with random sensor saturation (RSS) under a dynamic event-triggered mechanism. The nonlinear function is assumed to satisfy the Lipschitz condition. A dynamic event-triggered mechanism is employed to further reduce the innovation transmission frequencies among the adjacent nodes. Both the Bernoulli distributed random variables and saturation function are employed to model the phenomenon of RSS. The aim of this paper is to design a sub-optimal filter such that the covariance of the filtering error has an upper bound, which is minimized by appropriately computing the filter gain. Furthermore, the error boundedness is analysed and a sufficient criterion is presented to ensure that the filtering error is mean-square bounded. Finally, a numerical example is provided to verify the effectiveness of the proposed filtering algorithm. [ABSTRACT FROM AUTHOR]

This paper is concerned with the path planning of the coal mine robot. A new workspace model is presented to describe the complex coal mine environment. Thus, the cost of a path is composed of not only the distance of the path but also some hybrid costs that can be linked to the criteria of path optimization. To overcome the drawbacks of conventional ant colony optimization (ACO) algorithm, an improved ACO algorithm is developed to tackle the issues of path planning of coal mine robot based on the new workspace model. Some simulation experiments are carried out on the path planning of coal mine robot, and the validity and superiority of the new approach can be confirmed by the simulation results. [ABSTRACT FROM AUTHOR]

In this paper, aiming at the detection of fatigue driving scene of drivers, a diagnostic model based on machine learning is proposed under the scene of long-time driving. The validity of the model is verified by simulation experiments. The simulation result shows that the model can effectively fit the fatigue condition of drivers under long-time driving, and accurately judge and warn the fatigue state of drivers. At the same time, the model also extends the application of fatigue classification detection. [ABSTRACT FROM AUTHOR]

Macroeconomic predicting is a research hotspot in the field of predicting. The accuracy of predicting often directly affects the rationality of decision-making, especially for defense expenditure predicting. This paper studies the residual correction method of prediction model based on time series. Firstly, based on the grey nonlinear Verhulst prediction model, Fourier series is introduced in this paper to correct the residual sequence once and establish a residual correction model. On this basis, this paper also introduces Markov related concepts, creatively introduces the two-dimensional residual data into Markov state transition matrix, classifies it by K-means clustering analysis, and calculates its parameters by PSO algorithm to realize the secondary accurate correction of residual. Finally, a PSO-Markov residual correction method based on Verhulst-Fourier model is proposed. Tested by examples, this method effectively improves the prediction accuracy of the model, and the prediction is more reliable and accurate. [ABSTRACT FROM AUTHOR]

N6-methyladenosine (m6A) plays an important role in various biological processes. Identifying m6A site is a key step in exploring its biological functions. One of the biggest challenges in identifying m6A sites is how to extract features comprising rich categorical information to distinguish m6A and non-m6A sites. To address this challenge, we propose bidirectional dinucleotide and trinucleotide position-specific propensities, respectively, in this paper. Based on this, we propose two feature-encoding algorithms: Position-Specific Propensities and Pointwise Mutual Information (PSP-PMI) and Position-Specific Propensities and Pointwise Joint Mutual Information (PSP-PJMI). PSP-PMI is based on the bidirectional dinucleotide propensity and the pointwise mutual information, while PSP-PJMI is based on the bidirectional trinucleotide position-specific propensity and the proposed pointwise joint mutual information in this paper. We introduce parameters α and β in PSP-PMI and PSP-PJMI, respectively, to represent the distance from the nucleotide to its forward or backward adjacent nucleotide or dinucleotide, so as to extract features containing local and global classification information. Finally, we propose the M6A-BiNP predictor based on PSP-PMI or PSP-PJMI and SVM classifier. The 10-fold cross-validation experimental results on the benchmark datasets of non-single-base resolution and single-base resolution demonstrate that PSP-PMI and PSP-PJMI can extract features with strong capabilities to identify m6A and non-m6A sites. The M6A-BiNP predictor based on our proposed feature encoding algorithm PSP-PJMI is better than the state-of-the-art predictors, and it is so far the best model to identify m6A and non-m6A sites. [ABSTRACT FROM AUTHOR]

University timetable scheduling, which is a typical problem that all universities around the world have to face every semester, is an NP-hard problem. It is the task of allocating the right timeslots and classrooms for various courses by taking into account predefined constraints. In the current literature, many approaches have been proposed to find feasible timetables. Among others, swarm-based algorithms are promising candidates because of their effectiveness and flexibility. This paper investigates proposing an approach to university timetable scheduling using a recent novel swarm-based algorithm named Spotted Hyena Optimizer (SHO) which is inspired by the hunting behaviour of spotted hyenas. Then, a combination of SA and SHO algorithms also investigated to improve the overall performance of the proposed method. We also illustrate the proposed method on a real-world university timetabling problem in Vietnam. Experimental results have indicated the efficiency of the proposed method in comparison to other competitive metaheuristic algorithm such as PSO algorithm in finding feasible timetables. [ABSTRACT FROM AUTHOR]

Because of the phenomenal expansion of Internet of Things (IoT) devices around the world, Wireless Sensor Networks (WSN) have become increasingly important among the technical community, and research in this area has been growing exponentially. Researchers have used a variety of WSN technologies to address issues such as processing power constraints, bandwidth-limited connections, delays and energy consumption outlines that arise with sensor networks. However, in terms of delay optimization, affordability and effective energy consumption, WSN is the most suitable and alluring technology. This paper uses an Enhanced Scheduling Algorithm (ESA) with a probabilistic approach called Random Classical Game Theory (RCGT) to reduce the delay in WSN. Retransmissions are minimized when ESA and RCGT are used, which improve WSN delay. The idea is to improve the scheduling algorithm by using RCGT to lengthen the lifespan of the entire network. It has been demonstrated that the improved technique outperforms the existing algorithms in terms of throughput, energy consumption, hop count, delay and lifespan ratio. [ABSTRACT FROM AUTHOR]

The objective of this paper is to assess whether existing pavement temperature prediction algorithms can be used to reliably determine Performance Grade (PG) design temperatures for Australian asphalt pavements. The results show good agreement between internationally and locally developed pavement temperature algorithms for the prediction of high pavement design temperature. There is more variability between models in the prediction of low pavement design temperature. The paper also provides a set of PG grading results for a range of Australian asphalt binders. The findings indicate that for a given design situation harder bitumen, ormore highly modified binder would be specified in Australia than in jurisdictions using the PG system. [ABSTRACT FROM AUTHOR]

In this article, firstly, we describe picture fuzzy N-soft sets (PFN-SSs) as a generalization of picture fuzzy sets (PFSs) and N-soft sets (N-SS) by observing that one of the essential concept of neutral grade is missing in intuitionistic fuzzy N-SS (IFN-SS) theory. The concept of neutrality grade can be observed in the situation when we encounter human views including more answers of type: yes, abstain, no, refusal. For instance, in election the election commission or election council issues voting papers for the candidate. The voting outcomes are categorized into 4 groups with the number of papers namely, vote for, abstain, vote against, and refusal voting. Further, We define the fundamental properties of PFN-SS and introduce M-subset, F-subset, compliment, intersections, unions, of PFN-SS and give their examples. Secondly, we define an algorithm to cope with PFN-SS data which is more generalized then the algorithm defined for IFN-SS. To show the advantage and usefulness of the defined technique, we give two examples from real life by utilizing PFN-SS data. The result shows in the comparison that our initiated method is more general and suitable than the IFN-SS, fuzzy N-SS (FN-SS), and N-SS. [ABSTRACT FROM AUTHOR]

In order to solve the problem of distribution network reconstruction with distributed generation (DG) and electric vehicle (EV), a multi-objective distribution network reconstruction model with DG and EV is established in this study. Two rules for opening the loop are proposed to reduce the probability of infeasible solutions. Some measures are proposed to improve traditional gravitational algorithm (GSA). Firstly, the particle swarm algorithm (PSO) is combined to improves the update formula of speed and position. In this way, the global search capability of the GSA is enhanced, which gives the best performance with respect to jump out of the local traps. Furthermore, the processing method for agents that cross the boundary is improved, which increases the diversity of samples while generating elite particles. Hence, this method can improve the efficiency of the algorithm. Finally, the variability of load, DG and EV is considered for dynamic reconstruction. The validity of the optimization algorithm and refactoring strategy are demonstrated by case studies in the paper. [ABSTRACT FROM AUTHOR]

In this paper, four widely used temporal compositing algorithms, i.e. median, maximum NDVI, medoid, and weighted scoring-based algorithms, were evaluated for annual land cover classification using monthly Landsat time series data. Four study areas located in California, Texas, Kansas, and Minnesota, USA were selected for image compositing and land cover classification. Results indicated that images composited using weighted scoring-based algorithms have the best spatial fidelity compared to other three algorithms. In addition, the weighted scoring-based algorithms have superior classification accuracy, followed by median, maximum NDVI, and medoid in descending order. However, the median algorithm has a significant advantage in computational efficiency which was ∼70 times that of weighted scoring-based algorithms, and with overall classification accuracy just slightly lower (∼0.13% on average) than weighted scoring-based algorithms. Therefore, we recommended the weighted scoring-based compositing algorithms for small area land cover mapping, and median compositing algorithm for the land cover mapping of large area considering the balance between computational complexity and classification accuracy. The findings of this study provide insights into the performance difference between various compositing algorithms, and have potential uses for the selection of pixel-based image compositing technique adopted for land cover mapping based on Landsat time series data. [ABSTRACT FROM AUTHOR]

To quickly detect and count the number of bayberry trees, this paper improves the YOLO-v4 model and proposes an optimal YOLO-v4 method for detecting bayberry trees based on UAV images. We used the Leaky_ReLU activation function to accelerate the model extraction speed and used the DIoU NMS to retain the most accurate prediction boxes. In order to increase the recall rate of the object detection and construct the optimal YOLO-v4 model, the K-Means clustering method was embedded into DIoU NMS. We trained the model using UAV images of bayberry trees, it was determined that the optimal YOLO-v4 model threshold was 0.25, which had the best extraction effect. The optimal YOLO-v4 model had a detection accuracy of up to 97.78% and a recall rate of up to 98.16% on the dataset. The optimal YOLO-v4 model was compared with YOLO-v4, YOLO-v4 tiny, the YOLO-v3 model, and the Faster R-CNN model. With guaranteed accuracy, the recall rate was higher, up to 97.45%, and the detection of bayberry trees was better in different contexts. The result shows that the optimal YOLO-v4 model can accurately achieve the rapid detection and statistics of the number of bayberry trees in large-area orchards. [ABSTRACT FROM AUTHOR]

In 2019, the World Health Organization recognised diabetes as a clinically and pathophysiologically heterogeneous set of related diseases. Little is currently known about the diabetes phenotypes in the population of low- and middle-income countries (LMICs), yet identifying their different risks and aetiology has great potential to guide the development of more effective, tailored prevention and treatment. This study reviewed the scope of diabetes datasets, health information ecosystems, and human resource capacity in four countries to assess whether a diabetes phenotyping algorithm (developed under a companion study) could be successfully applied. The capacity assessment was undertaken with four countries: Trinidad, Malaysia, Kenya, and Rwanda. Diabetes programme staff completed a checklist of available diabetes data variables and then participated in semi-structured interviews about Health Information System (HIS) ecosystem conditions, diabetes programme context, and human resource needs. Descriptive analysis was undertaken. Only Malaysia collected the full set of the required diabetes data for the diabetes algorithm, although all countries did collect the required diabetes complication data. An HIS ecosystem existed in all settings, with variations in data hosting and sharing. All countries had access to HIS or ICT support, and epidemiologists or biostatisticians to support dataset preparation and algorithm application. Malaysia was found to be most ready to apply the phenotyping algorithm. A fundamental impediment in the other settings was the absence of several core diabetes data variables. Additionally, if countries digitise diabetes data collection and centralise diabetes data hosting, this will simplify dataset preparation for algorithm application. These issues reflect common LMIC health systems' weaknesses in relation to diabetes care, and specifically highlight the importance of investment in improving diabetes data, which can guide population-tailored prevention and management approaches. [ABSTRACT FROM AUTHOR]

In this paper, we introduced, discussed, and investigated analytical-approximate solutions for nonlinear time fractional gas dynamics equations in terms of conformable differential operator. The proposed algorithm relies upon the conformable power series method and residual error of the generalized Taylor series in terms of the conformable sense. This technique provides analytical solutions in the form of rapid and accurate convergent series in terms of the multiple fractional power series with easily computable components. In this direction, error estimation and convergence analysis for solutions of fractional gas dynamics equations are provided as well. Eventually, several physical examples are tested to justify the theoretical portion and give a clear explanation of dynamic systems for the proposed model for different orders of fractional case β ∈ ( 0 , 1 ]. The obtained numeric-analytic results indicate that the current algorithm is simple, effective, and profitably dealing with the complexity of many nonlinear fractional dispersion problems. [ABSTRACT FROM AUTHOR]

Medium Resolution Spectral Imager II (MERSI-II) is one of the core sensors mounted on the FengYun-3D (FY3D) satellite. Two adjacent 250 m long-wave thermal infrared (TIR) channels provide a considerable opportunity for retrieving Land Surface Temperature (LST) with high spatiotemporal resolution. In this paper, Thermodynamic Initial Guess Retrieval (TIGR) dataset and MODTRAN 4.0 model were used to re-fit the parameters of the Split-Window (SW) algorithm suitable for MERSI-II TIR channels, and then the daily 250 m resolution MERSI-II LST product was retrieved. The Radiance-based (R-based) method results showed that the bias value between L S T s simulated by MODTRAN4.0 and the input L S T t is 0.16 K, and the MAE value is 0.38 K. Inter-comparison method results showed that the MERSI-II LST and MODIS LST products were consistent in spatial distribution, but there were certain differences between MODIS LST and MERSI-II LST at different land cover types. T-based method results showed that R values between the site-observed LST and MERSI-II LST retrieved by SW algorithm exceeded 0.92, the bias value was between 3.6 K and 4.4 K, and the MAE value was between 2.6 K and 4.5 K. The above results indicating that the SW algorithm proposed in this study has good accuracy and applicability. [ABSTRACT FROM AUTHOR]

The recognition of English texts in teaching scenes is a practical research direction. English text recognition can be widely used in English teaching scenes, such as assisting teachers to recognise students' English homework, text positioning before text translation, developing outdoor classrooms, assisting junior students in scene understanding and so on. To identify English information in different scenes as accurately as possible, identifying the corresponding text content is the key. Based on a deep neural network, this paper proposes GCN-Attention English recognition algorithm. The experiment adopts the deep learning framework Tensorflow, which combines 104 × 104 size GCN with an attention mechanism for training. The output of GCN is used to train the cyclic neural network to continuously predict the next most likely letter in the sequence. The goal of training is to match the output words with the expected words as much as possible. The test results show that the model can have a good recognition accuracy for the scene image data set used in teaching. [ABSTRACT FROM AUTHOR]

In multi-objective bilevel optimisation problems, the upper-level performance of different lower-level optimal solutions may be very different, even though they belong to the same lower-level problem. It may lead to poor optimisation results. Therefore, the lower-level search should search lower-level non-dominated solutions that are also non-dominated in the upper-level objective space. In this paper, we use two populations in the lower-level search. The first population maintains non-dominance and diversity in the lower-level objective space and provides the second population with convergence pressure from the lower level. The second population selects the upper-level non-dominated solutions that are not dominated by the first population in the lower-level objective space, which make the second population maintain the non-dominance at both upper and lower levels. Besides, to improve the search efficiency, we set up the upper-level mating pool to generate the upper-level vectors of offsprings near the upper-level vectors of the better individuals in the current population. To balance convergence and diversity, the selection operator of a decomposition based multi-objective evolutionary algorithm is adopted. The proposed algorithm has been evaluated on a set of benchmark problems and a real-world optimisation problem. Experimental results demonstrate that the proposed algorithm is efficient and effective. [ABSTRACT FROM AUTHOR]

The search space of large-scale multi-objective optimization problems (LSMOPs) is huge because of the hundreds or even thousands of decision variables involved. It is very challenging to design efficient algorithms for LSMOPs to search the whole space effectively and balance the convergence and diversity at the same time. In this paper, to tackle this challenge, we develop a new algorithm based on a weighted optimization framework with two effective strategies. The weighted optimization framework transforms an LSMOP into multiple small-scale multi-objective optimization problems based on a problem transformation mechanism to reduce the dimensionality of the search space effectively. To further improve its effectiveness, we firstly propose a centerline symmetry strategy to select reference solutions to transform the LSMOPs. It takes not only some non-dominated solutions but also their centerline symmetric points as the reference solutions, which can enhance the population diversity to avoid the algorithm falling into local minima. Then, a new double-line transformation function is designed to expand the search range of the transformed problem to further improve the convergence and diversity. With the two strategies, more widely distributed potential search areas are provided and the optimal solutions can be found easier. To demonstrate the effectiveness of our proposed algorithm, numerical experiments on widely used benchmarks are executed and the statistical results show that our proposed algorithm is more competitive and performs better than the other state-of-the-art algorithms for solving LSMOPs. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) are capable of achieving data dissemination between them such that exploration of their potential could be performed based on their frequency range. It is considered to be highly difficult for recharging sensor devices under adverse situations. The main drawbacks of WSNs concern to the issue of network lifetime, coverage area, scheduling and data aggregation. In particular, prolonging network lifetime confirms the success together with the energy conservation of sensor nodes, data transmission reliability and scalability of their operation in data aggregation. Clustering schemes are considered to be highly suitable for effectively utilising the resources with lower overhead, such that energy consumption is enhanced for upgrading the network lifespan. In this paper, a Hybrid Modified Artificial Bee Colony and Firefly Algorithm (HMABCFA) -Based Cluster Head Selection is proposed for ensuring energy stabilisation, delay minimisation and inter-node distance reduction for improving the network lifetime. This proposed HMABCFA integrates the benefit of the Firefly optimisation algorithm for generating a new position that which has the capability of replacing the position, which is not updated in the scout bee phase of ABC. This incorporation of Firefly optimisation algorithm into the ABC algorithm prevents the limitations of premature convergence, slow convergence and the possibility of being trapped into the local point of optimality in the clustering process. The modified ABC-based clustering process is phenomenal in improving the feasible dimensions for enhancing the process of exploitation and exploration. The results of the HMABCFA, on an average are confirmed to enhance the network lifetime by 23.21%, energy stability by 19.84% and reduce network latency by 22.88%, compared to the benchmarked approaches. [ABSTRACT FROM AUTHOR]

The drill string is always exposed to various types of vibrations among which, stick slip is one of the most important types. It is a severe state of torsional vibrations. This phenomenon can decrease the rate of penetration of drilling, wear of expensive equipment prematurely and cause catastrophic failures. In this paper, a novel adaptive sliding mode (SM) controller is proposed to eliminate stick slip in drill string systems. This proposed algorithm has a more robust capacity than existing 1st-order SM schemes in the literature regarding the robustness to parametric uncertainties, variations in weight on bit (WOB), variations in reference velocity and measurement noise. Moreover, the proposed controller does not require a priori knowledge of the upper bounds of parametric uncertainties, external disturbances and can be easily applied for any operating mode of the drill rig. A proof of stability based on the Lyapunov criterion of the system is given. Simulation results show that the proposed algorithm suppresses the stick-slip while keeping good performances compared to other SM controllers. A comparative study between the proposed controller and classic SM controllers and other adaptive SM scheme is performed in order to assess the advantages of the proposed algorithm and illustrate the overall performance improvements. The obtained results show that the proposed controller succeeded to eliminate the stick-slip phenomenon with the best performance compared to the classic SM controllers. In fact, the proposed controller presented a reduction of nearly 26 % in terms of overshoot and 1.6 times better settling time values while having the smoother input signal. [ABSTRACT FROM AUTHOR]

This paper proposes an improved zero-mean normalization sum of squared differences (ZNSSD) algorithm to solve the problem of the inability of traditional structural measurement to extract high-frequency vibration signals. In the proposed technique, the high-speed image sequence of target vibration is captured by a high-speed camera. Then, the ZNSSD template matching algorithm with subpixel accuracy is introduced to process the captured images in the computer. Additionally, a modified search algorithm, the ZNSSD template matching algorithm based on image pyramid (ZNSSD-P), is proposed to significantly reduce the computation time and increase efficiency. Then, a jumping ZNSSD template matching algorithm based on image pyramid (J-ZNSSD-P) is proposed to further improve the efficiency of the ZNSSD-P algorithm. Vibration signals were extracted with Grating Ruler Motion Platform and sound barriers. Results show that the vibration signal extraction method has high precision and efficiency. [ABSTRACT FROM AUTHOR]

We study the Phase Retrieval (PR) problem under the phaseless short-time Fourier transform (STFT) measurements. This paper proposes a novel algorithm named PAR to solve the STFT PR problem in phase and amplitude respectively with a milder retrieval condition compared with the original methods. First, a symmetric undirected graph of signals is proposed for the computation of the relative phase. Then the retrieval conditions of STFT PR problem are discussed for a single window case and some weaker retrieval conditions are proposed compared with the LS method. We also discuss STFT PR problem in multiple windows and establish retrieval theorems without restrictions of sliding step-size L. We give some numerical results of the PAR algorithm. [ABSTRACT FROM AUTHOR]

The optimization problems are becoming more complicated, requiring new and efficient optimization techniques to solve them. Many bio-inspired meta-heuristic algorithms have emerged in the last decade to solve these complex problems as most of these algorithms may be trapped into local optima and could not effectively solve all types of optimization problems. Hence, researchers are still trying to develop new and better optimization algorithms. This paper introduces a novel biologically-based optimization algorithm called circulatory system-based optimization (CSBO). CSBO is modeled based on the function of the body's blood vessels with two distinctive circuits, i.e. pulmonary and systemic circuits. The proposed CSBO algorithm is tested on a wide variety of complex functions of the real world and validated with the standard meta-heuristic algorithms. The results indicate that the CSBO algorithm successfully achieves the optimal solutions and avoids local optima. Note that the source code of the CSBO algorithm is publicly available at . [ABSTRACT FROM AUTHOR]

On account of the variable topology and multi-terminal power supply in micro-grid, the fault diagnosis faces more and more challenges. Traditional fault location criteria are unsuitable and fault diagnosis modelling is complex or poor versatility. Further on, the fault reasoning operation is time-consuming. A high transplantable fault diagnosis model aiming at the fault features in micro-grid is established in this paper, and a simple inference algorithm with good error-detecting capability is proposed. Firstly, the fault location criterion based on current magnitude, current phase and Distributed Generation's current direction information is proposed, and the fault transient component is adopted as a supplementary criterion. Secondly, a hierarchical Petri net model utilizing the electrical information, relays' and circuit breakers' state information is accomplished. The model consists of fault location layer and fault clearance layer. In order to increase the portability of the model, the collective processing for the breakers is implemented. Moreover, 'bidirectional arrowhead arc' is introduced to reduce the number of places to optimize the Petri net model well. An improved redundant coding Petri net reasoning algorithm is proposed based on the fault clearance layer of the Petri net model. Finally, the validity of the method is verified through case analysis and comparison. [ABSTRACT FROM AUTHOR]

To address the increasing health care needs for an ageing population, in this paper, a method of detecting human movements using smartphones is proposed to decrease the risk of accidents in the elderly. The method proposed in this paper uses a mobile phone that has an embedded acceleration sensor to record human motion information that are divided into daily activities (walking, running, going up stairs, going down stairs, and standing still) and falling down. In the process of data acquisition, motion noise contains some interference, and thus the median filter is employed to de-noise and smooth the motion data. Moreover, we extract representative multi-group features and analyse the features by principal component analysis and singular value decomposition to reduce dimensions. Through experimental comparisons with various classifiers, the support vector machine classifier is selected to classify the extracted features. The accuracy of fall detection reached 96.072%, which proved the accuracy of our proposed method. [ABSTRACT FROM AUTHOR]