Understanding Scattering of Sound at Basin-scales with Numerical Experiments and Theory

1997 ◽  
Author(s):  
John L. Spiesberger
2013 ◽  
Vol 43 (1) ◽  
pp. 47-60
Author(s):  
Mihail Tsveov ◽  
Dimitar Chakarov

Abstract In the paper, different approaches for compliance control for human oriented robots are revealed. The approaches based on the non- antagonistic and antagonistic actuation are compared. In addition, an approach is investigated in this work for the compliance and the position control in the joint by means of antagonistic actuation. It is based on the capability of the joint with torsion leaf springs to adjust its stiffness. Models of joint stiffness are presented in this paper with antagonistic and non-antagonistic influence of the spring forces on the joint motion. The stiffness and the position control possibilities are investigated and the opportunity for their decoupling as well. Some results of numerical experiments are presented in the paper too.


2014 ◽  
Vol 8 (1) ◽  
pp. 218-221 ◽  
Author(s):  
Ping Hu ◽  
Zong-yao Wang

We propose a non-monotone line search combination rule for unconstrained optimization problems, the corresponding non-monotone search algorithm is established and its global convergence can be proved. Finally, we use some numerical experiments to illustrate the new combination of non-monotone search algorithm’s effectiveness.


2019 ◽  
Vol 97 ◽  
pp. 05023 ◽  
Author(s):  
Daler Sharipov ◽  
Sharofiddin Aynakulov ◽  
Otabek Khafizov

The paper deals with the development of mathematical model and numerical algorithms for solving the problem of transfer and diffusion of aerosol emissions in the atmospheric boundary layer. The model takes into account several significant parameters such as terrain relief, characteristics of underlying surface and weather-climatic factors. A series of numerical experiments were conducted based on the given model. The obtained results presented here show how these factors affect aerosol emissions spread in the atmosphere.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Idris Kharroubi ◽  
Thomas Lim ◽  
Xavier Warin

AbstractWe study the approximation of backward stochastic differential equations (BSDEs for short) with a constraint on the gains process. We first discretize the constraint by applying a so-called facelift operator at times of a grid. We show that this discretely constrained BSDE converges to the continuously constrained one as the mesh grid converges to zero. We then focus on the approximation of the discretely constrained BSDE. For that we adopt a machine learning approach. We show that the facelift can be approximated by an optimization problem over a class of neural networks under constraints on the neural network and its derivative. We then derive an algorithm converging to the discretely constrained BSDE as the number of neurons goes to infinity. We end by numerical experiments.


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
B. Borsos ◽  
János Karátson

Abstract The goal of this paper is to present various types of iterative solvers: gradient iteration, Newton’s method and a quasi-Newton method, for the finite element solution of elliptic problems arising in Gao type beam models (a geometrical type of nonlinearity, with respect to the Euler–Bernoulli hypothesis). Robust behaviour, i.e., convergence independently of the mesh parameters, is proved for these methods, and they are also tested with numerical experiments.


2021 ◽  
Vol 11 (12) ◽  
pp. 5656
Author(s):  
Yufan Zeng ◽  
Jiashan Tang

Graph neural networks (GNNs) have been very successful at solving fraud detection tasks. The GNN-based detection algorithms learn node embeddings by aggregating neighboring information. Recently, CAmouflage-REsistant GNN (CARE-GNN) is proposed, and this algorithm achieves state-of-the-art results on fraud detection tasks by dealing with relation camouflages and feature camouflages. However, stacking multiple layers in a traditional way defined by hop leads to a rapid performance drop. As the single-layer CARE-GNN cannot extract more information to fix the potential mistakes, the performance heavily relies on the only one layer. In order to avoid the case of single-layer learning, in this paper, we consider a multi-layer architecture which can form a complementary relationship with residual structure. We propose an improved algorithm named Residual Layered CARE-GNN (RLC-GNN). The new algorithm learns layer by layer progressively and corrects mistakes continuously. We choose three metrics—recall, AUC, and F1-score—to evaluate proposed algorithm. Numerical experiments are conducted. We obtain up to 5.66%, 7.72%, and 9.09% improvements in recall, AUC, and F1-score, respectively, on Yelp dataset. Moreover, we also obtain up to 3.66%, 4.27%, and 3.25% improvements in the same three metrics on the Amazon dataset.


Sign in / Sign up

Export Citation Format

Share Document