Results 21 to 30 of about 825,768 (324)

Classification of periodic variable stars with novel cyclic-permutation invariant neural networks [PDF]

open access: greenMonthly notices of the Royal Astronomical Society, 2021
We present Cyclic-Permutation Invariant Neural Networks, a novel class of neural networks (NNs) designed to be invariant to phase shifts of period-folded periodic sequences by means of ‘symmetry padding’.
Keming Zhang, J. S. Bloom
openalex   +3 more sources

Graphical cyclic permutation groups [PDF]

open access: yesDiscrete Mathematics, 2014
We establish conditions for a permutation group generated by a single permutation of a prime power order to be an automorphism group of a graph or an edge-colored graph. This corrects and generalizes the results of the two papers on cyclic permutation groups published in 1978 and 1981 by S. P. Mohanty, M. R. Sridharan, and S. K. Shukla.
Mariusz Grech
openaire   +4 more sources

A remark about the anomalies of cyclic holomorphic permutation orbifolds [PDF]

open access: greenInternational Journal of Mathematics, 2020
Using a result of Longo and Xu, we show that the anomaly arising from a cyclic permutation orbifold of order 3 of a holomorphic conformal net [Formula: see text] with central charge [Formula: see text] depends on the “gravitational anomaly” [Formula: see
Marcel Bischoff
openalex   +3 more sources

MixCycle: Unsupervised Speech Separation via Cyclic Mixture Permutation Invariant Training [PDF]

open access: greenIEEE Signal Processing Letters, 2022
We introduce two unsupervised source separation methods, which involve self-supervised training from single-channel two-source speech mixtures. Our first method, mixture permutation invariant training (MixPIT), enables learning a neural network model ...
Ertuğ Karamatlı, Serap Kırbız
openalex   +3 more sources

Minimal faithful quasi-permutation representation degree of p-groups with cyclic center [PDF]

open access: yesProceedings - Mathematical Sciences, 2023
For a finite group G , we denote by $$\mu (G)$$ μ ( G ) and c ( G ), the minimal degree of faithful permutation representation of G , and the minimal degree of faithful representation of G by quasi-permutation matrices over the complex field $$\mathbb {C}
S. K. Prajapati, Ayush Udeep
semanticscholar   +1 more source

The crossing numbers of join products of paths with three graphs of order five [PDF]

open access: yesOpuscula Mathematica, 2022
The main aim of this paper is to give the crossing number of the join product \(G^\ast+P_n\) for the disconnected graph \(G^\ast\) of order five consisting of the complete graph \(K_4\) and one isolated vertex, where \(P_n\) is the path on \(n\) vertices.
Michal Staš, Mária Švecová
doaj   +1 more source

Deep Incomplete Multi-view Learning via Cyclic Permutation of VAEs [PDF]

open access: greenInternational Conference on Learning Representations
Multi-View Representation Learning (MVRL) aims to derive a unified representation from multi-view data by leveraging shared and complementary information across views.
Xin Gao, Jian Pu
openalex   +2 more sources

Intelligent Fault Detection for Rotating Machinery Using Cyclic Morphological Modulation Spectrum and Hierarchical Teager Permutation Entropy

open access: yesIEEE Transactions on Industrial Informatics, 2023
Intelligent fault detection of rotating machines is essentially a pattern classification issue. At the same time, effectively obtaining fault features from the measured signals is a key step to timely diagnose the health status of rotating machinery and ...
Junchao Guo, Qingbo He, D. Zhen, F. Gu
semanticscholar   +1 more source

Application of a permutation group on sasirangan pattern

open access: yesDesimal, 2021
A permutation group is a group of all permutations of some set. If the set that forms a permutation group is the n-first of natural number, then a permutation group is called a symmetry group.
Na'imah Hijriati   +3 more
doaj   +1 more source

On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]

open access: yesOpuscula Mathematica, 2021
The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj   +1 more source

Home - About - Disclaimer - Privacy