Search

In the world of virtual and connected networks, the study of network's computing capabilities through graph embedding has grown in prominence. In order to implement algorithms created for the guest graph in the host graph, embedding involves simulating one architecture, called the guest, into another, called the host. In this paper, we have obtained the optimal wirelength of embedding (K 9 - C 9) n into Mesh M (3 n , 3 n) , generalized book graph GB [ 9 , 3 n - 1 , 3 n - 1 ] and extended firecracker tree EF 9 n . [ABSTRACT FROM AUTHOR]

In wireless sensor networks, location information is crucial to effectively use the event information recorded by the sensors. However, localizing mobile sensor nodes in resource-constrained networks presents several challenges, including determining the optimal number of anchor nodes, handling mobility, designing a path loss model, considering network topology, and addressing scalability and the number of localized nodes. To overcome these challenges, this paper proposes a coordinate-based auto-localization algorithm (CALA) with a single anchor node for mobile sensor nodes. The proposed algorithm uses an analytical model to determine the location of the target node by considering a parallel coordinate system and retrieving the original location of the target node by moving it to two different locations. The algorithm uses received signal strength indicator (RSSI) values for distance calculation while considering Rayleigh fading in the path loss model. The proposed algorithm's performance is evaluated using various parameter settings, including mobility, node density, fading, path loss exponent, and different random seed values. The study finds that fading and path loss significantly influence the localization process, leading to an accuracy range of 10 to 30% when measuring distances using RSSI. The proposed method shows a 30% improvement in localization accuracy when the number of nodes increases from 5 to 20, achieving an average localization accuracy of 90% in a network with 20 sensor nodes. Furthermore, the study offers an in-depth investigation of the effect of various random generating situations on localization accuracy. Overall, the proposed algorithm offers a promising solution to the challenges of localizing mobile sensor nodes in resource-constrained networks. [ABSTRACT FROM AUTHOR]

As a significant branch of production scheduling problem, the Flexibility Job Shop Scheduling Problem (FJSP) is a typical NP-hard problem. Most conventional flexible workshop scheduling primarily focuses on performance aspects involving production efficiency such as time and quality. In recent years, due to increased energy costs and environmental pollution, 'low-carbon scheduling' has garnered attention as a new scheduling paradigm among scholars and engineers. This paper investigates a low-carbon flexible Job shop scheduling problem, proposing a Grey Wolf Optimization algorithm (SC-GWO), aiming to minimize the sum of carbon emission costs and makespan costs. This algorithm employs the Grey Wolf Algorithm (GWO) as the fundamental optimization method, adaptively choosing between global and local searches based on the dispersion degree of individuals. Firstly, integrating the Sine Cosine Algorithm (SCA), the sinusoidal cosine search mechanism is applied to GWO to enhance its local search capability. Secondly, a new leader selection mechanism is introduced to prevent leaders from falling into local optima, thus improving the algorithm's global exploration capability. Utilizing a nonlinear convergence factor strategy controls the global exploration and local exploitation capabilities in different algorithm stages, enhancing optimization accuracy and accelerating convergence, achieving a dynamic balance between the two. Finally, validation of the SC-GWO algorithm's ability to solve low-carbon scheduling problems in flexible job shop scheduling instances is conducted. Experimental results demonstrate the superior performance of SC-GWO in solving low-carbon flexible workshop scheduling instances. Comparative experiments against four other advanced algorithms on 22 classic benchmark test functions confirm SC-GWO's better convergence. Through standard test functions like Bandimarte instances applied to solve FJSP, experimental results showcase the excellent optimization performance of SC-GWO. Compared to HGWO and GWO, the makespan time is reduced by 22.25% and 39.27%, respectively. The proposed SC-GWO algorithm demonstrates favorable solving effects on flexible job shop scheduling instances, meeting actual production scheduling needs. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

One of the most important strategies used to mitigate the adverse impacts of traffic growth on mobile networks is caching. By caching at the edge, the backhaul traffic load is reduced, and the quality of service for the user is increased. Developing an effective caching algorithm requires accurate prediction of the future popularity of the content, which is a challenging issue. In recent years, deep learning models have achieved high predictive accuracy due to advancements in data availability and increased computing power. In this paper, we present a caching algorithm called the user preference-aware content caching algorithm (UPACA). This algorithm is specifically designed for an edge content delivery platform where users can access content services provided by a remote content provider. UPACA operates in two steps. In the first step, the proposed collaborative filtering-based popularity prediction algorithm (CFPA) is used to predict future content popularities. CFPA utilizes a gated residual variational autoencoder collaborative filtering model to predict users' future preferences and calculate the future popularity of content. This algorithm considers the popularity of the content as well as the number and timing of content requests. Experimental results demonstrate that UPACA outperforms previous methods in terms of cache hit rates and user utilities. [ABSTRACT FROM AUTHOR]

Due to the large computational requirements of object detection algorithms, high-resolution remote sensing vehicle detection always involves numerous small objects, high level of background complexity, and challenges in balancing model accuracy and parameter count. The attention mechanism and efficient architecture lightweight-YOLO (AMEA-YOLO) is proposed in this paper. A lightweight network as the backbone network of AMEA-YOLO is designed, and it could maintain model accuracy and ensure good lightweight. FasterNet is employed to accelerate model training speed. The enhanced deep second-order channel attention module (EnhancedSOCA) is utilized to improve the image high-resolution. In addition, a lightweight module is devised to further reduce the model's weight. The implementation of the HardSwish activation function improves model accuracy. The experimental results indicate that the AMEA-YOLO algorithm could ensure model lightweight and accurate performance. [ABSTRACT FROM AUTHOR]

Power system operators are faced with the problem of unit commitment belonging to mixed integer programming, which becomes very complicated, as units become large-scale and highly constrained. Because unit commitment problem is a binary problem with commitment and de-commitment, a discrete/binary optimization algorithm with superior performance is required. This paper proposes a novel hybrid binary bat algorithm for unit commitment problem, which consists of two process. To begin with, the proposed binary bat algorithm is applied to determining the commitment schedule of unit commitment problem. Specifically, an improved crossover operator based on exponential-logic-modulo map is proposed to enhance the convergence and maintain the diversity of populations. To prevent the algorithm from falling into a local optimum, a local mutation strategy performs local perturbation. Chaotic map is responsible for updating some parameters to increase the performance of the proposed algorithm. Furthermore, Lambda-iteration method is adopted to solve economic load dispatch in continuous space. Constraint handling is performed using the heuristic constraint produce. The effectiveness of the proposed algorithm is verified by benchmark functions and test systems. Additionally, the simulation results are compared with other well-established heuristic and binary approaches. [ABSTRACT FROM AUTHOR]

Nowadays, establishing security in data transmission is essential, and it is achieved by cryptography. Encryption of still or video images in specific applications such as Internet of Things, medical and satellite imaging, in applications requiring high-speed encryption, or even in applications where a personal computer is unavailable or cannot be used needs special hardware. In this paper, an image encryption algorithm based on chaos theory named Parallel Chaotic Checksum-based Image Encryption or PCCIE algorithm is proposed that has been able to provide a fast, efficient and secure algorithm with a hardware perspective on the design and parallel system structure. Using high-level synthesis, PCCIE is implemented on a Field Programmable Gate Array (FPGA). The proposed algorithm using small and independent local image buffers solved FPGA internal memory limitation for encryption of large images. Ultimately, a Hexa-core crypto-processor with single-precision floating-point and fixed-point precision has been designed, capable of encrypting 256 × 256 and Full HD images in 2.13 and 59.52 milliseconds, respectively, at 469 and 16 frames per second. [ABSTRACT FROM AUTHOR]

The sparse triangular solver (SpTRSV) is mostly used for scientific and engineering applications. The structured-grid triangular solver of regular dependencies (STRSV) is a special kind of SpTRSV. Some general SpTRSVs that disregards the regularity of the matrix are unsuitable for solving this problem. This paper proposes an efficient parallel algorithm for STRSV on the SW26010 (a kind of China independently designed many-core processors), namely swStructTRSV. The algorithm makes full use of the fine-grained and low latency communication characteristics of the SW26010 to reduce the waiting time for synchronization, maximizes the regularity of access to improve memory access bandwidth, and achieves overlap between memory access and computation simultaneously. Moreover, the idea of the algorithm can be extended to incomplete LU factorization (ILU factorization) because of consistent dependencies. The experimental results on a core group(8 * 8 network composed of 64 cores) of SW26010 show that swStructTRSV can achieve an average speedup of over 30 in the sequential version. swStructTRSV on SW26010 achieves solving speedups of 2.2 and 6.3 over the fast STRSV (fSpTRSV) previously implemented on SW26010 and MKL on Intel Xeon Gold 6132, respectively. swStructTRSV significantly outperforms cuSparse on NVIDIA TITAN RTX in terms of overall execution time. [ABSTRACT FROM AUTHOR]

Effective resource allocation is a crucial aspect in improving the performance of visible light communication (VLC)/hybrid WiFi networks. This study presents a dynamic resource allocation algorithm for multiuser scenarios. A fuzzy logic technique is employed to select the network resources with higher scores for communication. In this sense, to ensure fairness in the hybrid VLC-WiFi network, an enhanced proportional fairness (PF) algorithm is utilized. The algorithm considers the access delay and the distance to the access point as users move, striking a reasonable balance between fair allocation of user resources and maximizing system resource utilization. Therefore, to enhance the user experience in real-time scheduling, a compensation factor is introduced to compensate users with higher latency, increasing their priority. A thorough analysis is provided for the throughput, latency, utility value, and fairness models of the VLC-WiFi heterogeneous network system. The algorithm proposed in this paper is simulated and compared with four traditional algorithms, namely the Round-Robin algorithm, maximum carrier to interference ratio (Max C/I) algorithm, modified largest weighted delay first algorithm, and PF algorithm, under different metrics. Simulation results show that the proposed method is effective, and the improved algorithm yields better fairness and higher throughput compared to the conventional algorithm. As the number of frames increases, the fairness index of the proposed algorithm increases the fastest and gradually converges to 1. The throughput of this method is significantly greater than that of previous algorithms, reaching a stable rate of roughly 1.3 Mbps. The suggested algorithm is approximately 150% higher than the throughput achieved by conventional PF algorithms. The algorithm improves user satisfaction in different regions, and the utility value remains around 0.975. The packet loss rate is approximately 75% lower than traditional typical algorithms, and the average latency is approximately 60% lower. Simulation results show that the proposed algorithm has good application prospects in heterogeneous networks. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

This paper presents a massively parallel approach of the multilevel fast multipole algorithm (PMLFMA) on homegrown many-core SW26010 cluster of China, noted as (SW-PMLFMA), for 3-D electromagnetic scattering problems. In this approach, the multilevel fast multipole algorithm (MLFMA) octree is first partitioned among management processing elements (MPEs) of SW26010 processors following the ternary partitioning scheme using the message passing interface (MPI). Then, the computationally intensive parts of the PMLFMA on each MPI process, matrix filling, aggregation and disaggregation are accelerated by using all the 64 computing processing elements (CPEs) in the same core group of the MPE via the Athread parallel programming model. Different parallelization strategies are designed for many-core accelerators to ensure a high computational throughput. In coincidence with the special characteristic of local Lagrange interpolation, the compressed sparse row (CSR) and the compressed sparse column (CSC) sparse matrix storage format is used for storing interpolation and anterpolation matrices, respectively, together with a specially designed cache mechanism of hybrid dynamic and static buffers using the scratchpad memory (SPM) to improve data access efficiency. Numerical results are included to demonstrate the efficiency and versatility of the proposed method. The proposed parallel scheme is shown to have excellent speedup. [ABSTRACT FROM AUTHOR]

The utilization of cloud computing environments is highly popular for carrying out workflow executions due to its ability to provide clients with immediate access to computing resources. Among the various workflow scheduling problems in the cloud, deadline-constrained workflow scheduling has garnered increasing attention in recent years. This paper introduces a hybrid scheduling algorithm known as Partial Critical Path–Ant Colony Optimization (PCP–ACO), which aims to minimize the execution cost of a workflow while ensuring that it meets the user-defined deadline in cloud environments. PCP–ACO is a list scheduling algorithm that combines the PCP heuristic algorithm with the meta-heuristic ACO to achieve faster convergence. The list scheduling algorithm consists of two phases: task ordering and resource selection. In the case of PCP–ACO, the first step involves calculating a topological sort of the workflow tasks to assign priority to each task. Subsequently, the ACO meta-heuristic is employed to allocate the appropriate resource to each task of the workflow, based on their respective sub-deadlines that are computed using the PCP heuristic. In order to evaluate the effectiveness of the proposed algorithm, several experiments were conducted using five real scientific workflows. The results demonstrate that PCP–ACO outperforms the IC-PCP, L-ACO, and HP-GA algorithms in terms of average execution cost, achieving reductions of 19%, 17.3%, and 21.5%, respectively. [ABSTRACT FROM AUTHOR]

Density peaks clustering (DPC) algorithm has been widely applied in many fields due to its innovation and efficiency. However, the original DPC algorithm and many of its variants choose Euclidean distance as local density and relative distance estimations, which affects the clustering performance on some specific shaped datasets, such as manifold datasets. To address the above-mentioned issue, we propose a density peak clustering algorithm with connected local density and punished relative distance (DPC–CLD–PRD). Specifically, the proposed approach computes the distance matrix between data pairs using the flexible connectivity distance metric. Then, it calculates the connected local density of each data point via combining the flexible connectivity distance measure and k-nearest neighbor method. Finally, the punished relative distance of each data point is obtained by introducing a connectivity estimation strategy into the distance optimization process. Experiments on synthetic, real-world, and image datasets have shown the effectiveness of the algorithm in this paper. [ABSTRACT FROM AUTHOR]

Identifying the location of the sensor nodes is a challenging aspect of Wireless Sensor Networks (WSNs) in a distributed environment. It is vital to understand where data and events come from when sensor nodes collect data and report on them. This paper uses a nature-inspired Jaya algorithm to estimate the location coordinates of target nodes in a distributed architecture of WSNs. The Jaya algorithm handles the nonlinear optimization problem of node localization in a randomly distributed sensor node configuration. The range-based, Received Signal Strength Indicator method is used for the distance estimation. MATLAB software is used to assess the proposed work, and a comparison is made with the Particle Swarm Optimization, Krill Herd Optimization, and Salp Swarm Algorithm based node localization algorithms in terms of localization error and computation time. The localization error analysis is done for the different numbers of anchor nodes and different values of degree of irregularity to verify the effectiveness of the proposed work. [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]

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]