Search

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

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 to ascertain the reasons behind their distress. In this paper, an efficient graph structure based on multi-dimensional hybrid features is proposed. Firstly, infant cries are processed to extract various speech features, such as spectrogram, mel-scaled spectrogram, MFCC, and others. These speech features are then combined across multiple dimensions to better utilize the information in the cries. Additionally, in order to better classify the efficient graph structure, a local-to-global convolutional neural network (AlgNet) based on convolutional neural networks and attention mechanisms is proposed. The experimental results demonstrate that the use of the efficient graph structure improved the accuracy by an average of 8.01% compared to using standalone speech features, and the AlgNet model achieved an average accuracy improvement of 5.62% compared to traditional deep learning models. Experiments were conducted using the Dunstan baby language, Donate a cry, and baby cry datasets with accuracy rates of 87.78%, 93.83%, and 93.14% respectively. [ABSTRACT FROM AUTHOR]

Bidirectional singleton arc consistency (BiSAC) which is an extended singleton arc consistency (SAC) has been proposed recently. The first contribution of this paper is to propose and prove two theorems of BiSAC theoretically (one is a property of BiSAC and the other is the property of allowing the deletion of some BiSAC-inconsistent values). Secondly, based on these properties we present two algorithms, denoted by BiSAC-DF and BiSAC-DP, to enforce BiSAC. Also, we prove their correctness and analyze the space and time complexity of them in detail. Besides, for special circumstances, we show that BiSAC-DF admits a worst-case time complexity in O(en²d4) and a best one in O(en²d³) when the problem is an already BiSAC, while BiSAC-DP also has the same best one when the tightness is small. Finally, experiments on a wide range of CSP instances show BiSAC-DF and BiSAC-DP are usually around one order of magnitude faster than the existing BiSAC-1. For some special instances, BiSAC-DP is about two orders of magnitude efficient. [ABSTRACT FROM AUTHOR]