Sparse code formation in the primary visual cortex (V1) has been inspiration for many state-ofthe-art visual recognition systems. To stimulate this behavior, networks are trained networks under mathematical constraint of sparsity or selectivity. Meanwhile, there is another line of research which emphasizes the role of lateral connections of neural networks in sparse code formation. Lateral conn...

A code C is Z2Z4-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y ) is a binary linear code (respectively, a quaternary linear code). In this paper, the rank and dimension of the kernel for Z2Z4-linear codes, which are the corresponding binary codes of Z2Z4-additive codes, are ...

In general, every linear code can be used to construct a secret sharing scheme. However, determining the access structure of the secret sharing scheme based on a linear code is a very difficult problem. In this paper, we first construct a class of two-weight linear code over finite chain ring Fq[u]/⟨u⟩. Then, we present an access structure of the secret sharing scheme based on the two-weight li...

This paper addresses non-linear global gyrokinetic simulations of ion temperature gradient (ITG) driven turbulence with the GYSELA code. The particularity of GYSELA code is to use a SemiLagrangian (SL) scheme and this for the full distribution function. The 4D non-linear driftkinetic version of the code already showns the interest of such a SL method which exhibits good properties of energy con...

Nowadays, various numerical methods are developed to extend computational fluid dynamics in engineering applications. One of the most useful methods in free surface modeling is Boundary Element Method (BEM). BEM is used to model inviscid fluid flow such as flow around ships. BEM solutions employ surface mesh at all of the boundaries. In order to model the linear free surface, BEM can be modifie...

We construct new binary and ternary self-orthogonal linear codes. In order to do this we use an equivalence between the existence of a self-orthogonal linear code over a prime eld with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations. To reduce the size of the system of equations we restrict the search for solutions to solutions w...