Computational Fluid Dynamics Approach for Predicting Pipeline Response to Various Blast Scenarios: A Numerical Modeling Study

Recent industrial explosions globally have intensified the focus in mechanical engineering on designing infras-tructure systems and networks capable of withstanding blast loading.Initially centered on high-profile facilities such as embassies and petrochemical plants,this concern now extends to a wider array of infrastructures and facilities.Engineers and scholars increasingly prioritize structural safety against explosions,particularly to prevent disproportionate collapse and damage to nearby structures.Urbanization has further amplified the reliance on oil and gas pipelines,making them vital for urban life and prime targets for terrorist activities.Consequently,there is a growing imperative for computational engineering solutions to tackle blast loading on pipelines and mitigate associated risks to avert disasters.In this study,an empty pipe model was successfully validated under contact blast conditions using Abaqus software,a powerful tool in mechanical engineering for simulating blast effects on buried pipelines.Employing a Eulerian-Lagrangian computational fluid dynamics approach,the investigation extended to above-surface and below-surface blasts at standoff distances of 25 and 50 mm.Material descriptions in the numerical model relied on Abaqus’default mechanical models.Comparative analysis revealed varying pipe performance,with deformation decreasing as explosion-to-pipe distance increased.The explosion’s location relative to the pipe surface notably influenced deformation levels,a key finding highlighted in the study.Moreover,quantitative findings indicated varying ratios of plastic dissipation energy(PDE)for different blast scenarios compared to the contact blast(P0).Specifically,P1(25 mm subsurface blast)and P2(50 mm subsurface blast)showed approximately 24.07%and 14.77%of P0’s PDE,respectively,while P3(25 mm above-surface blast)and P4(50 mm above-surface blast)exhibited lower PDE values,accounting for about 18.08%and 9.67%of P0’s PDE,respectively.Utilising energy-absorbing materials such as thin coatings of ultra-high-strength concrete,metallic foams,carbon fiber-reinforced polymer wraps,and others on the pipeline to effectively mitigate blast damage is recommended.This research contributes to the advancement of mechanical engineering by providing insights and solutions crucial for enhancing the resilience and safety of underground pipelines in the face of blast events.

Numerical Analysis of Bacterial Meningitis Stochastic Delayed Epidemic Model through Computational Methods

Based on theWorld Health Organization(WHO),Meningitis is a severe infection of the meninges,the membranes covering the brain and spinal cord.It is a devastating disease and remains a significant public health challenge.This study investigates a bacterial meningitis model through deterministic and stochastic versions.Four-compartment population dynamics explain the concept,particularly the susceptible population,carrier,infected,and recovered.The model predicts the nonnegative equilibrium points and reproduction number,i.e.,the Meningitis-Free Equilibrium(MFE),and Meningitis-Existing Equilibrium(MEE).For the stochastic version of the existing deterministicmodel,the twomethodologies studied are transition probabilities and non-parametric perturbations.Also,positivity,boundedness,extinction,and disease persistence are studiedrigorouslywiththe helpofwell-known theorems.Standard and nonstandard techniques such as EulerMaruyama,stochastic Euler,stochastic Runge Kutta,and stochastic nonstandard finite difference in the sense of delay have been presented for computational analysis of the stochastic model.Unfortunately,standard methods fail to restore the biological properties of the model,so the stochastic nonstandard finite difference approximation is offered as an efficient,low-cost,and independent of time step size.In addition,the convergence,local,and global stability around the equilibria of the nonstandard computational method is studied by assuming the perturbation effect is zero.The simulations and comparison of the methods are presented to support the theoretical results and for the best visualization of results.

Research on the Assessment System of Computational Mechanics Courses Based on the TOPSIS Entropy Weight Model

This paper takes the assessment and evaluation of computational mechanics course as the background,and constructs a diversified course evaluation system that is student-centered and integrates both quantitative and qualitative evaluation methods.The system not only pays attention to students’practical operation and theoretical knowledge mastery but also puts special emphasis on the cultivation of students’innovative abilities.In order to realize a comprehensive and objective evaluation,the assessment and evaluation method of the entropy weight model combining TOPSIS(Technique for Order Preference by Similarity to Ideal Solution)multi-attribute decision analysis and entropy weight theory is adopted,and its validity and practicability are verified through example analysis.This method can not only comprehensively and objectively evaluate students’learning outcomes,but also provide a scientific decision-making basis for curriculum teaching reform.The implementation of this diversified course evaluation system can better reflect the comprehensive ability of students and promote the continuous improvement of teaching quality.

Computational Experiments for Complex Social Systems:Experiment Design and Generative Explanation

Powered by advanced information technology,more and more complex systems are exhibiting characteristics of the cyber-physical-social systems(CPSS).In this context,computational experiments method has emerged as a novel approach for the design,analysis,management,control,and integration of CPSS,which can realize the causal analysis of complex systems by means of“algorithmization”of“counterfactuals”.However,because CPSS involve human and social factors(e.g.,autonomy,initiative,and sociality),it is difficult for traditional design of experiment(DOE)methods to achieve the generative explanation of system emergence.To address this challenge,this paper proposes an integrated approach to the design of computational experiments,incorporating three key modules:1)Descriptive module:Determining the influencing factors and response variables of the system by means of the modeling of an artificial society;2)Interpretative module:Selecting factorial experimental design solution to identify the relationship between influencing factors and macro phenomena;3)Predictive module:Building a meta-model that is equivalent to artificial society to explore its operating laws.Finally,a case study of crowd-sourcing platforms is presented to illustrate the application process and effectiveness of the proposed approach,which can reveal the social impact of algorithmic behavior on“rider race”.

Effect of solvent on the initiation mechanism of living anionic polymerization of styrene:A computational study

For living anionic polymerization(LAP),solvent has a great influence on both reaction mechanism and kinetics.In this work,by using the classical butyl lithium-styrene polymerization as a model system,the effect of solvent on the mechanism and kinetics of LAP was revealed through a strategy combining density functional theory(DFT)calculations and kinetic modeling.In terms of mechanism,it is found that the stronger the solvent polarity,the more electrons transfer from initiator to solvent through detailed energy decomposition analysis of electrostatic interactions between initiator and solvent molecules.Furthermore,we also found that the stronger the solvent polarity,the higher the monomer initiation energy barrier and the smaller the initiation rate coefficient.Counterintuitively,initiation is more favorable at lower temperatures based on the calculated results ofΔG_(TS).Finally,the kinetic characteristics in different solvents were further examined by kinetic modeling.It is found that in benzene and n-pentane,the polymerization rate exhibits first-order kinetics.While,slow initiation and fast propagation were observed in tetrahydrofuran(THF)due to the slow free ion formation rate,leading to a deviation from first-order kinetics.

A Novel Predictive Model for Edge Computing Resource Scheduling Based on Deep Neural Network

Currently,applications accessing remote computing resources through cloud data centers is the main mode of operation,but this mode of operation greatly increases communication latency and reduces overall quality of service(QoS)and quality of experience(QoE).Edge computing technology extends cloud service functionality to the edge of the mobile network,closer to the task execution end,and can effectivelymitigate the communication latency problem.However,the massive and heterogeneous nature of servers in edge computing systems brings new challenges to task scheduling and resource management,and the booming development of artificial neural networks provides us withmore powerfulmethods to alleviate this limitation.Therefore,in this paper,we proposed a time series forecasting model incorporating Conv1D,LSTM and GRU for edge computing device resource scheduling,trained and tested the forecasting model using a small self-built dataset,and achieved competitive experimental results.

A Novel Quantization and Model Compression Approach for Hardware Accelerators in Edge Computing

Massive computational complexity and memory requirement of artificial intelligence models impede their deploy-ability on edge computing devices of the Internet of Things(IoT).While Power-of-Two(PoT)quantization is pro-posed to improve the efficiency for edge inference of Deep Neural Networks(DNNs),existing PoT schemes require a huge amount of bit-wise manipulation and have large memory overhead,and their efficiency is bounded by the bottleneck of computation latency and memory footprint.To tackle this challenge,we present an efficient inference approach on the basis of PoT quantization and model compression.An integer-only scalar PoT quantization(IOS-PoT)is designed jointly with a distribution loss regularizer,wherein the regularizer minimizes quantization errors and training disturbances.Additionally,two-stage model compression is developed to effectively reduce memory requirement,and alleviate bandwidth usage in communications of networked heterogenous learning systems.The product look-up table(P-LUT)inference scheme is leveraged to replace bit-shifting with only indexing and addition operations for achieving low-latency computation and implementing efficient edge accelerators.Finally,comprehensive experiments on Residual Networks(ResNets)and efficient architectures with Canadian Institute for Advanced Research(CIFAR),ImageNet,and Real-world Affective Faces Database(RAF-DB)datasets,indicate that our approach achieves 2×∼10×improvement in the reduction of both weight size and computation cost in comparison to state-of-the-art methods.A P-LUT accelerator prototype is implemented on the Xilinx KV260 Field Programmable Gate Array(FPGA)platform for accelerating convolution operations,with performance results showing that P-LUT reduces memory footprint by 1.45×,achieves more than 3×power efficiency and 2×resource efficiency,compared to the conventional bit-shifting scheme.

Computation Tree Logic Model Checking of Multi-Agent Systems Based on Fuzzy Epistemic Interpreted Systems

Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.

Design of a Computational Heuristic to Solve the Nonlinear Liénard Differential Model

In this study,the design of a computational heuristic based on the nonlinear Liénard model is presented using the efficiency of artificial neural networks(ANNs)along with the hybridization procedures of global and local search approaches.The global search genetic algorithm(GA)and local search sequential quadratic programming scheme(SQPS)are implemented to solve the nonlinear Liénard model.An objective function using the differential model and boundary conditions is designed and optimized by the hybrid computing strength of the GA-SQPS.The motivation of the ANN procedures along with GA-SQPS comes to present reliable,feasible and precise frameworks to tackle stiff and highly nonlinear differentialmodels.The designed procedures of ANNs along with GA-SQPS are applied for three highly nonlinear differential models.The achieved numerical outcomes on multiple trials using the designed procedures are compared to authenticate the correctness,viability and efficacy.Moreover,statistical performances based on different measures are also provided to check the reliability of the ANN along with GASQPS.

Modeling and performance evaluation of QoS-aware job scheduling of computational grids

To achieve high quality of service （QoS） on computational grids, the QoS-aware job scheduling is investigated for a hierarchical decentralized grid architecture that consists of multilevel schedulers. An integrated QoS-aware job dispatching policy is proposed, which correlates priorities of incoming jobs used for job selecting at the local scheduler of the grid node with the job dispatching policies at the global scheduler for computational grids. The stochastic high-level Petri net （SHLPN） model of a two-level hierarchy computational grid architecture is presented, and a model refinement is made to reduce the complexity of the model solution. A performance analysis technique based on the SHLPN is proposed to investigate the QoS-aware job scheduling policy. Numerical results show that the QoS-aware job dispatching policy outperforms the QoS-unaware job dispatching policy in balancing the high-priority jobs, and thus enables priority-based QoS.

Modeling of gas-solid flow in a CFB riser based on computational particle fluid dynamics

A three-dimensional model for gas-solid flow in a circulating fluidized bed（CFB） riser was developed based on computational particle fluid dynamics（CPFD）.The model was used to simulate the gas-solid flow behavior inside a circulating fluidized bed riser operating at various superficial gas velocities and solids mass fluxes in two fluidization regimes,a dilute phase transport（DPT） regime and a fast fluidization（FF） regime.The simulation results were evaluated based on comparison with experimental data of solids velocity and holdup,obtained from non-invasive automated radioactive particle tracking and gamma-ray tomography techniques,respectively.The agreement of the predicted solids velocity and holdup with experimental data validated the CPFD model for the CFB riser.The model predicted the main features of the gas-solid flows in the two regimes;the uniform dilute phase in the DPT regime,and the coexistence of the dilute phase in the upper region and the dense phase in the lower region in the FF regime.The clustering and solids back mixing in the FF regime were stronger than those in the DPT regime.

Neural computational modeling reveals a major role of corticospinal gating of central oscillations in the generation of essential tremor

Essential tremor, also referred to as familial tremor, is an autosomal dominant genetic disease and the most common movement disorder. It typically involves a postural and motor tremor of the hands, head or other part of the body. Essential tremor is driven by a central oscillation signal in the brain. However, the corticospinal mechanisms involved in the generation of essential tremor are unclear. Therefore, in this study, we used a neural computational model that includes both monosynaptic and multisynaptic corticospinal pathways interacting with a propriospinal neuronal network. A virtual arm model is driven by the central oscillation signal to simulate tremor activity behavior. Cortical descending commands are classified as alpha or gamma through monosynaptic or multisynaptic corticospinal pathways, which converge respectively on alpha or gamma motoneurons in the spinal cord. Several scenarios are evaluated based on the central oscillation signal passing down to the spinal motoneurons via each descending pathway. The simulated behaviors are compared with clinical essential tremor characteristics to identify the corticospinal pathways responsible for transmitting the central oscillation signal. A propriospinal neuron with strong cortical inhibition performs a gating function in the generation of essential tremor. Our results indicate that the propriospinal neuronal network is essential for relaying the central oscillation signal and the production of essential tremor.

A Novel Parallel Computing Confidentiality Scheme Based on Hindmarsh-Rose Model

Due to the inherent insecure nature of the Internet,it is crucial to ensure the secure transmission of image data over this network.Additionally,given the limitations of computers,it becomes evenmore important to employ efficient and fast image encryption techniques.While 1D chaotic maps offer a practical approach to real-time image encryption,their limited flexibility and increased vulnerability restrict their practical application.In this research,we have utilized a 3DHindmarsh-Rosemodel to construct a secure cryptosystem.The randomness of the chaotic map is assessed through standard analysis.The proposed system enhances security by incorporating an increased number of system parameters and a wide range of chaotic parameters,as well as ensuring a uniformdistribution of chaotic signals across the entire value space.Additionally,a fast image encryption technique utilizing the new chaotic system is proposed.The novelty of the approach is confirmed through time complexity analysis.To further strengthen the resistance against cryptanalysis attacks and differential attacks,the SHA-256 algorithm is employed for secure key generation.Experimental results through a number of parameters demonstrate the strong cryptographic performance of the proposed image encryption approach,highlighting its exceptional suitability for secure communication.Moreover,the security of the proposed scheme has been compared with stateof-the-art image encryption schemes,and all comparison metrics indicate the superior performance of the proposed scheme.

A Dynamic Bayesian-Based Comprehensive Trust Evaluation Model for Dispersed Computing Environment

Dispersed computing is a new resourcecentric computing paradigm.Due to its high degree of openness and decentralization,it is vulnerable to attacks,and security issues have become an important challenge hindering its development.The trust evaluation technology is of great significance to the reliable operation and security assurance of dispersed computing networks.In this paper,a dynamic Bayesian-based comprehensive trust evaluation model is proposed for dispersed computing environment.Specifically,in the calculation of direct trust,a logarithmic decay function and a sliding window are introduced to improve the timeliness.In the calculation of indirect trust,a random screening method based on sine function is designed,which excludes malicious nodes providing false reports and multiple malicious nodes colluding attacks.Finally,the comprehensive trust value is dynamically updated based on historical interactions,current interactions and momentary changes.Simulation experiments are introduced to verify the performance of the model.Compared with existing model,the proposed trust evaluation model performs better in terms of the detection rate of malicious nodes,the interaction success rate,and the computational cost.

What can computational modeling offer for studying the Ca^(2+) dysregulation in Alzheimer's disease:current research and future directions

Ca^2＋ dysregulation is an early event observed in Alzheimer＇s disease（AD） patients preceding the presence of its clinical symptoms.Dysregulation of neuronalCa^2＋ will cause synaptic loss and neuronal death,eventually leading to memory impairments and cognitive decline.Treatments targetingCa^2＋ signaling pathways are potential therapeutic strategies against AD.The complicated interactions make it challenging and expensive to study the underlying mechanisms as to how Ca^2＋ signaling contributes to the pathogenesis of AD.Computational modeling offers new opportunities to study the signaling pathway and test proposed mechanisms.In this mini-review,we present some computational approaches that have been used to study Ca^2＋ dysregulation of AD by simulating Ca^2＋signaling at various levels.We also pointed out the future directions that computational modeling can be done in studying the Ca^2＋ dysregulation in AD.

An In Vivo Experimental Validation of a Computational Model of Human Foot

Reliable computational foot models offer an alternative means to enhance knowledge on the biomechanics of human foot. Model validation is one of the most critical aspects of the entire foot modeling and analysis process.This paper presents an in vivo experiment combining motion capture system and plantar pressure measure platform to validate a three-dimensional finite element model of human foot.The Magnetic Resonance Imaging(MRI)slices for the foot modeling and the experimental data for validation were both collected from the same volunteer subject.The validated components included the comparison of static model predictions of plantar force,plantar pressure and foot surface deformation during six loading conditions,to equivalent measured data.During the whole experiment,foot surface deformation,plantar force and plantar pressure were recorded simultaneously during six different loaded standing conditions.The predictions of the current FE model were in good agreement with these experimental results.

Multiple QoS modeling and algorithm in computational grid

Multiple QoS modeling and algorithm in grid system is considered. Grid QoS requirements can be formulated as a utility function for each task as a weighted sum of its each dimensional QoS utility functions. Multiple QoS constraint resource scheduling optimization in computational grid is distributed to two subproblems： optimization of grid user and grid resource provider. Grid QoS scheduling can be achieved by solving sub problems via an iterative algorithm.

3D Model Occlusion Culling Optimization Method Based on WebGPU Computing Pipeline

Nowadays,Web browsers have become an important carrier of 3D model visualization because of their convenience and portability.During the process of large-scale 3D model visualization based on Web scenes with the problems of slow rendering speed and low FPS(Frames Per Second),occlusion culling,as an important method for rendering optimization,can remove most of the occluded objects and improve rendering efficiency.The traditional occlusion culling algorithm(TOCA)is calculated by traversing all objects in the scene,which involves a large amount of repeated calculation and time consumption.To advance the rendering process and enhance rendering efficiency,this paper proposes an occlusion culling with three different optimization methods based on the WebGPU Computing Pipeline.Firstly,for the problem of large amounts of repeated calculation processes in TOCA,these units are moved from the CPU to the GPU for parallel computing,thereby accelerating the calculation of the Potential Visible Sets(PVS);Then,for the huge overhead of creating pipeline caused by too many 3D models in a certain scene,the Breaking Occlusion Culling Algorithm(BOCA)is introduced,which removes some nodes according to building a Hierarchical Bounding Volume(BVH)scene tree to reduce the overhead of creating pipelines;After that,the structure of the scene tree is transmitted to the GPU in the order of depth-first traversal and finally,the PVS is obtained by parallel computing.In the experiments,3D geological models with five different scales from 1:5,000 to 1:500,000 are used for testing.The results show that the proposed methods can reduce the time overhead of repeated calculation caused by the computing pipeline creation and scene tree recursive traversal in the occlusion culling algorithm effectively,with 97%rendering efficiency improvement compared with BOCA,thereby accelerating the rendering process on Web browsers.

A Computationally Efficient Aggregation Optimization Strategy of Model Predictive Control

Model Predictive Control (MPC) is a popular technique and has been successfully used in various industrial applications. However, the big drawback of MPC involved in the formidable on line computational effort limits its applicability to relatively slow and/or small processes with a moderate number of inputs. This paper develops an aggregation optimization strategy for MPC that can improve the computational efficiency of MPC. For the regulation problem, an input decaying aggregation optimization algorithm is presented by aggregating all the original optimized variables on control horizon with the decaying sequence in respect of the current control action.

A review of computational modeling and deep brain stimulation:applications to Parkinson’s disease

Biophysical computational models are complementary to experiments and theories,providing powerful tools for the study of neurological diseases.The focus of this review is the dynamic modeling and control strategies of Parkinson’s disease(PD).In previous studies,the development of parkinsonian network dynamics modeling has made great progress.Modeling mainly focuses on the cortex-thalamus-basal ganglia(CTBG)circuit and its sub-circuits,which helps to explore the dynamic behavior of the parkinsonian network,such as synchronization.Deep brain stimulation(DBS)is an effective strategy for the treatment of PD.At present,many studies are based on the side effects of the DBS.However,the translation from modeling results to clinical disease mitigation therapy still faces huge challenges.Here,we introduce the progress of DBS improvement.Its specific purpose is to develop novel DBS treatment methods,optimize the treatment effect of DBS for each patient,and focus on the study in closed-loop DBS.Our goal is to review the inspiration and insights gained by combining the system theory with these computational models to analyze neurodynamics and optimize DBS treatment.