Results 11 to 20 of about 975,846 (299)
Journal of Sound and Vibration, 2021 This article deals with the stochastic modeling of industrial mistuned bladed disks. More specifically, a cost-efficient implementation of polynomial chaos expansion is proposed, it is dedicated to mathematical systems exhibiting permutation invariance ...
Juliette Dréau +3 more
semanticscholar +3 more sources
IEEE 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 +3 more sources
Minimal faithful quasi-permutation representation degree of p-groups with cyclic center [PDF]
Proceedings of the Indian Academy of Sciences: 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}
Sunil Kumar Prajapati, Ayush Udeep
semanticscholar +3 more sources
MixCycle: Unsupervised Speech Separation via Cyclic Mixture Permutation Invariant Training [PDF]
IEEE 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ı, S. Kırbız
semanticscholar +3 more sources
Graphical representations of cyclic permutation groups
Discrete Applied Mathematics, 2020 In this paper we prove that a permutation group A generated by a single permutation σ is an automorphism group of an edge-colored graph if and only if for every orbit O of σ with cardinality | O | ≥ 3 there exists another orbit O ′ of σ such that gcd ( |
Mariusz Grech, A. Kisielewicz
semanticscholar +3 more sources
Journal of Lightwave Technology, 2020 We have achieved the longest three mode-multiplexed full C-band transmission yet attained over 3060 km. In wideband mode-multiplexed transmission over weakly-coupled fewmode fibers (FMFs), the width of signal impulse responses is dependent on wavelength,
K. Shibahara +7 more
semanticscholar +3 more sources
Cyclic Permutation Groups that are Automorphism Groups of Graphs
Graphs and Combinatorics, 2019 In this paper we establish conditions for a permutation group generated by a single permutation to be an automorphism group of a graph. This solves the so called concrete version of König’s problem for the case of cyclic groups. We establish also similar
Mariusz Grech, A. Kisielewicz
semanticscholar +3 more sources
Generating a random cyclic permutation [PDF]
BIT, 1986 We prove correct an algorithm that, given \(n>0\), stores in array b[0..n- 1] a random cyclic permutation of the integers in 0..n-1, with each cyclic permutation having equal probability of being stored in b. The algorithm was developed by Sattolo; our contribution is to present a more convincing proof using standard program-proving methods.
D. Gries, Jinyun Xue
semanticscholar +3 more sources
Modular Vector Invariants of Cyclic Permutation Representations
Canadian Mathematical Bulletin, 1999 AbstractVector invariants of finite groups (see the introduction for an explanation of the terminology) have often been used to illustrate the difficulties of invariant theory in the modular case: see, e.g., [1], [2], [4], [7], [11] and [12]. It is therefore all the more surprising that the unpleasant properties of these invariants may be derived from ...
Larry Smith
semanticscholar +3 more sources
The crossing numbers of join products of paths with three graphs of order five [PDF]
Opuscula 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