نتایج جستجو برای: ary hypergroup

تعداد نتایج: 4608  

Journal: :Photonics 2021

This paper exploits for the first time use of machine learning (ML) based techniques to identify complex structured light patterns under free space optics (FSO) jamming attacks secure FSO-based applications. Five M-ary modulation schemes, construed using Laguerre and Hermite Gaussian (LG HG) mode families, were used in this investigation. These include 8-ary LG, superposition-LG, 16-ary HG, LG ...

2010
C. Lavault

The paper presents a new fast k-ary reduction for integer GCD. It enjoys powerful properties and improves on the running time of the quite similar integer GCD algorithm of Kannan et al. Our k-ary reduction also improves on Sorenson's k-ary reductionn14] and thus favorably matches We-ber's algorithmm15]. More generally, the fast k-ary reduction also provides a basic tool for almost all the best ...

2016
Pinghong Ming Ting Cai Jin Li Yong Ning Shengao Xie Tao Tao Faqing Tang

7-hydroxy-5,4'-dimethoxy-2-arylbenzofuran (Ary) is purified from Livistona. It has been demonstrated to have anticancer activity to various tumors in including cervical cancer, but its mechanism is still unclear. In the present, we show that Ary induces cervical cancer cells apoptosis through mitochondria degradation and mediates cervical cancer cell arrest. Further, Ary-inducing cell cycle G1/...

Journal: :Probl. Inf. Transm. 2007
Victor Zinoviev Josep Rifà

In this paper from q-ary perfect codes new completely regular q-ary codes are constructed. In particular, two new ternary completely regular codes are obtained from ternary Golay [11, 6, 5] code. The first [11, 5, 6] code with covering radius ρ = 4 coincides with the dual Golay code and its intersection array is (22, 20, 18, 2, 1; 1, 2, 9, 20, 22) . The second [10, 5, 5] code, with covering rad...

Journal: :CoRR 2017
Alexander M. Romanov

We consider perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). In this paper, a generalized concatenation construction for q-ary 1-perfect codes is presented that allows us to construct q-ary 1-perfect codes of length (q − 1)nm + n +m from the given q-ary 1-perfect codes of length n = (q1 − 1)/(q − 1) and m = (q2 − 1)/(q − 1), where s1, s2 are ...

2007
Didier Arnal

We show that the sum of two adjoint orbits in the Lie algebra of an exponential Lie group coincides with the Campbell-Baker-Hausdorff product of these two orbits. Introduction N. Wildberger and others have recently investigated the structure of the hypergroup of the adjoint orbits in relation with the class hypergroup of compact Lie groups. A generalization of the notion of this type of hypergr...

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

Journal: :CoRR 2004
Alex Vinokur

A non-decreasing sequence of positive integer weights P ={p1, p2,..., pn} (n = N*(m-1) + 1, N is number of non-leaves of m-ary tree) is called absolutely ordered if the intermediate sequences of weights produced by m-ary Huffman algorithm for initial sequence P on i-th step satisfy the following conditions 2 , , ) ( 1 ) ( − = < + N 0 i p p i m i m . Let T be an m-ary tree of size n and M=M(T) b...

2016
Raine Rönnholm

In this paper we study the expressive power of k-ary exclusion logic, EXC[k], that is obtained by extending first order logic with k-ary exclusion atoms. It is known that without arity bounds exclusion logic is equivalent with dependence logic. From the translations between them we see that the expressive power of EXC[k] lies in between k-ary and (k+1)-ary dependence logics. We will show that, ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید