cancellation property
Recently Published Documents


TOTAL DOCUMENTS

36
(FIVE YEARS 3)

H-INDEX

8
(FIVE YEARS 0)

2021 ◽  
Vol 31 (6) ◽  
Author(s):  
Diego Alonso-Orán ◽  
Christian Rohde ◽  
Hao Tang

AbstractWe establish a local theory, i.e., existence, uniqueness and blow-up criterion, for a general family of singular SDEs in Hilbert spaces. The key requirement relies on an approximation property that allows us to embed the singular drift and diffusion mappings into a hierarchy of regular mappings that are invariant with respect to the Hilbert space and enjoy a cancellation property. Various nonlinear models in fluid dynamics with transport noise belong to this type of singular SDEs. By establishing a cancellation estimate for certain differential operators of order one with suitable coefficients, we give the detailed constructions of such regular approximations for certain examples. In particular, we show novel local-in-time results for the stochastic two-component Camassa–Holm system and for the stochastic Córdoba–Córdoba–Fontelos model.


Author(s):  
Hock Hung Chieng ◽  
Noorhaniza Wahid ◽  
Pauline Ong

QActivation function is a key component in deep learning that performs non-linear mappings between the inputs and outputs. Rectified Linear Unit (ReLU) has been the most popular activation function across the deep learning community. However, ReLU contains several shortcomings that can result in inefficient training of the deep neural networks, these are: 1) the negative cancellation property of ReLU tends to treat negative inputs as unimportant information for the learning, resulting in performance degradation; 2) the inherent predefined nature of ReLU is unlikely to promote additional flexibility, expressivity, and robustness to the networks; 3) the mean activation of ReLU is highly positive and leads to bias shift effect in network layers; and 4) the multilinear structure of ReLU restricts the non-linear approximation power of the networks. To tackle these shortcomings, this paper introduced Parametric Flatten-T Swish (PFTS) as an alternative to ReLU. By taking ReLU as a baseline method, the experiments showed that PFTS improved classification accuracy on SVHN dataset by 0.31%, 0.98%, 2.16%, 17.72%, 1.35%, 0.97%, 39.99%, and 71.83% on DNN-3A, DNN-3B, DNN-4, DNN-5A, DNN-5B, DNN-5C, DNN-6, and DNN-7, respectively. Besides, PFTS also achieved the highest mean rank among the comparison methods. The proposed PFTS manifested higher non-linear approximation power during training and thereby improved the predictive performance of the networks.


2020 ◽  
Vol 13 (39) ◽  
pp. 4109-4115
Author(s):  
G Rajeswari

Objectives: The main objective of this research article is to study the semiring structures, we have majorly focused on the constrains under which the structures of S*and A* semirings are additively and/or multiplicatively idempotent. We have also concentrated on the study of structures of totally ordered S* and A* semirings. Methods: We have imposed singularity, cancellation property, Integral Multiple Property (IMP) and some other constrains on both semirings. Findings: when we imposed totally ordered condition on these two semirings we observed that the additive structure takes place as a maximum addition. Applications: The proposed idempotents have wide applications to computer science, dynamical and logical systems, cryptography, graph theory and artificial intelligence.


2018 ◽  
Vol 17 (08) ◽  
pp. 1850156 ◽  
Author(s):  
D. D. Anderson ◽  
J. R. Juett ◽  
C. P. Mooney

We perform an in-depth study of several different cancellation properties for modules. Among those we consider are (half) (weak) cancellation modules, restricted cancellation modules, and (half) join principal modules. We also investigate which commutative rings have every nonzero (finitely generated) ideal (respectively, module) satisfying some cancellation property.


2017 ◽  
Vol 46 (2) ◽  
pp. 780-791
Author(s):  
Hongbo Zhang

2016 ◽  
Vol 48 (5) ◽  
pp. 822-834
Author(s):  
Adrien Dubouloz ◽  
Pierre-Marie Poloni

2015 ◽  
Vol 14 (09) ◽  
pp. 1540007 ◽  
Author(s):  
S. M. Bhatwadekar ◽  
Neena Gupta

In [On affine-ruled rational surfaces, Math. Ann.255(3) (1981) 287–302], Russell had proved that when k is a perfect field of positive characteristic, the polynomial ring k[X, Y] is cancellative. In this note, we shall show that this cancellation property holds even without the hypothesis that k is perfect.


2014 ◽  
Vol 66 (3) ◽  
pp. 596-624 ◽  
Author(s):  
Søren Eilers ◽  
Gunnar Restorff ◽  
Efren Ruiz

AbstractLet be a C*-algebra with real rank zero that has the stable weak cancellation property. Let be an ideal of such that is stable and satisfies the corona factorization property. We prove thatis a full extension if and only if the extension is stenotic and K-lexicographic. As an immediate application, we extend the classification result for graph C*-algebras obtained by Tomforde and the first named author to the general non-unital case. In combination with recent results by Katsura, Tomforde, West, and the first named author, our result may also be used to give a purely K-theoretical description of when an essential extension of two simple and stable graph C*-algebras is again a graph C*- algebra.


2012 ◽  
Vol 14 (02) ◽  
pp. 1250008 ◽  
Author(s):  
MAN CHUN LEUNG

For n ≥ 6, using the Lyapunov–Schmidt reduction method, we describe how to construct (scalar curvature) functions on Sn, so that each of them enables the conformal scalar curvature equation to have an infinite number of positive solutions, which form a blow-up sequence. The prescribed scalar curvature function is shown to have Cn - 1,β smoothness. We present the argument in two parts. In this first part, we discuss the uniform cancellation property in the Lyapunov–Schmidt reduction method for the scalar curvature equation. We also explore relation between the Kazdan–Warner condition and the first-order derivatives of the reduced functional, and symmetry in the second-order derivatives of the reduced functional.


Sign in / Sign up

Export Citation Format

Share Document