Search

One of the most significant challenges appears to be securing the Internet of Things (IoT) communication network. As a corollary, information security has become the basis for establishing trustworthiness in IoT network communication. Cryptography is one of the ways for securing information in this case. However, the majority of current approaches are static, making them subject to security threats. As a consequence, a new concept, dynamic encryption, is growing rapidly in IoT communication. In this paper, a dynamic encryption algorithm (DSIT) has been proposed to secure IoT communication. This algorithm is based on Feistel and Substitution–Permutation Network. DSIT is a block cipher that takes the 64-bit block of plaintext, 64-bit secret key, and a secret dynamic box (D-box) as input. It produces a 64-bit ciphertext by performing eight rounds of the DSIT algorithm. For each round, the key and D-box are updated. This dynamic effect provides high security to a dynamic IoT network. The proposed algorithm has been executed in IoT environment using Raspberry Pi 3 Model B + and 50% average Avalanche effect has been achieved. The proposed algorithm efficiently encrypts the image data to secure the communication and high resistant to cryptanalysis attacks. [ABSTRACT FROM AUTHOR]

Rapid system and hardware development of X-ray computed tomography (CT) technologies has been accompanied by equally exciting advances in image reconstruction algorithms. Of the two reconstruction algorithms, analytical and iterative, iterative reconstruction (IR) algorithms have become a clinically viable option in CT imaging. The first CT scanners in the early 1970s used IR algorithms, but lack of computation power prevented their clinical use. In 2009, the first IR algorithms became commercially available and replaced conventionally established analytical algorithms as filtered back projection. Since then, IR has played a vital role in the field of radiology. Although all available IR algorithms share the common mechanism of artifact reduction and/or potential for radiation dose reduction, the magnitude of these effects depends upon specific IR algorithms. IR reconstructs images by iteratively optimizing an objective function. The objective function typically consists of a data integrity term and a regularization term. Therefore, different regularization priors are used in IR algorithms. This paper will briefly look at the overall evolution of CT image reconstruction and the regularization priors used in IR algorithms. Finally, a discussion is presented based on the reality of various reconstruction methodologies at a glance to find the preferred one. Consequently, we will present anticipation towards future advancements in this domain. [ABSTRACT FROM AUTHOR]

Anabelian geometry has been developed over a much wider class of fields than Grothendieck, who is the originator of anabelian geometry, conjectured. So, it is natural to ask the following question: What kinds of fields are suitable for the base fields of anabelian geometry? In this paper, we consider this problem for higher local fields. First, to consider "anabelianness" of higher local fields themselves, we give mono-anabelian reconstruction algorithms of various invariants of higher local fields from their absolute Galois groups. As a result, the isomorphism classes of certain types of higher local fields are completely determined by their absolute Galois groups. Next, we prove that mixed-characteristic higher local fields are Kummer-faithful. This result affirms the above question for these higher local fields to a certain extent. [ABSTRACT FROM AUTHOR]

Computer Vision (CV) has become an essential field in Artificial Intelligence applications. Object detection and recognition (ODR) is one of the fundamental tasks of computer vision implementations. However, developing an efficient ODR model is still a significant problem. The model's execution time and speed are the most critical features during the inference or detection and recognition process, which need to be improved using the latest object detection architectures. In this paper, the handwritten detection and recognition (HDR) model is developed based on previously known algorithms with their efficiency, such as Faster R-CNN and YOLOv4 in the first hand. On the other hand, two new models capable of detecting and recognizing handwritten digits using the latest ODR algorithm are proposed, one based on the latest YOLO family architecture (YOLOv5-HDR) with high speed and accuracy and the other using the transformers architecture (DETR). To the best of our knowledge, this is the first study to achieve a details comparison between YOLOv5 and transformers-based models in handwritten digit detection. Finally, the detailed performance analysis achieved by the paper proves that the YOLOv4-based model achieved the testing inference 13% faster than Faster R-CNN. However, the proposed YOLOv5-based model outperformed the YOLOv4 and the transformers-based one as it increased the testing execution time 25% faster than the YOLOv4, three times faster than the DETR model. A further adversarial attack test has been conducted to ensure the robust performance of the proposed model. Furthermore, numerical experiment results and their analyses demonstrate the robustness and effectiveness of the proposed YOLOv5-based model being the most stable for handwritten digit detection and recognition tasks. [ABSTRACT FROM AUTHOR]

This paper presents an electric vehicle connected to a charging station based on the proposed method. The proposed technique is the joint execution of the Student Psychology Optimization Algorithm (SPOA) and the AdaBoost algorithm and is therefore called the SPOA-AdaBoost algorithm. In particular, the annualized social cost depends on CS and EVCS set from the objective function of the allocation model. The EVCS is linked with the CS and allows the charging service for electric vehicles. The vehicle-to-grid functions of electric vehicles are properly considered under the present optimization model. The EV load demands are considered as controllable resources, and EV optimal optimization problems are connected with allocation problems. When EV arrives at the charging station, it reports its own energy demand and expected departure time using the EVCS operator. Every EVCS could attack the details of electric vehicles via the proposed method. With this proper action, this method manages the energy demand and the total supply. The constraints are the power flow equations, equivalent load demands on the buses, branch current constraints, discrete size restrictions for CS, constraints on CS outputs, EV participation on V2G activities, mutual exclusivity of the EV charge and discharge statuses, EV Owner charge satisfaction, EV Owner satisfaction charge, EV SOC restrictions, Occupied CF quantities, and EVCS CF sufficiency. Among these, the execution of the present model done by the MATLAB/Simulink platform and the performance of the proposed model is likened with other systems. [ABSTRACT FROM AUTHOR]

The relationship between gauge and gravity amounts to understanding the underlying new geometrical local structures. These structures are new tetrads specially devised for Yang-Mills theories, Abelian and non-Abelian in four-dimensional Lorentzian curved spacetimes. In the present paper, a new tetrad is introduced for the Yang-Mills formulation. These new tetrads establish a link between local groups of gauge transformations and local groups of spacetime transformations that we previously called LB1 and LB2. New theorems are proved regarding isomorphisms between local internal groups and local tensor products of spacetime LB1 and LB2 groups of transformations. These new tetrads define at every point in spacetime two orthogonal planes that we called blades or planes one and two. These are the local planes of covariant diagonalization of the stress-energy tensor. These tetrads are gauge dependent. Tetrad local gauge transformations leave the tetrads inside the local original planes without leaving them. These local tetrad gauge transformations enable the possibility to connect local gauge groups Abelian or non-Abelian with local groups of tetrad transformations. On the local plane one, the Abelian group of gauge transformations was already proved to be isomorphic to the tetrad local group of transformations LB1, for example. LB1 is plus two different kinds of discrete transformations. On the local orthogonal plane two is isomorphic to LB2 which is just . That is, we proved that LB1 is isomorphic to which is a remarkable result since a noncompact group plus two discrete transformations is isomorphic to a compact group. These new tetrads have displayed manifestly and nontrivially the coupling between Yang-Mills fields and gravity. The new tetrads and the stress-energy tensor allow for the introduction of three new local gauge invariant objects. Using these new gauge invariant objects and in addition a new general local duality transformation, a new algorithm for the gauge invariant diagonalization of the Yang-Mills stress-energy tensor is developed as an application. This is a paper about grand Standard Model gauge theories - General Relativity gravity unification and grand group unification in four-dimensional curved Lorentzian spacetimes. [ABSTRACT FROM AUTHOR]

In this paper, we examine the main advances registered in the last ten years in Pattern Recognition methodologies based on graph matching and related techniques, analyzing more than 180 papers; the aim is to provide a systematic framework presenting the recent history and the current developments. This is made by introducing a categorization of graph-based techniques and reporting, for each class, the main contributions and the most outstanding research results. [ABSTRACT FROM AUTHOR]

Since its inception, control of data congestion on the Internet has been based on stochastic models. One of the first such models was Random Early Detection. Later, this model was reformulated as a dynamical system, with the average queue sizes at a router's buffer being the states. Recently, the dynamical model has been generalized to improve global stability. In this paper we review the original stochastic model and both nonlinear models of Random Early Detection with a two-fold objective: (i) illustrate how a random model can be "smoothed out" to a deterministic one through data aggregation and (ii) how this translation can shed light into complex processes such as the Internet data traffic. Furthermore, this paper contains new materials concerning the occurrence of chaos, bifurcation diagrams, Lyapunov exponents and global stability robustness with respect to control parameters. The results reviewed and reported here are expected to help design an active queue management algorithm in real conditions, that is, when system parameters such as the number of users and the round-trip time of the data packets change over time. The topic also illustrates the much-needed synergy of a theoretical approach, practical intuition and numerical simulations in engineering. [ABSTRACT FROM AUTHOR]

Nowadays, imbalanced data classification is a hot topic in data mining and recently, several valuable researches have been conducted to overcome certain difficulties in the field. Moreover, those approaches, which are based on ensemble classifiers, have achieved reasonable results. Despite the success of these works, there are still many unsolved issues such as disregarding the importance of samples in balancing, determination of proper number of classifiers and optimizing weights of base classifiers in voting stage of ensemble methods. This paper intends to find an admissible solution for these challenges. The solution suggested in this paper applies the support vector data descriptor (SVDD) for sampling both minority and majority classes. After determining the optimal number of base classifiers, the selected samples are utilized to adjust base classifiers. Finally, genetic algorithm optimization is used in order to find the optimum weights of each base classifier in the voting stage. The proposed method is compared with some existing algorithms. The results of experiments confirm its effectiveness. [ABSTRACT FROM AUTHOR]

In many engineered and natural networked systems, there has been great interest in leader selection and/or edge assignment during the optimal design of controllable networks. In this paper, we present our pioneering work in leader–follower network design via memetic algorithms, which focuses on minimizing the number of leaders or the amount of control energy while ensuring network controllability. We consider three problems in this paper: (1) selecting the minimum number of leaders in a pre-defined network with guaranteed network controllability; (2) selecting the leaders in a pre-defined network with the minimum control energy; and (3) assigning edges (interactions) between nodes to form a controllable leader–follower network with the minimum control energy. The proposed framework can be applied in designing signed, unsigned, directed, or undirected networks. It should be noted that this work is the first to apply memetic algorithms in the design of controllable networks. We chose memetic algorithms because they have been shown to be more efficient and more effective than the standard genetic algorithms in solving some optimization problems. Our simulation results provide an additional demonstration of their efficiency and effectiveness. [ABSTRACT FROM AUTHOR]

The technique of human action recognition can be applied in a number of fields, such as medical rehabilitation, posture in the domain of sports, and emotion perception in counselling. Deep learning action recognition models that consider the continuous changes in the human skeleton can efficiently identify action states, such as rehabilitation processes, posture, and changes in emotion. However, the keypoints of the human skeleton are susceptible to occlusion due to body movement, resulting in a lower confidence level in their positions, which in turn affects the training and execution of human action recognition models. This paper proposes a keypoint correction algorithm based on continuous-time images of temporal variation that can predict and correct the skeleton keypoints with low confidence, based on the previous and subsequent multiple images. The proposed temporal-variation skeleton keypoint correction algorithm can provide accurate feature association training for the locations of the skeleton keypoints. The proposed method is shown to improve the accuracy of human action recognition by at least 30% over three alternative models in the literature: STV-GCN, GCN-NAS, and 2S-AGCN. The proposed algorithm is also improved by at least 30% compared with the above-mentioned methods in the literature, based on an action recognition model with a Gaussian filter. [ABSTRACT FROM AUTHOR]

In recent days, health problems are becoming more prevalent because of changes in lifestyles and inherited factors. Heart disease (HD), in particular, has become increasingly widespread in recent years, putting people's lives in jeopardy. Blood pressure, cholesterol, and pulse rate are all varied for each person. Normal blood pressure should be 120/90, cholesterol should be 100–129 mg/dL, pulse rate should be 72, fasting blood sugar level should be 100 mg/dL, heart rate should be 60–100 bpm, and ECG should be normal, according to medically established data. The aorta is 25 mm (1 inch) wide, whereas capillaries are only 8 μ m wide, which signifies HD. This paper is based on a public health dataset that also contains a cardiac dataset. In our previous work, a new conventional neural network (CNN) architecture was used to extract and categorize histopathological images using the K -means consensus clustering. We achieved good results with the cardiac dataset compared to the existing results. The outcome of the proposed work achieves a precision rate of 97%. In this paper, a novel conventional neural network (CNN) architecture was utilized to identify and characterize histopathology pictures with the help of using the consensus K -nearest neighbor algorithm (CKNN). The usage of a deep neural network, as well as the selection and recovery of functionality, is an essential step until the dataset is classified. As a result, the training process has pre-formed the dataset. The system evaluates the person's symptoms as input and provides the disease's possibility as an output. The suggested approach is linked to temporal data modeling and makes use of a prior HD CNN prediction. In comparison to previous outcomes, we had good outcomes with the current cardiac dataset. The proposed model's conclusion has brought out accuracy of 99.1%. [ABSTRACT FROM AUTHOR]

In recent years, the study of social-based recommender systems has become an active research topic. We incorporate a combination of static and dynamic interest characteristics to predict users' real-time dynamic interests, which has rarely been considered in previous studies. In this paper, we propose a graph neural network social recommendation model that integrates static and dynamic feature relationships (FSDFR-GNNSR). The model uses a graph embedding algorithm to extract static features of users and movies, and takes the static features as input to gated recurrent unit (GRU), so that the model can take static features into consideration while modeling user dynamic behavior. Finally, we use graph attention networks to represent the dynamic influence of friends, simplify the update strategy of second-order neighbor nodes. We apply graph pooling operations to improve the generalization ability of the algorithm. Empirical analyses on real datasets show that the proposed approach achieves superior performance to existing approaches. [ABSTRACT FROM AUTHOR]

The emergence of computation intensive automotive applications poses significant challenges on computation capacity of automotive electronic systems, thus vehicular edge computing (VEC) is introduced as a new computing paradigm into the internet of vehicle (IoV) to improve its data processing capability. However, as the computation capacity is limited in VEC servers, efficient task offloading algorithms need to be proposed. This paper first proposes a multi-task offloading model and gives the related task response time analysis method, and then, both a mixed-integer linear programming (MILP)-based algorithm and a simulated annealing-based heuristic algorithm are proposed to minimize the task response time. By comparing with a baseline algorithm, the MILP-based offloading algorithm can reduce the average task response time by 91.45%, and the heuristic offloading algorithm can reduce the average task response time by 70%. [ABSTRACT FROM AUTHOR]

In this paper, we propose a computing algorithm to obtain optimal checking times which minimize the expected cost rate of sequential inspection models. This algorithm is applied to two modified inspection models with finite intervals such that the unit is checked at times T k (k = 1 , 2 , ... , N) for given N and given S ≡ T N . The modified algorithms are proposed and optimal checking times to minimize the expected cost rates are obtained. Numerical examples of each model are given to show how to use the algorithm. This method would be applied to other sequential inspection models by its suitable modifications. [ABSTRACT FROM AUTHOR]

March algorithms are widely used in Memory Built-In Self-Test (MBIST) on-chip memory testing, providing linear test complexities that reduce the test time and cost. However, studies show that March algorithms with complexities lower than 18N have poor coverages of faults that have emerged with the advent of the nanometer process technologies and are more relevant to nowadays memories. New March AZ1 and March AZ2 algorithms, with 13N and 14N complexities, respectively, were introduced to provide optimum coverage of those faults and to produce a shorter test than an 18N-complexity test algorithm with a lesser area overhead, thus reducing chip manufacturing costs. This paper presents the implementation and validation of MBIST controllers that applied the March AZ1 and March AZ2 algorithms in a Field-Programmable Gate Array (FPGA) device. They were implemented in the Intel Max 10 DE10-Lite FPGA Development Board. A test generator was built in FPGA, as an alternative to the external tester, to provide test vectors required in initiating the test on the memory model using the implemented MBIST. The FPGA experimental tests demonstrated that they function correctly as the expected test sequences were observed. In addition, their fault detection abilities were also validated through tests on a fault-injected memory model, which shows that the implemented March AZ1 and March AZ2 provide 80.6% and 83.3% coverage of the intended faults, respectively, which outperform any other existing 14N-complexity March algorithms. [ABSTRACT FROM AUTHOR]

The technology for path planning of independent mobile robots is mature, but multi-robot path planning for unified scheduling and allocation is much more complex than single-robot path planning. This requires consideration of collision problems between robots, general optimal path problems, etc. This paper proposes the use of the BSO algorithm for unified scheduling and allocation of multiple robots to improve the efficiency of task execution. The BSO algorithm is a new type of intelligent optimization algorithm that uses clustering ideas to search for local optimal solutions and obtains global optimal solutions by comparing local optimal solutions. It also uses mutation ideas to increase the diversity of the algorithm and avoid becoming trapped in local optimal solutions. Using the GA/SA algorithm and the proposed BSO algorithm for computer simulation comparison, we obtained the optimal path planning for the three robots under unified scheduling. The total distance of the optimal path obtained by the BSO algorithm was 27.36% and 25.31% shorter than those of the GA and SA algorithms, respectively. To further test the performance of the BSO algorithm, we conducted additional experiments on the unified scheduling of multiple robots. The experimental results show that the proposed BSO algorithm can significantly improve the efficiency. The multi-robot under unified scheduling performs point-to-point path planning without collisions, and they can traverse all task target points in the shortest path without repetition. This algorithm is suitable for multi-robot tasks in large-scale environments. [ABSTRACT FROM AUTHOR]

As digital communication and storage continue to expand, the protection of image privacy information becomes increasingly critical. To safeguard sensitive visual information from unauthorized access, this paper proposes a novel image encryption scheme that integrates multiobjective Artificial Bee Colony (ABC) optimization algorithm and DNA coding. Multiple evaluation metrics including correlation relationship, Number of Pixel Change Rate (NPCR), Unified Average Changing Intensity (UACI), and information entropy are collaboratively optimized by the ABC algorithm. The proposed method begins with the application of the SHA-256 algorithm to generate keys and random sequences using chaotic systems. These sequences are then employed for shuffling, DNA coding, decoding, and diffusion, generating initial encrypted images. Subsequently, the encrypted images serve as individuals within the ABC algorithm to determine optimal parameters of the chaotic systems and the best ciphertext image. Simulation experiments demonstrate that the ciphertext images achieved excellent results in information entropy, pixel correlation coefficient, NPCR, and UACI. The integration of the multiobjective ABC optimization algorithm with DNA coding in our proposed image encryption scheme results in heightened security, as evidenced by superior performance in various metrics. [ABSTRACT FROM AUTHOR]

In this paper, integro-differential equations are solved by using an efficient numerical technique, namely, Multistage Optimal Homotopy Asymptotic method. The existence and uniqueness of solutions are established by the application of Lipschitz condition. Convergence of approximate solutions along with stability are also carried out. Some examples are solved to highlight the vital characteristics of the applied numerical scheme. Error estimation and comparison of derived results with existing exact solutions and those results which already available in the literature through graphical illustrations and tables reveal that Multistage Optimal Homotopy Asymptotic algorithm is more efficient and fruitful. [ABSTRACT FROM AUTHOR]

This paper focuses on the intelligent recognition problem of radar detection targets. Aiming at the low accuracy and slow speed of millimeter-wave radar clustering point cloud information, a feature algorithm of millimeter-wave radar suitable for detecting targets is proposed. In the detection of targets by millimeter-wave radar, distance is the biggest factor affecting the number and degree of sparsity. A method that combines the feature information of the point cloud with the KD tree proximity search algorithm and the DBSCAN clustering algorithm is proposed, which can adapt to the problems of uneven target point cloud, small amount of data and slow clustering speed. The improved algorithm can use the KD tree to quickly find adjacent points and calculate the distance between adjacent points. The corresponding number of thresholds is set according to the distance where the target is located, and the radius of the target area reflected by the millimeter-wave radar plus the distance of the last threshold point is used as the neighborhood radius of the improved algorithm. Therefore, fast and adaptive parameter adjustment of the millimeter-wave radar can be realized. Simulation tests show that the improved clustering algorithm has better parameters. The accuracy of the improved algorithm is increased by 4.2%, and it also greatly improves the clustering speed. [ABSTRACT FROM AUTHOR]

2R-1C equivalent circuit is widely used in electrochemical impedance spectroscopy (EIS), such as modelling of lithium-ion batteries, bioimpedance analysis and water quality monitoring. It allows for an analysis of the basic electrical behavior of electrochemical systems and understanding of the underlying principles. However, the reported parameter estimation methods are usually deployed on the PC-based processing units that limit in-situ and unsupervised applications, where estimation results are free from user inputs. This paper presents a novel methodology for extracting the values of 2R-1C equivalent circuit by solely utilizing the measured impedance modulus. Unlike iterative and PC-based estimation methods, this approach eliminates user inputs in terms of a need for an initial guess, addressing a significant drawback of those approaches. The proposed work was validated by simulated and experimentally obtained impedance. Moreover, details of deployment on the PC-based and embedded hardware were also reported. The utilization of embedded hardware platform (Mega2560) enables an efficient processing of EIS data (80 milliseconds for 100 datapoints) by creating opportunities for in-situ parameter extraction of equivalent electrical circuits. [ABSTRACT FROM AUTHOR]

In this paper, a modified eigensystem realization algorithm for modal parameter identification and relaxation parameter is extended from a viscous damping system to a nonviscous damping system. The equation of motion with nonviscous damping in second-order form is expressed in the state space formulation. The eigenvalues of the second-order form equation are proved equal to the state space formulation. The extended method is based on the proposed nonlinear relationship between the eigenvalues and the damping parameters of a nonviscous damping system. The identified procedure of the proposed method is given in detail. Finally, the method is validated using three numerical examples for assessing its accuracy. [ABSTRACT FROM AUTHOR]

This article presents a novel approach to maintaining connectivity within a multi-agent system (MAS) using directional visual sensors. The approach leverages a mathematical model of the sensors and employs an optimization method to determine the position and orientation constraints for each sensor. Experimental results validate the effectiveness of the approach for a range of tasks within MAS. The text also discusses a three-step procedure for computing the desired position and orientation of a group of agents. It introduces an optimization problem for a given task and presents a gradient-descent approach to solve it. The text discusses the control objective of designing appropriate control actions for each agent to track a sequence of targets while considering the limitations of visual sensors. The main results involve establishing sufficient conditions for fulfilling the control objective and designing upper bounds for linear and angular velocity. The text also discusses a three-step control law for maintaining connectivity between agents in a network. The control law is designed to be fully distributed and ensures connectivity within the network. The given text discusses a distributed algorithm for maintaining connectivity in a multi-agent system with limited and directional sensing capabilities. The algorithm ensures that each sensor's control variables remain within their upper bounds while preserving connectivity. The effectiveness of the algorithm is validated through simulation and experimental results. The text provides brief biographical information about two individuals, one named D. degree and the other named Denny Oetomo, who have expertise in robotics and system dynamics. [Extracted from the article]

The 3D measurement system based on line-structured light uses a camera to capture laser stripes due to changing in the shape of an object, and uses the acquired pixel coordinates for 3D reconstruction. System calibration is an important step in 3D measurement. The current camera calibration algorithm research mainly focuses on improving the algorithm itself, and there is less research on the influence of external factors. This paper proposes a coplanar hybrid calibration algorithm based on the error screening model by combining the error screening model, mathematical model and neural network model. It is mainly divided into two steps. The first step is to use the radial array constraint calibration algorithm based on the error screening model to solve the camera's internal and external parameters. The second step uses the camera internal and external parameters obtained in the first step to convert the pixel coordinates into real three-dimensional coordinates, and compares the calculated three-dimensional coordinates with the actual coordinates. Using machine learning to establish a compensation network, get a compensation function, and use the resulting 3D world coordinates to perform point cloud stitching. Experiments show that compared with the traditional calibration algorithm, the calibration algorithm has a small error and reduces the calibration error by about 6.5%. [ABSTRACT FROM AUTHOR]

In recent years, image encryption schemes based on optical methods have been extensively studied. However, possible optical encryption methods in combination with fractional-order laser hyperchaotic systems have not been reported. Therefore, an optical image encryption scheme based on fractional Fourier transform and five-dimensional host-induced nonlinearity fractional-order laser hyperchaotic system is studied in this paper. Firstly, the dynamical characteristics of the proposed fractional-order laser hyperchaotic system are analyzed, and the DSP platform is used to realize the system. Then, a novel image encryption scheme is proposed combining BP neural network, GF(17) domain diffusion and hyperchaotic, random point scrambling algorithm. Finally, the performance of the encryption scheme is analyzed in detail. This work provides an experimental basis and theoretical guidance for image secure communication combining fractional-order laser hyperchaotic systems and optical methods and offers a new research perspective for optical image encryption. [ABSTRACT FROM AUTHOR]

The one-dimensional Otsu method is an adaptive threshold method. It obtains the optimal threshold for image segmentation by the maximum between-class variance, without considering the minimum within-class variance. As the background of water surface image is mostly uniform, using this feature, the threshold selection tactics adopt the combination of the one-dimensional Otsu method and the uniformity measurement, proposes the threshold segmentation method based on uniformity measurement, and adopts the performance evaluation method based on GT image to compare the segmentation result. Experimental results demonstrate that effectiveness of the improved Otsu method is generally better than the traditional Otsu method, and the other four commonly used threshold segmentation methods for the water surface image, which improves the segmentation accuracy of such images and reduces the segmentation error rate. At the same time, as the water surface image is usually affected by light intensity, water ripple and other factors, this paper also adopts the relevant correction algorithm to further improve the segmentation accuracy. [ABSTRACT FROM AUTHOR]

Microscopic images of bovine milk somatic cells are used to classify neutrophils, epithelial cells, macrophages and lymphocytes. Using pattern recognition technology, the problem of classification and recognition is solved from different nature, levels and spaces. The proposed RKSGA-SVM algorithm is used to realize somatic cell image recognition. First, color, morphological and texture features of four types of cells are extracted separately, including geometric and moment invariant features. Second, ReliefF algorithm is used to calculate the weights of all features. According to preset cumulative contribution rate, the preliminary feature set is obtained. Third, redundant features are eliminated by Kolmogorov–Smirnov (KS) test, and the high-level optimization is obtained. The selected feature sets have remarkable distinguishing ability. Finally, the weighted optimal feature sets are obtained by weighted coefficient method on the advanced optimal feature sets. The overall accuracy of RKSGA-SVM algorithm is 99.00%, and Kappa coefficient is 0.987. The proposed algorithm has the advantages of balancing classification accuracy, eliminating redundancy and reducing feature dimension. On the premise of ensuring high classification accuracy, the feature set can reduce feature dimension and the amount of data calculation, improve operation efficiency and save storage space. Experiments show that the feature selection method proposed in this paper is feasible and more suitable for extracting feature sets in the process of somatic cell classification. [ABSTRACT FROM AUTHOR]

Based on the dispersion entropy model, combined with multiscale analysis method and fractional order information entropy theory, this paper proposes new models — the generalized fractional order multiscale dispersion entropy (GMDE) and the generalized fractional order refined composite multiscale dispersion entropy (GRCMDE). The new models take the amplitude value information of the sequence itself into consideration, which can make better use of some key information in the sequence and have a higher stability and accuracy. In addition, extending the algorithm to generalized fractional order can make the model better capture the small evolution of the signal data, which is more advantageous for studying the dynamic characteristics of complex systems. This paper verifies the effectiveness of the new models by combining theoretical analysis with empirical research, and further studies the complexity of the financial system and the nature of its multiple time scales. The results show that the proposed GMDE, GRCMDE can better detect the intrinsic nature of financial time series and can distinguish the financial market complexity of different countries. [ABSTRACT FROM AUTHOR]

Complex network reconfiguration has always been an important task in complex network research. Simple and effective complex network reconstruction methods can promote the understanding of the operation of complex systems in the real world. There are many complex systems, such as stock systems, social systems and thermal power systems. These systems generally produce correlated time series of data. Discovering the relationships among these multivariate time series is the focus of this research. This paper proposes a Spearman coefficient reconstruction network (SCRN) method based on the Spearman correlation coefficient. In the SCRN method, we select entities in the real world as the nodes of the network and determine connection weights of the network edges by calculating the Spearman correlation coefficients among nodes. In this paper, we selected a stock system and boiler equipment in a thermal power generation system to construct two complex network models. For the stock network model, we used the classic Girvan–Newman (GN) algorithm for community discovery to determine whether the proposed network topology is reasonable. For the boiler network model, we built a predictive model based on an support vector regression (SVR) model in machine learning, and we verified the rationality of the boiler model by predicting the amount of boiler steam. [ABSTRACT FROM AUTHOR]

In this paper, the Levy flight-based chicken swarm optimization (LFCSO) is proposed to follow the highest power of grid-joined photovoltaic (PV) framework. To analyze the grid-associated PV framework, the characteristics of current, power, voltage, and irradiance are determined. Because of the low yield voltage of the source PV, a big advance up converter with big productivity is required when the source PV is associated with the matrix power. A tale great advance up converter dependent on the exchanged capacitor and inductor is illustrated in this paper. The LFCSO algorithm with the adaptive neuro-fuzzy inference system is used to generate the control pulses of the transformer-coupled inductor DC–DC converter-less switched capacitor. While using the switched capacitor-coupled inductor, the voltage addition is expanded in the DC–DC converter and the power of PV is maximized. Here, the normal CSO algorithm is updated with the help of Levy flight functions to generate optimal results. To get the accurate optimal results, the output of the proposed LFCSO algorithm is given as the input of the ANFIS technique. After that, the optimal results are generated and they provide the pulses for the system. The working guideline is analyzed and the voltage addition is derived with the utilization of the proposed technique. From that point forward, it predicts the exact maximum power of the converter according to its inputs. Under the variety of solar irradiance and partial shading conditions (PSCs), the PV system is tested and its characteristics are analyzed in different time instants. The proposed LFCSO with ANFIS method is actualized in Simulink/MATLABstage, and the tracking executing is examined with a traditional method such as genetic algorithm (GA), perturb and observe (P&O) technique–neuro-fuzzy controller (NFC) and fuzzy logic controller (FLC) technique. [ABSTRACT FROM AUTHOR]

Threshold segmentation has been widely used in recent years due to its simplicity and efficiency. The method of segmenting images by the two-dimensional maximum entropy is a species of the useful technique of threshold segmentation. However, the efficiency and stability of this technique are still not ideal and the traditional search algorithm cannot meet the needs of engineering problems. To mitigate the above problem, swarm intelligent optimization algorithms have been employed in this field for searching the optimal threshold vector. An effective technique of lightning attachment procedure optimization (LAPO) algorithm based on a two-dimensional maximum entropy criterion is offered in this paper, and besides, a chaotic strategy is embedded into LAPO to develop a new algorithm named CLAPO. In order to confirm the benefits of the method proposed in this paper, the other seven kinds of competitive algorithms, such as Ant–lion Optimizer (ALO) and Grasshopper Optimization Algorithm (GOA), are compared. Experiments are conducted on four different kinds of images and the simulation results are presented in several indexes (such as computational time, maximum fitness, average fitness, variance of fitness and other indexes) at different threshold levels for each test image. By scrutinizing the results of the experiment, the superiority of the introduced method is demonstrated, which can meet the needs of image segmentation excellently. [ABSTRACT FROM AUTHOR]

It is significantly important to have the knowledge of electromagnet situation of battlefield, because it contains a lot of useful information to understand the situation of the whole battlefield. Electromagnet situation visualization would be very useful to help people to understand the situation, and handle battlefield situation, such as the size and quality of the electromagnetic radiation source, target objects, and operational purposes by the two parties engaged in combat scale. This paper proposes two electromagnet situation visualization methods, one is an isoline tracking algorithm based on floating rectangle and the other is an isoline filling algorithm based on linear interpolation, which also solves the problem of low accuracy and low efficiency. This paper also implements and displays the visualization results using different ways of demonstration modules, which show that the visualization results are more intuitive. [ABSTRACT FROM AUTHOR]

Vehicular Ad-hoc NETworks (VANETs) are typically termed as a wireless ad-hoc network that contains extreme node mobility and also the network carries a great significance in various traffic-oriented commercial applications and safety services. Due to its high mobility, routing in VANET has been a challenging work and also proving a higher rate of packet delivery ratio with reduced packet loss has been more important to be considered in route formations. With that note, this paper contributes to developing a clustering model called Middle-Order Vehicle-based Clustering (MOVC) model for managing the frequent topological change and high vehicle mobility, and efficiently handling the typical road traffic scenario. Moreover, the algorithm is intended to maintain the cluster to be constant for managing the vehicles in effective ways and also to provide uninterrupted communication between the vehicles. An algorithm for Effective Cluster Head Election (ECHE) is also derived in this paper for proficiently handling the frequency variation on the highways. Further, the model is simulated and evaluated on the basis of various metrics of VANET routing, specifically packet loss, packet delivery ratio, network lifetime and throughput. The results show that the proposed mechanism outperforms the results of existing models. [ABSTRACT FROM AUTHOR]

With the rapid development of computer technology and network technology, it has become possible to build a large-scale networked video surveillance system. The video surveillance system has become a new type of infrastructure necessary for modern cities. In this paper, the problem of foreground extraction and motion recognition in intelligent video surveillance is studied. The three key sub-problems, namely the extraction of motion foreground in video, the deblurring of motion foreground and the recognition of human motion, are studied and corresponding solutions are proposed. A background modeling technique based on video block is proposed. The background is modeled at the block level, which greatly reduces the spatial complexity of the algorithm. It solves the problem that the traditional Gaussian model (GMM) moving target enters the static state and is integrated into the background process. The target starts to move for a long time and there are ghosts and other problems, which reduce the processing efficiency of the lifting algorithm. The test results on the Weizmann dataset show that the proposed algorithm can achieve high human motion recognition accuracy and recognition with low computational complexity. The rate can reach 100%; the local constrained group sparse representation classification (LGSRC) model is used to classify it. The experimental results on Weizmann, KTH, UCF sports and other test datasets confirm the validity of the algorithm in this chapter. KNN, SRC voting classification accuracy. [ABSTRACT FROM AUTHOR]

Task allocation of spatial crowdsourcing tasks is an important branch of crowdsourcing. Spatial crowdsourcing tasks not only require workers to complete a specific task at a specified time, but also require users to go to the designated location to complete the corresponding tasks. In this paper, Scope spatial crowdsourcing task whose work position is a region rather than a location is a kind of spatial crowdsourcing task. Mobile crowdsourced sensing (MCS) is one of the most important platforms to publish spatial crowdsourcing tasks, based on which MCS workers can use smartphones to complete the collections of related sensing data. When assigning tasks for scoped crowdsourcing tasks, there is a scope overlap between tasks and one or more tasks due to the association of task scope between tasks, which causes a waste of manpower. The focus of this paper is to study the redundancy of the task scope that occurs when using MCS to collect scoping data in the case of fewer workers and more tasks. Optimizing scope spatial crowdsourcing tasks allocation algorithm (OSSA) can eliminate the redundancy of the task area by integrating and decomposing tasks and achieve the improvement of the assignable number of tasks. In the Windows platform, experiments are made to compare the efficiency of the OSSA algorithm with the greedy algorithm and the two-phase-based global online allocation (TGOA) algorithm to further prove the correctness and feasibility of the algorithm for task scope optimization. [ABSTRACT FROM AUTHOR]

The process of extracting data from different heterogeneous data sources, transforming them into an integrated, unified and cleaned repository, and storing the result as a single entity leads to the construction of a data warehouse (DW), which facilitates access to data for the users of information systems and decision support systems. Due to their enormous volumes of data, processing of analytical queries of decision support systems need to scan very large amounts of data, which has a negative effect on the systems' response time. Because of the special importance of online analytical processing (OLAP) in these systems, to enhance the performance and improve the query response time of the system, an appropriate number of views of the DW are selected for materialization and will be utilized for responding to the analytical queries, instead of direct access to the base relations. Memory constraint and views maintenance overhead are two main limitations that make it impossible, in most cases, to materialize all views of the DW. Selecting a proper set of views of DW for materialization, called materialized view selection (MVS) problem, is an important research issue that has been focused in various papers. In this paper, we have proposed a method, called P-SA, to select an appropriate set of views using an improved version of simulated annealing (SA) algorithm that utilizes a proper neighborhood selection strategy. P-SA uses the multiple view processing plan (MVPP) structure for selecting the views. Data and queries of a benchmark DW have been used in experimental results for evaluating the introduced method. The experimental results show better performance of the P-SA compared to other SA-based MVS methods for increasing the number of queries, in terms of the total cost of view maintenance and query processing. Moreover, the total cost of queries in the P-SA is also better than the other important SA-based MVS methods of the literature when the size of the DW is increased. [ABSTRACT FROM AUTHOR]

The clinical diagnosis of heart disease in most situations is based on a difficult amalgamation of pathological and clinical information. Because of this complication, there is a significant level of curiosity among many diagnostic healthcare professionals and researchers who are keenly interested in the efficient, accurate, and early-stage forecasting of heart disease. Deep Learning Algorithms aid in the prediction of heart disease. The main focus of this paper is to develop a method for predicting heart disease through Modified Rough K means + + (MRK + +) clustering along with the Restricted Boltzmann Machine (RBM). This paper is categorized into two modules: (1) Propose a clustering component based on Modified Rough K-means + + ; (2) disease prediction based on RBM. The input Cleveland dataset is clustered using the stochastic probabilistic rough k-means + + clustering technique in the module for clustering. The clustered data is acquired and used in the RBM, and this hybrid structure is then used in the heart disease forecasting module. Throughout the testing procedure, the most valid result is chosen from the clustered test data, and the RBM classifier that correlates to the nearest cluster in the test data is based on the smallest distance or similar parameters. Furthermore, the output value is used to predict heart disease. There are three different types of experiments that are performed: In the first experiment comprises modifying the rough K-means + + clustering algorithm, the second experiment evaluates the classification result, and the third experiment suggests hybrid model representation. When the Hybrid Modified Rough k-means + + - RBM model is compared with any single model, it provides the highest accuracy. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT) and Internet technology, the product of the combination of the two, the Industrial Internet, has also received extensive attention and there are more and more research achievements related to the Industrial Internet. In the industrial Internet system, the communication network system composed of sensors, communication nodes, controllers and other intelligent devices can realize efficient and convenient data interaction between people and machines, providing an important infrastructure and technical support for industrial big data analysis and intelligent production. However, in the current industrial Internet system, industrial equipment users generally have the problem of low computing energy efficiency, and the collected industrial data has a high-security risk in the transmission, processing and other processes. At the same time, the size and scale of the industrial Internet equipment group is huge, and the lack of rational resource allocation leads to excessive waste of computing resources in the system, which is also a prominent problem of the current industrial Internet system. In response to the above questions, this paper, on the basis of reading a large number of documents, integrates the improved DRL algorithm, End-Edge-Cloud architecture and blockchain to form a new industrial Internet architecture. The architecture realizes computing offload through the three-tier structure of terminal layer, edge layer and cloud layer, and guarantees the security of industrial data through the decentralized feature of blockchain, ultimately achieving the goal of reducing energy consumption, computing overhead and trusted computing. In the architecture proposed in this paper, the dynamic unloading of industrial data and computing tasks is achieved through a three-tier architecture. The MDP is used to build an optimization problem model, and the improved DRL algorithm is used to iteratively solve the optimal computing resource scheduling strategy. The main research contents of this paper include (1) Using MDP to model optimization problems; (2) Propose an industrial Internet system architecture that integrates and improves DRL, "end edge cloud" and blockchain; (3) The MDP problem is solved iteratively based on deep reinforcement learning. The simulation results show that the proposed architecture has more advantages than the existing six architectures in terms of computing cost, equipment energy consumption and total working time. [ABSTRACT FROM AUTHOR]

Uses of time-fractional diffusion wave model (TFDWM) in its singular case with damping-reaction terms are widely seen in classical physics applications, e.g. for the quantitative measurement of activity diagnoses light-mechanical waves resulting from many physical experiments. The goal and importance of this paper are to predict and build accurate and convincing numerical solutions for TFDWM in its singular version by employing the collective cubic uniform B-spline approach (CUBSA) and standard finite difference approach (SFDA). The fractional Caputo time derivative (FCTD) has been estimated and broken down using SFDT, whilst the standard splines will be utilized upon realizing spatial discretization. To study the prediction error of our approach, some convergence and bound results are given under certain constraints. We demonstrate applications of our collective algorithm to a couple of fractional singular-type models appearing in fluid dynamics and electromagnetics. Detailed analysis, delegate tables, and representative graphs are displayed and offered in different dimensions to handle the crossover meaning for several order values of FCTDs. Some conclusions, observations, recommendations, and future issues were briefly raised in the final section of this paper. [ABSTRACT FROM AUTHOR]

Personalized recommendation systems learn user preference characteristics by analyzing behavioral data such as ratings and comments generated by users in the Internet, and provide precise recommendations for individual users accordingly. However, in real life, users often conduct group activities like group buying and traveling together. How to recommend for groups has become a heated research topic in recent years. Most existing group recommendation algorithms are recommended for given divided groups by collectively combining the preferences of members in the group. However, in most cases, users' group properties are fickle. As the results of group detection are decisive to the performance of group recommendation, group detection is particularly important to the group recommendation algorithm. After analyzing problems of existing group recommendation algorithms, this paper proposes the density peak clustering group detection algorithm based on GRU-CNN and the group recommendation algorithm based on the mechanism. With respect to group detection, most of the existing group detection algorithms suffer from certain deficiencies: First, depending solely on the users' static preference features while ignoring the variation of users' interest over time when finding the group structure in the network; second, group division based on users' topic features extracted from reviews is difficult to support further digging of the in-depth features in reviews. To address the above-mentioned problems, this paper proposes a density peak clustering group detection algorithm based on CNN-GRU. It would first extract representative keywords in the reviews with LDA topic model, and then model time series information based on GRU attaining users' dynamic topic features. Coupling with deeper characteristics cored out by CNN, density peak clustering algorithm completes its group detection finally. Experiments on real dataset indicate that the features mined by the fusion depth neural network model effectively capture users' dynamic preferences, and yield better results of group detection than that of existing algorithms. [ABSTRACT FROM AUTHOR]

This paper considers linear and nonlinear fractional delay Volterra integrodifferential equation of order ρ in the Atangana–Beleanu–Caputo (ABC) sense. We used continuous Laplace transform (CLT) to find equivalent Volterra integral equations that have been used together with the Arzela–Ascoli theorem and Schauder's fixed point theorem to prove the local existence solution. Moreover, the obtained Volterra integral equations and the contraction mapping theorem have been successfully applied to construct and prove the global existence and uniqueness of the solution for the considered fractional delay integrodifferential equation (FDIDE). The Galerkin algorithm instituted within shifted Legendre polynomials (SLPs) is applied in the approximation procedure for the corresponding delay equation. Indeed, by this algorithm, we get algebraic system models and by solving this system we gained the approximated nodal solution. The reliability of the method and reduction in the size of the computational work give the algorithm wider applicability. Linear and nonlinear examples are included with some tables and figures to show the effectiveness of the method in comparison with the exact solutions. Finally, some valuable notes and details extracted from the presented results were presented in the last part, with the sign to some of our future works. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is a new technology that has drawn interest from both industry and academia in the modern digital era. The IoT provides a platform for any device to connect and share data over the Internet. Because of the diverse IoT environment and resource-constrained IoT devices, this nascent technology has numerous security challenges. Due to the lack of fine-grained access control and flexibility, traditional cryptographic algorithms such as private key encryption and public-key encryption are not suitable for providing access control mechanisms. ABE (Attribute-Based Encryption) is a new cryptographic approach that not only provides security but also fine-grained access control. This paper provides a comprehensive survey of ABE and its various forms, such as key policy ABE and ciphertext policy ABE, based on access structure, multi-authority, and hierarchy features. Further access structures used in ABE and applications of the ABE technique in IoT are also discussed. A comparison of different ABE schemes is presented regarding features, efficiency, and security. In addition, numerous schemes are analyzed to uncover obstacles, issues, and gaps that need to be investigated further. [ABSTRACT FROM AUTHOR]

In this paper, we consider a system of inequalities associated with circular cones. By constructing a new smoothing function, the problem is reformulated as a system of parameterized smooth equations. In addition, we suggest a Newton-type algorithm for solving the smooth equations so that a solution of the problem concerned is found. In particular, the algorithm is proved to be globally and locally quadratically convergent under suitable conditions. The preliminary numerical results demonstrate that the algorithm is effective. [ABSTRACT FROM AUTHOR]

Aiming at the problems of high complexity and low detection accuracy of single-stage three-dimensional (3D) detection method, a vehicle object detection algorithm based on the Efficient Channel Attention (ECA) mechanism is proposed. This paper provides a good solution to the problems of low object recognition accuracy and high model complexity in the field of 3D object detection. First, we voxelized the original point cloud data, taking the average coordinates and intensity values as the initial features. By entering into the Voxel Feature Encoding (VFE) layer, we can extract the features of each voxel. Then, referring to the VoxelNet model, the ECA mechanism is introduced, which reduces the complexity of the model while maintaining the good performance in the model. Finally, experiments on the widely used KITTI dataset show that the algorithm performs well, and the accuracy of the proposed ECA algorithm has reached 87.75%. Compared with the current mainstream algorithm SE-SSD of object detection, the accuracy is increased by 0.21%. [ABSTRACT FROM AUTHOR]

In this paper, an efficient interactive image segmentation method based on maximization of submodular function under user's scribble constraint is presented. The problem of interactive image segmentation is formulated as the maximum entropy rate under user's constraints. The objective function is submodular, and we solve the constrained submodular function maximization by incorporating a new data structure and some aggregating rules into the greedy algorithm. The main steps of our algorithm are as follows. First, the pixels scribbled by the user are clustered separately as target foreground and background clusters. Second, in the process of greedy algorithm, unscribbled pixels are aggregated to the corresponding target cluster according to the proposed aggregating rules. Finally, the segmentation result is presented by the two target clusters. The experiments and comparisons on three standard benchmarks show that our method has good performance. Our method is straightforward and efficient, and the time complexity of our method is between linear and polynomial. Furthermore, we analyze the influence of different scribbles, and propose some optimal scribble strategies. [ABSTRACT FROM AUTHOR]

Broadcasting is disseminating information in a network where a specific message must spread to all network vertices as quickly as possible. Finding the minimum broadcast time of a vertex in an arbitrary network is proven to be NP-complete. However, this problem is solvable for a few families of networks. In this paper, we present an optimal algorithm for finding the broadcast time of any vertex in a fully connected tree ( FCT n ) in O (| V | log log n) time. An FCT n is formed by attaching arbitrary trees to vertices of a complete graph of size n where | V | is the total number of vertices in the graph. [ABSTRACT FROM AUTHOR]

Pose estimation is the basis and key of human motion recognition. In the two-dimensional human pose estimation based on image, in order to reduce the adverse effects of mutual occlusion among multiple people and improve the accuracy of motion recognition, a structurally symmetrical two-dimensional multi-person pose estimation model combined with face detection is proposed in this paper. First, transfer learning is used to initialize each sub-branch network model. Then, MTCNN is used for face detection to predict the number of people in the image. According to the number of people, the image is input into the improved two-branch OpenPose network. What is more, the double judgment algorithm is proposed to correct the false detection of MTCNN. The experimental results show that compared with TensorPose, which is the latest improved method based on OpenPose, the Average Precision (AP) (Intersection over Union (IoU) = 0. 5) on the validation set is 8.8 higher. Furthermore, compared with OpenPose, the mean AP (IoU = 0. 5 : 0. 9 5) is 1.7 higher on the validation set and is 1.3 higher on the Test-dev test set. [ABSTRACT FROM AUTHOR]

Influence maximization is a problem that aims to select top k influential nodes to maximize the spread of influence in social networks. The classical greedy-based algorithms and their improvements are relatively slow or not scalable. The efficiency of heuristic algorithms is fast but their accuracy is unacceptable. Some algorithms improve the accuracy and efficiency by consuming a large amount of memory usage. To overcome the above shortcoming, this paper proposes a fast and scalable algorithm for influence maximization, called K-paths, which utilizes the influence tree to estimate the influence spread. Additionally, extensive experiments demonstrate that the K-paths algorithm outperforms the comparison algorithms in terms of efficiency while keeping competitive accuracy. [ABSTRACT FROM AUTHOR]

Many biological and biomedical research areas such as drug design require analyzing the Gene Regulatory Networks (GRNs) to provide clear insight and understanding of the cellular processes in live cells. Under normality assumption for the genes, GRNs can be constructed by assessing the nonzero elements of the inverse covariance matrix. Nevertheless, such techniques are unable to deal with non-normality, multi-modality and heavy tailedness that are commonly seen in current massive genetic data. To relax this limitative constraint, one can apply copula function which is a multivariate cumulative distribution function with uniform marginal distribution. However, since the dependency structures of different pairs of genes in a multivariate problem are very different, the regular multivariate copula will not allow for the construction of an appropriate model. The solution to this problem is using Pair-Copula Constructions (PCCs) which are decompositions of a multivariate density into a cascade of bivariate copula, and therefore, assign different bivariate copula function for each local term. In fact, in this paper, we have constructed inverse covariance matrix based on the use of PCCs when the normality assumption can be moderately or severely violated for capturing a wide range of distributional features and complex dependency structure. To learn the non-Gaussian model for the considered GRN with non-Gaussian genomic data, we apply modified version of copula-based PC algorithm in which normality assumption of marginal densities is dropped. This paper also considers the Dynamic Time Warping (DTW) algorithm to determine the existence of a time delay relation between two genes. Breast cancer is one of the most common diseases in the world where GRN analysis of its subtypes is considerably important; Since by revealing the differences in the GRNs of these subtypes, new therapies and drugs can be found. The findings of our research are used to construct GRNs with high performance, for various subtypes of breast cancer rather than simply using previous models. [ABSTRACT FROM AUTHOR]

Periodic frequent patterns are frequent patterns which occur at periodic intervals in databases. They are useful in decision making where event occurrence intervals are vital. Traditional algorithms for discovering periodic frequent patterns, however, often report a large number of such patterns, most of which are often redundant as their periodic occurrences can be derived from other periodic frequent patterns. Using such redundant periodic frequent patterns in decision making would often be detrimental, if not trivial. This paper addresses the challenge of eliminating redundant periodic frequent patterns by employing the concept of deduction rules in mining and reporting only the set of non-redundant periodic frequent patterns. It subsequently proposes and develops a Non-redundant Periodic Frequent Pattern Miner (NPFPM) to achieve this purpose. Experimental analysis on benchmark datasets shows that NPFPM is efficient and can effectively prune the set of redundant periodic frequent patterns. [ABSTRACT FROM AUTHOR]