Search

Demeanor evidence refers to the authoritative opinions of experts using analytical instruments to collect and interpret the formation of external physiological symptoms of the entire human body. With the development of modern technology, the observation of demeanor has entered a new stage of multimodal quantification. The quantifiable results of demeanor observation with the help of scientific and technological instruments play an important role in judicial work such as search, interrogation, and evidence review. The use of man-made reasoning in the field of legal settling has become increasingly broad. Specialists are giving increasingly more consideration to the securing of modular proof. This paper proposes the development of a component examination model for modular proof examination applications. The technique for this paper is to apply the guileless Bayes strategy, propose a superior information mining calculation, and lay out a model for proof observation and examination. The function of these methods is to systematically explore the basic theoretical issues of demeanor evidence based on the status quo of judicial application of demeanor evidence. Through the prediction of individual demeanor based on data mining algorithm, the evidence analysis model is designed, the neurobiological experiment is carried out, and the demeanor evidence animal stress model is constructed to verify the scientific basis of multidemeanor evidence observation. The experimental results showed that after repeated stimulation of SD rats, the maximum changes in the expression of HSP70 gene and SAA gene were 10.77 and 14.1 respectively, reflecting the high reliability of demeanor evidence biological experiments. The model can improve the accuracy of evidence use, and the correct use of demeanor evidence can realize the true litigation value of intelligent justice and the concept of human rights protection, and promote the construction of intelligent justice. [ABSTRACT FROM AUTHOR]

Collecting and analyzing data from all devices to improve the efficiency of business processes is an important task of Industrial Internet of Things (IIoT). In the age of data explosion, extensive text data generated by the IIoT have given birth to a variety of text representation methods. The task of text representation is to convert the natural language to a form that computer can understand with retaining the original semantics. However, these methods are difficult to effectively extract the semantic features among words and distinguish polysemy in natural language. Combining the advantages of convolutional neural network (CNN) and variational autoencoder (VAE), this paper proposes an intelligent CNN-VAE text representation algorithm as an advanced learning method for social big data within next-generation IIoT, which help users identify the information collected by sensors and perform further processing. This method employs the convolution layer to capture the local features of the context and uses the variational technique to reconstruct feature space to make it conform to the normal distribution. In addition, the improved word2vec model based on topical word embedding (TWE) is utilized to add topical information to word vectors to distinguish polysemy. This paper takes the social big data as an example to illustrate the way of the proposed algorithm applied in the next-generation IIoT and utilizes Cnews dataset to verify the performance of proposed method with four evaluating metrics (i.e., recall, accuracy, precision, and F1-score). Experimental results indicate that the proposed method outperforms word2vec-avg and CNN-AE in K-nearest neighbor (KNN), random forest (RF), and support vector machine (SVM) classifiers and distinguishes polysemy effectively. [ABSTRACT FROM AUTHOR]

Channel pruning has recently become a widely used model compression method. However, most existing channel pruning methods only prune to decrease the model size, such as the number of parameters or FLOPs, and hence the decrease in model size does not effectively lead to an improvement in inference performance. To address this problem, this paper proposes a latency-optimized channel pruning method for CNN inference acceleration on GPU platforms by latency stair-step discrimination, two-stage benefit assessment and latency-sharing channel pruning. Compared with recent state-of-the-art model compression methods, it can achieve significant improvements in inference performance with comparable compression rates and model accuracy. The contributions of this paper include the following: first, a three-point latency stair-step discrimination method is proposed for determining the candidate prunable coordinates with the best latency performance adapted to the current hardware. Then, a two-stage benefit assessment method based on interlayer dependencies is proposed for determining the optimal channel pruning rate of each layer in the network. Finally, a latency-sharing channel pruning framework is proposed to accelerate the model pruning adaptation process. The method proposed in this paper can significantly reduce the model inference latency on multiple types of GPU platforms. To verify the effectiveness, we use three general-purpose GPU platforms and two embedded GPU platforms to evaluate the algorithm performance. The experimental results show that for recent state-of-the-art CNNs, the proposed method can achieve a 22.0–6.6% latency reduction and a 1.3 –3.0 inference performance improvement as well as a 1.2–4.3 pruning adaptation speedup with high model accuracy. [ABSTRACT FROM AUTHOR]

The growing depletion of fossil fuels has led to the use of distributed renewable energy sources. This shift has altered the grid structure from centralized to distributed, where energy flows from multiple sources through multiple paths, besides producing a more competitive and dynamic energy market, posing new problems to power system management. To tackle the issue of effectively utilizing renewable energy sources, the energy internet (EI) was developed, in which devices are connected by energy routers. Therefore, efficiently transmitting energy within the EI has become a prominent topic in research. Despite the existence of algorithms and reviews in the literature on energy routing, there is still a lack of a thorough and comprehensive comparison of these existing algorithms. This paper classifies current energy routers and discusses and categorizes energy routing algorithms based on their methods. Additionally, the paper conducts extensive simulations to compare several energy routing algorithms in detail. [ABSTRACT FROM AUTHOR]

The array redistribution problem occurs in many important applications in parallel computing. In this paper, we consider this problem in a torus network. Tori are preferred to other multidimensional networks (like hypercubes) due to their better scalability (IEE Trans. Parallel Distrib. Syst. 50(10), 1201–1218, []). We present a message combining approach that splits any array redistribution problem in a series of broadcasts where all sources send messages of the same size, thus a balanced traffic load is achieved. Unlike existing array redistribution algorithms, the scheme introduced in this work eliminates the need for data reorganization in the memory of the source and target processors. Moreover, the processing of the scheduled broadcasts is pipelined, thus the total cost of redistribution is reduced. [ABSTRACT FROM AUTHOR]

With the rapid development of network technology, the Internet has brought significant convenience to various sectors of society, holding a prominent position. Due to the unpredictable and severe consequences resulting from malicious attacks, the detection of anomalous network traffic has garnered considerable attention from researchers over the past few decades. Accurately labeling a sufficient amount of network traffic data as a training dataset within a short period of time is a challenging task, given the rapid and massive generation of network traffic data. Furthermore, the proportion of malicious attack traffic is relatively small compared to the overall traffic data, and the distribution of traffic data across different types of malicious attacks also varies significantly. To address the aforementioned challenges, this paper presents a novel network anomaly detection algorithm based on semi-supervised learning and adaptive multiclass balancing. Building upon the assumption of consistent distribution between labeled and unlabeled data, this paper introduces the multiclass split balancing strategy and the adaptive confidence threshold function. These innovative approaches aim to tackle the issue of the multiclass imbalanced in traffic data. By leveraging the mutually beneficial relationship between semi-supervised learning and ensemble learning, this paper presents the collaborative rotation forest algorithm. This algorithm is specifically designed to enhance performance of anomaly detection in an environment with label inadequacy. Several comparative experiments conducted on the NSL-KDD, UNSW-NB15, and ToN-IoT demonstrate that the proposed algorithm achieves significant improvements in performance. Specifically, it enhances precision by 1.5–5.7%, recall by 1.5−5.7%, and F-Measure by 1.4−4.3% compared to the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

In order to explore potential value of explosively growing data in thermal power unit, this paper proposes a big data mining method based on Hadoop-based Spark cluster-computing framework and algorithms. Firstly, positive and negative balance methods are used to accurately obtain actual net coal consumption, and maximum information coefficient method is used to select all parameters related to optimization objectives. Then, Spark-based Mini-Batch K-means algorithm and Elbow method are constructed to divide whole operating modes. After that, all data are discretized and mapped to corresponding intervals by using Spark-based Elbow method and Mini-Batch K-means algorithm. Finally, Spark-based parallel FP-growth algorithm is used to deeply mine the potential relationships and laws. To verify the proposed method, a 350-MW thermal power unit is taken as a study case. The important conclusions are as follows: (1) the proposed Spark-based Mini-Batch K-means algorithm reduces the calculation time by 57.11% compared with Mini-Batch K-means algorithm, and 85.61% calculation time compared with K-means algorithm. The proposed Spark-based FP-growth algorithm reduces computational time by 32.8% compared with FP-growth algorithm. (2) Strong association rules of whole operating modes are mined, and operating optimization guidance schemes for important parameters are obtained. Take operating mode 1 as an example: if the optimal result can be reasonably applied, it can save 2.942 g coal per kilowatt hour. (3) Besides, we have found out some other potential relationships among parameters, which have important reference value for on-site operators to analyze economy of the thermal power unit. [ABSTRACT FROM AUTHOR]

The back-projection algorithm can adapt to synthetic aperture radar imaging in any mode because of its time-domain imaging characteristics, so it has received increasing attention in scientific research and engineering practice. However, the large enormous of computation of the back-projection algorithm limits its application. Since the back-projection algorithm has a high degree of data parallelism, it is very suitable for GPU parallel processing. The data scale and hardware environment in different application scenarios will result in different bottlenecks which may prevent the back-projection algorithm from performing optimally. Thus, this paper proposes a series of strategies to aid the back-projection algorithm in achieving the best peak performance with any given problem scale on any given platform. A heuristic block strategy is proposed to optimize the peak performance of the back-projection algorithm on servers and miniaturized GPU devices, which can handle the differences in hardware platforms as well as the differences in data scales. To optimize the peak performance of the back-projection algorithm on miniaturized GPU devices, a memory management strategy is proposed by using unified memory and pinned host memory. The method proposed in this paper has achieved an acceleration ratio close to the device's peak performance on servers and miniaturized GPU devices. By using the proposed methods, any algorithm with data-independent chunking and any GPU device with a uniform memory architecture can achieve higher peak performance. [ABSTRACT FROM AUTHOR]

Artificial intelligence (AI) and machine learning (ML) tools play a significant role in the recent evolution of smart systems. AI solutions are pushing towards a significant shift in many fields such as healthcare, autonomous airplanes and vehicles, security, marketing customer profiling and other diverse areas. One of the main challenges hindering the AI potential is the demand for high-performance computation resources. Recently, hardware accelerators are developed in order to provide the needed computational power for the AI and ML tools. In the literature, hardware accelerators are built using FPGAs, GPUs and ASICs to accelerate computationally intensive tasks. These accelerators provide high-performance hardware while preserving the required accuracy. In this work, we present a systematic literature review that focuses on exploring the available hardware accelerators for the AI and ML tools. More than 169 different research papers published between the years 2009 and 2019 are studied and analysed. [ABSTRACT FROM AUTHOR]

Floorplanning is a crucial part of very large-scale integration (VLSI) physical design flow. It primarily determines the position of the blocks on a chip by considering the area, the total wirelength, etc., in light of several real-world limitations such as delay, price, and chip performance. Adopting B*-tree representation, this paper proposes a novel dual-population adaptive hybrid memetic algorithm called DPAHMA to handle the VLSI floorplanning problem effectively by optimizing the chip area and the total wirelength. Three main ideas are presented in this paper, including new definitions of crossover and mutation operators based on B*-tree encoding that overcome the shortcomings of the existing method, such as overly complicated operations on binary trees and a lack of diversity; a dynamic self-adjusting objective function, namely WeightDS, which is able to find solutions more suitable for the user-specified weight; and a main-auxiliary population mechanism by which a candidate population is introduced to assist the normal population in the global search phase. To make full use of the information obtained by the local search method, the candidate population keeps its high-quality solutions. The individuals from the candidate population crossover with the individuals from the normal population before the end of each iteration to obtain higher-quality solutions as much as possible. Experimental results for MCNC and GSRC benchmarks show that DPAHMA obtains floorplans effectively with better area and total wirelength than those of the state-of-the-art floorplanners. [ABSTRACT FROM AUTHOR]

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

Aiming at the problems of low data quality and high incentive costs caused by the low enthusiasm of participants in mobile crowd sensing, a new task recommendation framework is proposed in this paper. First, the participants' historical behaviors are analyzed, assuming that user behaviors can be quantified as the user's willingness to participate, and the cosine similarity theorem is used to calculate the similarity between participants, thereby constructing a user-hybrid model. Secondly, probabilistic matrix factorization is developed to predict the willingness of participants, and a ranking model is obtained through learn-to-rank algorithm. Finally, a task recommendation list is generated according to the ranking model, which serves as the target participant's preferred task list for sensing task recommendation. The experiment in this paper is carried out on the MATLAB platform based on two real check-in datasets, Gowalla and Brightkite. The results show that the average allocation precision rate can reach 96%, and the sensing user participation rate is about 97%. Meantime, the user's mobile cost is reduced, and the overall goal of maximizing accuracy and minimizing perceived cost is achieved. [ABSTRACT FROM AUTHOR]

A recognition model named the SVM-NP is proposed in this paper to address the multi-attribute overlap in radar working recognition. The model is based on the K-NN boundary preselection algorithm and SVM-BP algorithm. Traditional classifiers tend to neglect the overlap of samples' attributes in classification, which leads to the low accuracy of classifiers. The K-NN boundary preselection can quickly select boundary samples from the total ones and reduce the whole samples' attribute overlap. The SVM-BP algorithm is improved based on the SVM-RFE algorithm, and the boundary samples with high attribute overlap are divided into many planes for training and testing. Compared with traditional methods, the overlap of sample attributes can be reduced twice in this model. Theoretical analysis and experimental results verify that the model proposed in this paper displays better performance in classification when appropriate parameters are provided. [ABSTRACT FROM AUTHOR]

The distributed alternating direction method of multipliers (ADMM) is an effective algorithm for solving large-scale optimization problems. However, its high communication cost limits its scalability. An asynchronous lazy ADMM algorithm based on hierarchical sparse allreduce communication mode (HSAC-ALADMM) is proposed to reduce the communication cost of the distributed ADMM: firstly, this paper proposes a lazily aggregate parameters strategy to filter the transmission parameters of the distributed ADMM, which reduces the payload of the node per iteration. Secondly, a hierarchical sparse allreduce communication mode is tailored for sparse data to aggregate the filtered transmission parameters effectively. Finally, a Calculator-Communicator-Manager framework is designed to implement the proposed algorithm, which combines the asynchronous communication protocol and the allreduce communication mode effectively. It separates the calculation and communication by multithreading, thus improving the efficiency of system calculation and communication. Experimental results for the L1-regularized logistic regression problem with public datasets show that the HSAC-ALADMM algorithm is faster than existing asynchronous ADMM algorithms. Compared with existing sparse allreduce algorithms, the hierarchical sparse allreduce algorithm proposed in this paper makes better use of the characteristics of sparse data to reduce system time in multi-core cluster. [ABSTRACT FROM AUTHOR]

Tridiagonal system solver is a basic kernel and has been well-supported in mainstream numerical libraries. The purpose of this paper is to devise an efficient parallel algorithm to solve a large-scale tridiagonal system. Based on the performance analysis of the classic Thomas algorithm and matrix splitting method, we propose a parallel Thomas split (PTS) algorithm. Compared with the matrix splitting method, the PTS algorithm can achieve an acceleration of 10.34 × . Furthermore, we propose a Sunway parallel Thomas split (swPTS) algorithm based on the sw26010pro manycore processor. In the swPTS algorithm, we propose a specific data partitioning scheme to implement MPI+Athread parallelism. In the reduced set of equations, a new reduction approach for the Sunway architecture is proposed. Experiments show that the parallel elimination stage of our swPTS algorithm achieves up to 38.31 × speedup over a PTS algorithm, and overall reaches 5.74 × speedup over a Thomas algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the existing line segment detectors will detect overdense meaningless textures, this paper proposes a fusing contour features optimization method for line segment detector, called CF-Lines. We define a new line segment attribute, called "line segment associate contour(LAC)" attribute, which includes the contour features, the length and the angle of line segment. After using existing algorithms to detect contours and line segments, CF-Lines calculates the LAC of all line segments. When the LAC is greater than the threshold and passes the quantitative verification, the line segment is removed as overdense meaningless texture. Using the YorkUrban and Wireframe datasets, the CF-Lines is tested and compared with original detectors. Experimental results show that CF-Lines performs better than the original detectors in average precision, F-score, average length of line segments and average number of line segments. [ABSTRACT FROM AUTHOR]

We present a keyphrase extraction algorithm named TopicLPRank in this paper, which is an improved TopicRank algorithm. Different from the TopicRank which only uses the relative distance information of the text, we think that the length and absolute position of the text candidate keyphrases also have a certain influence on the results of the model for extraction keyphrases. Therefore, the proposed TopicLPRank incorporates these two factors on the basis of the TopicRank. The experimental results show that adding the location information and length information of candidate keyphrases can, respectively, increase the F-Score of the model by around 2.7 % points and 1.7 % points, which is equivalent to an increase of 19.6 and 12.3 % compared with the TopicRank. At the same time, the fusion of the length and location information of the candidate keyphrase can increase the F-Score by around 3.5 percentage points, which is equivalent to an increase of 25.21 % compared with the TopicRank in the dataset NUS. [ABSTRACT FROM AUTHOR]

The growing data have brought tremendous pressure for query processing and storage, so there are many studies that focus on using GPU to accelerate join operation, which is one of the most important operations in modern database systems. However, existing GPU acceleration join operation researches are not very suitable for the join operation on big data. Based on this, this paper speeds up nested loop join, hash join and theta join, combining Hadoop with GPU, which is also the first to use GPU to accelerate theta join. At the same time, after the data pre-filtering and pre-processing, using MapReduce and HDFS in Hadoop proposed in this paper, the larger data table can be handled, compared to existing GPU acceleration methods. Also with MapReduce in Hadoop, the algorithm proposed in this paper can estimate the number of results more accurately and allocate the appropriate storage space without unnecessary costs, making it more efficient. Experimental results show that comparing with GPU-based approach without Hadoop, our approach increases the speed by 1.5–2 times, and comparing with the Hadoop-based approaches without GPU, our approach increases the speed by 1.3–2 times. [ABSTRACT FROM AUTHOR]

The marine predators algorithm (MPA) is a metaheuristic algorithm for solving optimization problems. MPA divides the whole optimization process into three phases evenly, and each phase corresponds to a different search agent update strategy. Such a setup makes MPA inflexible when facing different optimization problems, which affects the optimization performance. In this paper, we propose a novel modified MPA hybridizing by Q-learning (QMPA), which applies reinforcement learning to the selection of update strategy, and selects the most appropriate position update strategy for search agents in different iteration stages and states. It can effectively compensate for the deficiency of MPA's adaptive ability when facing different optimization problems. The performance of QMPA is tested on classical benchmark functions, the CEC2014 test suite, and engineering problems. In the classical benchmark functions test, QMPA is compared with MPA in 10, 30, and 50 dimensions. QMPA performs better than MPA for seven of the ten functions when the dimension is 10 and 30. The results of dimension 50 show that QMPA outperforms MPA in 5 functions and is close to it in 4 functions. Then, comparing QMPA with algorithms such as grey wolf optimizer, particle swarm optimization, slime mould algorithm, sine cosine algorithm, reptile search algorithm, and aquila optimizer, the results show that QMPA has the best performance on 22 of the total 30 functions in the CEC2014 test suite. Finally, QMPA is tested on two commonly used real-world engineering problems and gives the most optimal results. In general, the adaptive update strategy proposed in this paper improves the optimization performance of the MPA algorithm in terms of convergence and stability. [ABSTRACT FROM AUTHOR]

A wait-free consensus technique is provided with endless processes utilizing a shared memory model. When a powerful adversary is allowed to view and destroy infinite number of votes, the approach weighted voting can be used to reach consensus with at least constant probability. In asynchronous system, there is no known upper bound to transmit the message from source to destination processor. This paper presents a resilient and message-efficient algorithm by aggregating the votes of individual processors to solve the wait-free consensus in asynchronous systems. We considered an adaptive adversary and message-passing communication system. Our aim is to construct a message-passing algorithm equivalent to a weak shared coin and to provide a message-efficient algorithm for aggregating the votes of individual processors. A processor announces votes to smaller groups before propagating them to larger ones. To limit generated, received, or sent, vote weights are gradually increased. The wait-free consensus problem is optimally solved by our algorithm, which demonstrates an effective message-passing execution of the shared coin. When less than n/2 processes are faulty or crashed, the predicted message complexity of this randomized consensus procedure is O (n2 (log log n)2). This is a linear improvement over the previous best protocol and is close to a message lower bound. [ABSTRACT FROM AUTHOR]

How to improve resource utilization of cloud data centers (CDCs) and ensure users' quality of service (QoS) through efficient virtual machine (VM) scheduling is an urgent problem. Especially when service reliability is taken into consideration, the problem becomes more challenging. However, existing related researches mostly ignore the influence of reliability factors, such as failures and recoveries of computing nodes (CNs), which cannot reflect the realistic situations of real-life CDCs. Therefore, this paper investigates the problem of fault tolerance-aware VM scheduling and formulates it as a multi-objective optimization model with multiple QoS constraints. The proposed model tries to minimize users' total expenditure and, at the same time, maximize the successful execution rate of their businesses. To solve the proposed optimization model, a greedy-based best fit decreasing (GBFD) algorithm is then developed. The GBFD algorithm adopts a cost efficiency factor whose definition is according to the characteristics of CNs, to select a suitable CN for each VM request. Finally, extensive experiments are conducted to verify the feasibility of the proposed models and algorithm based on both the real-world CDC cluster data sets and the simulation ones. The results show that, first, as expected, fault tolerance significantly influences the performance criteria of VM scheduling and second, in most cases, the developed algorithm can decrease users' expenditure, increase success rate for executing their business and improve their overall satisfactions. Specifically, under real-world CDC cluster scenario, GBFD algorithm can increase the overall satisfaction of all cloud users by 38.3%, 20.9% and 14.6%, respectively, compared with the other three ones. Thus, the developed algorithm can perform better under fault tolerance-aware cloud environments. [ABSTRACT FROM AUTHOR]

With the development of cloud computing, a growing number of workflows are deployed on cloud platform that can dynamically provides cloud resources on demand for users. In clouds, one basic problem is how to schedule workflow for minimizing the execution cost and the workflow completion time. Aiming at the problem that the maximum completion time and cost of multiple workflows are too high, this paper proposes a model of dynamic multi-workflow scheduling in cloud environment and a new scheduling algorithm which is named as MT (multi-workflow scheduling technology). In MT, the heterogeneity of resources is considered when calculating the priority of tasks. Then, the technique for order of preference by similarity to ideal solution (TOPSIS) method is used to rank the resources when selecting resources for tasks. Finally, MT takes the estimated minimum completion time of the workflow and the cost of the task as two attribute indexes in TOPSIS decision matrix. Also, it uses a fixed reference point instead of calculating ideal solution, which ensures the uniqueness of the evaluation criteria when there is a change in the number of resources. Simulation experiments are illustrated to verify the effectiveness of the proposed algorithm in reducing the maximum completion time and cost of multiple workflows. Compared with the state-of-the-art methods, the maximum completion time and cost can be reduced by at most 17 and 9 % , respectively. [ABSTRACT FROM AUTHOR]

The load balancing algorithm of web server cluster in network education system is studied in this paper, and a new strategy based on server status and request information is proposed to reduce the response time. The mechanism of the algorithm is to classify the degree of influence of the client's request content on the server, and set the corresponding weight. At the same time, it combines the server performance parameters and load conditions to allocate the request to the lightest load of the server. The overall framework structure of the hierarchy is proposed according to the MOOC education system, and the internal communication mechanism of the system and the monitoring program of the web server performance are studied in this paper. Experimental results show that the algorithm can fully utilize the existing software and hardware resources, effectively balance the load of the web cluster server, and fully utilize the service resources. [ABSTRACT FROM AUTHOR]

As the size of graph data grows exponentially, it is usually processed by parallel and distributed computing environment. During parallel processing, the first step is to divide the graph data into many subgraphs and then place them on different computational nodes. However, the existing graph clustering methods cannot adapt to parallel processing or improve computing performance. The main reason is that these methods only focus on the graph data but do not care about the graph's application algorithm. Therefore, this paper addresses a graph clustering method that supports parallel processing by perceiving the application algorithm semantics. We specifically focus on the characteristic of "tight inside and loose outside". Based on this characteristic, we give a new formula for calculating the modularity of the subgraph. In a graph application, graph data and its associated application algorithm are not separated from each other. Thus, we also focus on the execution patterns of the application algorithm. Combining the modularity of a subgraph and execution patterns of an application algorithm, we present the critical concept of semantic serial degree as a new criterion for big graph clustering. Consequently, we propose a graph clustering method that effectively balances the importance between the graph data and its associated application algorithm. By achieving this balance, our approach ensures that the final clustering results are more suitable for parallel and distributed processing. Extended experiments show that our proposed graph clustering method is more general and compatible with traditional clustering methods. Compared with FastUnfolding, a state-of-the-art graph clustering method, the completion times of an application algorithm are significantly reduced due to the help of the proposed graph clustering method. [ABSTRACT FROM AUTHOR]

The salp swarm algorithm (SSA) is a well-known optimization algorithm that is increasingly being utilized to solve many sorts of optimization problems. However, SSA may converge to sub-optimal solutions when it is applied to discrete problems such as the feature selection (FS) problem. This paper presents the enhanced opposition-based learning salp swarm algorithm (EOSSA), which is an improved SSA algorithm for solving the FS problem in intrusion detection systems (IDS). EOSSA incorporates four improvements into the original SSA algorithm. Firstly, the opposition-based learning (OBL) method is used in the initialization step of SSA to boost its population diversity. Secondly, the Elite opposition-based learning (EOBL) is used in the improvement loop of SSA to improve its exploration ability. Third, a variable neighborhood search (VNS) method is used in the improvement loop of SSA to improve its exploration mechanism to improve the local search space. Lastly, the Sigmoid binary transform function is used to convert the continuous candidate solutions produced by SSA into discrete binary solutions. EOSSA was evaluated against eighteen popular optimization algorithms (e.g., improved salp swarm algorithm based on opposition-based learning (ISSA), SSA, particle swarm algorithm (PSO), cuckoo search (CS), bat algorithm (BA), and Harris Hawk Optimization (HHO)) using eleven popular intrusion detection datasets (CICIDS2017, CSE-CIC-IDS2018, CICDDOS2019, CIRA-CIC-DoH, Intrusion detection 2018, UNSW-NB15, NSL-KDD, Phishing Legitimate, Malmem2022, IoT, and LUFlow Network) to Detect IoT Botnet Attacks. Moreover, EOSSA was compared with four machine learning algorithms (Decision Tree (DT), logistic regression (LR), Naive Bayes (NB), and K-Nearest Neighborhood (KNN)). The overall simulation results suggested that the proposed method is superior to the other algorithms in terms of the accuracy and number of selected features. The statistical analysis of the simulation results using the Friedman and Wilcoxon signed-rank test confirms the superiority of the proposed method. [ABSTRACT FROM AUTHOR]

The deployment of long-term evolution systems in an unauthorized spectrum provided a credible solution to manage accelerating network data traffic. Meanwhile, the distribution of spectrum on unlicensed bands creates severe interaction issues. Therefore, this paper proposed a novel listen-and-talk-based MAC (LAT-MAC) protocol to enhance secondary users' (SUs') access performance by implementing a full-duplex mechanism. The application of full-duplex methods efficiently neglects collision and improves spectrum utilization of unlicensed bands. For cognitive radio networks, utilizing these benefits of a full duplex, the proposed LAT-MAC protocol simultaneously executes transmission processes and spectrum sensing. The cognitive network users sense spectrum utilizing energy detectors. For enhanced energy detection, the type 2 fuzzy cooperative spectrum sensing (T2FCSS) technique is implemented. Moreover, to attain enhanced spectrum sensing performances with the negligence of power-throughput tradeoff and self-interference, the switching algorithm-based cognitive radio network (SA-CRN) is employed. The performances of the proposed protocol are analyzed using different metrics, and evaluation results illustrate that it achieves enhanced performance compared with existing techniques. [ABSTRACT FROM AUTHOR]

The digital images are widely captured, transmitted, and stored by limited resource devices. Those devices need lightweight encryption (LWE) techniques to protect secret and personal images. Designing LWE algorithms for digital images is challenging due to the large size and high inter-pixel correlations of digital images. This paper presents an image encryption technique based on the Nonlinear feedback shift register (NLFSR) and DNA computation. The image is permuted first using pseudorandom sequence generated by a NLSFR based Key stream generator followed by a substitution of pixel values using DNA computations in cipher block chaining mode. Furthermore, security analysis tests, histograms, correlation, entropy, NPCR, and UACI are used to verify our scheme. The security and performance analysis of the proposed techniques analyses showed their efficacy and resistance to attacks. The analysis of the results certainly indicates the scheme is highly secure and lightweight. The proposed scheme can be used for secure image transmission and storage in medical IoT, smart surveillance, etc. [ABSTRACT FROM AUTHOR]

Cell tracking is currently a powerful tool in a variety of biomedical research topics. Most cell tracking algorithms follow the tracking by detection paradigm. Detection is critical for subsequent tracking. Unfortunately, very accurate detection is not easy due to many factors like densely populated, low contrast, and possible impurities included. Keeping tracking multiple cells across frames suffers many difficulties, as cells may have similar appearance, they may change their shapes, and nearby cells may interact each other. In this paper, we propose a unified tracking-by-detection framework, where a powerful detector AttentionUnet++, a multimodal extension of the Efficient Convolution Operators algorithm, and an effective data association algorithm are included. Experiments show that the proposed algorithm can outperform many existing cell tracking algorithms. [ABSTRACT FROM AUTHOR]

The National Center for Atmospheric Research released a global atmosphere model named Community Atmosphere Model version 5.0 (CAM5), which aimed to provide a global climate simulation for meteorological research. Among them, the cloud microphysics scheme is extremely time-consuming, so developing efficient parallel algorithms faces large-scale and chronic simulation challenges. Due to the wide application of GPU in the fields of science and engineering and the NVIDIA's mature and stable CUDA platform, we ported the code to GPU to accelerate computing. In this paper, by analyzing the parallelism of CAM5 cloud microphysical schemes (CAM5 CMS) in different dimensions, corresponding GPU-based one-dimensional (1D) and two-dimensional (2D) parallel acceleration algorithms are proposed. Among them, the 2D parallel algorithm exploits finer-grained parallelism. In addition, we present a data transfer optimization method between the CPU and GPU to further improve the overall performance. Finally, GPU version of the CAM5 CMS (GPU-CMS) was implemented. The GPU-CMS can obtain a speedup of 141.69 × on a single NVIDIA A100 GPU with I/O transfer. In the case without I/O transfer, compared to the baseline performance on a single Intel Xeon E5-2680 CPU core, the 2D acceleration algorithm obtained a speedup of 48.75 × , 280.11 × , and 507.18 × on a single NVIDIA K20, P100, and A100 GPU, respectively. [ABSTRACT FROM AUTHOR]

Isometric Projection (IsoP) is a linear dimensionality reduction method, which provides the best linear approximation to the true isometric embedding of data. However, IsoP and all its variants only consider the one-way mapping from high-dimensional space to low-dimensional space. The projected low-dimensional data may not "represent" the original sample accurately and effectively. In this paper, based on the "encoding-decoding" mechanism, a new IsoP method called IsoP-R (Isometric Projection with Reconstruction) has been proposed. In this method, the conventional projection of IsoP is viewed as the encoding stage, and the decoder is used to reconstruct the original high-dimensional data from the projected low-dimensional data. In this way, our algorithm makes the low-dimensional embedding data "represent" the original data more accurately and effectively. Experiment results on Handwritten Alphadigits, COIL-100, Olivetti Research Laboratory and Georgia Tech face datasets show that the proposed IsoP-R approach better represents the data and achieves much higher recognition accuracy. [ABSTRACT FROM AUTHOR]

Business process model and notation (BPMN) is a popular notation used for process modelling mainly due to its high expressiveness. However, BPMN has shortcomings when dealing with specific domains (namely Hazard Analysis and Critical Control Points systems), struggling to model activity duration, quality control points, activity effects and monitoring nature. To tackle these limitations, the business process model and notation extended expressiveness (BPMN-E2) was proposed. In this paper, a multiperspective conformance checking algorithm is developed focusing on detecting non-conformity between an event log and a process model, regarding the information provided by the new elements within BPMN-E2. The proposed algorithm follows a two-step approach that starts by converting the model into a directly follows model (annotated with conformance rules), which is then used in a second phase to perform conformance checking effectively. This modular approach allows to apply the proposed algorithm to other process model notations than BPMN-E2. An event log clustering technique was also developed to downsize large-event logs without compromising data relevance. In this way, both the multiperspective algorithm and the log-downsize clustering technique here proposed are a key contribution to improve conformance checking in process modelling, as evinced in the proof-of-concept provided. [ABSTRACT FROM AUTHOR]

This paper proposes a parallel computing analysis model HPM and analyzes the parallel architecture of CPU–GPU based on this model. On this basis, we study the parallel optimization of the ray-tracing algorithm on the CPU–GPU parallel architecture and give full play to the parallelism between nodes, the parallelism of the multi-core CPU inside the node, and the parallelism of the GPU, which improve the calculation speed of the ray-tracing algorithm. This paper uses the space division technology to divide the ground data, constructs the KD-tree organization structure, and improves the construction method of KD-tree to reduce the time complexity of the algorithm. The ground data is evenly distributed to each computing node, and the computing nodes use a combination of CPU–GPU for parallel optimization. This method dramatically improves the drawing speed while ensuring the image quality and provides an effective means for quickly generating photorealistic images. [ABSTRACT FROM AUTHOR]

Large-scale numerical optimization problems arise from many fields and have applications in both industrial and academic contexts. Finding solutions to such optimization problems efficiently requires algorithms that are able to leverage the increasing parallelism available in modern computing hardware. In this paper, we review previous work on parallelizing algorithms for nonlinear optimization. To introduce the topic, the paper starts by giving an accessible introduction to nonlinear optimization and high-performance computing. This is followed by a survey of previous work on parallelization and utilization of high-performance computing hardware for nonlinear optimization algorithms. Finally, we present a number of optimization software libraries and how they are able to utilize parallel computing today. This study can serve as an introduction point for researchers interested in nonlinear optimization or high-performance computing, as well as provide ideas and inspiration for future work combining these topics. [ABSTRACT FROM AUTHOR]

PageRank can be viewed as a hyperlink-based method for estimating the importance of nodes in a network, and has attracted a lot of attention from researchers. In this paper, we first propose an extrapolation procedure for PageRank vector estimation based on the linear combination of the Ritz values computed from the Hessenberg process and eigenvectors from the classical power method. In order to improve the convergence rate of the PageRank computations, the extrapolation procedure is introduced into the Hessenberg-type algorithm by Gu et al. (Numer. Algorithms, 89(4): 1845–1863, 2022), then a new algorithm is derived and named Hessenberg-extrapolation algorithm whose convergence and construction are investigated in detail. In addition, we further analyze the convergence of the Hessenberg-type algorithm and discuss the relationship between the approximate vectors of the Hessenberg-type algorithm and the Arnoldi-type algorithm. Numerical experiments on several examples demonstrate that our presented algorithm has great potential in PageRank approximation. [ABSTRACT FROM AUTHOR]

Classic multidimensional scaling (MDS) and scaling by majorizing a complex function (SMACOF) are well-known centralized algorithms that are used to solve MDS problem. In this paper, we present a distributed algorithm for solving MDS problem. Estimations of coordinates are performed concurrently under the assumption that each item knows only its own position and its distances from its neighbors and their approximated present locations. The update process is done by calculating the average of the current coordinate of each object and its projections on the solution spaces allocated to it by its neighbors. We apply the method to the problem of sensor localization and obtain numerical results that demonstrate the efficacy of our suggested strategy. [ABSTRACT FROM AUTHOR]

In this paper, we propose a NLOS positioning and tracking method in order to be applied in the emerging smart rail systems. By analyzing MIMO scatter channels, the geometric relationship for positioning between each UE, BS and scattering points can be modeled that includes information of AOA, AOD, TOA. The accuracy of positioning can be improved by forming an optimization problem with bias in time and orientation. Further, in order to track the mobile UE, an ODE-LSTM algorithm is proposed, which is combined by ODE derivation solver and LSTM network. It puts the positioning information into an ODE-LSTM network to achieve continuous tracking in arbitrary time instance. Simulation works validate that the proposed ODE-LSTM method shows better performance in nonlinear tracking than traditional Kalman filter or enhanced Kalman filter, demonstrating a performance improvement of at least 10%. [ABSTRACT FROM AUTHOR]

Graph pattern matching is widely used in real-world applications, such as social network analysis. Since the traditional subgraph isomorphism is NP-complete and often too restrictive to catch sensible matches, relaxed graph pattern matching models are used. However, existing algorithms suffer from limited linear scalability and restricted degrees of parallelism. In this paper, we propose fast parallel algorithms, GPGS and GPDS, for graph simulation and dual simulation, respectively. They make most use of the GPU performance by adopting the edge-centric processing model. We perform parallel computations on the data graph edges to evaluate the matching constraints for each vertex allowing for fast and scalable algorithms. To the best of our knowledge, we present the first GPU-based algorithms for graph simulation and dual simulation. Extensive experiments on synthetic and real-world data graphs demonstrate that our algorithms significantly outperform existing methods, achieving up to 74.8 × acceleration for GPGS and up to 114.2 × acceleration for GPDS. [ABSTRACT FROM AUTHOR]

In the past few decades, many multi-objective evolution algorithms (MOEAs) have been proposed, often emphasizing a single crossover operator, which has a significant impact on the algorithm's performance. This paper proposed a novel MOEA, based on the MOEA/D framework and employing Q-learning for adaptive operator selection (QLMOEA/D-AOS). In every Iteration, Q-learning is used to dynamically choose an operator among five crossover operators. To obtain a better distribution of solutions in multi-objective optimization problems with irregular PFs, a new approach for weight vector initializing is proposed. Additionally, to enhance population diversity, a reward calculation method based on two metrics, Spacing and PD, is proposed. Finally, the proposed algorithm is validated for different numbers of objectives, ranging from two to five for multi/many-objective optimization problems. The experimental results demonstrate the significant advantages of the proposed algorithm compared to state-of-the-art MOEAs across multiple test cases. [ABSTRACT FROM AUTHOR]

Sparse general matrix–matrix multiplication (SpGEMM) is a crucial and complex computational task in many practical applications. Improving the performance of SpGEMM on SIMT processors like modern GPUs is challenging due to the unpredictable sparsity of sparse matrices. Although existing GPU solutions have made progress in improving performance through advanced algorithm design, they ignore some optimizations related to specific processor architectures. This can result in a partially inefficient implementation of their algorithms. This paper focuses on optimizing four inefficient parts of the NSparse algorithm on DCU (a GPU-like accelerator). The optimizations include: 1) setting parameters to improve the load balance of the second matrix by extracting maximum row information at runtime; 2) reducing overhead of binning operations by making full use of registers and shared memory effectively; 3) improving numerical SpGEMM performance by adjusting its calculation mode; and 4) enhancing global load balance through finer-grained grouping and kernel configurations. Experiment results demonstrate that when compared to five state-of-the-art SpGEMM algorithms (bhSparse, KokkosKernels, NSparse, rocSparse, and spECK), our optimized method achieves an average of 7.99x (up to 18.2x), 8.01x (up to 20.83x), 2.37x (up to 6.16x), 1.82x (up to 4.20x), and 1.63x (up to 5.01x) speedups on 29 sparse matrices with different sparse structures, respectively. [ABSTRACT FROM AUTHOR]

In industrial scenarios, cross-departmental collaboration is necessary to achieve quality traceability. However, data cannot be shared due to privacy concerns. Vertical Federated Learning (VFL) enables heterogeneous industrial sectors to jointly train models while preserving product privacy. However, existing traditional VFL algorithms only focus on aligning feature benefits and suffer from high communication costs and poor performance. This paper proposes a "Cluster Knowledge-Driven Vertical Federated Learning" (Cluster-VFL) algorithm, which integrates cluster intelligence to optimize heterogeneous distributed environments. In Cluster-VFL, each participant engages in training as an individual within the cluster, taking into account the utilization of non-aligned features. Cluster-VFL promotes model updates by identifying global optimal individuals and transferring global optimal knowledge. Subsequently, this knowledge is merged with the individual optimal knowledge obtained from local training of each participant. We conducted extensive experiments using an open-source diagnostic dataset and a proprietary dataset from Company A. The results unequivocally demonstrate that this algorithm enhances participants' learning abilities, improves their communication efficiency. [ABSTRACT FROM AUTHOR]

Snake optimizer (SO) is an optimization algorithm drawn from the reproductive habits of serpents. It exhibits outstanding effectiveness in solving continuous optimization problems. However, SO may face some performance challenges related to its population diversity and early convergence behavior. In this paper, we address the challenges of SO by introducing the Hybrid snake optimizer algorithm (HSOA). HSOA is a novel approach to optimization that incorporates two new optimization techniques into the SO algorithm. First, it incorporates a new opposition-based learning technique called Oppositional-mutual learning into the initialization stage of the SO algorithm. Second, it integrates dynamic polynomial mutation, which is an intelligent mutation method, into the initialization and optimization stages of the SO algorithm. These integrated approaches aim to increase the population's diversity of SO, while improving its searchability during its optimization stage. In power systems, the economic load dispatch (ELD) is an intricate optimization problem that becomes more challenging when the restrictions of the valve point effect (VPE) are incorporated into it. ELD with VPE is non-convex, lacking smoothness, and exhibiting nonlinearity that considers operational limitations expressed as both equality and inequality constraints to generate electricity. The suggested HSOA algorithm underwent evaluation and was compared with 47 renowned optimization algorithms across five real-world ELD problems with different specifications: generators with different unit capacities, transmission losses, prohibited operation zones, and Ramp Rate restrictions. The experimental results demonstrate that HSOA produces competitive solutions for the five real-world ELD problems. In detail, HSOA achieves the top rank in three cases of ELD problems with a 3-unit generator, and it secures the second and third positions in high-dimensional ELD problems with 40-unit and 80-unit generators, respectively. The statistical tests confirm the reliability and efficiency of HSOA. In addition, the effectiveness of HSOA was evaluated using the single-objective IEEE-CEC 2014 functions and compared to the results of eight popular metaheuristic algorithms. The results demonstrate that HSOA is a competitive optimization algorithm capable of solving the functions of IEEE-CEC 2014. [ABSTRACT FROM AUTHOR]

The presence of microparticle viruses significantly impacts the quality of silkworm seeds for domestic sericulture, making their exclusion from detection in silkworm seed production crucial. Traditional methods for detecting microparticle viruses in silkworms, such as manual microscopic observation, molecular biology, and immunological approaches, are cumbersome and unable to achieve intelligent, batch real-time detection. To address this challenge, we employ the YOLOv8 algorithm in this paper. Firstly, NAM attention is introduced in the original algorithm's Backbone component, allowing the model to extract more generic feature information. Secondly, ODConv replaces Conv in the Head component of the original algorithm, enhancing the model's ability to identify microparticle viruses. Finally, NWD-LOSS modifies the CIoU loss of the original algorithm to obtain a more accurate prediction box. Experimental results demonstrate that the NN-YOLOv8 model outperforms mainstream detection algorithms in detecting silkworm microparticle diseases. With an average detection time of 22.6 milliseconds per image, the model shows promising prospects for future applications. This model improvement enhances detection efficiency and reduces human resource costs, effectively realizing detection intelligence. [ABSTRACT FROM AUTHOR]

Imbalanced data poses a significant challenge in machine learning, as conventional classification algorithms often prioritize majority class samples, while accurately classifying minority class samples is more crucial. The synthetic minority oversampling technique (SMOTE) represents one of the most renowned methods for handling imbalanced data. However, both SMOTE and its variants have limitations due to their insufficient consideration of data distribution, leading to the generation of incorrect and unnecessary samples. This paper, therefore, introduces a novel oversampling algorithm called data distribution and spectral clustering-based SMOTE (DDSC-SMOTE). This algorithm addresses the shortcomings of SMOTE by introducing three innovative data distribution-based improvement strategies: adaptive allocation of synthetic sample quantities strategy, seed sample adaptive selection strategy, and synthetic sample improvement strategy. First, we use the k-nearest neighbor sample labels and the local outlier factor algorithm to remove noisy and outlier samples. Next, we leverage spectral clustering to identify clusters within the minority class and propose a dual-weight factor that considers inter-cluster and intra-cluster distances to allocate the number of synthetic samples effectively, addressing interclass and intraclass imbalances. Furthermore, we introduce a relative position weight coefficient to determine the probability of selecting seed samples within the subcluster, ensuring that important minority samples have higher chances of being sampled. Finally, we improve the SMOTE sample synthesis formula for safer generation. Extensive comparisons on real datasets from the UCI repository demonstrate that DDSC-SMOTE outperforms seven state-of-the-art oversampling algorithms significantly in terms of G-mean and F1-score, presenting a data distribution-focused solution for addressing imbalanced data challenges. [ABSTRACT FROM AUTHOR]

Blockchain received a vast amount of attention in recent years and is still growing. The second generation of blockchain, such as Ethereum, allows execution of almost any program in EVM, making it a global protocol for distributed applications. The code deployment and each operation performed in EVM cost the network fee called gas, whose price varies and can be significant. That is why code optimization and well-chosen algorithms are crucial in programming on the blockchain. This paper evaluates the gas usage of several exact pattern matching algorithms on the EVM. We also propose an efficient implementation of the algorithms in the Solidity/YUL language. We evaluate the gas fees of all the algorithms for different parameters (such as pattern length, alphabet size, and text size). We show a significant gas fee and execution time reduction with up to 22-fold lower gas usage and 55-fold speed-up compared to StringUtils (a popular Solidity string library). [ABSTRACT FROM AUTHOR]

As the core of blockchain technology, the consensus mechanism ensures the safe and stable operation of the blockchain system. According to the more complex traceability of data when sharing cross-system and cross-chain, the paper proposes the Layered Cross-Chain Practical Byzantine Fault Tolerance (LC-PBFT) suitable for cross-chain scenarios to ensure the secure traceability of data in the process of cross-chain data traceability. Firstly, in a single chain, the initial reputation value is set according to the success rate and efficiency of the nodes in the historical transactions in the chain, the reputation ranking of the nodes in the chain is realized by the improved PageRank algorithm, and delegated nodes are selected to participate in the cross-chain consensus based on reputation ranking. Then, the forest topology is sorted according to the contribution of the consensus nodes in the cross-chain system, and the consensus results from the child nodes are quickly verified by aggregation signature, which prevents the parent node from tampering with the consensus results of the child nodes. Meanwhile, the consensus process between the sibling nodes in the same layer and the view switching protocol when the master node fails are given. Finally, the performance of the LC-PBFT consensus algorithm is analyzed, and its advantages in performance such as throughput are verified by simulation. Compared with the Practical Byzantine Fault Tolerance (PBFT) algorithm, the consensus latency of the LC-PBFT consensus algorithm is reduced by 50.17%, and the throughput is improved by 19.37%. [ABSTRACT FROM AUTHOR]

High-dimensional imbalanced biomedical data has dual characteristics of high-dimensional and imbalanced distribution. It is important to improve classification accuracy by filtering out low-dimensional feature subsets that are highly correlated with the classification target and have minimal mutual redundancy. However, traditional feature selection algorithms tend to select the feature subset that is favorable to class with large sample size, resulting in poor classification performance for minority samples. In response to the above problems, the P-AdaBoost-PAUC algorithm is proposed to be applied to high-dimensional imbalanced biomedical data classification. The idea of P-AdaBoost-PAUC algorithm has two major contributions. The first is that an improved decision tree attribute optimization algorithm (DT-P) is proposed, which pays more attention to the correlation among attributes. The second is that an improved AdaBoost algorithm based on probabilistic AUC (AdaBoost-PAUC) is proposed, which comprehensively considers misclassification probability and AUC to pay more attention to minority samples. An ensemble algorithm for high-dimensional imbalanced biomedical data classification is formed, which is conducive to improve classification performance. Experimental results show that Recall, Specificity, F1, and AUC values of P-AdaBoost-PAUC ensemble algorithm have reached the highest values on datasets with different imbalance rate. Especially when the proportion of minority samples is only 12.6 % , Recall, Specificity, F1 and AUC values all reached above 0.95. And algorithm stability experiments show that P-AdaBoost-PAUC algorithm is more stable than other algorithms. Therefore, the P-AdaBoost-PAUC ensemble algorithm proposed in this paper improves classification performance of minority samples on high-dimensional imbalanced biomedical data to a certain extent. [ABSTRACT FROM AUTHOR]

According to the complexity of ocean data, this paper adopts a parallel mining algorithm of association rules to explore the correlation and regularity of oxygen, temperature, phosphate, nitrate and silicate in the ocean. After the marine data is interpolated, this paper utilizes the parallel FP-growth algorithm to mine the data and then briefly analyzes the mining results of the frequent itemsets and association rules. The relationship between the parallel efficiency and the core number of CPU is analyzed through datasets with different scales. The experimental results indicate that the acceleration effect is ideal when each thread scored 200,000-300,000 data, which leads to more than 1.2 times of performance improvement. [ABSTRACT FROM AUTHOR]

Our goal is to provide a novel method of representing 2D shapes, where each shape will be assigned a unique fingerprint—a computable approximation to the conformal map of the given shape to a canonical shape in 2D or 3D space (see page 22 for a few examples). In this paper, we make the first significant step in this program where we address the case of simply and doubly connected planar domains. We prove uniform convergence of our approximation scheme to the appropriate conformal mapping. To this end, we affirm a conjecture raised by Ken Stephenson in the 1990s which predicts that the Riemann mapping can be approximated by a sequence of electrical networks. In fact, we first treat a more general case. Consider a planar annulus, i.e., a bounded, 2-connected, Jordan domain, endowed with a sequence of triangulations exhausting it. We construct a corresponding sequence of maps which converge uniformly on compact subsets of the domain, to a conformal homeomorphism onto the interior of a Euclidean annulus bounded by two concentric circles. The resolution of Stephenson’s conjecture then follows by a limiting argument. With more complex topology of the given shape, i.e., when it has higher genus, we will use methods invented by Arabnia (J Parallel Distrib Comput 10:188-192, 1990) and Wani-Arabnia (J Supercomput 25:43-62, 2003). First, to divide the domain into subdomains and thereafter to make the scheme presented in this paper suitable for parallel processing. We will then be able to compare our results for those appearing, for instance, in the work of Arabnia-Oliver (Comput Graph Forum 8:3-11, 1989) that provides algorithms for the translation and scaling of complicated digitalized images. [ABSTRACT FROM AUTHOR]

This paper proposes a new chaotic satellite image encryption algorithm based on a 2D filter and Fisher–Yates shuffling. To reduce the encryption time and increase the security level in the proposed algorithm, the original image is divided into several blocks, and each block is encrypted using the same steps. Firstly, the vector transformation is applied to the original image to obtain a vector that is divided into several vectors where each one consists of 256 pixels. The obtained vector is transformed into a matrix using a matrix transformation. Afterward, the filtering operation generated by the 1D chaotic map is applied to the transformed matrix, where each pixel is filtered using a different mask filter. Then, the rows and the columns of the filtered matrix are scrambled, where the rows are scrambled by the modern Fisher–Yates shuffling and the columns are scrambled by the classical Fisher–Yates shuffling. The two Fisher–Yates shuffling methods are generated by different two 2D hyperchaotic systems. After that, the obtained scrambled matrix is transformed into a vector. Finally, if the storage vector is less than the original vector, the previous steps are repeated until encrypting the remaining next blocks. If not, the storage vector is transformed into a matrix which is considered the final cipher image. The advantages of the proposed algorithm are: Filtering technique has been used in the cryptography field and a different independent filter is used for every single pixel to improve the efficiency of the algorithm. Moreover, the use of Fisher's principle as a permutation technique in the proposed encryption algorithm is an effective manner. The experimental and analysis results show that the proposed algorithm has good performance in terms of a high level of security, large enough key space, tolerance to single event upsets, and low time complexity. [ABSTRACT FROM AUTHOR]

Adaptive algorithms are widely used in deep learning because of their fast convergence. Among them, Adam is the most widely used algorithm. However, studies have shown that Adam's generalization ability is weak. AdaX is a variant of Adam, which introduces a novel second-order momentum, modifies the second-order moment of Adam, and has good generalization ability. However, these algorithms may fail to converge due to instability and extreme learning rates during training. In this paper, we propose a new adaptive and momental bound algorithm, called AdaXod, which characterizes of exponentially averaging the learning rate and is particularly useful for training deep neural networks. By setting an adaptively limited learning rate in the AdaX algorithm, the resultant AdaXod can effectively eliminate the problem of excessive learning rate in the later stage of neural networks training and thus results in stable training. We conduct extensive experiments on different datasets and verify the advantages of the AdaXod algorithm by comparing with other advanced adaptive optimization algorithms. AdaXod eliminates large learning rates during neural networks training and outperforms other optimizers, especially for some neural networks with complex structures, such as DenseNet. [ABSTRACT FROM AUTHOR]