Search

Libcint is a library designed for the evaluation of analytical integrals for Gaussian type orbitals. It prioritizes simplicity, ease of use, and efficiency for the development of quantum chemistry programs. In the release of version 6.0, Libcint supports the computation of integrals for various operators, such as overlap, Coulomb, Gaunt, Breit, attenuated Coulomb, Slater-type geminals, and Yukawa potential, as well as arbitrary orders of derivatives for these operators. To enhance the usability of the library, Libcint provides a uniform function signature for all integral functions. A code generator is included to automate the implementation of new integrals. To achieve better performance on modern central processing unit architectures, the library employs explicit single instruction multiple data parallelization in the code implementation. [ABSTRACT FROM AUTHOR]

The calculation of two-electron repulsion integrals (ERIs) is a crucial aspect of Hartree–Fock calculations. In computing the ERIs of varying angular momentum, both the central processing unit (CPU) and the graphics processing unit (GPU) have their respective advantages. To accelerate the ERI evaluation and Fock matrix generation, a hybrid CPU/GPU method has been proposed to maximize the computational power of both CPU and GPU while overlapping the CPU and GPU computations. This method employs a task queue where each task corresponds to ERIs with the same angular momentum. The queue begins with ERIs of low angular momentum, which are computationally efficient on GPUs, and ends with ERIs of high angular momentum, which are better suited for CPU computation. CPUs and GPUs dynamically grab and complete tasks from the start and end of the queue using OpenMP dynamic scheduling until all tasks are finished. The hybrid CPU/GPU computation offers the advantage of enabling calculations with arbitrary angular momentum. Test calculations showed that the hybrid CPU/GPU algorithm is more efficient than "GPU-only" when using a single GPU. However, as more GPUs are involved, the advantage diminishes or disappears. The scaling exponents of the hybrid method were slightly higher than "GPU-only," but the pre-exponent factor was significantly lower, making the hybrid method more effective overall. [ABSTRACT FROM AUTHOR]

Quantum mechanical calculations for material modeling using Kohn–Sham density functional theory (DFT) involve the solution of a nonlinear eigenvalue problem for N smallest eigenvector-eigenvalue pairs, with N proportional to the number of electrons in the material system. These calculations are computationally demanding and have asymptotic cubic scaling complexity with the number of electrons. Large-scale matrix eigenvalue problems arising from the discretization of the Kohn–Sham DFT equations employing a systematically convergent basis traditionally rely on iterative orthogonal projection methods, which are shown to be computationally efficient and scalable on massively parallel computing architectures. However, as the size of the material system increases, these methods are known to incur dominant computational costs through the Rayleigh–Ritz projection step of the discretized Kohn–Sham Hamiltonian matrix and the subsequent subspace diagonalization of the projected matrix. This work explores the potential of polynomial expansion approaches based on recursive Fermi-operator expansion as an alternative to the subspace diagonalization of the projected Hamiltonian matrix to reduce the computational cost. Subsequently, we perform a detailed comparison of various recursive polynomial expansion approaches to the traditional approach of explicit diagonalization on both multi-node central processing unit and graphics processing unit architectures and assess their relative performance in terms of accuracy, computational efficiency, scaling behavior, and energy efficiency. [ABSTRACT FROM AUTHOR]

The intermediate state representation (ISR) formalism allows for the straightforward calculation of excited state properties and state-to-state transition moments using the algebraic-diagrammatic construction (ADC) scheme for the polarization propagator. Here, the derivation and implementation of the ISR in third-order perturbation theory for the one-particle operator are presented, enabling, for the first time, the calculation of consistent third-order ADC [ADC(3)] properties. The accuracy of ADC(3) properties is evaluated with respect to high-level reference data and compared to the previously used ADC(2) and ADC(3/2) schemes. Oscillator strengths and excited state dipole moments are computed, and typical response properties are considered: dipole polarizabilities, first-order hyperpolarizabilities, and two-photon absorption strengths. The consistent third-order treatment of the ISR leads to an accuracy similar to that of the mixed-order ADC(3/2) method; the individual performance, however, depends on the property and molecule under investigation. ADC(3) produces slightly improved results in the case of oscillator strengths and two-photon absorption strengths, while excited state dipole moments, dipole polarizabilities, and first-order hyperpolarizabilities exhibit similar accuracy at ADC(3) and ADC(3/2) levels. Taking the significant increase of central processing unit time and memory requirements of the consistent ADC(3) approach into account, the mixed-order ADC(3/2) scheme offers a better compromise between accuracy and efficiency for the properties considered. [ABSTRACT FROM AUTHOR]

We present a Graphics Processing Unit (GPU)-accelerated version of the real-space SPARC electronic structure code for performing Kohn–Sham density functional theory calculations within the local density and generalized gradient approximations. In particular, we develop a modular math-kernel based implementation for NVIDIA architectures wherein the computationally expensive operations are carried out on the GPUs, with the remainder of the workload retained on the central processing units (CPUs). Using representative bulk and slab examples, we show that relative to CPU-only execution, GPUs enable speedups of up to 6× and 60× in node and core hours, respectively, bringing time to solution down to less than 30 s for a metallic system with over 14 000 electrons and enabling significant reductions in computational resources required for a given wall time. [ABSTRACT FROM AUTHOR]

Using an OpenMP Application Programming Interface, the resolution-of-the-identity second-order Møller–Plesset perturbation (RI-MP2) method has been off-loaded onto graphical processing units (GPUs), both as a standalone method in the GAMESS electronic structure program and as an electron correlation energy component in the effective fragment molecular orbital (EFMO) framework. First, a new scheme has been proposed to maximize data digestion on GPUs that subsequently linearizes data transfer from central processing units (CPUs) to GPUs. Second, the GAMESS Fortran code has been interfaced with GPU numerical libraries (e.g., NVIDIA cuBLAS and cuSOLVER) for efficient matrix operations (e.g., matrix multiplication, matrix decomposition, and matrix inversion). The standalone GPU RI-MP2 code shows an increasing speedup of up to 7.5× using one NVIDIA V100 GPU with one IBM 42-core P9 CPU for calculations on fullerenes of increasing size from 40 to 260 carbon atoms using the 6-31G(d)/cc-pVDZ-RI basis sets. A single Summit node with six V100s can compute the RI-MP2 correlation energy of a cluster of 175 water molecules using the correlation consistent basis sets cc-pVDZ/cc-pVDZ-RI containing 4375 atomic orbitals and 14 700 auxiliary basis functions in ∼0.85 h. In the EFMO framework, the GPU RI-MP2 component shows near linear scaling for a large number of V100s when computing the energy of an 1800-atom mesoporous silica nanoparticle in a bath of 4000 water molecules. The parallel efficiencies of the GPU RI-MP2 component with 2304 and 4608 V100s are 98.0% and 96.1%, respectively. [ABSTRACT FROM AUTHOR]

In this work, we present ænet-PyTorch, a PyTorch-based implementation for training artificial neural network-based machine learning interatomic potentials. Developed as an extension of the atomic energy network (ænet), ænet-PyTorch provides access to all the tools included in ænet for the application and usage of the potentials. The package has been designed as an alternative to the internal training capabilities of ænet, leveraging the power of graphic processing units to facilitate direct training on forces in addition to energies. This leads to a substantial reduction of the training time by one to two orders of magnitude compared to the central processing unit implementation, enabling direct training on forces for systems beyond small molecules. Here, we demonstrate the main features of ænet-PyTorch and show its performance on open databases. Our results show that training on all the force information within a dataset is not necessary, and including between 10% and 20% of the force information is sufficient to achieve optimally accurate interatomic potentials with the least computational resources. [ABSTRACT FROM AUTHOR]

DNA-based identification is vital for classifying biological specimens, yet methods to quantify the uncertainty of sequence-based taxonomic assignments are scarce. Challenges arise from noisy reference databases, including mislabelled entries and missing taxa. PROTAX addresses these issues with a probabilistic approach to taxonomic classification, advancing on methods that rely solely on sequence similarity. It provides calibrated probabilistic assignments to a partially populated taxonomic hierarchy, accounting for taxa that lack references and incorrect taxonomic annotation. While effective on smaller scales, global application of PROTAX necessitates substantially larger reference libraries, a goal previously hindered by computational barriers. We introduce PROTAX-GPU, a scalable algorithm capable of leveraging the global Barcode of Life Data System (>14 million specimens) as a reference database. Using graphics processing units (GPU) to accelerate similarity and nearest-neighbour operations and the JAX library for Python integration, we achieve over a 1000 × speedup compared with the central processing unit (CPU)-based implementation without compromising PROTAX's key benefits. PROTAX-GPU marks a significant stride towards real-time DNA barcoding, enabling quicker and more efficient species identification in environmental assessments. This capability opens up new avenues for real-time monitoring and analysis of biodiversity, advancing our ability to understand and respond to ecological dynamics. This article is part of the theme issue 'Towards a toolkit for global insect biodiversity monitoring'. [ABSTRACT FROM AUTHOR]

The purpose of this work is to explore the decrease of total used power in cell‐free millimetre‐wave (mm‐Wave) massive multiple‐input multiple‐output (MIMO) systems, which can be regarded an essential technology for future wireless generations to improve system performance. One of the most important strategies for reducing total power consumption is to activate and deactivate radio frequency (RF) chains at each access point (AP) in the coverage region. Nonetheless, the optimization issue for this methodology is NP‐hard, and an exhaustive search method may be used to determine the ideal number of RF chains at each AP in the cell‐free network. Unfortunately, the exhaustive searching approach is prohibitively complicated, indicating that it is unworkable when there are a significant number of APs in the service region. Furthermore, present RF chain selection approaches prioritize decreasing consumed power and complexity at the price of system performance in terms of total possible rate. This research solves this issue by introducing a unique RF chain selection approach that combines Hungarian and genetic algorithms. The fact that the genetic algorithm (GA) can readily determine the ideal number of active RF chains, yet this technique generally entails significant complexity in large‐scale cell‐free networks, prompted this notion. As a result, the Hungarian method is used early in the GA to overcome the complexity problem while still retaining system performance. In addition, the suggested system employs a semi‐centralized hybrid beamforming architecture in which all analogue combiners for all APs are operated at a central processing unit using channel state information. In addition, each AP has a fully linked phase shifters network and restricted RF chains connecting to its antennas. Finally, simulation findings reveal that, when compared to state‐of‐the‐art techniques, the suggested approach achieves the maximum attainable rate and overall energy efficiency with a tolerable computational complexity. [ABSTRACT FROM AUTHOR]

The stationary point of optimization problems can be obtained via conjugate gradient (CG) methods without the second derivative. Many researchers have used this method to solve applications in various fields, such as neural networks and image restoration. In this study, we construct a three-term CG method that fulfills convergence analysis and a descent property. Next, in the second term, we employ a Hestenses-Stiefel CG formula with some restrictions to be positive. The third term includes a negative gradient used as a search direction multiplied by an accelerating expression. We also provide some numerical results collected using a strong Wolfe line search with different sigma values over 166 optimization functions from the CUTEr library. The result shows the proposed approach is far more efficient than alternative prevalent CG methods regarding central processing unit (CPU) time, number of iterations, number of function evaluations, and gradient evaluations. Moreover, we present some applications for the proposed three-term search direction in image restoration, and we compare the results with well-known CG methods with respect to the number of iterations, CPU time, as well as root-mean-square error (RMSE). Finally, we present three applications in regression analysis, image restoration, and electrical engineering. [ABSTRACT FROM AUTHOR]

Lagrangian particle dispersion models are indispensable tools for the study of atmospheric transport processes. However, Lagrangian transport simulations can become numerically expensive when large numbers of air parcels are involved. To accelerate these simulations, we made considerable efforts to port the Massive-Parallel Trajectory Calculations (MPTRAC) model to graphics processing units (GPUs). Here we discuss performance optimizations of the major bottleneck of the GPU code of MPTRAC, the advection kernel. Timeline, roofline, and memory analyses of the baseline GPU code revealed that the application is memory-bound, and performance suffers from near-random memory access patterns. By changing the data structure of the horizontal wind and vertical velocity fields of the global meteorological data driving the simulations from structure of arrays (SoAs) to array of structures (AoSs) and by introducing a sorting method for better memory alignment of the particle data, performance was greatly improved. We evaluated the performance on NVIDIA A100 GPUs of the Jülich Wizard for European Leadership Science (JUWELS) Booster module at the Jülich Supercomputing Center, Germany. For our largest test case, transport simulations with 108 particles driven by the European Centre for Medium-Range Weather Forecasts (ECMWF) ERA5 reanalysis, we found that the runtime for the full set of physics computations was reduced by 75 %, including a reduction of 85 % for the advection kernel. In addition to demonstrating the benefits of code optimization for GPUs, we show that the runtime of central processing unit (CPU-)only simulations is also improved. For our largest test case, we found a runtime reduction of 34 % for the physics computations, including a reduction of 65 % for the advection kernel. The code optimizations discussed here bring the MPTRAC model closer to applications on upcoming exascale high-performance computing systems and will also be of interest for optimizing the performance of other models using particle methods. [ABSTRACT FROM AUTHOR]

Topographic change detection is increasingly being used to identify and monitor landslides and other geohazards in support of risk-informed decision-making. Expanding change detection from site specific to regional scales enables increasingly proactive asset management and contributes to improving the resilience of infrastructure to extreme events. It is widely known that change detection precision can be improved by applying three-dimensional algorithms, such as iterative closest point (ICP) and M3C2, directly to raw point clouds. However, this also increases the computational requirements compared to alternatives such as digital elevation model differencing. This study presents a novel graphics processing unit (GPU)-based implementation of the ICP-M3C2 workflow to address this limitation. In the proposed algorithm, point cloud data segments are automatically queued and served to the working GPU, which efficiently performs point cloud processing operations, while the central processing unit (CPU) performs data management operations in parallel. The developed method is estimated to be up to 54 times faster than CPU-based versions of the same algorithm. In this study, we present how the workflow has been applied to six regional-scale landslide identification and monitoring case studies in which landslides are causing the disruption of pipelines, highways, and rail corridors. Overall, in 2021 and 2022, over 17 500 linear km of change detection were processed using the demonstrated method. [ABSTRACT FROM AUTHOR]

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

Smartphones, digital cameras, and other imaging devices generate vast amounts of high-resolution colored images daily, stored on devices equipped with multi-core central processing units or on the cloud. Safeguarding these images from potential attackers has become a pressing concern. This paper introduces a set of six innovative image ciphers designed to be stronger, faster, and more efficient. Three of these algorithms incorporate the State-Based Tent Map (SBTM) Chaotic Pseudo Random Number Generator (CPRNG), while the remaining three employ a proposed modified variant, SBTMPi. The Grayscale Image Cipher (GIC), Colored Image Cipher Single-Thread RGB (CIC1), and Colored Image Cipher Three-Thread RGB (CIC3) showcase the application of the proposed algorithms. By incorporating novel techniques in the confusion and diffusion phases, these ciphers demonstrate remarkable performance, particularly with large colored images. The study underscores the potential of SBTM-based image ciphers, contributing to the advancement of secure image encryption techniques with robust random number generation capabilities. [ABSTRACT FROM AUTHOR]

The finite‐difference time‐domain (FDTD) method often demands numerous grids for fine structure analysis, leading to high computational costs. To address this challenge, a subgridding scheme emerges as an attractive solution. However, the explicit nature of the FDTD subgrid method, constrained by Courant–Friedrichs–Lewy (CFL) conditions, can lead to inefficiencies with complex structures. In response, the leapfrog alternating‐direction implicit (ADI)‐FDTD method, exhibiting unconditional stability, has been developed to overcome CFL limitations. This paper presents a hybrid approach merging the one‐step leapfrog ADI‐FDTD method with a subgridding scheme using heterogeneous computing. By optimizing hardware usage and leveraging different device performances, this approach maximizes throughput in heterogeneous systems. Central processing units and graphics processing units handle workloads to minimize system latency. Simulation results on heterogeneous platforms demonstrate superior efficiency over single processor setups while maintaining simulation accuracy, especially in analyzing electromagnetic scattering from multiscale structures. [ABSTRACT FROM AUTHOR]

The development of highly thermally conductive composites that combine visible light/infrared camouflage and information encryption has been endowed with great significance in facilitating the application of 5G communication technology in military fields. This work uses aramid nanofibers (ANF) as the matrix, hetero‐structured silver nanowires@boron nitride nanosheets (AgNWs@BNNS) prepared by in situ growth as fillers, which are combined to fabricate sandwich structured thermally conductive and electrically insulating (BNNS/ANF)‐(AgNWs@BNNS)‐(BNNS/ANF) (denoted as BAB) composite films by "filtration self‐assembly, air spraying, and hot‐pressing" method. When the mass ratio of AgNWs@BNNS to BNNS is 1 : 1 and the total mass fraction is 50 wt %, BAB composite film has the maximum in‐plane thermal conductivity coefficient (λ∥ of 10.36 W/(m ⋅ K)), excellent electrical insulation (breakdown strength and volume resistivity of 41.5 kV/mm and 1.21×1015 Ω ⋅ cm, respectively) and mechanical properties (tensile strength of 170.9 MPa). 50 wt % BAB composite film could efficiently reduce the equilibrium temperature of the central processing unit (CPU) working at full power, resulting in 7.0 °C lower than that of the CPU solely integrated with ANF directly. In addition, BAB composite film boasts adaptive visible light/infrared dual camouflage properties on cement roads and jungle environments, as well as the function of fast encryption of QR code information within 24 seconds. [ABSTRACT FROM AUTHOR]

The development of highly thermally conductive composites that combine visible light/infrared camouflage and information encryption has been endowed with great significance in facilitating the application of 5G communication technology in military fields. This work uses aramid nanofibers (ANF) as the matrix, hetero‐structured silver nanowires@boron nitride nanosheets (AgNWs@BNNS) prepared by in situ growth as fillers, which are combined to fabricate sandwich structured thermally conductive and electrically insulating (BNNS/ANF)‐(AgNWs@BNNS)‐(BNNS/ANF) (denoted as BAB) composite films by "filtration self‐assembly, air spraying, and hot‐pressing" method. When the mass ratio of AgNWs@BNNS to BNNS is 1 : 1 and the total mass fraction is 50 wt %, BAB composite film has the maximum in‐plane thermal conductivity coefficient (λ∥ of 10.36 W/(m ⋅ K)), excellent electrical insulation (breakdown strength and volume resistivity of 41.5 kV/mm and 1.21×1015 Ω ⋅ cm, respectively) and mechanical properties (tensile strength of 170.9 MPa). 50 wt % BAB composite film could efficiently reduce the equilibrium temperature of the central processing unit (CPU) working at full power, resulting in 7.0 °C lower than that of the CPU solely integrated with ANF directly. In addition, BAB composite film boasts adaptive visible light/infrared dual camouflage properties on cement roads and jungle environments, as well as the function of fast encryption of QR code information within 24 seconds. [ABSTRACT FROM AUTHOR]

Serial crystallography experiments at synchrotron and X‐ray free‐electron laser (XFEL) sources are producing crystallographic data sets of ever‐increasing volume. While these experiments have large data sets and high‐frame‐rate detectors (around 3520 frames per second), only a small percentage of the data are useful for downstream analysis. Thus, an efficient and real‐time data classification pipeline is essential to differentiate reliably between useful and non‐useful images, typically known as 'hit' and 'miss', respectively, and keep only hit images on disk for further analysis such as peak finding and indexing. While feature‐point extraction is a key component of modern approaches to image classification, existing approaches require computationally expensive patch preprocessing to handle perspective distortion. This paper proposes a pipeline to categorize the data, consisting of a real‐time feature extraction algorithm called modified and parallelized FAST (MP‐FAST), an image descriptor and a machine learning classifier. For parallelizing the primary operations of the proposed pipeline, central processing units, graphics processing units and field‐programmable gate arrays are implemented and their performances compared. Finally, MP‐FAST‐based image classification is evaluated using a multi‐layer perceptron on various data sets, including both synthetic and experimental data. This approach demonstrates superior performance compared with other feature extractors and classifiers. [ABSTRACT FROM AUTHOR]

Deep reinforcement learning (DRL) has emerged as a promising approach for handling highly dynamic and nonlinear active flow control (AFC) problems. However, the computational cost associated with training DRL models presents a significant performance bottleneck. To address this challenge and enable efficient scaling on high-performance computing architectures, this study focuses on optimizing DRL-based algorithms in parallel settings. We validate an existing state-of-the-art DRL framework used for AFC problems and discuss its efficiency bottlenecks. Subsequently, by deconstructing the overall framework and conducting extensive scalability benchmarks for individual components, we investigate various hybrid parallelization configurations and propose efficient parallelization strategies. Moreover, we refine input/output (I/O) operations in multi-environment DRL training to tackle critical overhead associated with data movement. Finally, we demonstrate the optimized framework for a typical AFC problem where near-linear scaling can be obtained for the overall framework. We achieve a significant boost in parallel efficiency from around 49% to approximately 78%, and the training process is accelerated by approximately 47 times using 60 central processing unit (CPU) cores. These findings are expected to provide valuable insight for further advancements in DRL-based AFC studies. [ABSTRACT FROM AUTHOR]

Continuous constraint satisfaction is prevalent in many science and engineering fields. When solving continuous constraint satisfaction problems, it is more advantageous for practitioners to derive all feasible regions (i.e., the solution space) rather than a limited number of solution points, since these feasible regions facilitate design concept generation and design tradeoff evaluation. Several central processing unit (CPU)-based branch-and-prune methods and geometric approximation methods have been proposed in prior research to derive feasible regions for continuous constraint satisfaction problems. However, these methods have not been extensively adopted in practice, mainly because of their high computational expense. To overcome the computational bottleneck of extant CPU-based methods, this paper introduces a GPU-based parallel region classification method to derive feasible regions for continuous constraint satisfaction problems in a reasonable computational time. Using interval arithmetic, coupled with the computational power of GPU, this method iteratively partitions the design space into many subregions and classifies these subregions as feasible, infeasible, and indeterminate regions. To visualize these classified regions in the design space, a planar visualization approach that projects all classified regions into one figure is also proposed. The GPU-based parallel region classification method and the planar visualization approach are validated through two case studies about the bird function and the welded beam design. These case studies show that the method and the approach can solve the continuous constraint satisfaction problems and visualize the results effectively and efficiently. A four-step procedure for implementing the method and the approach in practice is also outlined. [ABSTRACT FROM AUTHOR]

Dance performance is an art form, which needs to cultivate students' dance skills, artistic accomplishment and stage performance ability. Sequential quadratic programming algorithm is an optimization algorithm that can be used to solve complex optimization problems. In this paper, Sequential Quadratic Programming (SQP) is applied to explore the training mode of dance performers in colleges to help dance performers develop the optimal training plan and program. Aiming at the problems existing in the training mode of dance performance talents in colleges, this paper put forward an optimization method based on SQP algorithm, and implemented its optimization scheme in actual colleges. In the planning of dance performance talent training mode, particle swarm optimization (PSO) is used to optimize SQP algorithm, so that it can have higher planning efficiency. This paper studied the goal and index system of the training of dance performance talents in colleges, generated a personalized training program, and further improved the scientific and practical effectiveness of the training mode. This paper investigated the current situation of dance performance talent training in several dance schools in a certain province of China. The survey data include practical curriculum planning, teachers' teaching philosophy and teaching content. Combined with SQP algorithm, the teaching and training program is optimized. After evaluation, it can be concluded that the SQP algorithm optimized by PSO shows good stability and accuracy. It can calculate the optimal solution of the cultivation scheme, and when calculating the optimal solution, the running time of the Central Processing Unit (CPU) was only 5.6 s, which can further improve the efficiency of the planning. Finally, through the satisfaction and resource utilization test, it can be found that the number of people who are very satisfied with the teaching content of the dance performance talent training program optimized by SQP increased from 38.4% to 52.4%. After optimization, the average utilization rate of teaching resources reached 88.1%. It can be concluded that SQP algorithm can provide scientific basis for dance education institutions to improve the training mode of dance talents. This can help dance education institutions better improve the training mode, and improve the overall quality and dance skills of dance students. [ABSTRACT FROM AUTHOR]

The ever-growing size of modern space–time data sets, such as those collected by remote sensing, requires new techniques for their efficient and automated processing, including gap-filling of missing values. Compute Unified Device Architecture-based parallelization on graphics processing units (GPUs) has become a popular way to dramatically increase the computational efficiency of various approaches. Recently, a computationally efficient and competitive yet simple spatial prediction approach inspired by statistical physics models, called the modified planar rotator method, was proposed. Its GPU implementation allowed additional impressive computational acceleration exceeding two orders of magnitude in comparison with central processing unit calculations. In the current study, a rather general approach to modeling spatial heterogeneity in GPU-implemented spatial prediction methods for two-dimensional gridded data is proposed by introducing spatial variability to model parameters. Predictions of unknown values are obtained from non-equilibrium conditional simulations, assuming "local" equilibrium conditions. It is demonstrated that the proposed method leads to significant improvements in both prediction performance and computational efficiency. [ABSTRACT FROM AUTHOR]

We develop an accurate, highly efficient, and scalable random batch Ewald (RBE) method to conduct molecular dynamics simulations in the isothermal–isobaric ensemble (the NPT ensemble) for charged particles in a periodic box. After discretizing the Langevin equations of motion derived using suitable Lagrangians, the RBE method builds the mini-batch strategy into the Fourier space in the Ewald summation for the pressure and forces such that the computational cost is reduced to O (N) per time step. We implement the method in the Large-scale Atomic/Molecular Massively Parallel Simulator package and report accurate simulation results for both dynamical quantities and statistics for equilibrium for typical systems including all-atom bulk water and a semi-isotropic membrane system. Numerical simulations on massive supercomputing cluster are also performed to show promising central processing unit efficiency of the RBE. [ABSTRACT FROM AUTHOR]

Aiming at problems such as tracking failure caused by illumination changes often encountered during unmanned aerial vehicle (UAV) tracking, a target tracking algorithm with illumination adaptive and future-aware correlation filters is proposed based on the background-aware correlation filters (BACF) algorithm, which realizes reliable UAV tracking tasks at night. First, the dark scene is recognized, and an efficient image enhancement module is used to enhance the brightness of low illumination images. Then a future-aware module is constructed to train the tracking model using the contextual information of the target in the next frame for better robustness. Finally, the model updating stage involves adaptive filter updating and adaptive learning rate updating to enhance target tracking precision. The results of the comparison experiments with the state-of-the-art algorithms on the UAVDark135, UAVDT, and DTB70 datasets show that the algorithm in this paper outperforms the state-of-the-art tracking methods and has better tracking performance under light changes and fast motion (FM) scenarios. The tracking speed on a single Central processing unit (CPU) reaches 49 FPS, which satisfies the real-time requirement of UAV tracking. [ABSTRACT FROM AUTHOR]

Real-time monitoring of rainwater is a critical issue in the development of autonomous vehicles and smart homes, while the corresponding sensors play a pivotal role in ensuring their sensitivity. Here, we study a self-powered intelligent water droplet monitoring sensor based on a solid–liquid triboelectric nanogenerator (SL-TENG). The sensor comprises a SL-TENG, a signal acquisition module, a central processing unit (CPU), and a wireless transmission module, facilitating the real-time monitoring of water droplet signals. It is worth noting that the SL-TENG has self-powering characteristics and can convert the kinetic energy of water droplets into electrical energy. The excellent output performance, with open-circuit voltage of 9 V and short-circuit current of 2 μA without any treatment of the SL-TENG, can provide an effective solution to the problem that traditional sensor need battery replacement. In addition, the SL-TENG can generate stable amplitude electrical signals through water droplets, exemplified by the absence of decay in a short-circuit current within 7 days. More importantly, the sensor is equipped with intelligent analytical capabilities, allowing it to assess rainfall based on variables such as amplitude and frequency. Due to its excellent stability and intelligent analysis, this sensor can be used for roof rainwater monitoring, intravenous administration monitoring, and especially in automobile automatic wipers and other fields. [ABSTRACT FROM AUTHOR]

The defect of insulators on the power line may lead to the failure of the electric transmission system, which in turn endangers the safe and reliable operation of the whole power system. Therefore, timely and accurate detection of insulators has become a current research hotspot. However, manual inspection cannot guarantee real-time detection and is prone to security accidents. Thanks to the convenience of Unmanned Aerial Vehicles (UAVs), collecting insulator images by UAVs and designing detection algorithms on insulators for real-time and accurate insulator detection have become a practical option. In this paper, considering the poor computing resources of UAVs, a lightweight object detection algorithm, NanoDet, is trained to detect insulators. In addition, to fully utilize the computing resources, the proposed model is segmented. Power-efficient layers are mapped to the central processing units (CPUs) for execution. Experimental results indicate that the proposed model can cut down the power consumption by up to 46.4% without violating the time constraint. [ABSTRACT FROM AUTHOR]

Modern electronic devices are supported by multicore processors and they have become an unavoidable part of recent technologies. The Arithmetic Logic Unit (ALU) is one of the indispensable parts of the Central Processing Unit (CPU) which performs most of the operations. Operations like multiplications, and exponentials consume more power than other normal operations. Power management is one of the major challenges in designing processors. To maximize speed and reduce power consumption, a new technique in Multiplier and ALU incorporated with a multicore processor has been proposed. The Proposed Approximate Compatible ALU (ACALU) is designed to perform specified operations that consume more power, using an advanced multiplication technique called the First One First Operand (FOFO) method. The selection process of eight bits is done by the FOFO method followed by error detection and error approximation is performed to get the accurate output. The ACALU performs these operations in the Approximate Computing Mode which utilizes only eight bits for the operations, thus reducing the power consumption. The results of several analyses between multipliers, ALUs, and microprocessors are provided. As we optimize the multiplier and ALU unit, the multicore processor is also enhanced. The proposed multicore processor is compared with the AMD processor and the latest INTEL processor and the comparison results show that the proposed technique is 95.2% and 97.8% more efficient than the existing processors. Thus, the power consumption is minimized and the performance speed is increased in the proposed multicore processor. [ABSTRACT FROM AUTHOR]

Quantization is a widespread method for reducing the inference time of neural networks on mobile Central Processing Units (CPUs). Eight-bit quantized networks demonstrate similarly high quality as full precision models and perfectly fit the hardware architecture with one-byte coefficients and thirty-two-bit dot product accumulators. Lower precision quantizations usually suffer from noticeable quality loss and require specific computational algorithms to outperform eight-bit quantization. In this paper, we propose a novel 4.6-bit quantization scheme that allows for more efficient use of CPU resources. This scheme has more quantization bins than four-bit quantization and is more accurate while preserving the computational efficiency of the later (it runs only 4% slower). Our multiplication uses a combination of 16- and 32-bit accumulators and avoids multiplication depth limitation, which the previous 4-bit multiplication algorithm had. The experiments with different convolutional neural networks on CIFAR-10 and ImageNet datasets show that 4.6-bit quantized networks are 1.5–1.6 times faster than eight-bit networks on the ARMv8 CPU. Regarding the quality, the results of the 4.6-bit quantized network are close to the mean of four-bit and eight-bit networks of the same architecture. Therefore, 4.6-bit quantization may serve as an intermediate solution between fast and inaccurate low-bit network quantizations and accurate but relatively slow eight-bit ones. [ABSTRACT FROM AUTHOR]

Aiming at problems such as tracking failure caused by illumination changes often encountered during unmanned aerial vehicle (UAV) tracking, a target tracking algorithm with illumination adaptive and future-aware correlation filters is proposed based on the background-aware correlation filters (BACF) algorithm, which realizes reliable UAV tracking tasks at night. First, the dark scene is recognized, and an efficient image enhancement module is used to enhance the brightness of low illumination images. Then a future-aware module is constructed to train the tracking model using the contextual information of the target in the next frame for better robustness. Finally, the model updating stage involves adaptive filter updating and adaptive learning rate updating to enhance target tracking precision. The results of the comparison experiments with the state-of-the-art algorithms on the UAVDark135, UAVDT, and DTB70 datasets show that the algorithm in this paper outperforms the state-of-the-art tracking methods and has better tracking performance under light changes and fast motion (FM) scenarios. The tracking speed on a single Central processing unit (CPU) reaches 49 FPS, which satisfies the real-time requirement of UAV tracking. [ABSTRACT FROM AUTHOR]

Three‐dimensional (3D) reconstruction is a pivotal research area within computer vision and photogrammetry, offering a valuable foundation of data for the development of smart cities. However, existing methods for constructing 3D models from unmanned aerial vehicle (UAV) images often suffer from slow processing speeds and low central processing unit (CPU)/graphics processing unit (GPU) utilization rates. Furthermore, the utilization of cluster‐based distributed computing for 3D modelling frequently results in inefficient resource allocation across nodes. To address these challenges, this paper presents a novel approach to 3D modelling in clusters, incorporating a dynamic load‐balancing strategy. The method divides the 3D reconstruction process into multiple stages to lay the groundwork for distributing tasks across multiple nodes efficiently. Instead of traditional traversal‐based communication, this approach employs gossip communication techniques to reduce the network overhead. To boost the modelling efficiency, a dynamic load‐balancing strategy is introduced that prevents nodes from becoming overloaded, thus optimizing resource usage during the modelling process and alleviating resource waste issues in multidevice clusters. The experimental results indicate that in small‐scale data environments, this approach improves CPU/GPU utilization by 35.8%/23.4% compared with single‐machine utilization. In large‐scale data environments for cluster‐based 3D modelling tests, this method enhances the average efficiency by 61.4% compared with traditional 3D modelling software while maintaining a comparable model accuracy. [ABSTRACT FROM AUTHOR]

Green houses are being built and expanded at a breakneck pace. The green house climate directly affects plant's development, and its continuous indoor environment monitoring is critical. Most green house systems rely on manual temperature and humidity monitoring which can be inconvenient for personnel required to visit the green house daily and manually control it. This research uses a modern approach by implementing automated environmental control technology to improve green house control technology effectively. The integration of the Internet of Things (IoT) and artificial intelligence (AI) can develop a capacity for independently predicting and controlling IoT devices. The microcontroller controls the system, which serves as the central processing unit for sensors and actuators. The sensor data utilizes input parameters for the microcontroller, which processes it using the long short-term memory (LSTM) approach to anticipate output parameters for controlling actuators, such as fan exhaust, misting, and motor control. Intelligent control is not placed directly on the embedded system but on a framework known as Laravel through the results of knowledge trained by the LSTM method. Using the traditional embedded system, no data can be learned using only simple conditioning. The test findings from the LSTM training data obtained that the learning rate was less than 0.002 with a total of 250 steps, where the results were processed from the accumulation of data every minute for one month, are near to a good value. Consequently, the proposal can accurately forecast the actuator control in three minutes based on data collected from the accumulated data in the preceding three minutes. The system will collect data for future use to anticipate and optimise the melon product. The primary purpose of using AI, IoT and LSTM is that the system can see the wide range of agricultural applications by taking into account several other complex parameters, each owned by LSTM to be applied using IoT devices, so that they can be will be applied directly using publish and subscribe method. [ABSTRACT FROM AUTHOR]

The Adding-Doubling (AD) algorithm is a general analytical solution of the radiative transfer equation (RTE). AD offers a favorable balance between accuracy and computational efficiency, surpassing other RTE solutions, such as Monte Carlo (MC) simulations, in terms of speed while outperforming approximate solutions like the Diffusion Approximation method in accuracy. While AD algorithms have traditionally been implemented on central processing units (CPUs), this study focuses on leveraging the capabilities of graphics processing units (GPUs) to achieve enhanced computational speed. In terms of processing speed, the GPU AD algorithm showed an improvement by a factor of about 5000 to 40,000 compared to the GPU MC method. The optimal number of threads for this algorithm was found to be approximately 3000. To illustrate the utility of the GPU AD algorithm, the Levenberg–Marquardt inverse solution was used to extract object parameters from optical spectral data of human skin under various hemodynamic conditions. With regards to computational efficiency, it took approximately 5 min to process a 220 × 100 × 61 image (x-axis × y-axis × spectral-axis). The development of the GPU AD algorithm presents an advancement in determining tissue properties compared to other RTE solutions. Moreover, the GPU AD method itself holds the potential to expedite machine learning techniques in the analysis of spectral images. [ABSTRACT FROM AUTHOR]

A novel approach is proposed in the present study, which combines the lattice Boltzmann method (LBM) with convolutional neural networks and is suitable for square cavity natural convection and conjugate natural convection problems, exhibiting remarkable acceleration capabilities and potentials. The density distribution function obtained from LBM at time t and the temperature distribution function at time t + Δ t under different Rayleigh numbers (Ra) are, respectively, utilized as input and output datasets for training and comparison in three convolutional neural networks, aiming to select the optimal coupling model, namely, half-Res-Unet. The coupling model can accurately simulate the natural convection in a square cavity within six times the upper limit of the Ra under the training condition, which can save the central processing unit (CPU) calculation time and the iteration steps by up to 29.2% and 30.3%, respectively. The coupling model is further extended in the current study to incorporate conjugate natural convection, enabling the accurate simulation of temperature distribution under training conditions with a thermal conductivity ratio (Ka) of 25 and an upper limit of Ra increased by 20 times. The corresponding maximum relative errors for the average Nusselt numbers (Nu) are found to be 1.8% and 0.7%, respectively, providing strong evidence for the generalization capability of the coupling model. Furthermore, the coupling model demonstrates a remarkable acceleration performance, as evidenced by its ability to reduce the CPU calculation time by up to 39.6% and iteration steps in the simulation process by 36.5%. It offers valuable insights into the integration of LBM with machine learning techniques, thereby enhancing the computational efficiency of LBM. [ABSTRACT FROM AUTHOR]

Mobile cloud computing (MCC) provides resources to users to handle smart mobile applications. In MCC, task scheduling is the solution for mobile users' context-aware computation resource-rich applications. Most existing approaches have achieved a moderate service reliability rate due to a lack of instance-centric resource estimations and task offloading, a statistical NP-hard problem. The current intelligent scheduling process cannot address NP-hard problems due to traditional task offloading approaches. To address this problem, the authors design an efficient context-aware service offloading approach based on instance-centric measurements. The revised machine learning model/algorithm employs task adaptation to make decisions regarding task offloading. The proposed MCVS scheduling algorithm predicts the usage rates of individual microservices for a practical task scheduling scheme, considering mobile device time, cost, network, location, and central processing unit (CPU) power to train data. One notable feature of the microservice software architecture is its capacity to facilitate the scalability, flexibility, and independent deployment of individual components. A series of simulation results show the efficiency of the proposed technique based on offloading, CPU usage, and execution time metrics. The experimental results efficiently show the learning rate in training and testing in comparison with existing approaches, showing efficient training and task offloading phases. The proposed system has lower costs and uses less energy to offload microservices in MCC. Graphical results are presented to define the effectiveness of the proposed model. For a service arrival rate of 80%, the proposed model achieves an average 4.5% service offloading rate and 0.18% CPU usage rate compared with state-of-the-art approaches. The proposed method demonstrates efficiency in terms of cost and energy savings for microservice offloading in mobile cloud computing (MCC). [ABSTRACT FROM AUTHOR]

As the basic and core component of electronic systems, CPU security is extremely important to network security. Even an unremarkable faulty instruction on the CPU may lead to serious security problems, such as the operating system crashes or privilege increase since it is often considered as a trusted black box. Therefore, CPU instruction detection is particularly crucial to CPU security. However, most existing methods of CPU instruction detection, based on the inconsistency of microarchitecture and instruction set design, suffer from slow speed and low accuracy. Our work is motivated to propose a practical framework for searching CPU undocumented instruction with fast speed and high accuracy. In this paper, we put forward a general framework InsFinder to detect undocumented instruction on CISC and RISC CPU by an efficient and accurate fuzzing method. It makes use of the instruction format to make advanced predictions, which greatly reduces the search space. Moreover, by introducing classification, de-redundancy, and verification, InsFinder greatly improves the detection accuracy. Experiments show that compared with the existing methods, InsFinder is more effective which costs at least 50% less processing time in detecting undocumented instructions on x86-64, ARM64, and RISC-V, and more accurate which divided the detection results into 4 categories. After filtering, the detection results were reduced from millions to less than 10,000. [ABSTRACT FROM AUTHOR]

Proper temperature management in electrical devices greatly boosts their performance. Thus, to maintain electrical devices at their optimal efficiency, combined hardware/software solutions are utilized for their thermal management. Here, we present a cost-effective, environmentally benign, and easy-to-implement chemical etching method to fabricate heat sinks with nano-sized roughened surfaces that can be utilized for the thermal management of central process units (CPUs) in computers. The fabricated heat sink was connected to a CPU dual cores Intel Pentium G2020 running two different benchmark programs from SPEC CPU2006 at a constant frequency. Nano-roughened heat sink (NRHS) reduced the maximum CPU temperature by nearly 4–8 °C and improved the program execution by 26% compared to the conventional heat sink (CHS). Meanwhile, a 57% increase in CPU lifetime was estimated, on average (comparing NRHS with CHS), which was aligned with the results obtained from imaging with a thermal camera. The operating temperature of the CPU connected to CHS at 2.1 GHz was almost the same as the operating temperature of CPU connected to NRHS at 2.9 GHz which means nearly 40% improvement in the processing frequency without increasing the operating temperature. [ABSTRACT FROM AUTHOR]

Elucidating the intricate neural mechanisms underlying brain functions requires integrative brain dynamics modeling. To facilitate this process, it is crucial to develop a general-purpose programming framework that allows users to freely define neural models across multiple scales, efficiently simulate, train, and analyze model dynamics, and conveniently incorporate new modeling approaches. In response to this need, we present BrainPy. BrainPy leverages the advanced just-intime (JIT) compilation capabilities of JAX and XLA to provide a powerful infrastructure tailored for brain dynamics programming. It offers an integrated platform for building, simulating, training, and analyzing brain dynamics models. Models defined in BrainPy can be JIT compiled into binary instructions for various devices, including Central Processing Unit, Graphics Processing Unit, and Tensor Processing Unit, which ensures high-running performance comparable to native C or CUDA. Additionally, BrainPy features an extensible architecture that allows for easy expansion of new infrastructure, utilities, and machine-learning approaches. This flexibility enables researchers to incorporate cutting-edge techniques and adapt the framework to their specific needs. [ABSTRACT FROM AUTHOR]

Ice-sheet flow models capable of accurately projecting their future mass balance constitute tools to improve flood risk assessment and assist sea-level rise mitigation associated with enhanced ice discharge. Some processes that need to be captured, such as grounding-line migration, require high spatial resolution (under the kilometer scale). Conventional ice flow models mainly execute on central processing units (CPUs), which feature limited parallel processing capabilities and peak memory bandwidth. This may hinder model scalability and result in long run times, requiring significant computational resources. As an alternative, graphics processing units (GPUs) are ideally suited for high spatial resolution, as the calculations can be performed concurrently by thousands of threads, processing most of the computational domain simultaneously. In this study, we combine a GPU-based approach with the pseudo-transient (PT) method, an accelerated iterative and matrix-free solution strategy, and investigate its performance for finite elements and unstructured meshes with application to two-dimensional (2-D) models of real glaciers at a regional scale. For both the Jakobshavn and Pine Island glacier models, the number of nonlinear PT iterations required to converge a given number of vertices (N) scales in the order of O(N1.2) or better. We further compare the performance of the PT CUDA C implementation with a standard finite-element CPU-based implementation using the price-to-performance metric. The price of a single Tesla V100 GPU is 1.5 times that of two Intel Xeon Gold 6140 CPUs. We expect a minimum speedup of at least 1.5 times to justify the Tesla V100 GPU price to performance. Our developments result in a GPU-based implementation that achieves this goal with a speedup beyond 1.5 times. This study represents a first step toward leveraging GPU processing power, enabling more accurate polar ice discharge predictions. The insights gained will benefit efforts to diminish spatial resolution constraints at higher computing performance. The higher computing performance will allow for ensembles of ice-sheet flow simulations to be run at the continental scale and higher resolution, a previously challenging task. The advances will further enable the quantification of model sensitivity to changes in upcoming climate forcings. These findings will significantly benefit process-oriented sea-level-projection studies over the coming decades. [ABSTRACT FROM AUTHOR]

Atmospheric numerical models play a crucial role in operational weather forecasting, as well as in improving our understanding of atmospheric dynamics via research studies. Maximising their accuracy is of paramount importance. Use of advective flux schemes greater than O7 in atmospheric models is largely undocumented, with no studies considering O3–O17 fluxes with formal accuracy‐preserving high‐order interpolation, pressure gradient/divergence, and subgrid‐scale (SGS) turbulent fluxes. Higher‐order numerical approximations can reduce truncation, amplitude and phase errors, and potentially improve model accuracy and effective resolution. Here, simulations are presented using very‐high‐order O3–O17 fluxes, with/without high‐order O2–O18 Lagrangian interpolations, pressure gradient/divergence approximations, and SGS turbulent fluxes for a two‐dimensional, highly‐viscous (Re ∼ 100) diffusion‐limited, nonlinear colliding‐plumes problem using 25–200 m spatial resolutions. The highest‐order flux schemes coupled with higher‐order interpolations, pressure gradient/divergence and SGS flux approximations produced the best solutions, with higher‐order fluxes and interpolations being most important. Overall solution convergence of order about O1–O2 with mode‐split (fast sound/slow advective waves) O3 Runge–Kutta temporal schemes was negatively impacted by order at most O1 temporal convergence with SGS fluxes, divergence damping, and especially spatial filters, compared to about order O3 convergence with these inactivated. While very‐high‐order schemes were shown to improve solution accuracy, few cost‐effective higher‐order highly‐viscous test problem solutions (higher order vs finer resolution) were found using theoretical floating‐point operations (FPO) with Courant‐Friedrichs‐Lewy (CFL)‐limited or constant stable Courant number‐based time steps. However, employing central processing unit (CPU) time, rather than FPOs, demonstrated there was reduced computational burden using higher‐order approximations. We conclude that O9–O17 flux schemes with or without high‐order (≥O4) interpolations, pressure gradient/divergence approximations, and SGS fluxes can improve atmospheric model solution accuracy, without prohibitive computation costs, compared to O3–O7 flux with O2 interpolations, pressure gradient/divergence approximations, and SGS fluxes. [ABSTRACT FROM AUTHOR]

Metadevices are of paramount interest and importance due to their exotic capabilities in light control and manipulation in the nano‐scale regime. Various practical applications, including wearable devices, lasers, optical sensors, high‐resolution microscopy, both virtual and augmented reality, and metasails, require large‐scale metasurfaces. However, layout generation for large metasurfaces, faces challenges as up to billions of unit cells are required to create a metasurface, resulting in slow speeds and high memory demands. Here, a new framework namely ParallelGDS is proposed for fully parallel, ultra‐fast, and memory‐independent generation of graphic design system (GDSII) files for arbitrarily large metasurfaces. Compared to existing methods such as GDSTk, GDSPy, LUMERICAL's polystencil, the proposed framework significantly accelerates the layout generation process by factors of 10 to 100. More importantly, ParallelGDS drastically reduces the required memory (an O(n2)$\mathcal {O}(n^{2})$ problem) with an average reduction factor of 0.5×Dn2$0.5 \times D^{2}_{\text{n}}$ where Dn$D_{\text{n}}$ is the normalized metasurface diameter, as the framework uses only ≈2 GB of memory regardless of the size of the metasurface. The proposed framework offers complete control over memory requirements and parallelization levels of layout generation, ranging from single‐core CPU usage to multithreaded CPU utilization, and finally, full utilization of all GPU cores. [ABSTRACT FROM AUTHOR]

A computationally fast third order numerical algorithm is developed for inhomogeneous parabolic partial differential equations. The algorithm is based on a third order method developed by using a rational approximation with single Gaussian quadrature pole to avoid complex arithmetic and to achieve high efficiency and accuracy. Difficulties with computational efficiency and accuracy are addressed using partial fraction decomposition technique. Third order accuracy and convergence of the method is proved analytically and verified numerically. Several classical as well as more challenging fractional and distributed order inhomogeneous problems are considered to perform numerical experiments. Computational efficiency of the method is demonstrated through central processing unit (CPU) time and is given in the convergence tables. [ABSTRACT FROM AUTHOR]

Aiming at the problems of low convective heat transfer coefficient and high energy consumption in the air-cooled data center of immersed liquid cooling, an improved deep learning algorithm is proposed for the data center system of immersed liquid cooling equipment room. By improving the design of the immersed liquid cooling system, heat exchange is carried out between the immersed liquid cooling system and heating components such as the central processing unit of the server. The insulation coolant and cooling water achieve server heat dissipation through energy exchange, achieving data management of the immersed liquid cooling room. The proposed algorithm improves data management efficiency while ensuring computational accuracy by conducting in-depth training and learning on the obtained immersed liquid cooling data, thus achieving the management of data in the immersed liquid cooling room. Through experiments, it has been proven that the immersed liquid cooling system in this study has high data management efficiency and low error, and can maintain server memory heat below 37 ° C, with a research accuracy of up to 92%. [ABSTRACT FROM AUTHOR]

Traditionally, parallel discrete-event simulations of agent-based models in continuous time are organized around logical processes exchanging time-stamped events, which clashes with the properties of models in which tightly coupled agents frequently and instantaneously access each other's states. To illustrate the challenges of such models and to derive a solution, we consider the domain-specific modeling language ML3, which allows modelers to succinctly express transitions and interactions of linked agents based on a continuous-time Markov chain (CTMC) semantics. We propose synchronous optimistic synchronization algorithms tailored toward simulations of fine-grained interactions among tightly coupled agents in highly dynamic topologies and present implementations targeting multicore central processing units (CPUs) as well as many-core graphics processing units (GPUs). By dynamically restricting the temporal progress per round to ensure that at most one transition or state access per agent, the synchronization algorithms enable efficient direct agent interaction and limit the required agent state history to only a single current and projected state. To maintain concurrency given actions that depend on dynamically updated macro-level properties, we introduce a simple relaxation scheme with guaranteed error bounds. Using an extended variant of the classical susceptible-infected-recovered network model, we benchmark and profile the performance of the different algorithms running on CPUs and on a data center GPU. [ABSTRACT FROM AUTHOR]

As the volume of satellite images increases rapidly, unsupervised classification can be utilized to swiftly investigate land cover distributions without prior knowledge and to generate training data for supervised (or deep learning-based) classification. In this study, an inter-image k-means clustering algorithm (IIkMC), as an improvement of the native k-means clustering algorithm (kMC), was introduced to obtain a single set of class signatures so that the classification results could be compatible among multiple images. Because IIkMC was a computationally intensive algorithm, parallelized approaches were deployed, using multi-cores of a central processing unit (CPU) and a graphics processing unit (GPU), to speed up the process. kMC and IIkMC were applied to a series of images acquired in a PlanetScope mission. In addition to the capability of the inter-image compatibility of the classification results, IIkMC could settle the problem of incomplete segmentation and class canceling revealed in kMC. Based on CPU parallelism, the speed of IIkMC improved, becoming up to 12.83 times better than sequential processing. When using a GPU, the speed improved up to 25.53 times, rising to 39.00 times with parallel reduction. From the results, it was confirmed IIkMC provided more reliable results than kMC, and its parallelism could facilitate the overall inspection of multiple images. [ABSTRACT FROM AUTHOR]

Due to the excessive temperature rise in the Central Processing Unit (CPU), computers shut down and system damage occurs over time. In this study, a new thermoelectric cooling system is designed to reduce the temperature in the CPU. The novel cooling system is designed using a thermoelectric module. It is to remove the excess heat by conduction and convection by taking advantage of the temperature difference between the thermoelectric cooler and the CPU we add to the system. Since the temperature of the thermoelectric cooler will always be lower than the CPU temperature, effective cooling will be provided. A special electronic circuit and software have been developed for the control of the cooling unit. Three different artificial intelligence models (artificial neural network, random forest, and k-nearest neighbor) were created to dynamically control the additional cooling system and their successes were compared. Artificial intelligence determines the power and fan speed of the thermoelectric cooling system. It performs this control by evaluating all parameters (different values such as CPU frequency, voltage, number of processes) instead of a specific CPU load or a specific temperature value. While the CPU temperature was 41°C at maximum load, this temperature was reduced to 31°C thanks to the designed thermoelectric cooling system. All methods provided a high classification success in education. By using the artificial neural network 97.973% classification success was achieved, whereas the classification success for random forest and k-nearest neighbour model were 97.297% and 96.306%, respectively. [ABSTRACT FROM AUTHOR]