generation algorithm
Recently Published Documents





2021 ◽  
Bo Qian ◽  
Hongri Fan

Abstract In order to solve the problems of low efficiency and complex process in the current generation algorithm and process verification of hexagonal honeycomb structures for complex spatial shapes and arbitrarily curved surfaces, this paper proposes an adaptive hexagonal grid calculation method based on the intracellular splitting iteration method for the first time. This method can better adapt to the complex spatial shape and arbitrary curved surface structure in the three-dimensional space, and it can also achieve the purpose of enhancing the mechanical performance while maintaining the lightweight structure. According to the principle of the above algorithm, different structural models including honeycomb cells are calculated and generated. 316L Stainless Steel material and Selective Laser Melting additive manufacturing processes are also used for printing actual samples. The printed samples are mechanically compressed. According to the results of the compression curve, the critical yield force of the honeycomb grid parts with iteration is higher than that of the homogeneous honeycomb grid parts, and the value is basically greater than 30%-40%. Finally, the energy absorption efficiency can be increased by more than 20% according to the compression characteristics of the adaptive iterative honeycomb analyzed.

2021 ◽  
Vol 17 (4) ◽  
pp. 84-94
Egor I. Safonov ◽  
Oleg I. Sokolkov

The article describes the process of designing and creating a software environment that allows in automatic mode to create a realistic landscape. A review of existing approaches to landscape generation is carried out, which have a set of disadvantages taken into account when developing a software environment. A diagram of components and main classes is described. The developed subroutine that implements the polygon mesh generation algorithm provides an interface for creating and editing a mesh of hexagons on a plane, used for simplified work with biomes, as well as detailing the boundaries of polygons to give the landscape elements of randomness and, as a result, realism. The process uses the Diamond Square noise generation algorithm. The docking algorithm is designed to reduce the gaps between the heights of different biomes. The erosion algorithm uses particles generated on a height mapto carry soil particles in accordance with physical laws. The user interface of the application and the results of the algorithms are presented.

2021 ◽  
Théo Le Guenedal ◽  
Philippe Drobinski ◽  
Peter Tankov

Abstract. Tropical cyclones are responsible for a large share of global damage resulting from natural disasters and estimating cyclone-related damage at a national level is a challenge attracting growing interest in the context of climate change. The global climate models, whose outputs are available from the Coupled Model Intercomparison Project (CMIP), do not resolve tropical cyclones. The Cyclone generation Algorithm including a THERmodynamic module for Integrated National damage Assessment (CATHERINA) presented in this paper, couples statistical and thermodynamic relationships to generate synthetic tracks sensitive to local climate conditions and estimates the damage induced by tropical cyclones at a national level. The framework is designed to be compatible with CMIP models’ data offering a simple solution to resolve tropical cyclones in climate projections. We illustrate it by producing damage projections in Representative Concentration Pathways (RCP) at the global level and for individual countries. The algorithm contains a module to correct biases in climate models based on the distributions of the climate variables in the reanalyses.

2021 ◽  
Vol 2120 (1) ◽  
pp. 012024
Siew Ting Chew ◽  
Yap Hoon ◽  
Hafisoh Ahmad

Abstract The study presents a new proposed reference current generation algorithm based on the synchronous reference frame (SRF) conventional algorithm in single-phase power system for an active power filtering. Shunt active power filter (SAPF) is often used as it can mitigate harmonic currents in the AC networks due to its superiority in dynamic-state conditions. The reference current generation algorithm is the most important control algorithms to control SAPF as it has the simplest implementation features. A proposed STF-based fundamental component identifier (STF-FCI) algorithm is implemented for the major improvements such as the removal of the unnecessary cosine function to reduce complexity of algorithm, employment of self-tuning filter (STF) to extract accurate fundamental component and to generate a sinusoidal reference current. The purpose of developing STF-FCI algorithm is to replace low pass filter (LPF) with a mean as it can generate a fast and accurate fundamental reference current to operate the SAPF in reducing the harmonics content of the power system and provide a fast response time in the dynamic-state conditions. This paper is presented under both steady-state which is capacitive (RC) load or inductive (RL) load as well as dynamic condition where capacitive load change to inductive load. The performance of steady-state condition will be evaluated in terms of THD values, ripple factor, power factor and phase difference. Under dynamic-state condition, the dynamic speed will be evaluated to capture the speed of the amplitude change in nonlinear load in a period of time. MATLAB-Simulink is used to design and evaluate the proposed STF-FCI algorithm with mean algorithm and LPF algorithm for comparison purpose. The simulation results had shown the major improvement when THD values, ripple factor, power factor and phase difference are reduced. The response time of the changing load is shorter by using mean algorithm compare to LPF algorithm. The simulation results obtained proved success when the proposed STF-FCI algorithm using mean algorithm are much better than LPF algorithm in steady-state and dynamic conditions under two voltage conditions i.e. ideal and distorted voltage.

2021 ◽  
Vol 16 (12) ◽  
pp. C12009
N. Trevisani

Abstract This contribution presents an update on the Analytical Method (AM) algorithm for trigger primitive (TP) generation in the CMS Drift Tube (DT) chambers during the High Luminosity LHC operation (HL-LHC or LHC phase 2). The algorithm has been developed and validated both in software with an emulation approach, and through hardware implementation tests. The algorithm is mainly divided into the following steps: a grouping (pattern recognition) step that finds the path of a given muon, a fitting step to extract the track parameters (position and bending angle), and a correlation step that matches the information from the different super-layers and with signal from the resistive plate chambers. Agreement between the software emulation and the firmware implementation has been verified using different data samples, including a sample of real muons collected during 2016 data taking. In this contribution, an update of the grouping step using a pseudo-Bayes classifier will be discussed.

2021 ◽  
Vol 38 (11) ◽  
pp. 825-832
Juhyun Kim ◽  
Sang Hyun Park ◽  
Dong-Guan Shin ◽  
Min-Gyu Kim ◽  
Seong Youb Chung ◽  

2021 ◽  
Vol 10 (4) ◽  
pp. 69
Omar Banimelhem ◽  
Eyad Taqieddin ◽  
Ibrahim Shatnawi

Recently, the data collection problem in wireless sensor networks (WSNs) using mobile sinks has received much attention. The main challenge in such problems is constructing the path that the mobile sink (MS) will use to collect the data. In this paper, an efficient path generation algorithm for the mobile sink based on principal component analysis (PCA) is proposed. The proposed approach was evaluated using two data collection modes—direct and multihop—and it was compared with another approach called the mobile-sink-based energy-efficient clustering algorithm for wireless sensor networks (MECA). When compared with MECA, simulation results have shown that the proposed approach improves the performance of WSN in terms of the number of live nodes and average remaining energy.

Sign in / Sign up

Export Citation Format

Share Document