K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for performance original algorithms have been put forward, while almost all them are based on single instruction data (SISD) architecture processors (GPUs), which partly ignored inherent paralleled characteristic In this paper, a novel multiple (SIMD) (GPUs) k-means proposed. algorithm, in order to accelerate compute-intensive portions traditional k-means, both objects assignment and...

An efficient synthesis of quinoxalin-2(1H)-ones or spiro[cyclohexene-1,2'-imidazol]-4'-ones has been achieved in moderate to high yields by the visible light-induced and N-bromosuccinimide-mediated cyclization reaction 2-azido-N-phenylacetamides at ambient temperature. Both regioselectivity speed are affected substituents attached phenyl ring. For example, quinoxalin-2-ones produced as main products when substrates bear electron-withdrawing groups para-position ring; contrast, obtained...

Binary butterfly optimization approach (bBOA) is a recent high performing feature selection algorithm presented in 2018 which based on the food foraging behavior of butterflies. This paper tries to improve structure bBOA enhance its classification accuracy, dimension reduction and reliability task for who are interested fields data mining pattern recognition. The new initialization strategy differential evolution applied reduce randomness bBOA's local search process. Then, parameter added...

Crying serves as the primary means through which infants communicate, presenting a significant challenge for new parents in understanding its underlying causes. This study aims to classify infant cries ascertain reasons behind their distress. In this paper, an efficient graph structure based on multi-dimensional hybrid features is proposed. Firstly, are processed extract various speech features, such spectrogram, mel-scaled MFCC, and others. These then combined across multiple dimensions...

Micro-expression recognition (MER) presents a significant challenge due to the transient and subtle nature of motion changes involved. In recent years, deep learning methods based on attention mechanisms have made some breakthroughs in MER. However, these still suffer from limitations insufficient feature capture poor dynamic adaptation when coping with instantaneous movement micro-expressions. Therefore, this paper, we design an Adaptive Hierarchical Multi-Scale Attention Network...

Feature selection is an important method to reduce the number of attributes high-dimensional data and essential preprocess work in classification. It eliminates irrelevant, redundant, noisy features improves performance model reduces computational burden. Fruit fly optimization algorithm a new proposed recent years, which imitates foraging behavior fruit fly. To best our knowledge, it has not been systematically applied feature selection. This paper uses as search strategy designs...

Abstract An efficient synthesis of paullone and kenpaullone derivatives in moderate to high yields has been achieved through photocyclizations (2‐chloro‐1 H ‐indole‐3‐yl)‐ N ‐arylacetamides acetone at room temperature. Paullone have obtained easily by deprotection the photocyclization products.

A one-pot synthesis of indolo[2,3-<i>c</i>]quinolin-6(7<i>H</i>)-ones was achieved by sequential photocyclizations 3-(2-azidophenyl)-<i>N</i>-phenylacrylamides in moderate to high yields. The reactions proceeded via photochemical cyclization aryl azides form <i>N</i>-phenylindol-2-carbamides and subsequent 6π-electrocyclic reaction oxidative aromatization afford the corresponding indolo[2,3-<i>c</i>]quinolin-6(7<i>H</i>)-ones.

A concise synthesis of 3-(1-alkenyl)isoindolin-1-ones and 5-(1-alkenyl)pyrrol-2-ones has been achieved by the coupling reactions N-acyliminium ions produced from 3-hydroxyisoindol-1-ones or 5-hydroxy-1-pyrrol-2-ones with unactivated olefins in presence BF(3)·OEt(2) at room temperature. For most olefins, afforded C(sp3)-C(sp2) cross-coupling products, but for α-methylstyrene 1-hexene, C(sp3)-C(sp3) products were obtained.

Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR are useless for negative In this work, we propose a novel algorithm and its improvement, which Our preliminary experiments performed some random instances certain benchmark instances. The results show that new outperform GAC-valid MDD-based GAC algorithm.