In this paper we consider a general setting of skew-symmetric distribution which was constructed by Azzalini (1985), and its properties are presented. A suitable empirical estimator for a skew-symmetric distribution is proposed. In data analysis, by comparing this empirical model with the estimated skew-normal distribution, we show that the proposed empirical model has a better fit in den...

‎in this paper‎, ‎we propose a feasible interior-point method for‎ ‎convex quadratic programming over symmetric cones‎. ‎the proposed algorithm relaxes the‎ ‎accuracy requirements in the solution of the newton equation system‎, ‎by using an inexact newton direction‎. ‎furthermore‎, ‎we obtain an‎ ‎acceptable level of error in the inexact algorithm on convex‎ ‎quadratic symmetric cone programmin...

let d be a symmetric 2-(121, 16, 2) design with the automorphism group of aut(d). in this paper the order of automorphism of prime order of aut(d) is studied, and some results are obtained about the number of fixed points of these automorphisms. also we will show that |aut(d)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. in addition we prese...

A novel probabilistic numerical method for quantifying the uncertainty induced by the time integration of ordinary differential equations (ODEs) is introduced. Departing from the classical strategy to randomize ODE solvers by adding a random forcing term, we show that a probability measure over the numerical solution of ODEs can be obtained by introducing suitable random time-steps in a classic...

pseudo ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo ricci symmetric real hypersurfaces of the complex projective space cpn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.

a graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. in this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

we give a survey of recent applications of group rings to combinatorics and tocryptography, including their use in the di erential cryptanalysis of block ciphers.

a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...