Search

To date, a large number of research papers have been written on malware classification, identification, classification into different families, and the distinction between malware and goodware. These works have been based on captured malware samples and have attempted to analyse malware and goodware using various techniques like the analysis of malware using malware visualization. These works usually convert malware samples capturing the malware structure into image structures which are then subject to image processing. In this paper, we propose an unconventional and novel approach to malware visualization based on its dynamical analysis, subsequent complex network conversion and fractal geometry, e.g. Julia sets visualization. Very interesting images being subsequently used to classify as malware and goodware. The classification is done by deep learning network. The results of the presented experiments of fractal conversion and subsequent classification are based on a database of 6,589,997 goodware, 827,853 potentially unwanted applications and 4,174,203 malware samples provided by ESET. 1 1 https://www.eset.com. This paper aims to show a new direction in visualizing malware using fractal geometry and possibilities in analysis and classification. [Display omitted] • Introduction of a new method for malware visualization based on fractal geometry. • Show interesting results when visualy comparing classified samples using fractal geometry. • Test novel malware image classification using deep learning. • To point out and define new research directions in visual malware analysis opened by our method. [ABSTRACT FROM AUTHOR]

• A new framework based on the PINNs is presented for bimaterial interface crack analysis. • An enriched PINNs is proposed to correctly capture the local crack-tip behavior. • The complex SIFs of interfacial cracks can be directly calculated with very high accuracy. This study explores the application of physics-informed neural networks (PINNs) to analyze interface crack problems within the context of elastic bimaterial fracture mechanics. Bimaterial interface cracks exhibit a distinct behavior compared to cracks in homogeneous materials, and this behavior often involves oscillatory phenomena that can pose challenges in numerical modeling. By employing neural networks for solution approximation, PINNs are meshless and are trained using batches of collocation points, which may be randomly or strategically sampled across the computational domain. To effectively capture the oscillatory singular behavior in the crack-tip regions, this paper introduces an enhanced PINNs formulation that enables the modeling of interface cracks without requiring any refinement near the crack-tip. The trainable parameters of the current PINNs are dynamically optimized throughout the training process to fulfill both the underlying differential equations and the associated initial/boundary conditions. One of the significant advantages of the present PINNs is that it uses enrichment functions to capture the behavior around the crack region, allowing for greater flexibility in handling irregular or complex crack paths. The method's accuracy and stability are validated across several benchmark examples. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this paper is to present a deep-learning-based beamforming method for phased array weather radars, especially whose antenna arrays are equipped with large number of elements, for fast and accurate detection of weather observations. Design/methodology/approach: The beamforming weights are computed by a convolutional neural network (CNN), which is trained with input–output pairs obtained from the Wiener solution. Findings: To validate the robustness of the CNN-based beamformer, it is compared with the traditional beamforming methods, namely, Fourier (FR) beamforming and Capon beamforming. Moreover, the CNN is compared with a radial basis function neural network (RBFNN) which is a shallow type of neural network. It is shown that the CNN method has an excellent performance in radar signal simulations compared to the other methods. In addition to simulations, the robustness of the CNN beamformer is further validated by using real weather data collected by the phased array radar at Osaka University (PAR@OU) and compared to, besides the FR and RBFNN methods, the minimum mean square error beamforming method. It is shown that the CNN has the ability to rapidly and accurately detect the reflectivity of the PAR@OU with even less clutter level in comparison to the other methods. Originality/value: Motivated by the inherit advantages of the CNN, this paper proposes the development of a CNN-based approach to the beamforming of PAR using both simulated and real data. In this paper, the CNN is trained on the optimum weights of Wiener solution. In simulations, it is applied on a large 32 × 32 planar phased array antenna. Moreover, it is operated on real data collected by the PAR@OU. [ABSTRACT FROM AUTHOR]

In the contemporary data-driven era, the fields of machine learning, deep learning, big data, statistics, and data science are essential for forecasting outcomes and getting insights from data. This paper looks at how machine learning approaches can be used to anticipate solar power generation, assess heat exchanger heat transfer efficiency, and predict the thermo-physical properties of nanofluids. The review specifically focuses on the potential use of machine learning in solar thermal applications, perovskites, and photovoltaic power forecasting. Predictions of nanofluid characteristics and device performance may be more accurately made with the development of machine learning algorithms. The use of machine learning in the creation of new perovskites and the assessment of their effectiveness and stability is also included in the review. Additionally, the paper explores developments in artificial intelligence, particularly deep learning, in this area and offers insights into techniques for forecasting solar power, including PV production, cloud motion, and weather classification. [ABSTRACT FROM AUTHOR]

Purpose: The purpose of this paper is to develop surrogate models, using deep learning (DL), that can facilitate the application of EM analysis software. In the current status quo, electrical systems can be found in an ever-increasing range of products that are part of everyone's daily live. With the advances in technology, industries such as the automotive, communications and medical devices have been disrupted with new electrical and electronic systems. The innovation and development of such systems with increasing complexity over time has been supported by the increased use of electromagnetic (EM) analysis software. Such software enables engineers to virtually design, analyze and optimize EM systems without the need for building physical prototypes, thus helping to shorten the development cycles and consequently cut costs. Design/methodology/approach: The industry standard for simulating EM problems is using either the finite difference method or the finite element method (FEM). Optimization of the design process using such methods requires significant computational resources and time. With the emergence of artificial intelligence, along with specialized tools for automatic differentiation, the use of DL has become computationally much more efficient and cheaper. These advances in machine learning have ushered in a new era in EM simulations where engineers can compute results much faster while maintaining a certain level of accuracy. Findings: This paper proposed two different models that can compute the magnetic field distribution in EM systems. The first model is based on a recurrent neural network, which is trained through a data-driven supervised learning method. The second model is an extension to the first with the incorporation of additional physics-based information to the authors' model. Such a DL model, which is constrained by the laws of physics, is known as a physics-informed neural network. The solutions when compared with the ground truth, computed using FEM, show promising accuracy for the authors' DL models while reducing the computation time and resources required, as compared to previous implementations in the literature. Originality/value: The paper proposes a neural network architecture and is trained with two different learning methodologies, namely, supervised and physics-based. The working of the network along with the different learning methodologies is validated over several EM problems with varying levels of complexity. Furthermore, a comparative study is performed regarding performance accuracy and computational cost to establish the efficacy of different architectures and learning methodologies. [ABSTRACT FROM AUTHOR]

Today's wireless technologies are largely based on inflexible designs, which make them inefficient and prone to a variety of wireless attacks. To address this key issue, wireless receivers will need to (i) infer on-the-fly the physical layer parameters currently used by transmitters; and if needed, (ii) change their hardware and software structures to demodulate the incoming waveform. In this paper, we introduce PolymoRF, a deep learning-based polymorphic receiver able to reconfigure itself in real time based on the inferred waveform parameters. Our key technical innovations are (i) a novel embedded deep learning architecture, called RFNet, which enables the solution of key waveform inference problems, and (ii) a generalized hardware/software architecture that integrates RFNet with radio components and signal processing. We prototype PolymoRF on a custom software-defined radio platform and show through extensive over-the-air experiments that PolymoRF achieves throughput within 87% of a perfect-knowledge Oracle system, thus demonstrating for the first time that polymorphic receivers are feasible. [ABSTRACT FROM AUTHOR]

Condition-based maintenance (CBM) policy can avoid premature or late maintenance and reduce system failures and maintenance costs. Most existing CBM studies cannot solve the dimensional disaster problem in multi-component complex systems. Only some studies consider the constraint of maintenance resources when searching for the optimal maintenance policy, which is hard to apply to practical maintenance. This paper studies the joint optimization of the CBM policy and spare components inventory for the multi-component system in large state and action spaces. We use Markov Decision Process to model it and propose an improved deep reinforcement learning algorithm based on the stochastic policy and actor-critic framework. In this algorithm, factorization decomposes the system action into the linear combination of each component's action. The experimental results show that the algorithm proposed in this paper has better time performance and lower system cost compared with other benchmark algorithms. The training time of the former is only 28.5% and 9.12% of that of PPO and DQN algorithms, and the corresponding system cost is decreased by 17.39% and 27.95%, respectively. At the same time, our algorithm has good scalability and is suitable for solving Markov decision-making problems in large-scale state and action space. • Considering minor and major repair, we model the joint optimization of CBM and spare ordering for large multi-component systems based on MDP. • An improved DRL algorithm is presented to deal with the MDP model in large-scale discrete state and action space. • We validate our DRL algorithm has good time performance and optimal decision-making series solution via comparisons with DQN and PPO algorithm. [ABSTRACT FROM AUTHOR]

Data augmentation strategies have always been important in machine learning techniques and play a unique role in model performance optimization processes. Therefore, in recent years, these techniques have become popular in the artificial intelligence field. In this paper, a new data augmentation strategy is proposed based on the interpretation algorithm of deep convolutional neural networks, i.e., constructing new training samples by deeply exploiting key features extracted from interpretable networks to achieve sample augmentation. Thus, a novel supervised data augmentation approach known as Supervised Data Augmentation–Key Feature Extraction (SDA-KFE) was proposed. By introducing the Neural Network Interpreter-Segmentation Recognition and Interpretation (NNI-SRI) algorithm, an augmentation strategy is proposed that can balance the high accuracy and high robustness of the final model while ensuring a large amount of data augmentation. The advantages of the SDA-KFE algorithm are mainly reflected in the following aspects. First, it is easy to implement. This algorithm is implemented based on the lightweight NNI-SRI algorithm, which lays the foundation for the implementation of SDA-KFE so that it can be easily implemented on convolutional neural networks. Second, this model, which is widely applicable, can be applied to almost any deep convolutional network. Through research and experiments on this proposed algorithm, SDA-KFE can be applied in graphical image binary classification and multiclassification models. Third, SDA-KFE can rapidly construct data samples with diverse variations. Under the premise of determining the classification labels of the generated samples, the distribution of the feature unit composition of the samples can be controlled. Compared with traditional data augmentation methods, SDA-KFE can control the direction of the model performance, i.e., the balance between the pursuit of high accuracy and robust performance of the model. Therefore, the novel supervised augmentation approach proposed in this paper is relevant for optimizing deep convolutional neural networks, solving model overfitting, augmenting data types, etc. The data augmentation algorithm proposed in this paper can be regarded as a useful supplement to traditional data augmentation methods, such as horizontal or vertical image flipping, cropping, color transformation, extension and rotation. [ABSTRACT FROM AUTHOR]

In this paper, we construct two deep neural network (DNN) approaches based on the hybridized discontinuous Galerkin (HDG) method for solving some elliptic problems. The main idea is to use an HDG scheme for spatial discretization and then estimate solutions using the deep learning idea. In fact, by employing DNN, we can achieve robust methods compared to classical methods for solving noisy and high-dimensional problems. A brief analysis shows that the loss functions corresponding to the proposed methods, which are called DNN-HDG-I and DNN-HDG-II, converge to zero as the mesh step size reduces. By testing several examples in one, two, and three dimensions, we demonstrate the performance of the proposed methods that show their apparent advantages especially compared to classical HDG methods. As we expected, the DNN-HDG methods can efficiently and accurately extract the pattern of the solutions in all three dimensions. To show the superiority of the proposed schemes, the DNN-HDG methods are compared with the classical HDG method for solving a problem involving some noisy data. Specifically, we employ the proposed methods for solving a problem which its exact solution is not accessible and compare it with the HDG solution. In this paper, the uniformly random data and Jacobi polynomial roots are considered, respectively, as the training data on the boundary and quadrature points for approximating integrals. Also, we find that the proposed methods are not required a high number of neurons (at most 30) and hidden layers (at most 10) for satisfactory results with acceptable accuracy. [ABSTRACT FROM AUTHOR]

Explainable Artificial Intelligence (XAI) is targeted at understanding how models perform feature selection and derive their classification decisions. This paper explores post-hoc explanations for deep neural networks in the audio domain. Notably, we present a novel Open Source audio dataset consisting of 30,000 audio samples of English spoken digits which we use for classification tasks on spoken digits and speakers' biological sex. We use the popular XAI technique Layer-wise Relevance Propagation LRP to identify relevant features for two neural network architectures that process either waveform or spectrogram representations of the data. Based on the relevance scores obtained from LRP, hypotheses about the neural networks' feature selection are derived and subsequently tested through systematic manipulations of the input data. Further, we take a step beyond visual explanations and introduce audible heatmaps. We demonstrate the superior interpretability of audible explanations over visual ones in a human user study. • We present a novel audio dataset consisting of 30,000 audio samples of spoken digits. • We use LRP to explain predictions of two different models in the audio domain. • We confirm hypotheses about the neural networks' use of features from explanations. • We present audible explanations and demonstrate their superior interpretability. [ABSTRACT FROM AUTHOR]

Deep learning, with its powerful multilayer nonlinear representation of deep neural networks, enables models trained based on deep learning to describe the true distribution of data more accurately and thus have better generalization capabilities. However, the training data are usually assumed to obey independent identical distribution. Industrial process data nowadays usually have complex characteristics such as non-Gaussian, nonlinear, dynamic, strong correlation, and high-dimensional, which make it difficult to meet the assumptions of deep learning. Using industrial process data directly would result in low model accuracy and bias in the model output. This paper proposes a fault diagnosis method based on independent slow feature analysis (ISFA) and stacked sparse autoencoder (SSAE) network. The statistical properties possessed by ISFA are used to perform preliminary feature extraction of industrial process data, and then the extracted preliminary features are input to the SSAE network for fine-grained feature extraction. The proposed two-step feature extraction method not only makes the data input to the SSAE network as close as possible to obey independent identical distribution and provides convincing fault diagnosis results, but also makes full use of the powerful feature extraction capability of the SSAE network, which makes the proposed method also significantly improve the detection accuracy of incipient faults. The feasibility and superiority of the proposed method is verified through the TE process. • A two-step feature extraction fault diagnosis method is proposed. • Higher-order information and finer-grained features can be extracted. • The performance of both fault detection and classification has been validated. [ABSTRACT FROM AUTHOR]

Purpose: The stock indexes are an important issue for investors, and in this paper good trading strategies will be aimed to be adopted according to the accurate prediction of the stock indexes to chase high returns. Design/methodology/approach: To avoid the problem of insufficient financial data for daily stock indexes prediction during modeling, a data augmentation method based on time scale transformation (DATT) was introduced. After that, a new deep learning model which combined DATT and NGRU (DATT-nested gated recurrent units (NGRU)) was proposed for stock indexes prediction. The proposed models and their competitive models were used to test the stock indexes prediction and simulated trading in five stock markets of China and the United States. Findings: The experimental results demonstrated that both NGRU and DATT-NGRU outperformed the other recurrent neural network (RNN) models in the daily stock indexes prediction. Originality/value: A novel RNN with NGRU and data augmentation is proposed. It uses the nested structure to increase the depth of the deep learning model. [ABSTRACT FROM AUTHOR]

Moisture diffusion is a common phenomenon in geotechnical engineering, and its induced deformation seriously affects the stability of the engineering structure, such as embankment slope instability and tunnel surrounding rock deformation. Numerical simulation is an effective method for moisture diffusion-deformation coupling computation, but it has a large computational cost and a high learning threshold for ordinary engineers. In this paper, a surrogate model based on deep convolutional neural networks is presented for moisture diffusion-deformation coupling computation. First, designing the neural network structure includes the dense blocks and transition layers, and hyperparameters. Then, the moisture diffusion-deformation coupling model in the finite discrete element method (FDEM) software package MultiFracS is used to obtain the high-fidelity simulation data for the moisture diffusion-deformation examples. The simulation data and the key parameter (elastic modulus and Poisson's ratio) are processed into the image data structure (matrix) for training the surrogate model. Finally, the root means square error and the correlation coefficient are used to evaluate the effectiveness of the surrogate model. The results reveal that, rather than taking several hours to run a numerical model, the surrogate model only takes a few seconds to obtain the deformation and stress under a given moisture field and material parameters, which significantly improves prediction efficiency. Using this surrogate model, the engineers can obtain the deformation law just only modifying key parameters. Moreover, the surrogate model can be packaged into a mobile app to provide support for rapid decision-making on the project site. [ABSTRACT FROM AUTHOR]

Small Seal script (Chinese called XiaoZhuan), as the earliest archaic form of standardized Chinese script, is the predecessor of modern Chinese characters. However, the Small Seal character recognition remains a challenging task, due to various un-/semi-structured pictographic glyphs and writing styles. This paper proposes a style-independent pictographic radical decomposition for the zero-shot recognition of Small Seal script, by taking advantage of the inherent consistency of pictographic representations between the Small Seal script and the Traditional Chinese script (Chinese called Fanti). Specifically, we design a feature-level collaboration framework of two tasks. One is the XiaoZhuan-to-Fanti translation task, which employs a generative adversarial network (GAN) based dual-learning mechanism to learn style-independent and consistent pictographic feature representations from different styles of Small Seal and their corresponding Traditional Chinese characters. The other is a transformer-based pictographic radical sequence learning from the pictographic feature representations. Experiments demonstrate that our model has satisfactory recognition ability to various styles of Small Seal scripts, especially for the zero-shot recognition of those with unknown glyphs and unseen styles. The code is available at https://github.com/windyz77/SmallSealRecon. [ABSTRACT FROM AUTHOR]

Purpose: Stock market forecasters are focusing to create a positive approach for predicting the stock price. The fundamental principle of an effective stock market prediction is not only to produce the maximum outcomes but also to reduce the unreliable stock price estimate. In the stock market, sentiment analysis enables people for making educated decisions regarding the investment in a business. Moreover, the stock analysis identifies the business of an organization or a company. In fact, the prediction of stock prices is more complex due to high volatile nature that varies a large range of investor sentiment, economic and political factors, changes in leadership and other factors. This prediction often becomes ineffective, while considering only the historical data or textural information. Attempts are made to make the prediction more precise with the news sentiment along with the stock price information. Design/methodology/approach: This paper introduces a prediction framework via sentiment analysis. Thereby, the stock data and news sentiment data are also considered. From the stock data, technical indicator-based features like moving average convergence divergence (MACD), relative strength index (RSI) and moving average (MA) are extracted. At the same time, the news data are processed to determine the sentiments by certain processes like (1) pre-processing, where keyword extraction and sentiment categorization process takes place; (2) keyword extraction, where WordNet and sentiment categorization process is done; (3) feature extraction, where Proposed holoentropy based features is extracted. (4) Classification, deep neural network is used that returns the sentiment output. To make the system more accurate on predicting the sentiment, the training of NN is carried out by self-improved whale optimization algorithm (SIWOA). Finally, optimized deep belief network (DBN) is used to predict the stock that considers the features of stock data and sentiment results from news data. Here, the weights of DBN are tuned by the new SIWOA. Findings: The performance of the adopted scheme is computed over the existing models in terms of certain measures. The stock dataset includes two companies such as Reliance Communications and Relaxo Footwear. In addition, each company consists of three datasets (a) in daily option, set start day 1-1-2019 and end day 1-12-2020, (b) in monthly option, set start Jan 2000 and end Dec 2020 and (c) in yearly option, set year 2000. Moreover, the adopted NN + DBN + SIWOA model was computed over the traditional classifiers like LSTM, NN + RF, NN + MLP and NN + SVM; also, it was compared over the existing optimization algorithms like NN + DBN + MFO, NN + DBN + CSA, NN + DBN + WOA and NN + DBN + PSO, correspondingly. Further, the performance was calculated based on the learning percentage that ranges from 60, 70, 80 and 90 in terms of certain measures like MAE, MSE and RMSE for six datasets. On observing the graph, the MAE of the adopted NN + DBN + SIWOA model was 91.67, 80, 91.11 and 93.33% superior to the existing classifiers like LSTM, NN + RF, NN + MLP and NN + SVM, respectively for dataset 1. The proposed NN + DBN + SIWOA method holds minimum MAE value of (∼0.21) at learning percentage 80 for dataset 1; whereas, the traditional models holds the value for NN + DBN + CSA (∼1.20), NN + DBN + MFO (∼1.21), NN + DBN + PSO (∼0.23) and NN + DBN + WOA (∼0.25), respectively. From the table, it was clear that the RMSRE of the proposed NN + DBN + SIWOA model was 3.14, 1.08, 1.38 and 15.28% better than the existing classifiers like LSTM, NN + RF, NN + MLP and NN + SVM, respectively, for dataset 6. In addition, he MSE of the adopted NN + DBN + SIWOA method attain lower values (∼54944.41) for dataset 2 than other existing schemes like NN + DBN + CSA(∼9.43), NN + DBN + MFO (∼56728.68), NN + DBN + PSO (∼2.95) and NN + DBN + WOA (∼56767.88), respectively. Originality/value: This paper has introduced a prediction framework via sentiment analysis. Thereby, along with the stock data and news sentiment data were also considered. From the stock data, technical indicator based features like MACD, RSI and MA are extracted. Therefore, the proposed work was said to be much appropriate for stock market prediction. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new deep learning algorithm based on the physics-informed neural network (PINN) for solving the Cahn–Hilliard (CH) equations. We adopt the discrete time model of the PINN and use Runge–Kutta methods to discretize the time variable. We introduce a novel loss function and update it at each time step so that the computational cost can be significantly reduced compared to some existing methods. Numerical results of several one-dimensional and two-dimensional CH equations are presented to validate the efficiency and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

Purpose: With the rapid development of the financial market, stock index futures have been the one of important financial instruments. Predicting stock index futures accurately can bring considerable benefits for investors. However, traditional models do not perform well in stock index futures forecasting. This study put forward a novel hybrid model to improve the predictive accuracy of stock index futures. Design/methodology/approach: This study put forward a multivariate deep learning framework based on extreme gradient boosting (XGBoost) for stock index futures price forecasting. First, the original sequences were decomposed into several sub-sequences by variational mode decomposition (VMD), and these sub-sequences were reconstructed by sample entropy (SE). Second, the gradient boosting decision tree (GBDT) was used to rank the feature importance of influential factors, and the top influential factors were chosen for further prediction. Next, reconstructed sequence and the multiple factors screened were input into the bidirectional gate recurring unit (BiGRU) for modeling. Finally, XGBoost was used to integrate the modeling results. Findings: For the sake of examining the robustness of the proposed model, CSI 500 stock index futures, NASDAQ 100 index futures, FTSE 100 index futures and CAC 40 index futures are selected as sample data. The empirical consequences demonstrate that the proposed model can serve as an effective tool for stock index futures prediction. In other words, the proposed model can improve the accuracy of stock index futures. Originality/value: In this paper, an innovative hybrid model is proposed to enhance the predictive accuracy of stock index futures. Meanwhile, this method can be applied in other financial products prediction to achieve better forecasting results. [ABSTRACT FROM AUTHOR]

Purpose: The bank is termed as an imperative part of the marketing economy. The failure or success of an institution relies on the ability of industries to compute the credit risk. The loan eligibility prediction model utilizes analysis method that adapts past and current information of credit user to make prediction. However, precise loan prediction with risk and assessment analysis is a major challenge in loan eligibility prediction. Design/methodology/approach: This aim of the research technique is to present a new method, namely Social Border Collie Optimization (SBCO)-based deep neuro fuzzy network for loan eligibility prediction. In this method, box cox transformation is employed on input loan data to create the data apt for further processing. The transformed data utilize the wrapper-based feature selection to choose suitable features to boost the performance of loan eligibility calculation. Once the features are chosen, the naive Bayes (NB) is adapted for feature fusion. In NB training, the classifier builds probability index table with the help of input data features and groups values. Here, the testing of NB classifier is done using posterior probability ratio considering conditional probability of normalization constant with class evidence. Finally, the loan eligibility prediction is achieved by deep neuro fuzzy network, which is trained with designed SBCO. Here, the SBCO is devised by combining the social ski driver (SSD) algorithm and Border Collie Optimization (BCO) to produce the most precise result. Findings: The analysis is achieved by accuracy, sensitivity and specificity parameter by. The designed method performs with the highest accuracy of 95%, sensitivity and specificity of 95.4 and 97.3%, when compared to the existing methods, such as fuzzy neural network (Fuzzy NN), multiple partial least squares regression model (Multi_PLS), instance-based entropy fuzzy support vector machine (IEFSVM), deep recurrent neural network (Deep RNN), whale social optimization algorithm-based deep RNN (WSOA-based Deep RNN). Originality/value: This paper devises SBCO-based deep neuro fuzzy network for predicting loan eligibility. Here, the deep neuro fuzzy network is trained with proposed SBCO, which is devised by combining the SSD and BCO to produce most precise result for loan eligibility prediction. [ABSTRACT FROM AUTHOR]

Multimodal emotion recognition, that is, emotion recognition uses machine learning to generate multi-modal features on the basis of videos which has become a research hotspot in the field of artificial intelligence. Traditional multi-modal emotion recognition method only simply connects multiple modalities, and the interactive utilization rate of modal information is low, and it cannot reflect the real emotion under the conflict of modal features well. This article first proves that effective weighting can improve the discrimination between modalities. Therefore, this paper takes into account the importance differences between multiple modalities, and assigns weights to them through the importance attention network. At the same time, considering that there is a certain complementary relationship between the modalities, this paper constructs an attention network with complementary modalities. Finally, the reconstructed features are fused to obtain a multi-modal feature with good interaction. The method proposed in this paper is compared with traditional methods in public datasets. The test results show that our method is accurate in It performs well in both the rate and confusion matrix metrics. [ABSTRACT FROM AUTHOR]

Thin-walled structural problems have been a longstanding computational challenge. The research bottleneck in applying the standard numerical methods for such problems arises from their special geometrical configurations in which the thickness-to-length ratio of the thin-structures is usually up to the order of 10−6 or even smaller. In this paper, we present a method to solve such problems using physics-informed neural networks (PINNs) which are trained to satisfy the differential operator and the corresponding boundary/initial conditions. The PINNs-based method is meshless which is a key feature since mesh-based methods become infeasible for problems with ultra-thin shapes. Instead of using a mesh, the PINNs are trained on batches of randomly sampled collocation points. The algorithm is tested for a class of thin-walled structural problems, including elastic/piezoelectric thin-films as well as ultra-thin coating/substrate structures. We also present comparisons with numerical solutions obtained by using an advanced boundary element method (BEM). Accurate and reliable PINNs results can be achieved for a relative thickness-to-length ratio of the thin structures as small as 10−8, which is sufficient for modeling most of thin structures as used in smart materials. A self-contained MATLAB code and data-sets accompanying this paper are also provided. [ABSTRACT FROM AUTHOR]

Deep learning training involves a large number of operations, which are dominated by high dimensionality Matrix-Vector Multiplies (MVMs). This has motivated hardware accelerators to enhance compute efficiency, but where data movement and accessing are proving to be key bottlenecks. In-Memory Computing (IMC) is an approach with the potential to overcome this, whereby computations are performed in-place within dense 2-D memory. However, IMC fundamentally trades efficiency and throughput gains for dynamic-range limitations, raising distinct challenges for training, where compute precision requirements are seen to be substantially higher than for inferencing. This paper explores training on IMC hardware by leveraging two recent developments: (1) a training algorithm enabling aggressive quantization through a radix-4 number representation; (2) IMC leveraging compute based on precision capacitors, whereby analog noise effects can be made well below quantization effects. Energy modeling calibrated to a measured silicon prototype implemented in 16 nm CMOS shows that energy savings of over $400\times $ can be achieved with full quantizer adaptability, where all training MVMs can be mapped to IMC, and $3\times $ can be achieved for two-level quantizer adaptability, where two of the three training MVMs can be mapped to IMC. [ABSTRACT FROM AUTHOR]

• Local and global self-attention mechanisms are used for character embedding. • CNN with multi-size filters are used to extract character information for NER. • A cross-attention method that fuses character and word embedding for NER is proposed • A modified Mogrifier LSTM is presented to improve the performance of NER. • Proposed methods integrated with a transformer-based model achieve good performance. Clinical and biomedical concept extraction is critical in medical analysis using clinical and biomedical documents from professional literature, EHRs and PHRs. Named entity recognition (NER) accurately marks essential information in the literature based on the characteristics of the target entity, providing a method for extracting clinical and biomedical concepts. The performance of NER is heavily embedding-dependent, so recent studies have proposed the method of generating word embedding from character-level information, which can strengthen the representation ability for word embedding. In this paper, we present a novel neural network model including an attention mechanism network and a convolutional neural network (CNN) to further improve character-level embedding. First, an attention mechanism is applied simultaneously to the local and global character embedding. Then, a CNN with multi-size filters is used to extract more information from the character level, which can capture more meaningful features from words with various lengths. In addition, a cross-attention method is used to leverage the interaction between word embedding and character embedding to generate the final word representation. Finally, we modified Mogrifier LSTM to make it suitable for NER tasks and integrated it into our model. Experimental results show that our method is effective and that the model performs better than the baseline models. We also apply our methods proposed in this paper to the transformer-based model and obtain a 90.36 F1-score on NCBI-Disease. [ABSTRACT FROM AUTHOR]

Designing a Convolutional Neural Networks (CNN) is a complex task and requires expert knowledge to optimize the performance and network architecture. In this paper, a novel data-driven approach is proposed to determine the architecture of CNN models. The proposed Autonomous Convolutional Neural Networks (AutoCNNThe executable code and original numerical results can be downloaded from (https://tinyurl.com/AutoCNN)) algorithm introduces data driven strategies for addition of new convolutional layers, pruning of redundant filters and training cycle optimization. AutoCNN is evaluated using MNIST, MNIST-rot-back-image, Fashion MNIST and the ADHD200 datasets to measure the performance on small datasets with varied feature distributions. The results indicate that AutoCNN optimizes the CNN network architecture and helps maximise the classification performance. The data-driven network determination approach introduced in this paper was found to not only provides competitive performance similar to existing evolutionary computation based network determination algorithms in literature, but was found to be an effective optimization tool to improve the performance of existing CNN architectures. Further, the AutoCNN was found to highly immune to noise in the dataset and has proven to be effective method to transfer knowledge between related datasets. Therefore, the AutoCNN is a highly versatile CNN architecture determination tool that has a wide range of applications in the field of autonomous driving, medical image analysis, image enhancement, camera based security monitoring and image based fault detection. [ABSTRACT FROM AUTHOR]

Generative models have emerged as potential tools for creating high-quality images, videos, and text. This paper explores the application of generative models in automating vlog content creation. It addresses both static and dynamic visual elements, eliminating the need for human intervention. Traditional vlogs often require specific environmental conditions and proper lighting for the vlog creation. To streamline this process, an automated system utilizing the generative models is proposed here. Generative models excel at generating realistic content that seamlessly integrates with real-world content. They enhance overall video quality and introduce creative elements by generating new scenes and backgrounds. This paper categorizes various generative modeling techniques based on frame elements and foreground-background conditions. It offers a comparative analysis of different generative model variants tailored for specific objectives. Furthermore, the paper reviews existing research on generative models for video and image content generation, visual quality enhancement, diversity, and coherence outcomes. Additionally, the paper highlights practical uses of the generative model for content creation in various contexts, such as face swapping, scene translation, and virtual content insertion. The paper also examines the public datasets used to train generative models. These datasets contain diverse visual content such as celebrity images, urban landscapes, and everyday scenes. [ABSTRACT FROM AUTHOR]

Recent researches show that deep learning model is susceptible to backdoor attacks. Many defenses against backdoor attacks have been proposed. However, existing defense works require high computational overhead or backdoor attack information such as the trigger size. In this paper, we propose a novel backdoor detection method based on intentional adversarial perturbations. The proposed method leverages intentional adversarial perturbation to detect whether an image contains a trigger, which can be applied in both the training stage and the inference stage (sanitize the training set in training stage or detect the backdoor instances in inference stage). Specifically, given an untrusted image, the adversarial perturbation is added to the image intentionally. If the prediction of the model on the perturbed image is consistent with that on the unperturbed image, the input image will be considered as a backdoor instance. Compared with most existing defense works, the proposed method is faster and introduces less computational overhead during backdoor detection process. Moreover, the proposed method maintains the visual quality of the image (as the ℓ 2 norm of the added perturbation is as low as 2.8715, 3.0513 and 2.4362 on Fashion-MNIST, CIFAR-10 and GTSRB datasets, respectively). Experimental results show that, for general backdoor attack, the backdoor detection rate of the proposed defense method is 99.63%, 99.76% and 99.91% on Fashion-MNIST, CIFAR-10 and GTSRB datasets, respectively. For invisible backdoor attack, the backdoor detection rate of the proposed defense method is 99.75% against blended backdoor attack and 98.00% against sample-specific backdoor attack. It is also demonstrated that the proposed method can achieve high defense performance against backdoor attacks under different attack settings (trigger transparency, trigger size and trigger pattern). In addition, the experimental comparison with related work demonstrates that the proposed method has better detection performance and higher detection efficiency. [ABSTRACT FROM AUTHOR]

Usually, manual labeling of large-scale electrocardiograms (ECGs) for deep learning is always expensive, as it requires considerable effort and time from cardiologists. Currently, contrastive learning can utilize unlabeled ECGs to improve deep learning using insufficient labels. However, this field may still lack instructive literature. In this paper, a dense lead contrast (DLC) is proposed for effective contrastive learning on multilead ECGs. It develops contrastive learning between any two leads from different views to explore intralead and interlead invariance. A joint loss combining intralead and interlead contrastive loss guides the DLC pretraining. Moreover, DLC introduces a multibranch network (MBN) for contrastive learning, generates a representation for each lead, and fuses all the leads for a global representation. In the downstream tasks, DLC outperforms the standard contrastive learning paradigm of multilead ECGs by 2.78%∼6.59% in AUROC (linear probe). Using only 10% of the labeled training data, it still outperforms standard contrastive learning by a significant margin in AUROC. Compared with existing methods, DLC shows obvious advantages in all the experiments. Therefore, DLC may be more suitable for the contrastive learning of multilead ECGs. Its good performance based on insufficient labels can alleviate the cardiologists' burden from data labeling. • Dense lead contrast (DLC) conducts an effective self-supervised pre-training. • DLC jointly explores intra- and inter-lead invariance of electrocardiograms (ECGs). • Multiple branch network (MBN) architecture organizes all the leads. • Raw ECGs from a real-world hospital are used to validate algorithm robustness. [ABSTRACT FROM AUTHOR]

• Proposing a new deep learning model for accurately detecting cyber threats to extract a feature representation and learn temporal information from cybersecurity data sequences. • Decreasing the learning rate of the Adam optimizer exponentially to improve its exploitation operator when it cannot improve in the validation loss within several epochs. • Evaluating the proposed model's performance, DeepAK-IoT uses three datasets, two of which are aggregated using heterogeneous data sources, to assess its ability to detect the malicious code that can threaten IoT sources. • Refining DeepAK-IoT provides greater accuracy for the validated datasets, superior to three contemporary models. Our daily lives have been profoundly changed over the past few years owing to the growing presence of the Internet of Things (IoT). Importantly, IoT makes our lives more convenient, simpler, and more efficient; however, gadgets are vulnerable to a wide variety of cyberattacks due to the lack of robust security mechanisms and hardware security support. This paper presents an alternative deep learning model known as DeepAK-IoT to detect cyberattacks against IoT devices. DeepAK-IoT uses three blocks as its foundation: the residual-based-spatial representation (RSR) block, the temporal representation block (TRB), and the detection block (DB). The RSR block uses five residual blocks to extract a feature representation from the output of the preceding layer. The four convolutional layers are connected in parallel with a skip connection within each block to avoid vanishing or exploding gradients. Then, the second block uses the extracted spatial representation to learn a temporal representation to detect cyber threats. The final block decides how to classify the input record. We evaluated the accuracy and generalization ability of DeepAK-IoT using three well-known public datasets: TON-IoT, Edge-IIoTset, and UNSW-NB15. The proposed model was compared to three state-of-the-art deep learning models to demonstrate its effectiveness in detecting cyber threats in IoT systems. According to the experimental results, DeepAK-IoT was found to be a powerful alternative model for managing cyber threats in IoT networks, as it provided 90.57% accuracy for TON IoT, 94.96% for Edge-IIoTset, and 98.41% for UNSW NB15. [ABSTRACT FROM AUTHOR]

The training effect of the neural network model is directly influenced by optimization algorithms. The Barzilai-Borwein(BB) method is used in the stochastic gradient descent (SGD) and other deep learning optimization algorithms because of its outstanding performance in terms of convergence speed. In order to improve the stability of BB step size and the output quality of network model in deep learning, this paper presents two improved optimization algorithms based on the BB method: BBbound and AdaBBbound. BBbound reduces the floating BB step size by generating the upper bound of the step in the current iteration. It avoids the occasional occurrence of long steps; AdaBBbound is an adaptive gradient method based on BB method with dynamic bound. The algorithm has a fast convergence effect in the early stage, then calculates learning rate and smoothly transitions to SGD by setting the better conditions of the BB method. We analyzed the performance of the two algorithms based on the initial conditions and the learning rate change curve. Meanwhile, we tested our algorithms on popular network models such as ResNet and DenseNet. The results showed that the new optimization algorithms have achieved high stability and significantly improved the performance of the network model. [ABSTRACT FROM AUTHOR]

To further enhance the reliability of Machine Learning (ML) systems, considerable efforts have been dedicated to developing privacy protection techniques. Recently, membership privacy has gained increasing attention, with a focus on determining whether a specific data point is present in the confidential training set of an ML model. However, most current attacks only prioritize attack accuracy and fail to extend their range to the evidence that contributes to the member/non-member classification. This limitation greatly reduces the practicality of Membership Inference Attacks (MIA), as real-world data typically includes multiple features, making it challenging to identify which features are involved in the sensitive training set. Therefore, this paper targets one of the fundamental challenges in membership inference attack: measuring the distance between an attack sample and a member sample. Specifically, we propose a novel threat model called Membership Reconstruction Attack (MRA), which aims to reconstruct the exact distribution of the target training set. MRA achieves this by marking each input dimension (e.g., pixels) according to its similarity to the target dataset in feature space. Our attack demonstrates its effectiveness across various settings, including different major datasets (MNIST, CIFAR-10, CIFAR-100) and different model architectures (AlexNet, ResNet, DenseNet, and generative models). Additionally, we evaluate MRA from the defenders' perspective and test several defense approaches against our attack. [ABSTRACT FROM AUTHOR]

This issue of DeepFake technique that may cause great threat to privacy, democracy, and national security has attracted the attention of deep learning researchers. DeepFake detection, therefore, has been a very hot issue in deep learning research. The face landmark feature maps are often used by many DeepFake approaches in generating fake faces. It also provides key information to help to detect manipulated face images. In this paper, we propose a detection approach for manipulated face images. To make full use of face landmark information, we propose a facial geometry prior module (FGPM) to extract facial geometry feature maps. Then the facial geometry feature maps are embedded into upsampling feature maps generated by the CNN-LSTM network. The proposed FGPM exploits facial maps and frequency domain correlation to analyze the discriminative characteristics between manipulated and non-manipulated regions by incorporating the CNN-LSTM network. Finally, a decoder is used to learn the mapping from low-resolution feature maps to pixel-wise to predict manipulation localization. Or a softmax classifier is used to predict real or fake face images. By experimenting on several popular datasets, the proposed detection model has demonstrated the capability of localizing manipulation at the pixel level and with a high prediction on real or fake face images. • Propose a manipulated face detection model which predicts fake face in pix-lever. • Facial geometry feature maps are used in predicting fake face. • Propose a CNN-LSTM network to discriminate manipulated face images. [ABSTRACT FROM AUTHOR]

Recently, 3D deep learning models have been shown to be susceptible to adversarial attacks like their 2D counterparts. Most of the state-of-the-art (SOTA) 3D adversarial attacks perform perturbation to 3D point clouds. To reproduce these attacks in the physical scenario, a generated adversarial 3D point cloud needs to be reconstructed to mesh, which leads to a significant drop in its adversarial effect. In this paper, we propose a strong 3D adversarial attack named Mesh Attack to address this problem by directly performing perturbation on mesh of a 3D object. In order to take advantage of the most effective gradient-based attack, a differentiable sample module that back-propagate the gradient of point cloud to mesh is introduced. To further ensure the adversarial mesh examples without outlier and 3D printable, three mesh losses are adopted. Extensive experiments demonstrate that the proposed scheme outperforms SOTA 3D attacks by a significant margin. We also achieved SOTA performance under various defenses. Our code will be available at: https://github.com/cuge1995/Mesh-Attack. [ABSTRACT FROM AUTHOR]

Current research on machine learning-based intelligent routing focuses on algorithm design and performance optimization. How to deploy it in practice remains a pressing issue. Existing deep learning-based intelligent routing algorithms suffer from a high computational cost, which is hard to be afforded by routers. Considering that the cloud can assist the routers with limited resources to handle complex computation, outsourcing deep learning-based intelligent routing computations to the cloud becomes a feasible solution to support intelligent routing. However, due to the untrustworthiness of the cloud, it is necessary for the routers to verify the truth of outsourced routing results. However, the literature has not yet explored this issue. In this paper, we proposed VeriORouting, a scheme to verify the correctness of outsourced deep learning-based intelligent routing results provided by the cloud. Facing a lazy cloud, VeriORouting allows routers to check the reliability of intelligent routing models by testing model accuracy, and to verify the routing results returned by the cloud without knowing the model by using verification functions generated with multilayer perceptron (MLP) and locality-sensitive hashing (LSH) in advance. We show the robustness of VeriORouting under two attacks raised by the cloud. We evaluate the performance of VeriORouting and compare it with a local intelligent routing scheme. The results show that VeriORouting outperforms the local scheme in terms of computational overhead and storage overhead, especially when the number of routers in the network increases. In terms of communication, VeriORouting reduces communication overhead between routers compared to the local scheme. In addition, we measure the verification performance of VeriORouting under a random attack. VeriORouting achieves a detection success rate of 73% with a false positive rate of 3%, and a detection success rate of 90% with a false positive rate of 25%. • The first scheme to verify deep learning-based intelligent routing outsourced to the cloud. • A mechanism for timely network state information transmission with validation. • A new routing table to reduce redundant executions of verification. • Resistance to two possible attacks from a lazy cloud and advance for practical deployment. [ABSTRACT FROM AUTHOR]

Purpose: Questionnaire studies of knowledge, attitude and practice (KAP) are effective research in the field of health, which have many shortcomings. The purpose of this research is to propose an automatic questionnaire-free method based on deep learning techniques to address the shortcomings of common methods. Next, the aim of this research is to use the proposed method with public comments on Twitter to get the gaps in KAP of people regarding COVID-19. Design/methodology/approach: In this paper, two models are proposed to achieve the mentioned purposes, the first one for attitude and the other for people's knowledge and practice. First, the authors collect some tweets from Twitter and label them. After that, the authors preprocess the collected textual data. Then, the text representation vector for each tweet is extracted using BERT-BiGRU or XLNet-GRU. Finally, for the knowledge and practice problem, a multi-label classifier with 16 classes representing health guidelines is proposed. Also, for the attitude problem, a multi-class classifier with three classes (positive, negative and neutral) is proposed. Findings: Labeling quality has a direct relationship with the performance of the final model, the authors calculated the inter-rater reliability using the Krippendorf alpha coefficient, which shows the reliability of the assessment in both problems. In the problem of knowledge and practice, 87% and in the problem of people's attitude, 95% agreement was reached. The high agreement obtained indicates the reliability of the dataset and warrants the assessment. The proposed models in both problems were evaluated with some metrics, which shows that both proposed models perform better than the common methods. Our analyses for KAP are more efficient than questionnaire methods. Our method has solved many shortcomings of questionnaires, the most important of which is increasing the speed of evaluation, increasing the studied population and receiving reliable opinions to get accurate results. Research limitations/implications: Our research is based on social network datasets. This data cannot provide the possibility to discover the public information of users definitively. Addressing this limitation can have a lot of complexity and little certainty, so in this research, the authors presented our final analysis independent of the public information of users. Practical implications: Combining recurrent neural networks with methods based on the attention mechanism improves the performance of the model and solves the need for large training data. Also, using these methods is effective in the process of improving the implementation of KAP research and eliminating its shortcomings. These results can be used in other text processing tasks and cause their improvement. The results of the analysis on the attitude, practice and knowledge of people regarding the health guidelines lead to the effective planning and implementation of health decisions and interventions and required training by health institutions. The results of this research show the effective relationship between attitude, practice and knowledge. People are better at following health guidelines than being aware of COVID-19. Despite many tensions during the epidemic, most people still discuss the issue with a positive attitude. Originality/value: To the best of our knowledge, so far, no text processing-based method has been proposed to perform KAP research. Also, our method benefits from the most valuable data of today's era (i.e. social networks), which is the expression of people's experiences, facts and free opinions. Therefore, our final analysis provides more realistic results. [ABSTRACT FROM AUTHOR]

Ambient intelligence (AmI) systems aim to provide users with context-aware assistance services intended to improve the quality of their lives in terms of autonomy, safety, and well-being. Taking the uncertainty and partial observability of these environments into account is of major importance for context recognition and, more specifically, to detect and solve context abnormalities such as those related to the user's behavior or those related to context attribute prediction. In this paper, an ontology-based framework integrating machine learning and probabilistic planning within commonsense reasoning is proposed to recognize the user's context and abnormalities associated with it. The reasoning is performed using event calculus in answer set programming (ECASP); ECASP allows for abductive and temporal reasoning, which results in an eXplainable AI (XAI) approach. A context ontology is proposed to axiomatize the reasoning and introduce the notion of probabilistic fluents into the EC formalism in order to perform probabilistic reasoning. The reasoning incorporates probabilistic planning based on a partially observable Markov decision process (POMDP) to solve knowledge incompleteness. To evaluate the proposed framework, real-life scenarios, based on the Orange4Home and SIMADL public datasets are implemented and discussed. [ABSTRACT FROM AUTHOR]

Nowadays, Deep Learning is drastically revolutionizing financial research as well as industry. Many methods have been discussed in the last few years, mainly related to option pricing. In fact, traditional approaches such as Monte Carlo simulation or finite difference methods are seriously harmed by multi-dimensional underlying and path dependency. Thus, dealing with particular contracts such as American multi-asset options is still rough. This paper addresses such a problem by pricing said put options with a novel meshless methodology, named Physics-Informed Neural Networks (PINNs), based on Artificial Intelligence. PINN paradigm has been recently introduced in Deep Learning literature. It exploits the theoretical background of the universal approximation theorem for neural networks to solve Partial Differential Equations numerically. This Deep Learning meshless method incorporates the equation and its initial and boundary conditions thanks to a specially designed loss function. We develop a suitable PINN for the proposed problem by introducing an algorithmic trick for improving the convergence of the free boundary problem. Furthermore, the worthiness of the proposal is assessed by several experiments concerned with single and multi-asset options. Finally, a parametric model is built to benefit further studies of option value behaviour related to particular market conditions. [ABSTRACT FROM AUTHOR]

Differentiable architecture search (DARTS) is an effective neural architecture search algorithm based on gradient descent. However, there are two limitations in DARTS. First, a small proxy search space is exploited due to memory and computational resource constraints. Second, too many simple operations are preferred, which leads to the network deterioration. In this paper, we propose a uniform-space differentiable architecture search, named U-DARTS, to address the above problems. In one hand, the search space is redesigned to enable the search and evaluation of the architectures in the same space, and the new search space couples with a sampling and parameter sharing strategy to reduce resource overheads. This means that various cell structures are explored directly rather than cells with same structure are stacked to compose the network. In another hand, a regularization method, which takes the depth and the complexity of the operations into account, is proposed to prevent network deterioration. Our experiments show that U-DARTS is able to find excellent architectures. Specifically, we achieve an error rate of 2.59% with 3.3M parameters on CIFAR-10. The code is released in https://github.com/Sun-Shiqi/U-DARTS. [ABSTRACT FROM AUTHOR]

Machine learning models, especially deep neural network (DNN) models, have widespread and valuable applications in business activities. Training a deep learning model for commercial use requires plenty of private data, expert knowledge, and computing resources. The huge commercial value of such trained models has attracted the attention of attackers. Attackers can construct a dataset by repeatedly querying the target model for the output of the requested samples and then train a substitute model on this dataset that functions similarly to the target model. In this paper, we propose a defense scheme based on physical unclonable function (PUF) against such black-box model extraction attacks. We deploy a PUF on the user side and the corresponding PUF model on the service provider side to ensure that only legitimate users can obtain the correct model predictions. Our experimental results show that by choosing a suitable fuzzy extractor threshold d , legitimate users can recover more than 99.5% of the prediction results with a little additional computational overhead to the service provider. We perform a model extraction attack in the most favorable case for the attacker, and the prediction accuracy of the obtained substitute model is only about 10%, which demonstrates the effectiveness of our proposed scheme. Compared to existing defenses, our scheme not only effectively prevents black-box model extraction attacks but also ensures that the accuracy of the prediction service for legitimate users is not affected. • Defense based on PUF obfuscation against black-box model extraction attacks. • A PUF and the corresponding PUF model ensure that legitimate users can obtain correct model predictions. • Legitimate users can correctly recover more than 99.5% of the predictions with a little additional computational overhead. • The prediction accuracy of the model extracted by the attacker is only about 10%. [ABSTRACT FROM AUTHOR]

This paper proposes a novel method for efficiently finding the Nash equilibrium in a chance-constrained game (CCG). Conventional numerical solution methods require significant computational time when solving multiple instances of CCG. We introduce CCGnet, a deep learning approach that is capable of efficiently solving multiple instances of CCG in a one-shot manner. CCGnet employs a specialized network structure and training algorithm based on neurodynamic optimization. We demonstrate the strong performance of CCGnet in practice and show that our proposed method outperforms conventional methods. [ABSTRACT FROM AUTHOR]

• Propose a differentiable bi-level optimization network for multi-view clustering. • Construct an interpretable network by stacking multiple differentiable block networks. • Integrate traditional optimization methods with deep learning. • Perform both explicit and implicit optimization simultaneously. Multi-view clustering on traditional optimization methods is derived from different theoretical frameworks, yet it may be inefficient in dealing with complex multi-view data compared to deep models. In contrast, deep multi-view clustering methods for implicit optimization have excellent feature abstraction ability but are inscrutable due to their black-box problem. However, very limited research was devoted to integrating the advantages of the above two types of methods to design an efficient method for multi-view clustering. Focusing on these problems, this paper proposes a differentiable bi-level optimization network (DBO-Net) for multi-view clustering, which is implemented by incorporating the traditional optimization method with deep learning to design an interpretable deep network. To enhance the representation capability, the proposed DBO-Net is constructed by stacking multiple explicit differentiable block networks to learn an interpretable consistent representation. Then all the learned parameters can be implicitly optimized through back-propagation, making the learned representation more suitable for the clustering task. Extensive experimental results validate that the strategy of bi-level optimization can effectively improve clustering performance and the proposed method is superior to the state-of-the-art clustering methods. [ABSTRACT FROM AUTHOR]

In deep learning, auxiliary modules for model training have become increasingly popular, such as Deep Mutual Learning (DML) and Multi-Scale Dense Convolutional Networks (MSDNet), which can maximize the performance of the model without increasing the amount of test computation. Nevertheless, current research does not fully exploit the knowledge between different auxiliary modules. This paper proposes a new model training technique–Siamese Labels Auxiliary (SiLA) Learning, in which the SiLA module is designed to concatenate the outputs of the modules to get auxiliary information. In addition, the knowledge learned from different modules can be fully exploited by auxiliary information. Our experiments show that SiLA Learning effectively improves the performance of standard models and achieves convincing experimental results on image classification tasks without increasing the amount of test computation. Moreover, the experiments show that SiLA Learning can be easily combined with methods such as DML and MSDNet to exploit the knowledge fully and perform best. [ABSTRACT FROM AUTHOR]

The rising popularity of intelligent mobile devices and the computational cost of deep learning-based models call for efficient and accurate on-device inference schemes. We propose a novel model compression scheme that allows inference to be carried out using bit-level sparsity, which can be efficiently implemented using in-memory computing macros. In this paper, we introduce a method called BitS-Net to leverage the benefits of bit-sparsity (where the number of zeros are more than number of ones in binary representation of weight/activation values) when applied to compute-in-memory (CIM) with resistive RAM (RRAM) to develop energy efficient DNN accelerators operating in the inference mode. We demonstrate that BitS-Net improves the energy efficiency by up to 5x for ResNet models on the ImageNet dataset. [ABSTRACT FROM AUTHOR]

Despite the active research on deep learning these days, no existing works attempt to query neural networks for a specific task so that we can quickly obtain a model specialized for the queried task. This paper presents the first study on the problem of querying neural networks, aiming to efficiently find a lightweight model for any on-demand sub-task supported by a large and generic neural network. This problem is well motivated by the fact that such a lightweight model is particularly suitable for deployment in commodity mobile devices with limited computing resources. In this paper, we propose QueryNet , a framework of queriable neural networks, which is based on our class-aware channel pruning technique and the proposed method of merging multiple tiny networks for producing a specialized model for the task. Through the extensive experiments, we show that QueryNet can generate a lightweight neural network for a given task up to 3.25 times faster than learning a specialized model from scratch, and the resulting specialized neural network carries up to 37 times less parameters than a pretrained network, and even shows a slightly better accuracy than that of the pretrained model. [ABSTRACT FROM AUTHOR]

• The deep reinforcement learning is firstly employed to solve source searching problem. • The belief state is maintained by the particle filter. • The feature of belief state is extracted by the DBSCAN algorithm. • Transfer learning is employed to reuse the trained Q-network in heterogeneous tasks. The localization of hazardous sources (e.g. poisonous gas sources) is an important task regarding the security of human society. To find the unknown source in time, various autonomous source searching methods have mushroomed and been employed over the past decade. This paper designs a fresh source searching approach, namely particle clustering-deep Q-network, PC-DQN, which applies the deep reinforcement learning (DRL) techniques as a source searching approach for the first time. Specifically, the search process is formulated as the partially observable Markov decision process, then converted into the Markov decision process based on the belief state (represented by the particle filter). PC-DQN leverages the density-based spatial clustering of applications with noise (DBSCAN) algorithm to extract the feature of belief state, and employ the deep Q-network (DQN) algorithm to find the optimal policy for the source searching task. Through the comparison with two baseline methods (i.e. RANDOM and Entrotaxis algorithm) under various experimental conditions, the viability of our proposed PC-DQN is testified. Results explicitly reveal that the success rate of the PC-DQN maintains at a high level (beyond 99.6%) in all scenarios in this paper, and the mean search step shows evident superiority over baseline methods in most scenarios. Significantly, we also introduce the transfer learning concept to reuse the well-trained Q-network into new scenarios. These findings show important implications of the DRL-based approach as an alternative and more effective source searching approach. [ABSTRACT FROM AUTHOR]

The successful application of modern deep neural network models is deeply influenced by the choice of hyperparameters. As one of the most important hyperparameters, the Learning Rate (LR) needs to be fine-tuned. In order to train models that can perform better, finding a suitable LR schedule quickly has become a pressing problem. Current research often relies on manual use of parallel search methods such as grid search, or serial methods such as Bayesian. However, the variety and number of models and datasets result in a very large LR space, and these methods consume significant resources to find only sub-optimal static LR schedules within a given time frame. It was found that in the currently widely used Distributed Data Parallel (DDP) deep learning, where multiple nodes themselves constitute the population, it is possible to use population algorithms to optimise the searched LR schedule dynamically throughout the training process with little additional training time. To maximise the potential of both the searched LR schedule and the population optimisation of the participating multi-nodes, this paper proposes a Leader Population Learning Rate Schedule (LPLRS) for the DDP deep learning environment, which continuously explores for better learning rates in the neighbourhood of the searched LR schedule and guides the subsequent training process. LPLRS achieves higher model classification accuracy on the Cifar 10&100 test datasets on the state-of-the-art Wide Residual Network with Sharpness-Aware Minimization (WRN(SAM)) model compared to the latest SGDR, CLR, and StepLR learning rate schedules. [ABSTRACT FROM AUTHOR]

Graph has currently become an increasingly popular model in many real applications. The efficiency of graph storage is crucial for these applications. Generally speaking, the tuning task of graph storage relies on the database administrators to find the best graph storage. However, DBAs make the tuning decisions by mainly relying on their experiences and intuition. Due to the limitations of the DBAs, the tuning may have an uncertain performance and worse efficiency. In this paper, we observed that an estimator of the graph workload has the potential ability to guarantee the performance of tuning operations. Unfortunately, because of complex characteristics of the graph evaluation task, there exists no mature estimator for graph workload. We formulate the evaluation task of graph workload as a classification task and carefully design the feature engineering process, including graph data features, graph workload features and graph storage features. For this evaluation task, we propose an active auto-estimator (AAE) for the graph workload evaluation by combining the active learning and deep learning. We test the time efficiency and evaluation accuracy of AAE with two open source graph data, LDBC and Freebase. The experimental results show that our estimator could efficiently complete the graph workload evaluation in milliseconds. [ABSTRACT FROM AUTHOR]

• A novel lightweight DL technique is presented for fine-tuning lung infection segmentation. • The down-sampling module is innovatively designed to effectively capture lesion features from cross-domain CT images. • A novel contextual enrichment module is introduced to empower the network to capture the combinations of static. • A novel federated periodic client selection protocol is proposed to select the training participants fairly and periodically. The automatic segmentation of COVID-19 pneumonia from a computerized tomography (CT) scan has become a major interest for scholars in developing a powerful diagnostic framework in the Internet of Medical Things (IoMT). Federated deep learning (FDL) is considered a promising approach for efficient and cooperative training from multi-institutional image data. However, the nonindependent and identically distributed (Non-IID) data from health care remain a remarkable challenge, limiting the applicability of FDL in the real world. The variability in features incurred by different scanning protocols, scanners, or acquisition parameters produces the learning drift phenomena during the training, which impairs both the training speed and segmentation performance of the model. This paper proposes a novel FDL approach for reliable and efficient multi-institutional COVID-19 segmentation, called MIC-Net. MIC-Net consists of three main building modules: the down-sampler, context enrichment (CE) module, and up-sampler. The down-sampler was designed to effectively learn both local and global representations from input CT scans by combining the advantages of lightweight convolutional and attention modules. The contextual enrichment (CE) module is introduced to enable the network to capture the contextual representation that can be later exploited to enrich the semantic knowledge of the up-sampler through skip connections. To further tackle the inter-site heterogeneity within the model, the approach uses an adaptive and switchable normalization (ASN) to adaptively choose the best normalization strategy according to the underlying data. A novel federated periodic selection protocol (FED-PCS) is proposed to fairly select the training participants according to their resource state, data quality, and loss of a local model. The results of an experimental evaluation of MIC-Net on three publicly available data sets show its robust performance, with an average dice score of 88.90% and an average surface dice of 87.53%. [ABSTRACT FROM AUTHOR]

• An advanced anomaly detection method via granular computing is proposed; • Granular data descriptors are used to construct anomaly detectors; • A fuzzy rule-based modeling method is applied for anomaly data detection (ADD); • The constructed granular ADD detectors are low-cost and effective; It is meaningful for data-driven studies to detect and remove the anomaly data from a given raw dataset. Considering the existing anomaly data detection (ADD) methods have some drawbacks, e.g. confidence and uncertainty in anomaly description, computation cost of kernel learning and deep learning in ADD, therefore this paper proposes an advanced approach for constructing low-cost and effective ADD detectors. Firstly, making use of the good data description ability of information granules, granular data descriptors are constructed for anomaly and normal data description. Then, based on these data descriptors, reconstruction-based strategy is applied to model anomaly detection. Subsequently, with consideration of anomaly data's uncertainty, fuzzy rules are formed and used to realize the final anomaly data detection. In this study, both synthetic and publicly available datasets are considered in experimental analysis. Numerical results illustrate the proposed method has a superiority ranging from 8.60% to 32.58% to conventional models on ADD performance, verifying the feasibility and effectiveness the proposed methods via granular data descriptors. Moreover, through the discussion on computation complexity, the proposed method is also demonstrated efficient on detecting anomalies. [ABSTRACT FROM AUTHOR]

• A new supervised fuzzy measure learning algorithm is proposed for combining classifiers. • Different from previous works, any cost function can be optimized, including those well-suited for classification problems. • Three new update policies are proposed for dealing with monotonicity constrains. • The benefit of using appropriate cost functions for classification is experimentally demonstrated. • The new proposal outperforms existing methods in both binary and multi-class problems. Fuzzy measure-based aggregations allow taking interactions among coalitions of the input sources into account. Their main drawback when applying them in real-world problems, such as combining classifier ensembles, is how to define the fuzzy measure that governs the aggregation and specifies the interactions. However, their usage for combining classifiers has shown its advantage. The learning of the fuzzy measure can be done either in a supervised or unsupervised manner. This paper focuses on supervised approaches. Existing supervised approaches are designed to minimize the mean squared error cost function, even for classification problems. We propose a new fuzzy measure learning algorithm for combining classifiers that can optimize any cost function. To do so, advancements from deep learning frameworks are considered such as automatic gradient computation. Therefore, a gradient-based method is presented together with three new update policies that are required to preserve the monotonicity constraints of the fuzzy measures. The usefulness of the proposal and the optimization of cross-entropy cost are shown in an extensive experimental study with 58 datasets corresponding to both binary and multi-class classification problems. In this framework, the proposed method is compared with other state-of-the-art methods for fuzzy measure learning. [ABSTRACT FROM AUTHOR]

Extreme Multi-label Text Classification (XMTC) is a key task of finding the most relevant labels from a large label set for a document. Although some deep learning-based methods have shown great success in XMTC, they still suffer from the following drawbacks. First, although several methods have improved the precision by clustering labels and combining several sub-models to train and predict for one dataset, they were not ideal in terms of computational efficiency. Second, most of those methods need a low dimensional bottleneck layer before the output layer to compress the feature representations to fit the GPU memory, which results in information loss of original features. In this paper, we proposed a novel two-stage X MTC framework with candidate R etrieving and deep R anking (XRR) to address those drawbacks. In the retrieving stage, we designed two retrieval strategies, including an a ligning P oint M utual I nformation (aPMI) method, and a U nified L abel- S emantic E mbedding (ULSE) method, to extract hundreds of candidates from massive labels. In the ranking stage, we presented a deep ranking model using a pre-trained transformer to distinguish the true labels from candidates. Extensive experiments show that XRR outperforms the state-of-the-art methods on five widely used multi-label datasets. [ABSTRACT FROM AUTHOR]

• An advanced anomaly detection method via granular computing is proposed; • Granular data descriptors are used to construct anomaly detectors; • A fuzzy rule-based modeling method is applied for anomaly data detection (ADD); • The constructed granular ADD detectors are low-cost and effective; It is meaningful for data-driven studies to detect and remove the anomaly data from a given raw dataset. Considering the existing anomaly data detection (ADD) methods have some drawbacks, e.g. confidence and uncertainty in anomaly description, computation cost of kernel learning and deep learning in ADD, therefore this paper proposes an advanced approach for constructing low-cost and effective ADD detectors. Firstly, making use of the good data description ability of information granules, granular data descriptors are constructed for anomaly and normal data description. Then, based on these data descriptors, reconstruction-based strategy is applied to model anomaly detection. Subsequently, with consideration of anomaly data's uncertainty, fuzzy rules are formed and used to realize the final anomaly data detection. In this study, both synthetic and publicly available datasets are considered in experimental analysis. Numerical results illustrate the proposed method has a superiority ranging from 8.60% to 32.58% to conventional models on ADD performance, verifying the feasibility and effectiveness the proposed methods via granular data descriptors. Moreover, through the discussion on computation complexity, the proposed method is also demonstrated efficient on detecting anomalies. [ABSTRACT FROM AUTHOR]