Simple Dataset Research Articles

Mining of potentially stem cell-related miRNAs in planarians.

Stem cells and regenerative medicine have recently become important research topics. However, the complex stem cell regulatory networks involved in various microRNA (miRNA)-mediated mechanisms have not yet been fully elucidated. Planarians are ideal animal models for studying stem cells owing to their rich stem cell populations (neoblasts) and extremely strong regeneration capacity. The roles of planarian miRNAs in stem cells and regeneration have long attracted attention. However, previous studies have generally provided simple datasets lacking integrative analysis. Here, we have summarized the miRNA family reported in planarians and highlighted conservation in both sequence and function. Furthermore, we summarized miRNA data related to planarian stem cells and regeneration and screened potential involved candidates. Nevertheless, the roles of these miRNAs in planarian regeneration and stem cells remain unclear. The identification of potential stem cell-related miRNAs offers more precise suggestions and references for future investigations of miRNAs in planarians. Furthermore, it provides potential research avenues for understanding the mechanisms of stem cell regulatory networks. Finally, we compiled a summary of the experimental methods employed for studying planarian miRNAs, with the aim of highlighting special considerations in certain procedures and providing more convenient technical support for future research endeavors.

Specific emitter identification unaffected by time through adversarial domain adaptation and continual learning

Timely identifying the emitter of target signals is crucial for communication security in complex electromagnetic environments. Specific emitter identification (SEI) is a technique to identify emitters using the hardware fingerprints of emitters. In this paper, the impact of changes in hardware fingerprints over time on SEI is solved, which significantly deteriorates identification performance. This issue is addressed from two aspects: one is mitigating the impact of these changes, and the other is tracking and adapting to them. For the aspect of mitigating impact, an alternating adversarial domain adaptation (AADA) method is proposed to eliminate the time-varying component in hardware fingerprints. Subsequently, a feature map calculation method using weighted Euclidean distance is designed, preserving the main parameters of feature maps for each emitter. For the aspect of tracking and adapting to changes, a continual learning method was designed based on feature maps of each emitter. This approach incorporates the selective annotation of unlabeled new data with an iterative optimization training process. To validate the effectiveness of the proposed method, we independently collected comprehensive time-variant datasets as well as simpler datasets with varying receivers and environments. The proposed method was tested on these datasets and compared with existing conventional and advanced methods. The experimental results indicate that the proposed SEI method exhibits superior recognition performance. Compared to existing methods, it achieved an average recognition accuracy improvement of over 8% on the time-variant dataset, and demonstrated enhanced robustness against these three types of variations.

Adaptive Modem Based on LSTM-AutoEncoder with Vector Quantization

Recently, researchers have achieved the goal of using unified architecture to achieve multiple modulation modes under specific conditions. However, existing research still suffers from the problem of large resource and time overhead. This paper proposes an adaptive modem based on a vector quantization (VQ) long short-term memory autoencoder (LSTM-AE), designed to implement modulation and demodulation of signals from the second to thirty-second order in a lightweight way. By leveraging the memory capacity of the LSTM module and the compression capability of the autoencoder, the model is able to support multi-order modulation methods. This study used the Adam optimizer for training and testing on a simple dataset extended by adding AWGN noise only and made modifications based on the MSE loss function to balance the accuracy and training speed of each part of the model. Experiments demonstrate that the proposed method not only achieves comparable modem performance to existing frameworks for second to thirty-second order signals, but also significantly reduces the number of parameters and training time. Experimental results indicate that the proposed methodology not only matches the performance of existing frameworks for signals ranging from the second to the thirty-second order, but also employs merely 79.6% of the average parameter count and a mere 7.4% of the average training duration. This represents a substantial reduction in resource expenditure.

A Novel Electronic Nose Using Biomimetic Spiking Neural Network for Mixed Gas Recognition

Odors existing in natural environment are typically mixtures of a large variety of chemical compounds in specific proportions. It is a challenging task for an electronic nose to recognize the gas mixtures. Most current research is based on the overall response of sensors and uses relatively simple datasets, which cannot be used for complex mixtures or rapid monitoring scenarios. In this study, a novel electronic nose (E-nose) using a spiking neural network (SNN) model was proposed for the detection and recognition of gas mixtures. The electronic nose integrates six commercial metal oxide sensors for automated gas acquisition. SNN with a simple three-layer structure was introduced to extract transient dynamic information and estimate concentration rapidly. Then, a dataset of mixed gases with different orders of magnitude was established by the E-nose to verify the model’s performance. Additionally, random forests and the decision tree regression model were used for comparison with the SNN-based model. Results show that the model utilizes the dynamic characteristics of the sensors, achieving smaller mean squared error (MSE < 0.01) and mean absolute error (MAE) with less data compared to random forest and decision tree algorithms. In conclusion, the electronic nose system combined with the bionic model shows a high performance in identifying gas mixtures, which has a great potential to be used for indoor air quality monitoring in practical applications.

Spiking generative adversarial network with attention scoring decoding

Generative models based on neural networks present a substantial challenge within deep learning. As it stands, such models are primarily limited to the domain of artificial neural networks. Spiking neural networks, as the third generation of neural networks, offer a closer approximation to brain-like processing due to their rich spatiotemporal dynamics. However, generative models based on spiking neural networks are not well studied. Particularly, previous works on generative adversarial networks based on spiking neural networks are conducted on simple datasets and do not perform well. In this work, we pioneer constructing a spiking generative adversarial network capable of handling complex images and having higher performance. Our first task is to identify the problems of out-of-domain inconsistency and temporal inconsistency inherent in spiking generative adversarial networks. We address these issues by incorporating the Earth-Mover distance and an attention-based weighted decoding method, significantly enhancing the performance of our algorithm across several datasets. Experimental results reveal that our approach outperforms existing methods on the MNIST, FashionMNIST, CIFAR10, and CelebA. In addition to our examination of static datasets, this study marks our inaugural investigation into event-based data, through which we achieved noteworthy results. Moreover, compared with hybrid spiking generative adversarial networks, where the discriminator is an artificial analog neural network, our methodology demonstrates closer alignment with the information processing patterns observed in the mouse. Our code can be found at https://github.com/Brain-Cog-Lab/sgad.

Autoencoder-based Image Denoiser Suitable for Image of Numbers with High Potential for Hardware Implementation

The algorithms for processing images and videos are currently essential for many applications. Many of these applications are specified for processing and analyzing images of numbers, such as smart meter reading, automated document processing, and processing of vehicles and license plate images in traffic monitoring and analysis. Consequently, eliminating noise is frequently used as a pre-processing step to improve subsequent analysis and processing outcomes. In this context, this manuscript proposes using artificial intelligence-based methods to increase the efficiency of the image-denoising process. However, the computational demands of these algorithms necessitate careful consideration of the hardware on which they are implemented. Therefore, this paper proposes using the simple autoencoder approach and evaluates its efficiency compared to the conventional methods. This unsupervised model is trained to identify and remove impulse noise from digital images by replacing some pixels with others from the outer dataset that can clarify the whole image more. The model was trained using handwritten numbers, MNIST, and data set size in the first trial and the FER2013 dataset in the second. The model is superior in the case of the simple dataset. Two versions of autoencoders are considered, the first with three layers and the second with five. The Traditional denoising methods are investigated for comparison purposes. The four conventional filtering procedures, AMF, DBMF, ADBMF, and MDBUTMF, are implemented using the MATLAB simulation environment, and the results are reported and compared with the proposed methodology. The results show that the proposed artificial intelligence-based method significantly outperforms the traditional methods regarding processing efficiency and the resulting image quality. Moreover, the computational intensity for the proposed methodology is chosen as a metric for evaluating the algorithm compliance for the hardware implementation compared to the other Artificial Intelligence (AI)-based denoising algorithms. The suggested technique has minor processing and training time compared to the other AI-based methods with adequate quality in case the images of numbers usually do not contain many details, making it more convenient for hardware implementation.

Sensor-Based Indoor Fire Forecasting Using Transformer Encoder.

Indoor fires may cause casualties and property damage, so it is important to develop a system that predicts fires in advance. There have been studies to predict potential fires using sensor values, and they mostly exploited machine learning models or recurrent neural networks. In this paper, we propose a stack of Transformer encoders for fire prediction using multiple sensors. Our model takes the time-series values collected from the sensors as input, and predicts the potential fire based on the sequential patterns underlying the time-series data. We compared our model with traditional machine learning models and recurrent neural networks on two datasets. For a simple dataset, we found that the machine learning models are better than ours, whereas our model gave better performance for a complex dataset. This implies that our model has a greater potential for real-world applications that probably have complex patterns and scenarios.

“R” U ready?: a case study using R to analyze changes in gene expression during evolution

As high-throughput methods become more common, training undergraduates to analyze data must include having them generate informative summaries of large datasets. This flexible case study provides an opportunity for undergraduate students to become familiar with the capabilities of R programming in the context of high-throughput evolutionary data collected using macroarrays. The story line introduces a recent graduate hired at a biotech firm and tasked with analysis and visualization of changes in gene expression from 20,000 generations of the Lenski Lab’s Long-Term Evolution Experiment (LTEE). Our main character is not familiar with R and is guided by a coworker to learn about this platform. Initially this involves a step-by-step analysis of the small Iris dataset built into R which includes sepal and petal length of three species of irises. Practice calculating summary statistics and correlations, and making histograms and scatter plots, prepares the protagonist to perform similar analyses with the LTEE dataset. In the LTEE module, students analyze gene expression data from the long-term evolutionary experiments, developing their skills in manipulating and interpreting large scientific datasets through visualizations and statistical analysis. Prerequisite knowledge is basic statistics, the Central Dogma, and basic evolutionary principles. The Iris module provides hands-on experience using R programming to explore and visualize a simple dataset; it can be used independently as an introduction to R for biological data or skipped if students already have some experience with R. Both modules emphasize understanding the utility of R, rather than creation of original code. Pilot testing showed the case study was well-received by students and faculty, who described it as a clear introduction to R and appreciated the value of R for visualizing and analyzing large datasets.

Georeferenced dataset of maritime piracy in the Gulf of Guinea from 2010 to 2021

Piracy has been a global concern and a threat to the safety of people performing maritime trade around the globe. Since ancient times maritime piracy has been a common practice that, unfortunately, has not ended in the current days. A georeferenced dataset providing the position, meteorologic conditions, and a description of the occurrence can provide essential information for analyzing this global phenomenon. The dataset focuses on the Gulf of Guinea (GoG) as an area dominated by corruption and weak supervision capacity by the local authorities. The time interval considered in this paper is between 2010 and 2021. Using this simple dataset, it is possible to analyze attributes such as when the piracy occurred or if the illegal activity involved deaths or kidnapping. The accuracy of the data was guaranteed by cross-referencing data sources, so we have 595 pirate attacks accurately described. This dataset can easily be used for data mining, allowing further analysis of the patterns and trends of pirate attacks in the GoG over time.

Study on Economic Data Forecasting Based on Hybrid Intelligent Model of Artificial Neural Network Optimized by Harris Hawks Optimization

To use different models for forecasting economic data suitably, three main basic models (the grey system model, time series analysis model, and artificial neural network (ANN) model) are analyzed and compared comprehensively. Based on the analysis results of forecasting models, one new hybrid intelligent model based on the ANN model and Harris hawks optimization (HHO) has been proposed. In this hybrid model, HHO is used to select the hyperparameters of the ANN and also to optimize the linking weights and thresholds of the ANN. At last, by using four economic data cases including two simple data sets and two complex ones, the analysis of the basic models and the proposed hybrid model have been verified comprehensively. The results show that the grey system model can suitably analyze exponential data sequences, the time series analysis model can analyze random sequences, and the ANN model can be applied to any kind of data sequence. Moreover, when compared with the basic models, the new hybrid model can be suitably applied for both simple data sets and complex ones, and its forecasting performance is always very suitable. In comparison with other hybrid models, not only for computing accuracy but also for computing efficiency, the performance of the new hybrid model is the best. For the least initial parameters used in the new hybrid model, which can be determined easily and simply, the application of the new hybrid model is the most convenient too.

FFSDF: An improved fast face shadow detection framework based on channel spatial attention enhancement

Recent shadow detectors excel on simple datasets but encounter difficulties with facial shadow images under complex lighting due to the lack of annotated shadow masks, varying shadow sizes, and imbalances between the target and background. This leads to training difficulties, reduced accuracy, and slower processing, posing a significant challenge for precise and fast detection framework development. We collected images and created Extended Yale Shadow Detection Dataset (EYSDD). In comparison to other datasets, this dataset includes additional manually annotated shadow masks, making it suitable for training convolutional neural networks. To address this problem, we propose incorporating Channel Spatial Direction-aware Spatial Context (CSDSC) module into Fast Shadow Detection Network (FSDNet). Additionally, we introduce Selective Attention Inverted Residual Bottleneck (SAIRB) with Selective Attention Mechanism (SAM). Furthermore, we integrate Detail Enhancement Module (DEM), which refines low-level features, into Fast Face Shadow Detection Framework (FFSDF). Finally, compared to other methods, our model surpasses the baseline method FSDNet and the advanced method EVP by 3.5% and 1.9% in terms of IoU, and 1.8% and 4.3% in terms of Dice score, respectively. Our model has only 4.31 M parameters and achieves a computing speed of 0.022 sec/image, demonstrating superior efficiency compared to other methods.

Feature evolvable learning with image streams

Feature Evolvable Stream Learning (FESL) has received extensive attentions during the past few years where old features could vanish and new features could appear when learning with streaming data. Existing FESL algorithms are mainly designed for simple datasets with low-dimension features, nevertheless they are ineffective to deal with complex streams such as image sequences. Such crux lies in two facts: (1) the shallow model, which is supported to be feasible for the low-dimension streams, fails to reveal the complex nonlinear patterns of images, and (2) the linear mapping used to recover the vanished features from the new ones is inadequate to reconstruct the old features of image streams. In response, this paper explores a new online learning paradigm: Feature Evolvable Learning with Image Streams (FELIS) which attempts to make the online learners less restrictive and more applicable. In particular, we present a novel ensemble residual network (ERN), in which the prediction is weighted combination of classifiers learnt by the feature representations from several residual blocks, such that the learning is able to start with a shallow network that enjoys fast convergence, and then gradually switch to a deeper model when more data has been received to learn more complex hypotheses. Moreover, we amend the first residual block of ERN as an autoencoder, and then proposed a latent representation mapping (LRM) approach to exploit the relationship between the previous and current feature space of the image streams via minimizing the discrepancy of the latent representations from the two different feature spaces. We carried out experiments on both virtual and real scenarios over large-scale images, and the experimental results demonstrate the effectiveness of the proposed method.

CMTSNN: A Deep Learning Model for Multiclassification of Abnormal and Encrypted Traffic of Internet of Things

With the increasing types and number of IoT devices and malicious programs and the popularization of encryption technology in the communication process between the internet and the Internet of Things (IoT), a large amount of encrypted abnormal traffic among devices endangers IoT cybersecurity. How to identify abnormal encrypted traffic of the IoT has become the premise of cybersecurity. Presently, most of the detection methods for traffic in the IoT have problems such as simple dataset processing, imperfect feature extraction, data imbalance, and low multi-classification accuracy. In this paper, we propose a multi-classification deep learning model named the cost matrix time-space neural network (CMTSNN) for abnormal and encrypted IoT traffic. The CMTSNN is divided into three parts. The first part is the preprocessing stage of the dataset, which needs to retain the timing relation between two data packets in the stream and create a cost penalty matrix according to the sample distribution. Aimed at the robustness of feature extraction in network flow, the second part extracts time series features and then space features to ensure the robustness of feature extraction. The third part is aimed at the problem of data imbalance. The cost penalty matrix is applied to the cost penalty layer in the training process, and then the improved cross-entropy loss function is used to calculate the loss to improve the classification accuracy of minority categories and increase the overall multi-classification performance of the model. Experiments were carried out with the ToN-IoT, BoT-IoT and ISCX VPN-NonVPN datasets. Compared with current methods, the proposed method shows better performances, including accuracy, precision, recall, F1 Score and false alarm rate.

Comparison and validation of metadta for meta-analysis of diagnostic test accuracy studies.

We developed metadta, a flexible, robust and user-friendly statistical procedure that fuses established and innovative statistical methods for meta-analysis, meta-regression, and network meta-analysis of diagnostic test accuracy studies in Stata. Using data from published meta-analyses, we validate metadta by comparing and contrasting its features and output to popular procedures dedicated to the meta-analysis of diagnostic test accuracy studies; (midas (Stata), metandi (Stata), metaDTA (web application), mada (R), and MetaDAS (SAS)). We also demonstrate how to perform network meta-analysis with metadta, for which no alternative procedure is dedicated to network meta-analysis of diagnostic test accuracy data in the frequentist framework. metadta generated consistent estimates in simple and complex diagnostic test accuracy data sets. We expect its availability to stimulate better statistical practice in the evidence synthesis of diagnostic test accuracy studies. This article is protected by copyright. All rights reserved.

Enabling Fast and Memory-Efficient Acceleration for Pattern Matching Workloads: The Lightweight Automata Processing Engine

Growing pattern matching applications are employing finite automata as their basic processing model. These applications match tens to thousands of patterns on a large amount of data, which brings a great challenge to conventional processors. Therefore hardware-based solutions have emerged frequently and achieved high throuphput automata processing. However, existing methods are generally difficult to achieve both processing speed and storage efficiency, and are often too heavy to be integrated into a small chip and have to rely on off-chip DRAMs or other high capacity memories even on some simple data sets, leading to the potential area and power consumption issues. In this paper, we focus on building a more lightweight automata processing engine, hoping to store the whole automata model into on-chip memory and run effectively and independently. We propose LAP, a lightweight automata processing engine. Powered with a novel automata model (A-DFA) and efficient packing algorithms, extremely high storage efficiency compared with traditional DFA is achieved in LAP. Meanwhile, we identify the key parallelization factors in the A-DFA model and then propose a specialized microarchitecture with novel instructions to further accelerate the state transition process. As a result, LAP can obtain more effective trade-off between processing speed and storage efficiency. Evaluation results show that LAP achieves extremely high storage efficiency on simple data sets, exceeding IBM's RegX by 8×, and achieves significant improvements in processing speed ranging from 1.32× to 1.91× compared with previous lightweight hardware implementations. Moreover, LAP has good scalability in hardware architecture. It is easy to build an acceleration system with higher throughput by increasing the number of cores. We prototype a 16-core system into Xilinx ZC702 FPGA and a 64-core system into Xilinx ZCU102 FPGA respectively. The prototype system on ZC702 on average achieves 3.5 GB/s throughput on simple data sets, and the prototype system on ZCU102 can obtain higher throughput and compute density values on part of large datasets in ANMLZoo compared with modern in-memory NFA-based solutions.

Handling Logical Character Dependency in Phylogenetic Inference: Extensive Performance Testing of Assumptions and Solutions Using Simulated and Empirical Data.

Logical character dependency is a major conceptual and methodological problem in phylogenetic inference of morphological data sets, as it violates the assumption of character independence that is common to all phylogenetic methods. It is more frequently observed in higher-level phylogenies or in data sets characterizing major evolutionary transitions, as these represent parts of the tree of life where (primary) anatomical characters either originate or disappear entirely. As a result, secondary traits related to these primary characters become "inapplicable" across all sampled taxa in which that character is absent. Various solutions have been explored over the last three decades to handle character dependency, such as alternative character coding schemes and, more recently, new algorithmic implementations. However, the accuracy of the proposed solutions, or the impact of character dependency across distinct optimality criteria, has never been directly tested using standard performance measures. Here, we utilize simple and complex simulated morphological data sets analyzed under different maximum parsimony optimization procedures and Bayesian inference to test the accuracy of various coding and algorithmic solutions to character dependency. This is complemented by empirical analyses using a recoded data set on palaeognathid birds. We find that in small, simulated data sets, absent coding performs better than other popular coding strategies available (contingent and multistate), whereas in more complex simulations (larger data sets controlled for different tree structure and character distribution models) contingent coding is favored more frequently. Under contingent coding, a recently proposed weighting algorithm produces the most accurate results for maximum parsimony. However, Bayesian inference outperforms all parsimony-based solutions to handle character dependency due to fundamental differences in their optimization procedures-a simple alternative that has been long overlooked. Yet, we show that the more primary characters bearing secondary (dependent) traits there are in a data set, the harder it is to estimate the true phylogenetic tree, regardless of the optimality criterion, owing to a considerable expansion of the tree parameter space. [Bayesian inference, character dependency, character coding, distance metrics, morphological phylogenetics, maximum parsimony, performance, phylogenetic accuracy.].

Particle filtration efficiency measured using sodium chloride and polystyrene latex sphere test methods

Standards governing face masks differ in the test methods used to determine sub-micron particle filtration efficiency (PFE), such that the meaning of PFE is not universal. Unifying the meaning of PFE requires data using these different test methods to drive improvements in standards. This simple data set provides the equivalence between two major test methods used to assess PFE: (1) a test method using a neutralized, polydisperse sodium chloride (NaCl) and (2) a test method using an unneutralized, “monodisperse” polystyrene latex sphere (PSL) aerosols. Measurements are made on over 5800 real-world medical masks, leading to the establishment of a relationship between these two kinds of PFE for these products.

Comparison of classification algorithms for predicting autistic spectrum disorder using WEKA modeler

BackgroundIn healthcare area, big data, if integrated with machine learning, enables health practitioners to predict the result of a disorder or disease more accurately. In Autistic Spectrum Disorder (ASD), it is important to screen the patients to enable them to undergo proper treatments as early as possible. However, difficulties may arise in predicting ASD occurrences accurately, mainly caused by human errors. Data mining, if embedded into health screening practice, can help to overcome the difficulties. This study attempts to evaluate the performance of six best classifiers, taken from existing works, at analysing ASD screening training dataset.ResultWe tested Naive Bayes, Logistic Regression, KNN, J48, Random Forest, SVM, and Deep Neural Network algorithms to ASD screening dataset and compared the classifiers’ based on significant parameters; sensitivity, specificity, accuracy, receiver operating characteristic, area under the curve, and runtime, in predicting ASD occurrences. We also found that most of previous studies focused on classifying health-related dataset while ignoring the missing values which may contribute to significant impacts to the classification result which in turn may impact the life of the patients. Thus, we addressed the missing values by implementing imputation method where they are replaced with the mean of the available records found in the dataset.ConclusionWe found that J48 produced promising results as compared to other classifiers when tested in both circumstances, with and without missing values. Our findings also suggested that SVM does not necessarily perform well for small and simple datasets. The outcome is hoped to assist health practitioners in making accurate diagnosis of ASD occurrences in patients.

Simple and complex spiking neurons: perspectives and analysis in a simple STDP scenario

Spiking neural networks (SNNs) are largely inspired by biology and neuroscience and leverage ideas and theories to create fast and efficient learning systems. Spiking neuron models are adopted as core processing units in neuromorphic systems because they enable event-based processing. Among many neuron models, the integrate-and-fire (I&F) models are often adopted, with the simple leaky I&F (LIF) being the most used. The reason for adopting such models is their efficiency and/or biological plausibility. Nevertheless, rigorous justification for adopting LIF over other neuron models for use in artificial learning systems has not yet been studied. This work considers various neuron models in the literature and then selects computational neuron models that are single-variable, efficient, and display different types of complexities. From this selection, we make a comparative study of three simple I&F neuron models, namely the LIF, the quadratic I&F (QIF) and the exponential I&F (EIF), to understand whether the use of more complex models increases the performance of the system and whether the choice of a neuron model can be directed by the task to be completed. Neuron models are tested within an SNN trained with spike-timing dependent plasticity (STDP) on a classification task on the N-MNIST and DVS gestures datasets. Experimental results reveal that more complex neurons manifest the same ability as simpler ones to achieve high levels of accuracy on a simple dataset (N-MNIST), albeit requiring comparably more hyper-parameter tuning. However, when the data possess richer spatio-temporal features, the QIF and EIF neuron models steadily achieve better results. This suggests that accurately selecting the model based on the richness of the feature spectrum of the data could improve the whole system’s performance. Finally, the code implementing the spiking neurons in the SpykeTorch framework is made publicly available.

Guidelines for effective unsupervised guided wave compression and denoising in long-term guided wave structural health monitoring

This paper studies the effectiveness of joint compression and denoising strategies with realistic, long-term guided wave structural health monitoring data. We leverage the high correlation between nearby collections of guided waves in time to create sparse and low-rank representations. While compression and denoising schemes are not new, they are almost exclusively designed and studied with relatively simple datasets. In contrast, guided wave structural health monitoring datasets have much more complex operational and environmental conditions, such as temperature, that distort data and for which the requirements to achieve effective compression and denoising are not well understood. The paper studies how to optimize our data collection and algorithms to best utilize guided wave data for compression, denoising, and damage detection based on seven million guided wave measurements collected over 2 years.