Cmc-computers Materials & Continua 

About: Cmc-computers Materials & Continua is an academic journal. The journal publishes majorly in the area(s): Computer science & Pattern recognition (psychology). It has an ISSN identifier of 1546-2218. It is also open access. Over the lifetime, 3326 publications have been published receiving 27882 citations. The journal is also known as: Computers, materials and continua & CMC.

Artificial neural network methods for the solution of second order boundary value problems

Abstract: We present a method for solving partial differential equations using artificial neural networks and an adaptive collocation strategy. In this procedure, a coarse grid of training points is used at the initial training stages, while more points are added at later stages based on the value of the residual at a larger set of evaluation points. This method increases the robustness of the neural network approximation and can result in significant computational savings, particularly when the solution is non-smooth. Numerical results are presented for benchmark problems for scalar-valued PDEs, namely Poisson and Helmholtz equations, as well as for an inverse acoustics problem.

Boundary conditions generated by dynamic particles in SPH methods

Abstract: Smoothed Particle Hydrodynamics is a purely Lagrangian method that can be applied to a wide variety of fields. The foundation and properties of the so called dynamic boundary particles (DBPs) are described in this paper. These boundary particles share the same equations of continuity and state as the moving particles placed inside the domain, although their positions and velocities remain unaltered in time or are externally prescribed. Theoretical and numerical calculations were carried out to study the collision between a moving particle and a boundary particle. The boundaries were observed to behave in an elastic manner in absence of viscosity. They allow the fluid particles to approach till a critical distance depending on the energy of the incident particle. In addition, a dam break confined in a box was used to check the validity of the approach. The good agreement between experiments and numerical results shows the reliability of DBPs. Keyword: Meshfree methods, SPH, smoothed particle hydrodynamics, boundary conditions

A Deep Collocation Method for the Bending Analysis of Kirchhoff Plate

Abstract: In this paper, a deep collocation method (DCM) for thin plate bending problems is proposed. This method takes advantage of computational graphs and backpropagation algorithms involved in deep learning. Besides, the proposed DCM is based on a feedforward deep neural network (DNN) and differs from most previous applications of deep learning for mechanical problems. First, batches of randomly distributed collocation points are initially generated inside the domain and along the boundaries. A loss function is built with the aim that the governing partial differential equations (PDEs) of Kirchhoff plate bending problems, and the boundary/initial conditions are minimised at those collocation points. A combination of optimizers is adopted in the backpropagation process to minimize the loss function so as to obtain the optimal hyperparameters. In Kirchhoff plate bending problems, the C1 continuity requirement poses significant difficulties in traditional mesh-based methods. This can be solved by the proposed DCM, which uses a deep neural network to approximate the continuous transversal deflection, and is proved to be suitable to the bending analysis of Kirchhoff plate of various geometries.

Towards an Artificial Intelligence Framework for Data-Driven Prediction of Coronavirus Clinical Severity

Abstract: The virus SARS-CoV2, which causes coronavirus disease (COVID-19) has become a pandemic and has spread to every inhabited continent Given the increasing caseload, there is an urgent need to augment clinical skills in order to identify from among the many mild cases the few that will progress to critical illness We present a first step towards building an artificial intelligence (AI) framework, with predictive analytics (PA) capabilities applied to real patient data, to provide rapid clinical decision-making support COVID-19 has presented a pressing need as a) clinicians are still developing clinical acumen to this novel disease and b) resource limitations in a surging pandemic require difficult resource allocation decisions The objectives of this research are: (1) to algorithmically identify the combinations of clinical characteristics of COVID-19 that predict outcomes, and (2) to develop a tool with AI capabilities that will predict patients at risk for more severe illness on initial presentation The predictive models learn from historical data to help predict who will develop acute respiratory distress syndrome (ARDS), a severe outcome in COVID-19 Our results, based on data from two hospitals in Wenzhou, Zhejiang, China, identified features on initial presentation with COVID-19 that were most predictive of later development of ARDS A mildly elevated alanine aminotransferase (ALT) (a liver enzyme), the presence of myalgias (body aches), and an elevated hemoglobin (red blood cells), in this order, are the clinical features, on presentation, that are the most predictive The predictive models that learned from historical data of patients from these two hospitals achieved 70% to 80% accuracy in predicting severe cases

A PSO based Energy Efficient Coverage Control Algorithm for Wireless Sensor Networks

Abstract: Wireless Sensor Networks (WSNs) are large-scale and high-density networks that typically have coverage area overlap. In addition, a random deployment of sensor nodes cannot fully guarantee coverage of the sensing area, which leads to coverage holes in WSNs. Thus, coverage control plays an important role in WSNs. To alleviate unnecessary energy wastage and improve network performance, we consider both energy efficiency and coverage rate for WSNs. In this paper, we present a novel coverage control algorithm based on Particle Swarm Optimization (PSO). Firstly, the sensor nodes are randomly deployed in a target area and remain static after deployment. Then, the whole network is partitioned into grids, and we calculate each grid’s coverage rate and energy consumption. Finally, each sensor nodes’ sensing radius is adjusted according to the coverage rate and energy consumption of each grid. Simulation results show that our algorithm can effectively improve coverage rate and reduce energy consumption.