Search

Over the academic year 2022-23, we discussed the teaching of software performance engineering with more than a dozen faculty across North America and beyond. Our outreach was centered on research-focused faculty with an existing interest in this course material. These discussions revealed an enthusiasm for making software performance engineering a more prominent part of a curriculum for computer scientists and engineers. Here, we discuss how MIT's longstanding efforts in this area may serve as a launching point for community development of a software performance engineering curriculum, challenges in and solutions for providing the necessary infrastructure to universities, and future directions.

We propose a system for dynamic triangle mesh processing entirely on the GPU. Our system offers an efficient data structure that allows fast updates of the underlying mesh connectivity and attributes. Our data structure partitions the mesh into small patches which allows processing all dynamic updates for each patch within the GPU's fast shared memory. This allows us to rely on speculative processing for conflict handling, which has low rollback cost while maximizing parallelism and reducing the cost of locking. Our system also introduces a new programming model for dynamic mesh processing. The programming model offers concise semantics for dynamic updates, relieving the user from having to worry about conflicting updates in the context of parallel execution. Our programming model relies on the cavity operator, which is a general mesh update operator that formulates any dynamic operation as an element reinsertion by removing a set of mesh elements and inserting others in the created void. We used our system to implement Delaunay edge flips and isotropic remeshing applications on the GPU. Our system achieves a 3—18x speedup on large models compared to multithreaded CPU solutions. Despite our additional dynamic features, our data structure also outperforms state-of-the-art GPU static data structures in terms of speed and memory requirements.

In this paper, we present the development of a new version of the BrkgaCuda, called BrkgaCuda 2.0, to support the design and execution of Biased Random-Key Genetic Algorithms (BRKGA) on CUDA/GPU-enabled computing platforms, employing new techniques to accelerate the execution. We compare the performance of our implementation against the standard CPU implementation and a previous GPU implementation. In the same spirit as the standard implementation, all central aspects of the BRKGA logic are dealt with in our framework, and little effort is required to reuse the framework on another problem. The user can also implement the decoder on the CPU in C++ or GPU in CUDA. Moreover, the BrkgaCuda 2.0 provides a decoder that receives a permutation created by sorting the indices of the chromosomes using the genes as keys. To evaluate our framework, we use a total of 54 instances of the Traveling Salesman Problem, the Set Cover Problem, and the Capacitated Vehicle Routing Problem, using two decoders in the last one. Our focus on this work is to improve the performance within the BRKGA logic. We show that the BrkgaCuda 2.0 is the fastest among similar frameworks while still providing solutions of similar quality. [ABSTRACT FROM AUTHOR]

Background: Magnetic resonance (MR) imaging devices have been integrated with medical linear accelerators (linac) in radiation therapy. Both perpendicular linac‐MR (LMR‐B⊥) and parallel (LMR‐B∥) systems exist, where due to the MR's magnetic field dose can be perturbed in the patient. Dose perturbations from the electron return effect (ERE) and electron streaming effects (ESEs) are present in LMR‐B⊥ systems, where a dose collimating effect has been observed in LMR‐B∥ systems. Purpose: To report on an asymmetric dose perturbation which is present at the interface between two different materials during treatment in parallel linac‐MR (LMR‐B∥) systems. To the best of our knowledge, these asymmetric dose effects, "Lateral Scattered Electron Return Effect" (LS‐ERE) have not been previously reported. Methods: BEAMnrc and EGSnrc Monte Carlo (MC) radiation transport codes were used with the EEMF macro to emulate a 6 FFF beam from the 0.5‐T Alberta linac‐MR (LMR). Simulations were performed at 0.5 and 1.5 T in several different phantom material–interface combinations and field sizes including from modulated MLC‐like fields. MC simulations quantified LS‐ERE in patient CT datasets for the head, breast, and lung. LS‐ERE cancellation techniques were investigated. LS‐ERE asymmetries were quantified by subtracting an antiparallel dose from the parallel dose, dividing by two and normalizing to the global 0‐T maximum dose. GafChromic film measurements were made in the 0.5‐T Alberta LMR‐B∥ system using solid water at the water–air interface to validate MC simulations. ERE was simulated for an emulated LMR‐B⊥ system and compared to LMR‐B∥ dose perturbations. Results: LS‐ERE is mostly independent of field size for fields >1 × 1 cm2. For 5 × 5‐cm2 fields at 0.5T/1.5T, LS‐ERE asymmetries are ≤±6.9%/6.9% at bone–air and ≤±9.0%/7.0% at tissue–air for nonair doses, and ≤±4.1%/5.5% at tissue–lung interfaces. LS‐ERE increases as the density gradient increases, where the magnitude and extent of LS‐ERE are reduced as field strength increases. For a single 5 × 5‐cm2 field at 0.5T/1.5T, the LS‐ERE asymmetry is ≤±10.2%/8.5% at the tissue–air sinus interface for head, ≤±4.2%/5.3% at the spine–lung interface for the lung, and ≤±5.7%/4.9% at the skin–air interface for a breast tangent plan at 0.5T/1.5T. POP fields mostly remove LS‐ERE asymmetries, with magnetic field reversal during treatment being the most effective method. Skin dose was investigated and compared to 0‐T treatments for 0.5T/1.5T LMR‐B∥ single field breast and head treatments. Including all dosimetric magnetic field perturbations, a 21%/24% and 22%/22% increase in skin dose to head and breast, respectively, was observed, of which LS‐ERE is responsible for approximately 30% of the total. Measured LS‐ERE asymmetries and dose enhancements at the water–air interface using GafChromic film were in excellent agreement with MC simulations. ERE in 1.5‐T LMR‐B⊥ systems are on average 5.5 times larger than total dose perturbations at 0.5 T in LMR‐B∥ systems. Conclusion: LS‐ERE is present at the interface between materials and awareness of LS‐ERE is crucial for proper TPS evaluation for LMR‐B∥ treatments, especially in areas where large tissue density gradients exist. [ABSTRACT FROM AUTHOR]

Copyright of Food & Fermentation Industries is the property of Food & Fermentation Industries and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The deblocking filter (DF) and the sample adaptive offset (SAO) filter, which aids in enhancing the subjective quality of the image, make up the in-loop filter of the high-efficiency video coding (HEVC) encoder and decoder. The in-loop filter significantly increases the computational load on the HEVC encoder. It is challenging to design an in-loop filter on hardware that can handle intensive computations while using the least amount of on-chip memory, taking external memory traffic and dependencies simultaneously delivering high throughput to support Ultra HD video applications. The proposed design employs the following strategies to address these issues. This work proposes an address generation technique for pipelined horizontal and vertical filtering in DF, that avoids a transpose buffer which otherwise is required. This enables easy pipelining and parallelization thus improving throughput while reducing the on-chip memory utilization. A simplified SAO filter with parallel-pipelined processing is included in the design. These features enable the design to support ultra-HD 7680 $ \times $ × 4320 @ 40 fps video applications. The proposed hardware architecture has a total gate count of 7.73 K LUTs and 2.8 K slice registers, and it is implemented on a 28 nm field programmable gate array (FPGA) platform. [ABSTRACT FROM AUTHOR]

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The VTK-m software library enables scientific visualization on exascale-class supercomputers. Exascale machines are particularly challenging for software development in part because they use GPU accelerators to provide the vast majority of their computational throughput. Algorithmic designs for GPUs and GPU-centric computing often deviate from those that worked well on previous generations of high-performance computers that relied on traditional CPUs. Fortunately, VTK-m provides scientific visualization algorithms for GPUs and other accelerators. VTK-m also provides a framework that simplifies the implementation of new algorithms and adds a porting layer to work across multiple processor types. This paper describes the main challenges encountered when making scientific visualization available at exascale. We document the surprises and obstacles faced when moving from pre-exascale platforms to the final exascale designs and the performance on those systems including scaling studies on Frontier, an exascale machine with over 37,000 AMD GPUs. We also report on the integration of VTK-m with other exascale software technologies. Finally, we show how VTK-m helps scientific discovery for applications such as fusion and particle acceleration that leverage an exascale supercomputer. [ABSTRACT FROM AUTHOR]

This paper introduces a parallel Topology Optimization (TO) platform capable of optimizing designs for multiple objectives, whilst subject to multiple constraints, in the open source Fierro Finite Element code. The TO methodology uses a continuous material interpolation scheme, which avoids checkerboard designs without additional filters and constraints as seen with piece-wise constant material interpolation schemes. Additionally, analytic Hessian-vector products are used, with the relevant adjoint calculation shown. The code utilizes OpenMPI to make parallel the major computational segments of TO: global equation assembly, global equation solution, and the non-linear optimization of the design. The algorithm leverages several software packages: ELEMENTS (grants FE basis functions), MATAR (grants efficient multidimensional dense and sparse matrix storage), Zoltan2 (Mesh Decomposition Algorithm), MueLu (parallel multi-grid solver for the global equilibrium equations), and ROL (non-linear optimization). It is found that the Fierro TO platform optimizes problems with mechanical and thermal objectives subject to multiple constraints: mass, several moment of inertia targets, and constraints related to load bearing regions. Additionally, the performance of several ROL algorithms using analytic Hessian-vector products is compared with the Method of Moving Asymptotes, approximate Hessian, for topology optimization. [ABSTRACT FROM AUTHOR]

The exponential growth in internet data usage has created a pressing demand for highly efficient Network Intrusion Detection Systems (NIDS) capable of scaling with ever-increasing bandwidths to safeguard sensitive information. A cornerstone of NIDS, packet inspection, hinges on the ability to rapidly identify and analyze patterns within incoming data streams. The more diverse and extensive the pattern database, the more robust and effective the NIDS becomes. While the parallel failure-less version of the Aho-Corasick (AC) algorithm provides maximum parallelism, it faces significant memory constraints due to the large transition tables generated when dealing with a vast number of patterns. To mitigate this limitation and enhance the scalability of NIDS, we introduce a novel parallel failure-less compressed hashed variation of the Aho-Corasick algorithm. Our proposed approach leverages the power of compression and hashing techniques to significantly reduce memory consumption without compromising performance. Empirical evaluations demonstrate that our algorithm requires only a fraction (approximately the square root) of the memory footprint compared to the original parallel failure-less Aho-Corasick algorithm, making it a more practical and scalable solution for modern NIDS architectures. [ABSTRACT FROM AUTHOR]

Conventional visual search tasks do not address attention directly and their core manipulation of 'set size' – the number of displayed items – introduces stimulus confounds that hinder interpretation. However, alternative approaches have not been widely adopted, perhaps reflecting their complexity, assumptions, or indirect attention-sampling. Here, a new procedure, the ATtention Location And Size ('ATLAS') task used probe displays to track attention's location, breadth, and guidance during search. Though most probe displays comprised six items, participants reported only the single item they judged themselves to have perceived most clearly – indexing the attention 'peak'. By sampling peaks across variable 'choice sets', the size and position of the attention window during search was profiled. These indices appeared to distinguish narrow- from broad attention, signalled attention to pairs of items where it arose and tracked evolving attention-guidance over time. ATLAS is designed to discriminate five key search modes: serial-unguided, sequential-guided, unguided attention to 'clumps' with local guidance, and broad parallel-attention with or without guidance. This initial investigation used only an example set of highly regular stimuli, but its broader potential should be investigated. [ABSTRACT FROM AUTHOR]

To assist an individual with an amputation in regaining daily quality of life, a 2SPU-RU type parallel mechanism was developed based on ankle biomechanics. The inverse kinematic analysis of this mechanism was performed using the vector method. Subsequently, the Jacobian matrices were analyzed. The dynamic model of the mechanism was then created based on the principle of virtual work, and its theoretical solution was compared with numerical results obtained in a simulation environment. Additionally, the validity of the dynamic model and the inverse kinematics was verified by comparing theoretical and simulation results for the movements of plantarflexion–dorsiflexion, eversion–inversion, and abduction–adduction during the gait cycle. [ABSTRACT FROM AUTHOR]

This paper presents the parallelization of two widely used implicit numerical solvers for the solution of partial differential equations on structured meshes, namely, the ADI (Alternating-Direction Implicit) solver for tridiagonal linear systems and the SIP (Strongly Implicit Procedure) solver for the penta-diagonal systems. Both solvers were parallelized using CUDA (Computer Unified Device Architecture) Fortran on GPGPUs (General-Purpose Graphics Processing Units). The parallel ADI solver (P-ADI) is based on the Parallel Cyclic Reduction (PCR) algorithm, while the parallel SIP solver (P-SIP) uses the wave front method (WF) following a diagonal line calculation strategy. To map the solution schemes onto the hierarchical block-threads framework of the CUDA on the GPU, the P-ADI solver adopted two mapping methods, one block thread with iterations (OBM-it) and multi-block threads (MBMs), while the P-SIP solver also used two mappings, one conventional mapping using effective WF lines (WF-e) with matrix coefficients and solution variables defined on original computational mesh, and a newly proposed mapping using all WF mesh (WF-all), on which matrix coefficients and solution variables are defined. Both the P-ADI and the P-SIP have been integrated into a two-dimensional (2D) hydrodynamic model, the CCHE2D (Center of Computational Hydroscience and Engineering) model, developed by the National Center for Computational Hydroscience and Engineering at the University of Mississippi. This study for the first time compared these two parallel solvers and their efficiency using examples and applications in complex geometries, which can provide valuable guidance for future uses of these two parallel implicit solvers in computational fluids dynamics (CFD). Both parallel solvers demonstrated higher efficiency than their serial counterparts on the CPU (Central Processing Unit): 3.73~4.98 speedup ratio for flow simulations, and 2.166~3.648 speedup ratio for sediment transport simulations. In general, the P-ADI solver is faster than but not as stable as the P-SIP solver; and for the P-SIP solver, the newly developed mapping method WF-all significantly improved the conventional mapping method WF-e. [ABSTRACT FROM AUTHOR]

Laser‐induced forward transfer (LIFT) of polymers is a versatile printing method for parallel in situ synthesis of peptides on microarrays. Chemical building blocks embedded in a polymer matrix are transferred and coupled in a desired pattern to a surface, generating peptides on microarrays by repetitive in situ solid‐phase synthesis steps. To date, the approach is limited to simple, heat induced chemical reactions. The VaporLIFT method, disclosed here, combines LIFT with chemical vapor glycosylation to rapidly generate glycans on microarray surfaces while maintaining inert, low temperature conditions required for glycosylations. Process design and parameter optimization enables the synthesis of a collection of glycans at defined positions on a glass surface. The synthetic structures are detected by mass spectrometry, fluorescently labeled glycan‐binding proteins, and covalent staining with fluorescent dyes. VaporLIFT is ideal for parallel screening of other chemical reactions, that require inert and well‐defined reaction conditions. [ABSTRACT FROM AUTHOR]

To address the efficiency bottleneck encountered in reactor design calculations for the newly developed lead-based reactor neutronics analysis code system MOSASAUR, we recently developed acceleration functions based on various coarse-mesh finite difference (CMFD) methods and spatial domain decomposition parallel algorithm. However, the applicability of these improvements to different lead-based reactors remains to be analyzed. This work collected and established core models for various types of lead-based reactor. Based on different SN nodal transport solvers, we analyzed the acceleration performance of different CMFD methods, different CPU cores, and the combination of CMFD and parallel calculation. The results indicated that the impact of different CMFD acceleration or parallel acceleration on the calculation accuracy was negligible; the rCMFD method had good stability and convergence rate, achieving speedup of several to dozens; parallel efficiency was related to the number of meshes, and for large reactor cores, superlinear speedup was achieved with 200 CPU cores; rCMFD and parallel computing could achieve combined speedup, with 200 cores achieving speedup of hundreds to thousands, typically completing a reactor core transport calculation in 1 min. [ABSTRACT FROM AUTHOR]

A two-stage KSAGA algorithm combining Spark-based simulated annealing and genetic algorithms was proposed for the single-depot multiple traveling salesman problem with minimum total path length. In the first stage, the multiple traveling salesman problem was split into multiple single traveling salesman problems by kmeans clustering, and the traversal order of cities in the group was optimized using the simulated annealing algorithm. In the second stage, the classification of cities was optimized by genetic algorithm, and the cross-variance operator as well as the hybrid local optimization operator were designed based on the chromosome grouping encoding method to improve the search space and convergence speed of the algorithm. As the number of cities increased and the computational scale became larger, the characteristics of genetic algorithm were used to realize the parallelism of the algorithm in order to speed up the algorithm operation efficiency. Finally, the solution quality of KSAGA was compared with that of ACO, GA, SPKSA, ALNS and NSGA-II and the convergence speed of GA and NSGA-II by selecting some datasets of TSPLIB for simulation experiments. The results showed that KSAGA could converge quickly in solving the single-depot multiple traveling salesman problem, and the solution quality was greatly improved compared with other algorithms. Meanwhile, the advantage of KSAGA was more obvious as the number of cities and the number of travelers increased. [ABSTRACT FROM AUTHOR]

The meshless global radial basis function (RBF) collocation method is widely used to model physical phenomena in science and engineering. The method produces highly accurate solutions with an exponential convergence rate. However, due to the global approximation structure of the method, dense node distributions lead to long computation times and hinder the applicability of the technique. In order to overcome this issue, this study proposes a parallel meshless global RBF collocation algorithm. The algorithm is applied to 2-D neutron diffusion problems. The multiquadric is used as the RBF. The algorithm is developed with Mathematica and eight virtual processors are used in calculations on a multicore computer with four physical cores. The method provides accurate numerical results in a stable manner. Parallel speedup increases with the number of processors up to five and seven processors for external and fission source problems, respectively. The speedup values are limited by the constrained resource sharing of the multicore computer’s memory. On the other hand, significant time savings are achieved with parallel computation. For the four-group fission source problem, when 4316 interpolation nodes are employed, the utilization of seven processors instead of sequential computation decreases the computation time of the meshless approach by 716 s.

Granular computing (GrC) is a methodology for reducing the complexity of problem solving and includes two basic aspects: granulation and granular-based computing. Strongly connected components (SCCs) are a significant subgraph structure in digraphs. In this paper, two new granulation strategies were devised to improve the efficiency of computing SCCs. Firstly, four SCC correlations between the vertices were found, which can be divided into two classes. Secondly, two granulation strategies were designed based on correlations between two classes of SCCs. Thirdly, according to the characteristics of the granulation results, the parallelization of computing SCCs was realized. Finally, a parallel algorithm based on granulation strategy for computing SCCs of simple digraphs named GPSCC was proposed. Experimental results show that GPSCC performs with higher computational efficiency than algorithms. [ABSTRACT FROM AUTHOR]

Stream surfaces can reveal complex flow behaviors that are not available on streamlines, but their construction algorithm is also more sophisticated. A common strategy is to sample a series of streamlines from a seeding curve and stitch the neighboring streamlines to form surfaces. To maintain a uniform density of sample points, extra streamlines may be inserted when the flow diverges. This leads to high computation cost with sequential insertion operations, hindering the use of stream surfaces in interactive scenarios and large-scale learning. In this paper, we proposed two parallel strategies to construct stream surfaces on GPUs. Both strategies generate stream surfaces in multiple passes, where each pass consists of a streamline tracing phase and a ribbon construction phase. The first strategy aims at increasing throughput, by hiding the long generation time of an individual surface with computation from other surfaces. The second strategy aims at reducing latency, by generating redundant streamlines for a single surface. We evaluate the performance of the two strategies and compare them with a CPU baseline using ten datasets exhibiting various characteristics. [ABSTRACT FROM AUTHOR]

In this research, we describe the modulus-based synchronous multisplitting iteration method for solving a class of horizontal nonlinear complementarity problems by utilizing the matrix multisplitting technique. We derive several convergence criteria to guarantee the suggested method's convergence, and we provide numerical examples to demonstrate our method's efficacy. [ABSTRACT FROM AUTHOR]

G‐quadruplexes play a pivotal role in regulating various cellular processes, including gene expression and replication, making them essential structures in understanding, and manipulating cellular functions. The development of G‐quadruplex ligands holds significant promise in therapeutic and research applications, offering targeted tools to modulate G‐quadruplex structures and potentially influence critical biological pathways. An exciting frontier in G‐quadruplex research lies in the exploration of anionic ligands, and their profound impact on stabilizing and modulating G‐quadruplex DNA. In this study, the interaction of two anionic phthalocyanine compounds (Zinc (II) phthalocyanine 3,4′,4″,4‴‐tetrasulfonic acid, tetrasodium salt, ZnAPC; cobalt (II) phthalocyanine 3,4′,4″,4‴‐tetrasulfonic acid, tetrasodium salt, CoAPC) and three separate G‐quadruplex‐forming DNA sequences was investigated. Interactions were carried out by DNA polymerase stop studies along with spectroscopic studies. According to the results of experimental data, it was determined that ZnAPC actively interacts with the G‐quadruplex DNA structures. On the other hand, it was thought that the interaction with CoAPC was less and even occurred in simple electrostatic interactions. KD constants and Bmax constants for the interaction with ZnAPC were calculated. The KD constants for ZnAPC were found to be (1.16 ± 0.07) × 10−5, (9.75 ±.24) × 10−6 and (1.00 ± 0.36) × 10−4 M for AS1411, Vegf, and Tel21, respectively. Accordingly, it was concluded that ZnAPC interacts with G‐quadruplex DNA ligands effectively. [ABSTRACT FROM AUTHOR]

Two general trainers in the sports field do not disagree about finding and using a special aid in teaching skills, as each sports skill has a specificity in learning it, and the game of artistic gymnastics for men is one of the individual games and has physical, movement and coordination requirements. The aim of the research is to know the effect of using The feedback device in teaching the skill of standing on the hands, alternating a half-turn outward on the parallel apparatus. The research hypothesis is that the use of an instantaneous feedback device has an effect in teaching the skill of standing on the hands, alternating a half-turn outward on the parallel apparatus. The researcher used the experimental method with a sample design. One because it suits the research problem, as the research population is limited to (7) emerging players who train in Baghdad, Al-Amana Sports Club for Gymnastics, and their ages range between (9-13) years. As for the research sample, they are (6) players, and the research sample constituted (90%). As for the most important conclusions, the assistive device added to the sample a second and enjoyable training method that had a clear impact on learning the skill of standing on the hands, switching half a turn to the outside. Through the educational units and repetitions for the players on the device, it becomes clear that it has a good design and can withstand their weights and repetitions. The researcher suggests that During the course of working on some skills similar to the skill under research, conducting studies on the use of an assistive device in learning them, in which the handstand skill enters the elementary part, such as the skill of hilly and switching half a turn inwards, which have greater difficulties in learning. [ABSTRACT FROM AUTHOR]

In order to realize the precise phase correction of high order modulation in M-APSK modem, the Q-power non-data aided phase detection method recommended by DVB-S2 standard for 16APSK and 32APSK was extended to 64APSK, 128APSK and 256APSK.An improved algorithm was proposed to solve the problem of unstable loop operation when the proportion of constellation points used for phase detection in high-order modulation was low.By using threshold judgment on the amplitude of the received symbol after power normalization, phase detection was performed only when the amplitude was higher than the threshold, and the filter state and phase compensation value were not changed when the amplitude was lower than the threshold, so as to improve the phase detection effectiveness and reliability of constellation points and reduce the lock threshold.Aiming at the problem that the symbol rate of high-speed data transmission was very high but the working clock frequency of the processor was relatively low, a parallel carrier synchronization method for M-APSK was proposed, which could meet the needs of the receiver’s working clock.Compared with the traditional constant coding and modulation (CCM) carrier synchronization loop, the parallel method could also be applied to the frequency tracking of variable coding and modulation (VCM) system.

Group decision-making has captured the attention of researchers for decades but due to its importance and complexity further explorations and studies, namely for its application in industrial engineering continue to be needed in the current digital age. In this paper a group decision making approach is put forward for evaluating and selecting maintenance tasks to enable its joint scheduling with production orders, by using a collaborative management system. The proposed approach includes a two-stage collaborative assessment method, which enables a set of decision makers to rank and select maintenance tasks for being scheduled with production orders. The proposed approach uses a dynamic multi-criteria decision model that aggregates information about historical, current and provisional data about maintenance tasks. The approach is illustrated through an application example and contextualized in the state of the art. This study permits to realize that collaborative management approaches enable conducting a dynamic, integrated, distributed, intelligent, predictive, time and condition based maintenance task management in real time, based on the fusion of past, present and predicted data, and that there is still a lack of contributions regarding its use of in industrial management.

All-DC wind power system is one of the important directions of wind power development in the future, and its safe and reliable topology and stable control strategy are the key to the stable operation of the system. In order to solve the problems of poor control flexibility, difficulty of self-starting and low reliability of DC fault crossing in the current all-DC wind farm, this paper presented a topological structure of the parallel all-DC wind power system with turbine-side boost based on a new DC conversion. Based on the dynamic connection mode that each bridge arm of the new DC converter was charged in parallel on the low voltage side and discharged in series on the high voltage side, this paper designed the control strategy of the all-DC wind farm and analysed the operation mode of the all-DC wind farm in the steady state operation stage, the self-starting stage and the DC fault crossing period. Based on PSCAD/EMTDC, the simulation model of the parallel all-DC wind power system with turbine-side boost based on a new DC converter was established. Through the simulation of all-DC wind farm under normal operating conditions, such as steady state and dynamic operation, and fault conditions, such as dynamic cut-in and cut-out of faulty wind turbine and short circuit of DC bus, it was verified that the topology structure of the proposed parallel all-DC wind power system with turbine-side boost based on a new DC converter could improve the control flexibility, reduce the difficulty of self-starting, and ensure the high reliability of DC fault crossing under the premise of feasibility.

Distributed Acoustic Sensing (DAS) is an emerging sensing technology that records the strain-rate along fiber optic cables at high spatial and temporal resolution. This technique is becoming a popular tool in seismology, hydrology, and other subsurface monitoring applications. However, due to the large coverage (10’s of km) and high density of measurements (1m spacing at 100’s of Hz), a DAS installation could produce terabytes of data records per day. Because many DAS instruments are deployed in remote locations, this large data size poses significant challenges to its transfer and storage. In this paper, we explore lossless compression methods to reduce the storage requirement in both real-time and post-hoc scenarios. We propose a two-stage compression method to improve the compression ratio and compression speed. This two-stage compression method could reduce the storage requirement by 40%, which is 20% more than other lossless methods, such as ZSTD. We demonstrate that the compression method could complete its operation well before the DAS instrument needs to output the next file, making it suitable for real-time DAS acquisition. We also implement a parallel compression method for a post-hoc scenario and demonstrate that our method could effectively utilize a parallel computer. With 256 CPU cores, our parallel compression method achieves the speed of 26GB/second.

Copyright of Journal on Communication / Tongxin Xuebao is the property of Journal on Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Multi-effect parallel feed desalination system (MED-PF) has emerged as an efficient technology for large-scale seawater desalination. Enhancing the system's performance ratio and incorporation of a thermal vapor compressor (TVC) have proven to be effective in previous studies. Notably, these studies have suggested that the optimal placement for the TVC is within the middle section. The current study explores the impact of a new component, a brine preheater, on the performance of multi-effect desalination system. The hot rejected brine is used to heat the feed seawater for systems with various number of effects. Results demonstrate that utilizing the rejected brine for feed preheating significantly improves the system's performance ratio among other important parameters. Comparative analysis also shows that utilization of heat associated with the rejected brine for feed preheating leads to a reduction in the cost of water produced in the range of 4.55–9.63%. For example, water production cost of 1.87 $/m3 for a 8-effect MED-PF system without brine preheating reduces to 1.69 $/m3 upon preheating the feed without an additional, external energy source. Nevertheless, this approach results in an improvement in the system's performance ratio (PR) in the range of 7.46% to 13.9%. The effect on the total heat transfer surface area (sA) and specific flow rate of cooling water is also taken into consideration. [ABSTRACT FROM AUTHOR]

In this paper, a relaxed two-step modulus-based matrix synchronous multisplitting iteration method for solving the linear complementarity problems is constructed. The convergence conditions of the proposed method are analyzed with the convergence range of the relaxation parameters. Some parallel numerical experiments under OpenACC framework are given to show that the proposed method can accelerate the convergence rate of the existing method significantly. [ABSTRACT FROM AUTHOR]

This study investigates the CO2 reduction potential of powertrain hybridisation on heavy-duty lorries and city buses. The analysis considers modern parallel and serial hybrid architectures, assessing their efficiency and limits in CO2 emission reduction through vehicle simulation in VECTO, which is the official tool of the European Commission for calculating heavy-duty vehicle fuel and energy consumption. The results reveal distinct trends for each vehicle type and architecture. In lorries, more significant improvements are observed in urban delivery profiles, reaching up to ~16%, indicating the benefits of hybridisation in transient conditions with energy recuperation opportunities. City buses, particularly those with serial architectures, exhibit significant emission reductions that reach 36%, making them suitable for urban environments. The optimisation of electric motor size and performance plays a crucial role in achieving emission reductions, while battery capacity must be carefully considered to avoid adverse effects. For lorries in urban delivery use, further improvements of 17.5% can be achieved by utilising a 160 kW engine motor and 30 kWh battery. Buses are already quite well optimised, with serial architecture presenting the highest benefits with a 120 kW electric motor and a battery of 11 kWh. Future research should focus on supercapacitors and gearboxes to improve efficiency at higher vehicle speeds and assess hybridisation potential in interurban coach travel. The heavy-duty vehicle sector can make significant strides towards low-carbon transport by maximising hybrid powertrain efficiency and emission reductions. [ABSTRACT FROM AUTHOR]

The meshless global radial basis function (RBF) collocation method is widely used to model physical phenomena in science and engineering. The method produces highly accurate solutions with an exponential convergence rate. However, due to the global approximation structure of the method, dense node distributions lead to long computation times and hinder the applicability of the technique. In order to overcome this issue, this study proposes a parallel meshless global RBF collocation algorithm. The algorithm is applied to 2-D neutron diffusion problems. The multiquadric is used as the RBF. The algorithm is developed with Mathematica and eight virtual processors are used in calculations on a multicore computer with four physical cores. The method provides accurate numerical results in a stable manner. Parallel speedup increases with the number of processors up to five and seven processors for external and fission source problems, respectively. The speedup values are limited by the constrained resource sharing of the multicore computer's memory. On the other hand, significant time savings are achieved with parallel computation. For the four-group fission source problem, when 4316 interpolation nodes are employed, the utilization of seven processors instead of sequential computation decreases the computation time of the meshless approach by 716 s. [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]

Germline DNA testing using the next-generation sequencing (NGS) technology has become the analytical standard for the diagnostics of hereditary diseases, including cancer. Its increasing use places high demands on correct sample identification, independent confirmation of prioritized variants, and their functional and clinical interpretation. To streamline these processes, we introduced parallel DNA and RNA capture-based NGS using identical capture panel CZECANCA, which is routinely used for DNA analysis of hereditary cancer predisposition. Here, we present the analytical workflow for RNA sample processing and its analytical and diagnostic performance. Parallel DNA/RNA analysis allowed credible sample identification by calculating the kinship coefficient. The RNA capture-based approach enriched transcriptional targets for the majority of clinically relevant cancer predisposition genes to a degree that allowed analysis of the effect of identified DNA variants on mRNA processing. By comparing the panel and whole-exome RNA enrichment, we demonstrated that the tissue-specific gene expression pattern is independent of the capture panel. Moreover, technical replicates confirmed high reproducibility of the tested RNA analysis. We concluded that parallel DNA/RNA NGS using the identical gene panel is a robust and cost-effective diagnostic strategy. In our setting, it allows routine analysis of 48 DNA/RNA pairs using NextSeq 500/550 Mid Output Kit v2.5 (150 cycles) in a single run with sufficient coverage to analyse 226 cancer predisposition and candidate genes. This approach can replace laborious Sanger confirmatory sequencing, increase testing turnaround, reduce analysis costs, and improve interpretation of the impact of variants by analysing their effect on mRNA processing. [ABSTRACT FROM AUTHOR]

Two general trainers in the sports field do not disagree about finding and using a special aid in teaching skills, as each sports skill has a specificity in learning it, and the game of artistic gymnastics for men is one of the individual games and has physical, movement and coordination requirements. The aim of the research is to know the effect of using The feedback device in teaching the skill of standing on the hands, alternating a half-turn outward on the parallel apparatus. The research hypothesis is that the use of an instantaneous feedback device has an effect in teaching the skill of standing on the hands, alternating a half-turn outward on the parallel apparatus. The researcher used the experimental method with a sample design. One because it suits the research problem, as the research population is limited to (7) emerging players who train in Baghdad, Al-Amana Sports Club for Gymnastics, and their ages range between (9-13) years. As for the research sample, they are (6) players, and the research sample constituted (90%). As for the most important conclusions, the assistive device added to the sample a second and enjoyable training method that had a clear impact on learning the skill of standing on the hands, switching half a turn to the outside. Through the educational units and repetitions for the players on the device, it becomes clear that it has a good design and can withstand their weights and repetitions. The researcher suggests that During the course of working on some skills similar to the skill under research, conducting studies on the use of an assistive device in learning them, in which the handstand skill enters the elementary part, such as the skill of hilly and switching half a turn inwards, which have greater difficulties in learning.

To address the efficiency bottleneck encountered in reactor design calculations for the newly developed lead-based reactor neutronics analysis code system MOSASAUR, we recently developed acceleration functions based on various coarse-mesh finite difference (CMFD) methods and spatial domain decomposition parallel algorithm. However, the applicability of these improvements to different lead-based reactors remains to be analyzed. This work collected and established core models for various types of lead-based reactor. Based on different SN nodal transport solvers, we analyzed the acceleration performance of different CMFD methods, different CPU cores, and the combination of CMFD and parallel calculation. The results indicated that the impact of different CMFD acceleration or parallel acceleration on the calculation accuracy was negligible; the rCMFD method had good stability and convergence rate, achieving speedup of several to dozens; parallel efficiency was related to the number of meshes, and for large reactor cores, superlinear speedup was achieved with 200 CPU cores; rCMFD and parallel computing could achieve combined speedup, with 200 cores achieving speedup of hundreds to thousands, typically completing a reactor core transport calculation in 1 min.

The development of MOOSE has kept accelerating since the last release, with over 2,100 pull requests merged over the last 30 months that involved nearly fifty contributors across close to a dozen institutions internationally. The growth in MOOSE's capabilities and downstream applications is reflected in the growth of the community. User support provided on the GitHub discussions forum has steadily increased to nearly 50 daily interactions. New simulation projects, notably to model advanced nuclear reactor and fusion devices, are driving a significant expansion of the capabilities. This paper reports on these developments, with several major released features, new physics modules, and key improvements to the user experience and simulation workflow.