Search

p , q -quasirung orthopair fuzzy set (p , q -QOFS) is an extension of the q -rung orthopair fuzzy set (q -ROFS) theory used to represent uncertainty and vagueness in decision-making processes. The paper aims to utilize robust sine-trigonometric operational laws to investigate the group decision-making process within the p , q -QOFSs framework. The p , q -QOFS possess a distinctive characteristic of handling uncertain information by utilizing a wider space for membership representation compared to q -ROFS. Consequently, the current paper has been categorized into three distinct phases. In the initial phase, novel operational laws will be presented for p , q -QOFSs. The fundamental concept behind these newly proposed operations is to integrate the properties of the sine function, which include being periodic and symmetric about the origin, into the decision-making process for objects. Then, based on these laws, several operators for aggregating information will be obtained, along with their necessary properties and relationships. Lastly, an algorithm will be presented for interpreting the problem of multi attribute group decision-making (MAGDM), utilizing the operators, and demonstrating it with an illustrative example. A comprehensive comparative analysis will be conducted with some of the existing methods to uncover their impacts. [ABSTRACT FROM AUTHOR]

As is known, the problem of finding a three-dimensional stable matching with cyclic preferences (3DSM-CYC) always has a solution, if the number of objects of each type (i.e., the problem size n) does not exceed 5. According to the conjecture proposed by Eriksson et al. (2006), this is true for any n. However, Lam and Plaxton (2019) have proposed an algorithm for constructing preference lists in 3DSM-CYC which has allowed them to disprove the mentioned conjecture. The size of the initially constructed counterexample equals 90; however, according to the results obtained by us recently for the problem with incomplete preference lists, one can use the same construction for getting a counterexample of size 45. The main contribution of this paper consists of reducing the size of the counterexample to n = 20. We summarize results of the application of the technique developed by us for constructing counterexamples for 3DSM-CYC. In the final section of the paper we discuss a new variant of 3DSM, whose solution always exists and can be found within the same time as that required for solving 2DSM. [ABSTRACT FROM AUTHOR]

I n network information mining, people must measure the influence of important nodes in complex networks, otherwise it cannot be mined. However, traditional node influence measurement methods have defects and strong application limitations. Therefore, this paper proposes a multi-scale centrality algorithm under some traditional methods, and carries out related research. This paper introduces the basic concept and application advantages of multi-scale centrality algorithm, then constructs the algorithm model, and finally verifies the effectiveness of the algorithm model in the measurement of node influence in complex networks. After verification, the algorithm is effective and the measurement result is accurate. [ABSTRACT FROM AUTHOR]

With the construction of smart cities, smart ports are developing rapidly, providing favorable conditions for enhancing port competitiveness, promoting industrial upgrading, and economic transformation. With the continuous progress of society and science and technology, the safety risks of intelligent ports are also increasing. In order to better address these risks, it is necessary to establish a stable and efficient management system. This paper applies data mining and fuzzy control theory technologies for large-volume, high-precision real-time information collection, based on the research of the BP neural network algorithm. By establishing and analyzing a safety risk management system model based on the BP multilayer neuron network, it provides a rationality evaluation method and design concept. After designing the safety risk management system, this paper conducts a performance test on the system. The test results show that through optimization, the accuracy, generalization ability, and reliability of the model can be improved. Its accuracy is as high as 92% or more, fully demonstrating the system's reliability and superiority! [ABSTRACT FROM AUTHOR]

The rapid development of the Internet leads to the rapid growth of network information, we call it information explosion. The Internet is full of information, and it is difficult for users to find this information and useful knowledge of the ocean. The Web has become the world's largest information repository, and there is an urgent need for efficient access to the valuable knowledge of vast amounts of web information. The purpose of this paper is to study the process and algorithm analysis of text mining system based on artificial intelligence. This paper presents an algorithm of document feature acquisition based on genetic algorithm. Selecting suitable features is an important task in specific text classification and information retrieval. Finding appropriate feature vectors to represent the text will undoubtedly help with subsequent sorting and grouping. Based on the genetic algorithm of variable length chromosome, this paper improves the crossover, mutation and selection operations, and proposes an algorithm to obtain text feature vectors. This method has a wide range of applications and good results. [ABSTRACT FROM AUTHOR]

With the rapid growth of social economy, the requirements for resource utilization are becoming higher and higher. How to effectively solve the problem of energy shortage has become a hot topic. However, there are still many deficiencies in the current resource scheduling algorithm. For example, for different types of satellites with different needs and requirements, their performance indicators are different, and in the satellite communication system, the interaction between multiple nodes needs to be considered. Therefore, this paper studies the artificial intelligence algorithm, and proposes an improved particle complementary scheduling strategy for a single user in view of the shortcomings of the existing particle swarm optimization (PSO) algorithm. On this basis, this paper applies this method to evaluate the system performance and verify its effectiveness. The verification results show that the utilization efficiency of the satellite communication system resource scheduling algorithm is above 93%. [ABSTRACT FROM AUTHOR]

Big data has become the mainstream of information dissemination today. Big data plays an important role in the field of intelligent network monitoring. How to improve the hidden danger identification of intelligent network monitoring system and improve its accuracy is a hot issue to be solved. Therefore, in the context of big data, this paper uses intelligent analysis algorithm to identify and analyze the hidden dangers of intelligent network monitoring system. This paper mainly applies the methods of experimental setup, fuzzy analysis and data comparison to carry out relevant research on intelligent analysis of hidden danger identification of intelligent network monitoring system. The experimental data shows that the accuracy of the data obtained by the proposed method in the hidden danger identification is more than 50%, but less than 80%. Therefore, the application of background difference method needs further improvement. [ABSTRACT FROM AUTHOR]

In this paper, based on the Lagrange multiplier method, we construct a maximum principle preserving scheme for the time-fractional Allen-Cahn equation of 2- α (0 < α < 1) order. The correction energy of this scheme is increased by a term compared to the original energy, which is O (τ α). We prove that our scheme is unconditionally stable related to the corrected energy and verify the convergence, maximum principle, and energy conservation properties of the algorithm through numerical examples. We also find that the larger the α , the faster the evolution of the time-fractional Allen-Cahn equation. [ABSTRACT FROM AUTHOR]

In this paper we provide a tetrahedra-free algorithm to compute low-cardinality quadrature rules with a given degree of polynomial exactness, positive weights and interior nodes on a polyhedral element with arbitrary shape. The key tools are the notion of Tchakaloff discretization set and the solution of moment-matching equations by Lawson-Hanson iterations for NonNegative Least-Squares. Several numerical tests are presented. The method is implemented in Matlab as open-source software. [ABSTRACT FROM AUTHOR]

In this paper, we devise a stochastic extragradient-like algorithm incorporated with inertial terms, which requires a single projection onto our feasible set and employs a stochastic approximation version of an Armijo-type line search scheme along a feasible direction, for solving pseudomonotone stochastic variational inequalities. In the algorithm, two different stepsize strategies are employed to update steplength sequences without using the prior knowledge of the Lipschitz constant of involved operators. In the process of the stochastic approximation, we iteratively reduce the variance of stochastic errors. The almost sure convergence, the complexity analysis, and rates are provided in a dimensional space under reasonable conditions. Finally, some numerical experiments with graphical illustrations are reported to demonstrate the applicability and the efficiency of our algorithm in comparison with some projection type methods in the literature. [ABSTRACT FROM AUTHOR]

Diffeomorphic registration is a widely used technique for finding a smooth and invertible transformation between two coordinate systems, which are measured using template and reference images. The point-wise volume-preserving constraint det ⁡ (∇ φ (x)) = 1 is effective in some cases, but may be too restrictive in others, especially when local deformations are relatively large. This can result in poor matching when enforcing large local deformations. In this paper, we propose a new bi-variant diffeomorphic image registration model that introduces a soft constraint on the Jacobian equation det ⁡ (∇ φ (x)) = f (x) > 0. This allows local deformations to shrink and grow within a flexible range 0 < κ m < det ⁡ (∇ φ (x)) < κ M. The Jacobian determinant of transformation is explicitly controlled by optimizing the relaxation function f (x). To prevent deformation folding and improve the smoothness of the transformation, a positive constraint is imposed on the optimization of the relaxation function f (x) , and a regularizer is used to ensure the smoothness of f (x). Furthermore, the positivity constraint ensures that f (x) is as close to one as possible, which helps to achieve a volume-preserving transformation on average. We also analyze the existence of the minimizer for the variational model and propose a penalty-splitting algorithm with a multilevel strategy to solve this model. Numerical experiments demonstrate the convergence of the proposed algorithm and show that the positivity constraint can effectively control the range of relative volume without compromising the accuracy of the registration. Moreover, the proposed model generates diffeomorphic maps for large local deformations and outperforms several existing registration models in terms of performance. • A novel bi-variant diffeomorphic image registration model with relaxed Jacobian determinant constraints is proposed. • The existence of the minimizer for the variational model is proved. • A penalty splitting algorithm with a multilevel strategy is designed to solve the new model. • Numerical experiments show that the proposed algorithm is convergent and the new model has good performance. [ABSTRACT FROM AUTHOR]

Software-based technical indicators have been widely used for the stock market forecasting, aiming to predict market direction. Even though many algorithms for the software based technical indicators are presented, there are almost no hardware implementations reported in the literature. In this paper, the hardware implementation is presented for three commonly used technical indicators: Moving Average Convergence/Divergence (MACD), Relative Strength Index (RSI), and Aroon. Latency evaluation is conducted for Bitcoin and Ethereum within a single-day timeframe, utilizing the Xilinx Zynq-7000 programmable SoC XC7Z020-CLG484-1 platform. Additionally, various hardware/software (HW/SW) partitioning strategies are explored to leverage the flexibility of software alongside the performance advantages of hardware via the Zynq SoC platform. The results show that the best performing technical indicator is MACD with a speedup of 30 times over its software only counterpart. Furthermore, a hybrid design integrating multiple technical indicators is proposed, pairing MACD with RSI due to their competitive throughput values, differing by only 0.38 microseconds. This hybrid approach capitalizes on the parallel processing capabilities of hardware, enabling multiple systems to operate simultaneously. • Proposed SoC framework boosts HFT system efficiency. • HW/SW partitioning on Zynq-7000 SoC enhances flexibility. • MACD, RSI, Aroon indicators implemented for forecasting. • MACD outperforms others on ZYNQ SoC, 30x faster than software. • MACD and RSI combination optimal for hybrid designs. [ABSTRACT FROM AUTHOR]

Earth observation satellite (EOS) scheduling is critical for improving the performance of Earth observation system. Most of the existing studies on satellite observation scheduling problems focus on static tasks and real-time dynamic tasks also known as emergency tasks while few attempts have been made for common dynamic tasks yet. The common dynamic tasks are characterized by uncertain arrival times and delayable observations while the emergency tasks require immediate observations. The number of common dynamic tasks is rapidly increasing with the expansion of satellite observation applications, which poses great challenges to EOS observation scheduling. To address this issue, this paper investigates the satellite observation scheduling problem with common dynamic tasks. Firstly, a centralized onboard dynamic scheduling framework based on a periodic-triggered rolling horizontal optimization (RHO) strategy is proposed and a novel two-stage mathematical model is established for the periodic rescheduling problem. Secondly, we propose a low-complexity onboard periodic rescheduling algorithm (OPR), which consists of a greedy-based task allocation algorithm, a pointer network (Ptr-network) based task scheduling algorithm and an iterative local search algorithm. In the greedy-based task allocation algorithm, we define a Task-EOS Fitness Indicator (TEFI) and each task is greedily allocated to the EOS with maximum TEFI. In the Ptr-network based task scheduling algorithm, the allocated task sets of all EOSs are fed into the Ptr-network in parallel to generate the observation scheduling result. Afterward, an iterative local search algorithm is proposed to further improve the quality of the observation scheduling result. Finally, extensive experiments are conducted to demonstrate the superiority of the OPR algorithm for the satellite observation scheduling problem with common dynamic tasks. [ABSTRACT FROM AUTHOR]

A k -class domination coloring (k -cd-coloring) is a partition of the vertex set of a graph G into k independent sets V 1 , ... , V k , where each V i is dominated by some vertex u i of G. The least integer k such that G admits a k -cd-coloring is called the cd-chromatic number, χ c d (G) , of G. A subset S of the vertex set of a graph G is called a subclique in G if d G (x , y) ≠ 2 for every x , y ∈ S. The cardinality of a maximum subclique in G is called the subclique number, ω s (G) , of G. In this paper, we present algorithms to compute an optimal cd-coloring and a maximum subclique of (i) trees with time complexity O (n) and (ii) co-bipartite graphs with time complexity O (n 2. 5). This improves O (n 3) algorithms by Shalu et al. (2017, 2020). In addition, we prove tight upper bounds for the subclique number of the class of (i) P 5 -free graphs and (ii) double-split graphs. [ABSTRACT FROM AUTHOR]

One of the most dangerous threats in WSNs is botnet attacks, in which attackers use mutual communications between IoT devices to launch large-scale malicious activities. In this regard, developments in the field of effective and reliable means of defence against this type of threat, in particular, reliable methods for detecting, identifying, and countering botnet attacks, are becoming increasingly important and relevant. This paper presents a comprehensive study that applies machine learning techniques, namely Random Forest and XGBoost, to identify botnet attacks on IoT effectively. These algorithms are analyzed, compared, and shown to be highly effective in detecting complex patterns indicative of botnet activity, thus achieving a significant improvement in IoT security. The conducted research aims to make a useful contribution to the problem of securing WSNs and IoT in general. The results of the study demonstrated high accuracy in detecting attacks with an accuracy of 99.18% for XGBoost and Random Forest showed an accuracy of 99.21%. Thus, it was shown that the significance of applying machine learning techniques such as Random Forest and XGBoost can be one of the key approaches in combating botnet attacks and securing the IoT. The results of the work emphasize the promising application of machine learning techniques for effective defense against cyber threats and highlight the importance of further. [ABSTRACT FROM AUTHOR]

Intellectual analysis of small and middle-sized datasets through machine learning tools presents challenges in various application domains. Existing methods fail to provide sufficient accuracy, and their utilization is accompanied by a range of issues during data analysis. This paper proposes the improvement of the input doubling method for middle-sized data analysis. The existing method employs an augmentation procedure where the augmented data sample increases quadratically. This imposes several limitations on the method's usage for middle-sized data analysis. The authors propose enhancing this method by introducing an additional clustering procedure during data augmentation. The training algorithms and application methods are described, and a visualization of the main steps of its operation is provided. Modeling is performed on two medium-sized datasets. Optimal parameters for the improved method are selected, demonstrating its high efficiency. Specifically, significant reductions in the volumes of augmented datasets (8-9 times for both datasets respectively) are achieved, accompanied by substantial reductions in the training procedure duration of the method (more than 100 and 260 times for both datasets respectively), while maintaining high accuracy. [ABSTRACT FROM AUTHOR]

• OCR-detected characters or words in an image require line segmentation to reunite into word or sentence. • Projection based line segmentation cannot be applied to Chinese historical texts. • Columns in Chinese historical texts exhibit a sub-divided column format. • Adjacent character detection (ACD) algorithm can deal with the unique column structure. • Performance of ACD algorithm as a post-processing of OCR is discussed. In recent times, the advent of AI-based optical character recognition (OCR) has garnered significant attention in the realm of digital text conversion. However, it is imperative to note that OCR solely identifies individual characters or words, and lacks the ability to reunite them into cohesive units such as words or sentences. Consequently, the manual sorting of them to establish the appropriate reading order has emerged as a bottleneck. In this paper, we present an algorithm termed adjacent character detection (ACD), designed to serve as a post-processing of OCR, facilitating automatic digital text conversion. The algorithm involves line segmentation through a quad-ACD scan (up-down-down-up), allowing it to consecutively discern characters within a column based on their adjacency relations. Conventional projection profile analyses have struggled to effectively partition the distinct internal structure of Chinese historical text, where two annotation columns often subdivide from a single body column. In contrast, our ACD algorithm employs an approach, reuniting adjacent characters rather than fragmenting the entire text into isolated entities. Additionally, ACD algorithm enabled body/annotation classification for OCR-detected characters based on the pattern analysis of its quad scan. This cumulative information empowers the conversion of digital text in a desired reading order. To assess the efficacy of the proposed algorithm, a set of ground-truth OCR result was subjected to rigorous testing, culminating in a reading order accuracy of 98.6%. Noteworthy robustness was also demonstrated in the face of misaligned columns, experimentally induced by applying tilt, warp, and wavy noises to the original digital images. Lastly, the algorithm was integrated with two pre-developed OCR models, resulting in a reading order accuracy of 97.7%. [Display omitted] [ABSTRACT FROM AUTHOR]

This paper analyzes a parareal approach based on fractional-step methods for the nonstationary Navier-Stokes equations. As an efficient parallel computing framework, the coarse propagator often determines the performance of the parareal algorithm. We present a parareal algorithm using the fractional-step method, a very efficient time discrete scheme for the Naiver-Stokes equations, as the coarse propagator for the Navier-Stokes equations. Then we give the specific stability and convergence analysis of this specific parareal algorithm. Finally, numerical experiments are done to show efficiency and illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

Two key challenges in optimal control include efficiently solving high-dimensional problems and handling optimal control problems with state-dependent running costs. In this paper, we consider a class of optimal control problems whose running costs consist of a quadratic on the control variable and a convex, non-negative, piecewise affine function on the state variable. We provide the analytical solution for this class of optimal control problems as well as a Hopf-type representation formula for the corresponding Hamilton-Jacobi partial differential equations. Finally, we propose efficient numerical algorithms based on our Hopf-type representation formula, convex optimization algorithms, and min-plus techniques. We present several high-dimensional numerical examples, which demonstrate that our algorithms overcome the curse of dimensionality. We also describe a field-programmable gate array (FPGA) implementation of our numerical solver whose latency scales linearly in the spatial dimension and that achieves approximately a 40 times speedup compared to a parallelized central processing unit (CPU) implementation. Thus, our numerical results demonstrate the promising performance boosts that FPGAs are able to achieve over CPUs. As such, our proposed methods have the potential to serve as a building block for solving more complicated high-dimensional optimal control problems in real-time. [ABSTRACT FROM AUTHOR]

In this paper, elliptic control problems with the integral constraint on the gradient of the state and the box constraint on the control are considered. The optimality conditions for the problem are proved. To numerically solve the problem, a finite element duality-based inexact majorized accelerated block coordinate descent (FE-dABCD) algorithm is proposed. Specifically, both the state and the control are discretized by piecewise linear functions. An inexact majorized ABCD algorithm is employed to solve the discretized problem via its dual, which is a multi-block unconstrained convex optimization problem, but the primal variables are also generated in each iteration. Thanks to the inexactness of the FE-dABCD algorithm, the subproblems at each iteration are allowed to be solved inexactly. For the smooth subproblem, we use the preconditioned generalized minimal residual (GMRES) method to solve it. For the two nonsmooth subproblems, one of them has a closed form solution through introducing an appropriate proximal term, and another one is solved by the line search Newton's method. Based on these efficient strategies, we prove that our proposed FE-dABCD algorithm enjoys O (1 k 2 ) iteration complexity. Moreover, to make the algorithm more efficient and further reduce its computation cost, based on the mesh-independence of ABCD method, we propose an FE-dABCD algorithm with a warm-start strategy (wFE-dABCD). Some numerical experiments are done and the numerical results show the efficiency of the FE-dABCD algorithm and wFE-dABCD algorithm. [ABSTRACT FROM AUTHOR]

• Dynamics of multi-layer membrane structure with elastic spacers is studied. • An optimization criterion to eliminate the crossing modes is proposed. • The optimal spacer positions are calculated by Particle Swarm Optimizer algorithm. In recent years, there has been a growing interest in the dynamics of space membrane structures. However, existing research primarily focuses on single-layer membrane structures, leaving a significant research gap in the study of multi-layer structures with elastic spacers. To address this gap, this paper studies the dynamics and interlayer spacing accuracy of multi-layer membrane structures with elastic spacers. Specifically, the research focuses on the placement optimization of elastic spacers. A novel optimization criterion for the elastic spacers has been proposed, and the Particle Swarm Optimizer (PSO) algorithm has been utilized to calculate the optimal spacers positions. Results show that optimally placed elastic spacers can eliminate the crossing modes and improve the interlayer spacing accuracy during vibration. [ABSTRACT FROM AUTHOR]

Dynamic Mode Decomposition (DMD) is an equation-free method that aims at reconstructing the best linear fit from temporal datasets. In this paper, we show that DMD does not provide accurate approximation for datasets describing oscillatory dynamics, like spiral waves, relaxation oscillations and spatio-temporal Turing instability. Inspired by the classical "divide and conquer" approach, we propose a piecewise version of DMD (pDMD) to overcome this problem. The main idea is to split the original dataset in N submatrices and then apply the exact (randomized) DMD method in each subset of the obtained partition. We describe the pDMD algorithm in detail and we introduce some error indicators to evaluate its performance when N is increased. Numerical experiments show that very accurate reconstructions are obtained by pDMD for datasets arising from time snapshots of certain reaction-diffusion PDE systems, like the FitzHugh-Nagumo model, a λ - ω system and the DIB morpho-chemical system for battery modeling. Finally, a discussion about the overall computational load and the future prediction features of the new algorithm is also provided. [ABSTRACT FROM AUTHOR]

In the contemporary era, technology plays a significant role in our daily lives. Consequently, there is a growing emphasis on securing information transmitted across networks. To meet this need, numerous cryptographic systems have been developed to enhance security. The distinguishing factor among these systems lies in their capability to uphold fundamental criteria for information security, including authentication confidentiality and integrity. This paper introduces a method involving the use of DNA and lightweight cryptography[1-2-3]. This method utilizes for the encryption and decryption of data using DNA sequence and the SIMON cryptographic system—a symmetric encryption algorithm specifically designed for simplicity and efficiency. [ABSTRACT FROM AUTHOR]

Clustering and routing algorithms are critical to collecting and processing data sensed by nodes of wireless sensor networks deployed in various missions including environmental monitoring, tracking, and rescue operations. In this paper, a clustering algorithm is presented for wireless sensor networks with balanced cluster size resulting in energy efficiency. The algorithm is based on forming clusters using topology of the network and routing aggregated data from each cluster head to the base station. The cluster formation phase involves using tree-based traversals on the underlying sensor network graph. Using simulations, it is demonstrated that clusters of similar sizes are obtained for networks of varying sensor radii. It is demonstrated that the time to death of the first node of this clustering algorithm is superior to well-known clustering algorithm for random networks. [ABSTRACT FROM AUTHOR]

• Variational Quantum Circuits (VQCs) play a key role in several applications. • VQCs are parameterized quantum circuits trained by using classical optimizers. • The paper proposes to apply memetic algorithms to train VQCs. • The designed memetic algorithm outperforms the state-of-the-art classical optimizers. Among the ready-to-implement quantum algorithms, Variational Quantum Circuits (VQCs) play a key role in several applications, including machine learning. Their strength lies in the use of a parameterized quantum circuit that is trained by means of an optimization algorithm run on a classical computer. In such a scenario, there is a strong need to design appropriate classical optimization schemes that deal efficiently with VQCs and pave the way for quantum advantage in machine learning. Among possible optimization schemes, those based on evolutionary computation are finding increasing interest, given the unconventional and nonanalytical nature of the problem to be solved. This paper proposes to apply memetic algorithms to train VQCs used as quantum classifiers and shows the benefits of exploiting this evolutionary optimization technique through a comparative experimental session. [ABSTRACT FROM AUTHOR]

Knee arthritis occupies a significant proportion of the musculoskeletal burden in the UK. Total knee arthroplasty currently comprises the mainstay of treatment. There has been a shift towards treating isolated unicompartmental osteoarthritis with bone-preserving surgical techniques, in the form of realignment osteotomy or unicompartmental arthroplasty. There are significant data regarding the survivorship of unicompartmental knee arthroplasty from the National Joint Registry data. Similar registry data are not available for osteotomy surgery yet, but the evidence suggests that unicompartmental knee arthroplasty has greater survivorship. Osteotomies can, however, deliver higher functional return. For both techniques to succeed, it is imperative that rigorous surgical decision-making, with regards to patient selection, should be followed. This paper discusses the basis for these principles and their importance in delivering optimal care. Often, these two surgical techniques are promoted as being mutually exclusive; this paper argues that, in fact, they are part of a complementary algorithm that can deliver the best outcome to the appropriately selected patient. [ABSTRACT FROM AUTHOR]

Big data analytics uncovers hidden patterns through classification, prediction and reinforcement of big datasets. In these datasets, some features have a negligible connection with other features and some may be insignificant as their presence does not impact the results of big data analytics. The algorithms of big data analytics generate better classification models when supplied with a dataset consisting of relevant, important and informative features. These features can be classified as important and unimportant. For the selection of important features, different filtrations techniques are used. These techniques filter features on different basis like information gain, information dispersion, Gini index, etc. and have a few drawbacks reviewed in this paper. The first contribution of this paper is to propose a new feature selection technique named "Relevance-diversity algorithm" for selecting important features based on two measures i.e. relevance and diversity for optimizing features as low as possible and reducing the search time used in feature selection. The second contribution of the paper is that it proposes a new supervised classification algorithm based on Naive Bayes classification. The assumption of naive i.e. feature independence is discarded from the algorithm of Naive Bayes classification. The features are considered to be dependent on each other and their combined impact on the class value is evaluated. The newly proposed classification algorithm is then applied to the features selected through the relevance-diversity based feature selection technique. The datasets of Weather, Tic-Tac-Toe, Lenses, Balance-scale and CarEval are used for the evaluation of both the techniques. The results of the proposed feature selection method are compared with the existing methods and the results of Modified-Bayes are compared with the existing Naive Bayes algorithm. Analysis revealed that the proposed method performed better in terms of the number of features, accuracy and time complexity. [ABSTRACT FROM AUTHOR]

The conventional direct torque control (DTC) has high torque and stator flux fluctuation that causes the stator current distortion. This paper presents an efficient control method based on the feedback-linearization direct torque control (FL-DTC) method for an interior permanent magnet synchronous motor (IPMSM) drive by using an improved firefly algorithm. The proposed approach can greatly restrain the poor performance of torque and stator flux. Thus, it is suitable for IPMSM drives in electric vehicles. First, a decoupled linear model is derived to implement the proposed efficient feedback linearization control for the IPMSM. Two phase voltages in d-q axes and two additional control inputs take shape into an isomorphism mapping with the concept of orthogonal transformation. The torque generation is related to the additional control. Second, the Hamiltonian efficient control theory combined with an improved firefly algorithm is applied to obtain an analytical solution. An efficient linearization controller is designed with a cost function considering the maximum voltage of the inverter. Finally, simulation and experiment are carried out to compare the performance of the proposed efficient FL-DTC with the improved firefly algorithm and the conventional direct torque control. The results show that the proposed control method can reduce the torque and flux ripples at a steady state and maintains a good dynamic response with the variations of speed and torque. • To restrain the poor performance of torque and stator flux, this paper presents an optimal control method based on feedback-linearization direct torque control (FL-DTC) method for an interior permanent magnet synchronous motor (IPMSM) drive by using an advanced firefly algorithm. • A decoupled linear model is derived to implement the proposed optimal feedback linearization control for the IPMSM. Two phase voltages in d-q axes and two additional control inputs take shape into an isomorphism mapping with the concept of orthogonal transformation. • The Hamiltonian of optimal control theory based on an advanced firefly algorithm is applied to obtain an analytical solution. • An optimal linearization controller is designed with a cost function considering the maximum voltage of the inverter. • The proposed control method has faster torque response and smaller torque and stator flux fluctuation. [ABSTRACT FROM AUTHOR]

Product recommendation systems are an important aspect of retailing because of the improved shopping experience provided for customers. Due to the wide range of products offered by retailers, recommendation systems provide an optimal approach for displaying only relevant products to customers by forming associations that exist between products. Still, it is also important to understand the characteristics of customers connected to different product associations. Conventional approaches for product recommendation systems apply association algorithms and unsupervised classification of customers based on product ratings. However, it is not clear what demographic properties of customers are linked to which different product associations. This paper applies a hybrid system of machine learning (ML) association and clustering algorithms to implement a product recommendation system that shows associations that exist in products and unique customer profiles linked to these associations. The method described in this paper is evaluated with a case of a hygiene product retailer in Austria. [ABSTRACT FROM AUTHOR]

• This paper constructs and analyzes a composite s -sub-step explicit method. • Seven explicit schemes in the present method are developed and compared. • Each explicit scheme is second-order accurate and provides maximal stability bound. • Each explicit scheme (s > 1) can control numerical dissipation at the bifurcation point. This paper constructs a composite s -sub-step explicit method and analyzes second-order accuracy, conditional stability, and dissipation control at the bifurcation point. In the present s -sub-step method, each explicit scheme achieves identical second-order accuracy for analyzing general structures and provides maximal stability bound, that is 2 × s where s denotes the number of sub-steps. Except for the single-sub-step case, each explicit scheme achieves dissipation control at the bifurcation point. After registering second-order accuracy and controllable numerical dissipation, the composite multi-sub-step explicit method should be well-designed to reach maximal stability bound. The analysis reveals that as the number of sub-steps increases, the developed explicit schemes can reduce numerical low-frequency dissipation and enlarge stability. Under the same computational cost, the advantage of reducing low-frequency dissipation and enlarging stability is gradually weakened with the increase of sub-steps, so the first seven explicit schemes are only developed and compared in this paper. Some typical experiments are provided to confirm the methods' numerical performance. The proposed explicit schemes are more accurate and efficient for some models than existing second-order algorithms of that class. [ABSTRACT FROM AUTHOR]

Graph mining is one of the significant tasks in the field of computer science. Most of the applications generate a vast amount of data which is represented with the help of a graph. Due to this graph representation, these applications have become complex and increased in size. Finding relevant information from that graph becomes a complicated task. For this community detection algorithms play a vital role in graph partitioning to retrieve relevant information. Finding communities in a graph reduces the complexity of the graph due to related data comes closer to forming a community. Many algorithms have been introduced in the last decade; the Clique percolation method (CPM) is the benchmark algorithm for finding an overlapping community. But in this method, some nodes remain unclassified, nodes that are not part of the clique. Paper proposed the clique-based Louvain algorithm(CBLA), which can classify the non-classified node (NCN) obtained after finding cliques in one of the communities by applying the Louvain algorithm. Louvain algorithm is used to classify the non-overlapped community, but with the help of cliques, it will also detect the overlapped nodes. This paper compared the proposed algorithm with four other benchmark algorithms. The proposed algorithm gives equal or enhanced performance among all compared algorithms. [ABSTRACT FROM AUTHOR]

In this paper, the multi-parameter time fractional radially symmetric anomalous diffusion model used in porous media with initial singularity is considered. Both the direct numerical solution problem and the multi-parameter identification inverse problem are studied. Given the singularity in the initial time, a stable numerical scheme on nonuniform grid mesh is derived by using the L 2 − 1 σ method. To conduct the multi-parameter inversion problem, a novel hybrid Black Widow Optimization and Cuckoo Search (BWOCS) algorithm is proposed to combine the advantages of both the BWO algorithm and the CS algorithm, in order to improve the convergence speed and to achieve high-accuracy optimal results. Numerical examples are given to verify the efficiency and accuracy of the proposed numerical scheme and parameter inversion algorithm. Results show that the nonuniform grid L 2 − 1 σ scheme is efficient to deal with the time fractional radially symmetric anomalous diffusion problem with initial singularity, and the hybrid BWOCS algorithm has high precision and well convergence speed, compared with both the BWO and CS algorithms, which can be extended to other fractional inverse problems. [ABSTRACT FROM AUTHOR]

Cognitive radio network (CRN) is getting growing interest of the researchers due to its wide applicability for spectrum sharing with massive number of active devices in Internet of Things (IoT). In existing schemes, a large part of the spectrum may remain underutilized which was assigned to service providers as primary users (PU). Secondary user (SU) may be the alternative to use the spectrum. The main challenge is that SU keeps on sending the packets in an incremental manner until a free channel is found in real conditions. It results in excessive communication and packet loss. This paper presents an efficient tree-centric approach where a centralized base-station maintains a tree of available channels and intelligently allocate to the SUs as per the real-time availability of channels. It analyzes for the effective usage of these channels by the SUs. It also manages the authenticated SUs to avoid any interference due to the hidden node problem. A number of extensive simulations are performed using network simulator. The existing instantaneous approaches require 10 to 12 attempts to send request for acquiring free channel with an average delay of 315 ms, the Hybrid-P1 and Hybrid-P2 approaches consumed 4 requests each with a delay of 128 ms to 135 ms. Our proposed CDC mechanism achieves a channel access mostly in 1 to 2 requests with an average delay of about 72 ms. Results are extracted from the trace files that prove the dominance of proposed scheme. [ABSTRACT FROM AUTHOR]

Honey badger algorithm (HBA) is a recent swarm-based metaheuristic algorithm that excels in simplicity and high exploitation capability. However, it suffers from some limitations including weak exploration capacity and an imbalance between exploration and exploitation. In this paper, an improved honey badger algorithm called ODEHBA is proposed to improve the performance of basic HBA. Firstly, an improved orthogonal opposition-based learning technique is employed to assist population in escaping local optimum. Secondly, differential evolution is utilized to ensure the enrichment of population diversity and to enhance convergence speed. Finally, the exploration capability of ODEHBA is boosted by an equilibrium pool strategy. To validate the efficacy of proposed ODEHBA, it is compared with 13 well-known metaheuristic algorithms on CEC2022 benchmark test sets. Friedman test and Wilcoxon rank-sum test are utilized to assess the performance of ODEHBA. Furthermore, three engineering design problems and Internet of Vehicles (IoV) routing problem are applied to validate the capability of ODEHBA. The simulation results demonstrate that ODEHBA excels in solving complex numerical problems, engineering design, and IoV routing problems. This holds significant practical implications for cost reduction and improved resource utilization. [ABSTRACT FROM AUTHOR]

Medical images acquired at different institutions have different data distributions due to varying scanners, imaging protocols, or patient cohorts. Thus, normalizing samples before using them to train the Deep Learning (DL) models is an essential task. Scholars have used various normalization methods to normalize mammograms. However, which normalization method works best on mammograms and if it can help training generalize the DL model has not been analyzed in the literature. This paper presents a comparative analysis of commonly used normalization methods, such as scaling, Contrast Limited Adaptive Histogram Equalization (CLAHE), and Z-score normalization on mammograms for breast mass segmentation tasks. We trained the Attention Unet model on INbreast and the subset of the Cohort of Screen-Aged Women dataset (CSAW-S). We performed cross-dataset analysis on trained models to investigate how normalization methods helped train robust models to handle diverse datasets. Our results suggest that the normalizing method of input data affects the segmentation model's performance. We achieved the best scores with the Z-score normalization closely followed by CLAHE. However, further investigation suggests that the normalization method's performance may depend on the variability of mammograms in the dataset. Results of cross-dataset analysis suggest the importance of choosing the normalization method for consistent DL model performance. To our knowledge, this study represents the first systematic analysis of the performance of prevalent normalization techniques on a diverse dataset of mammogram images. The insights gained from our experiments can guide the selection of normalization methods for improved mass segmentation accuracy. [ABSTRACT FROM AUTHOR]

This paper aims to address two significant challenges of Deep Learning(DL) model generation, high computational cost involved during the training phase and data interpretability from high dimensional data. The computational cost is curbed using centralized as well as distributed matrix factorization technique known as CUR decomposition. CUR decomposition has the advantage of reducing the dimensions of the dataset without data transformation and minimal information loss. Though Singular Value De-composition(SVD) is the best matrix decomposition technique with least reconstruction error, it transforms the data and hence the original data cannot be interpreted from the decomposed matrices while applying DL technique. So CUR decomposition is leveraged to reduce the number of features in high-dimensional data while preserving the essential information. Extensive experimental analysis is conducted to evaluate and compare the performance of CUR and SVD techniques based on reconstruction error and time complexity in centralized as well as distributed setting. The results exhibit that CUR outperforms SVD in terms of computational efficiency, especially in a distributed setting where the decomposition time for CUR was a fraction compared to SVD. At the same time DL models generated from this reduced dataset exhibit comparable accuracy with the original high dimensional dataset as well as reduced dataset obtained through SVD. This work also enhances the accessibility of the CUR algorithm to users, for which an application is developed that enables users to execute the algorithm on any dataset. The user-friendly interface of the application facilitates the upload of datasets, configuration of desired decomposition rank, and execution of the algorithm with a single click. [ABSTRACT FROM AUTHOR]

Techniques for classifying data using data mining are now a day prevalent in agriculture. The method of classifying seeds involves grouping various seed varieties according to their morphological characteristics. To accomplish categorization of the typical Charotar region (generally comprising Anand and Kheda districts of the Gujarat State of India) Gujarat Wheat (GW) varieties (TRITICUM – AESTIVUM) viz. GW 273, GW 496, GW 322, LOK-1, and GDW 1255 (TRITICUM – DURUM), Weka Explorer was used. The features used are area, perimeter, solidity, aspect ratio, major and minor axis of seed kernel, Hue, Saturation, Value, and SF1 (empirical). Features reduction was done using Information Gain (IG) and its modified version Gain Ratio (GR). This paper compares performance of Tree based data mining algorithms in classifying wheat varieties. For classification we used purely tree-based machine learning algorithms viz. J48, Random Forest, Hoeffding Tree, Logistic Model Tree (LMT), and REPTree. LMT- logistics regression method gives higher accuracy 96.4% compared to other classifiers. Hoeffding Tree classifiers stood second with 96% accuracy. For validation 10-fold cross validation was used. By reducing the number of folds in cross validation performance of most algorithms decreased except J48. The percentage of correctly classified instance increased for all algorithms when features were selected by GR except for J48. [ABSTRACT FROM AUTHOR]

Heat exchanger network (HEN) synthesis is a vibrant research field in process system engineering, with substantial contributions to energy conservation and emissions reduction initiatives. The optimal design of a heat exchanger network is not an easy task due to the abundance of local optima in the solution space caused by the non-linear, non-convex, and discontinuous nature of the problem. Generally, several heuristic algorithms employ a greedy evolutionary mechanism, optimize through greedily accepting the decrease in the objective function, and converge to obtain the optimal solution. The Random Walk algorithm has a simple evolutionary mechanism, is prone to mutation, and exhibits high flexibility. However, the algorithm's inherent persistent greediness in searching restrict the scope of the search. Thus, this paper proposes an anti-greedy concept based on the Random Walk method to serve as the basis of a new synthesis approach called the Anti-greedy Random Walk algorithm. Two strategies are proposed in the algorithm, which broaden the solution domain by slowing down rapid unit reduction and accepting imperfect solutions, respectively. One strategy is to thoroughly search for the integer and continuous variables of the HEN problem by covering a much larger search space. Another is to escape the local extrema and move forward to discover more possibilities. Quantitative data demonstrates the algorithm's ability to avoid the local extrema and enhance the search effectiveness. Three different scales of classical cases are used in this work and the obtained results are superior to the published ones. [Display omitted] • An improved Random Walk algorithm is presented for heat exchanger network synthesis. • Two anti-greedy strategies are proposed from an objective and structural perspective. • Both integer and continuous variables are explored by covering a larger search space. • Three benchmark cases were solved with better results than previously literature. [ABSTRACT FROM AUTHOR]

We address the problem of Multi-Source Domain Adaptation (MSDA), which trains a neural network using multiple labeled source datasets and an unlabeled target dataset, and expects the trained network to well classify the unlabeled target data. The main challenge in this problem is that the datasets are generated by relevant but different joint distributions. In this paper, we propose to address this challenge by estimating and minimizing the mutual information in the network latent feature space, which leads to the alignment of the source joint distributions and target joint distribution simultaneously. Here, the estimation of the mutual information is formulated into a convex optimization problem, such that the global optimal solution can be easily found. We conduct experiments on several public datasets, and show that our algorithm statistically outperforms its competitors. Video and code are available at https://github.com/sentaochen/Mutual-Information-Estimation-and-Minimization. [ABSTRACT FROM AUTHOR]

This paper investigates the problem of optimal preview pinning control for Boolean networks. The primary objective is to design efficient control strategies that leverage future reference information for improved control performance. We propose a policy iteration algorithm specifically for Boolean networks based on an augmented error system, constructed using the state augmentation technique in combination with the Exclusive-Or operator approach. The algorithm effectively optimizes control policies using future information. Finally, an example is presented to illustrate the effectiveness of the proposed algorithm. • First study of optimal preview pinning control problem of BNs. • Transformation using the semi-tensor product and exclusive-OR operator. • Deduction of a policy iteration algorithm for BNs. [ABSTRACT FROM AUTHOR]