In this paper, we propose a novel approach to recognize radar targets on inverse synthetic aperture radar (ISAR) and synthetic aperture radar (SAR) images. This approach is based on the multiple salient keypoint descriptors (MSKD) and multitask sparse representation based classification (MSRC). Thus, to characterize the targets in the radar images, we combine the scale-invariant feature transform (SIFT) and the saliency map. The goal of this combination is to reduce the SIFT keypoints and their time computing time by maintaining only those located in the target area (salient region). Then, we compute the feature vectors of the resulting salient SIFT keypoints (MSKD). This methodology is applied for both training and test images. The MSKD of the training images leads to construct the dictionary of a sparse convex optimization problem. To achieve the recognition, we adopt the MSRC taking into consideration each vector in the MSKD as a task. This classifier solves the sparse representation problem for each task over the dictionary and determines the class of the radar image according to all sparse reconstruction errors (residuals). The effectiveness of the proposed approach method has been demonstrated by a set of extensive empirical results on ISAR and SAR images databases. The results show the ability of our method to predict adequately the aircraft and the ground targets.

Scene classification plays an important role in the intelligent processing of high-resolution satellite (HRS) remotely sensed image. In HRS image classification, multiple features, e.g. shape, color, and texture features, are employed to represent scenes from different perspectives. Accordingly, effective integration of multiple features always results in better performance compared to methods based on a single feature in the interpretation of HRS image. In this paper, we introduce a multi-task joint sparse and low-rank representation model to combine the strength of multiple features for HRS image interpretation. Specifically, a multi-task learning formulation is applied to simultaneously consider sparse and low-rank structure across multiple tasks. The proposed model is optimized as a non-smooth convex optimization problem using an accelerated proximal gradient method. Experiments on two public scene classification datasets demonstrate that the proposed method achieves remarkable performance and improves upon the state-of-art methods in respective applications.

The success of deep learning (DL) in offline brain-computer interfaces (BCIs) has not yet translated into efficient online applications. This is due to three primary challenges. First, most DL solutions are designed for offline decoding, making the transition to online decoding complex and unclear. Second, the use of sliding windows in online decoding increases the computational complexity of DL training. Third, DL models typically require large amounts of training data, which are often scarce in BCI applications. To address these issues and enable real-time decoding, even across different subjects without calibration data, we first introduce a novel approach called real-time adaptive pooling (RAP). RAP modifies the pooling layers of existing offline DL models towards the online decoding requirements. Additionally, it significantly reduces the computational demand during training by jointly decoding consecutive windows. To reduce the amount of training data required, our approach leverages different levels of domain adaptation. We show how different settings enable different adaptation solutions. The results demonstrate that our approach is both powerful and can be calibration-free, providing a robust and practical solution for real-time BCI applications. These findings pave the way for the development of co-adaptive and highly efficient DL-based online BCI systems.

Against the background of the sky, imaging and perception of aircraft are cru- cial. Among these, the location of aircrafts is not a very difficult problem in general, because that deep learning algorithms and object detection models based on convolutional neural network(CNN) are ever-evolving. In order to have a better identification of various aircrafts, or to accurately locate different types of flying targets in the sky, it becomes significant to distinguish and recognize different types of aircrafts. One question is that, distinguishing and recognizing between sub-categories of aircrafts pose great challenges. Although fine-grained recognition focuses on exploring and studying such problems, aircrafts under different sub-categories and granularities lead us to rethink the application of features. We noticed that features in swin-transformer demonstrates the under- standing and processing of images, fully showcasing the encoding and indexing of information. Through this research and proposed approach, we discovered a better understanding of features encoding and use, which are inspired by the feature encoding and computation in swin-transformer. In our paper, our ap- proach has achieved effects on features encoded graphically, manifested from the architecture design and convolutional neural network computation, and outper- forms other famous fine-graiend classification models on this issue. Not only approach we proposed has demonstrated superior performance in fine-grained aicraft classification, but also the mechanisms of the feature encoding under different sample space partitions is revealed for this issue, which provides a re- search for the representation of aircraft fineness characteristics. The relationship between representation orientation of aircraft feature information under various grained divisions, shows that the recognition of different categories according to man-made, such as aircraft, can be achieved by means of the feature represen- tations studied in this paper, for more specific defined classification tasks and various man-made targets partition criteria, which may influences the princi- ple of design for calculation and feature extraction in fine-grained classification models.

Multimodal medical image fusion is a fundamental but challenging problem in the fields of brain science research and brain disease diagnosis, and it is challenging for sparse representation (SR)-based fusion to characterize activity level with single measurement and no loss of effective information. In this paper, the Kronecker-criterion-based SR framework is applied for medical image fusion with a patch-based activity level integrating salient features of multiple domains. Inspired by the formation process of vision system, the spatial saliency is characterized by textural contrast (TC), which is composed of luminance and orientation contrasts to promote more highlighted texture information to participate in the fusion process. As substitution of the conventional l1-norm-based sparse saliency, a metric of sum of sparse salient features (SSSF) is used for promoting more significant coefficients to participate in the composition of activity level measure. The designed activity level measure is verified to be more conducive to maintain the integrity and sharpness of detailed information. Various experiments on multiple groups of clinical medical images verify the effectiveness of the proposed fusion method on both visual quality and objective assessment. Furthermore, the research work of this paper is helpful for further detection and segmentation of medical images.

Accurate power curve modelling is essential to continuously evaluate the performance of a wind turbine (WT). In this work, we characterize the wind power curves using SCADA data acquired at a frequency of 5 minutes in a wind farm (WF) consisting of 5 WTs. Regarding the non-parametric methods, we select artificial neural networks (ANNs) to make curve estimations. Given that, we have the curves provided by the manufacturer of the WTs given by some very precisely measured pair of wind speed and power points. We can evaluate the difference between the manufacturer characterization and the ones estimated with the data provided by the SCADA system. Before the estimation, we propose a method of filtering the anomalies based on the characteristics provided by the manufacturer. We use three-quarters of the available data for curve estimation and one-quarter for the test. One WT suffered a break in the test part, so we can check how the test estimates reflect this problem in its wind-power curve compared to the estimations obtained in the WTs that worked adequately.

Curcumin, found in the rhizome of turmeric, has extensive therapeutic promises via its antioxidant, anti-inflammatory, and antiproliferative properties. Preclinical in vitro and in vivo data have shown curcumin to be an effective treatment for multiple cancers. These effects are drived by curcumin's ability to induce G2/M cell cycle arrest, induction of autophagy, activation of apoptotic pathways, disruption of molecular signaling, inhibition of invasion and metastasis, and by increasing the efficacy of existing chemotherapeutics. Here we focused on the hormetic behaviour of curcumin. Frequently, low doses of toxins and other stressors not only are harmless but also activate an adaptive stress whereas high dose activates acute responses like autophagy and cell death. This phenomenon is referred to as hormesis. Many molecules that cause cell death elicite an initial autophagic step that is a cytoprotective mechanism relying on elimination of dysfunctional structures intracellular, notably by mitophagy. This phenomenon is considered as a primarily protective mechanism against stressors. At higher doses, cells undergo mitochondrial outer membrane permeabilization due to calcium release from the endoplasmic reticulum and die. Herein, we address the complex crosstalk between the induced mitochondrial biogenesis, mitochondrial destabilization accompanied by mitophagy and cell death that can also be at play.

Orthogonal Frequency Division Multiplexing (OFDM) while being an efficient scheme for high data rate wireless communications has drawbacks such as higher Peak-to-Average Power Ratio (PAPR). To reduce PAPR, use of multiple signal representation technique such as Partial Transmit Sequence (PTS) is one of the favored techniques. However, the use of conventional PTS technique need excessive number of complex calculations in order to search for all permissible combinations of phase sequences causing steep increase in complexity in terms of complex computations. Paper aims to reduce the cumbersome process of phase selection by making use of the similarity of the phase vectors. The phase vectors are obtained sequentially and thus minimize the number of changes from one phase vector to another. Theoretical analysis shows that computational complexity is significantly reduced with the help of this proposed novel technique. We have also demonstrated that PAPR values are similar i.e. PAPR reduction capability remains similar but at reduced complexity.

In this work, we explore the ability to dynamically group the Wind Turbine (WT) of a Wind Farm (WF) based on the behaviour of some of their Supervisory Control And Data Acquisition (SCADA) signals to detect the turbines that exhibit abnormal behaviour. We centre this study on a small WF of five WTs. We use the fact that the same signals from different turbines in the same WF coherently evolve temporally in a time domain, describing very similar waveforms. In this contribution, we use averaged signals from the SCADA system and omit maximums, minimums and standard deviations, focusing mainly on velocities and other slowly varying signals. For the temporal analysis, sliding windows of different temporal durations and overlapings are explored. The capability to automatically identify WTs whose signals differ from the group’s behaviour can alert and program preventive maintenance operations on such WTs before a major breakdown occurs.

The electroencephalogram (EEG) is a record of brain activity. Brain Computer Interface (BCI) technology formed by the EEG signal has become one of the hotspots at present. How to extract the feature signal of EEG is the most basic research of BCI technology. In this paper, A new method of recognizing fatigue, conscious, concentrated state of human brain is proposed by the combination of discrete wavelet transform and the neural network based on EEG signal. First of all, the law signal is preprocessed by the wavelet denoising method because the law EEG signal contains a large number of high frequency noise, which is decomposed into multi-layer high frequency signal and low frequency signal. thus, δ wave, θ wave, α wave, β wave are obtained by the wavelet transform. And then, frequency band energy of the different wave is regards as the feature signal of EEG. In the experiment, the feature signal is classified by radial basic function (RBF) and annealed chaotic competitive learning network (ACCLN). RBF and ACCLN networks are trained with 500 sets of sample data and are tested by 100 sets of samples in different mental states. The experimental results show that the average accuracy of RBF network under three conditions are 88.75%, 88.25%, 88.5%, respectively, and the correct rate of ACCLN network is 97%, 98%, 98%, respectively.

A configurable design of a microstrip square spiral RFID tag antenna, for a wide range of microwave frequencies in S- and C-band, is presented. The design is parameterized in dimensions, and hence changing the design frequency (or frequencies) is easy, by changing only an initial value for the spiral geometry. A tag specimen was fabricated using Cu electroplating technique according to the design for frequencies of interest in the areas of 2.4 and 5.8 GHz. The substrate material is a 320 μm high resistivity Si and the bridge dielectric is a 15μm polyimide PI2525. The microfabrication process involves steps of metallic structure pattern transfer techniques with optical UV lithography procedures. The reflection coefficient and gain of the specimen were measured inside an anechoic enclosure using a vector network analyzer (VNA) and a TEM horn test antenna over a frequency range of up to 6 GHz. Simulated and measured results are presented and discussed, exhibiting reasonable agreement.

Time evolution of the quantum correlation of the hybrid qubit-qutrit system in multilocal and global dephasing under the effect of a classical noises environment is presented. We considered the qutrit in z direction and the qubit x direction. In addition, our system presents two configurations: the different and the common environment and our discussion involves three types of noises: A Static Noise (SN), Random Telegraph Noise (RTN) and Ornstein- Uhlenbeck noise (OU). By using the density matrix approach to determine the evolution of the state of the system, the found that the static noise is fatal for the quantum entanglement, the quantum correlation and for RTN and OU noises the quantum entanglement, the quantum correlation decreases monotonically with a sufficiently long time. Therefore, we can say that, entanglement and the quantum correlation are more robust to the noise precisely those Random telegraph noise and Ornstein-Uhlenbeck noise.

The paper describes the new method for image compression based on coordinated group signal transformation. The algorithm is a type of difference coding. Coordinated processing significantly simplifies the difference signal conversion scheme using a single group codec for all signals. The described method considers color channels as correlated signals of a multi-channel communication system. The specifics of the processed data required modification of the coordinated group processing algorithm. First, we changed how to calculate the difference signals to prevent data loss. Secondly, the group codec was supplemented with a neural network to improve the quality of reconstructed images. We considered the following types of neural networks: fully connected, recurrent, convolution, and convolution in the Fourier space. Based on the simulation results, it is best to use fully connected neural networks if the goal is to minimize processing delay time. These networks have a response time of 13 ms. On the other hand, if the priority is to improve quality in cases where delays are not critical, then convolution neural networks in the Fourier space should be used. These networks have a response time of 140 ms and are of significant interest.

Diffusion magnetic resonance imaging (dMRI) is an imaging technique that provides information on the microstructural organization of biological tissue. dMRI allows for non-invasive visualization and quantitative assessment of white matter architecture in the brain by characterizing restrictions on the random motion of water molecules. Ultra-high field MRI scanners, such as those operating at 7 Tesla (7T) or higher, can boost signal-to-noise ratio (SNR) to improve dMRI compared with what is attainable at conventional field strengths such as 3T or 1.5T. However, at 7T wavelength effects cause lower transmit magnetic field efficiency in the human brain, mainly in the posterior fossa region, manifesting as signal dropouts in this region. Recently, we reported a simple approach of using a wireless radiofrequency (RF) surface array to improve transmit efficiency and signal sensitivity at 7T. Here we demonstrate the feasibility and effectiveness of using this RF enhancer for in-vivo dMRI at 7T. The use of the RF enhancer can effectively recover signal dropouts in the regions with intrinsically lower SNR such as cerebellum, leading to a better depiction of principal fiber orientations and enhanced visualization of extended tracts to the brainstem and pons enabling more comprehensive delineation of the full white matter architecture.

This paper proposes an enhanced Quantum Key Distribution (QKD) protocol by incorporating a Three-Dimensional Angular Momentum Representation (3D AMR) to address vulnerabilities inherent in traditional two-dimensional polarization states-based systems. The 3D AMR method expands the state space, potentially increasing security against sophisticated quantum attacks. We present a theoretical and computational framework that transitions from the conventional two-dimensional polarization to a three-dimensional angular momentum space, which inherently increases the complexity and security of the quantum states used in QKD.

Vibration signal analysis is regarded as a fundamental approach in diagnosing faults in rolling bearings, and recent advancements have shown notable progress in this domain. However, the presence of substantial background noise often results in the masking of these fault signals, posing a significant challenge for researchers. In response, an Adaptive Denoising Autoencoder (ADAE) approach is proposed in this paper. The data representations are learned by the encoder through convolutional layers, while the data reconstruction is performed by the decoder using deconvolutional layers. Both the encoder and decoder incorporate adaptive shrinkage units to simulate denoising functions, effectively removing interfering information while preserving sensitive fault features. Additionally, dropout regularization is applied to sparsify the network and prevent overfitting, thereby enhancing the overall expressive power of the model. To further enhance ADAE's noise resistance, shortcut connections are added. Evaluation using publicly available datasets under scenarios with known and unknown noise demonstrates that ADAE effectively enhances the signal-to-noise ratio in strongly noisy backgrounds, facilitating accurate diagnosis of faults in rolling bearings.

In electromagnetic ultrasonic testing, it is difficult to recognize small-size bottom cracks by time of flight (ToF), and the lift-off fluctuation of the probe affects the accuracy and consistency of the inspection results. In order to overcome the difficulty, a novel EMAT (electromagnetic acoustic transducer)-PEC (pulse eddy current) composite sensor is designed. We use amplitude of bottom echo recorded by EMAT to identify the tiny bottom crack as well as the amplitude of PEC signals picked up by the integrated symmetric coils to measure the average lift-off of the probe in real time. Firstly, the effects of lift-off and bottom cracks on amplitude of bottom echo are distinguished combining the theoretical analysis and finite element method (FEM). And then an amplitude correction method based on the fusion of EMAT and PEC signals is proposed to reduce the impact of lift-off on the defect signal. The experimental results demonstrate that the designed composite sensor can effectively detect the bottom crack as small as 0.1mm* 0.3mm. The signal fusion method can accurately correct the amplitude of defect signal and the relative error is less than ±8%.

Sparse training (ST) aims to ameliorate deep learning by replacing fully connected artificial neural networks (ANNs) with sparse or ultra-sparse ones, such as brain networks are, therefore it might benefit to borrow brain-inspired learning paradigms from complex network intelligence theory. Here, we launch the ultra-sparse advantage challenge, whose goal is to offer evidence on the extent to which ultra-sparse (around 1% connection retained) topologies can achieve any leaning advantage against fully connected. Epitopological learning is a field of network science and complex network intelligence that studies how to implement learning on complex networks by changing the shape of their connectivity structure (epitopological plasticity). One way to implement Epitopological (epi- means new) Learning is via link prediction: predicting the likelihood of non-observed links to appear in the network. Cannistraci-Hebb learning theory inspired the CH3-L3 network automata rule for link prediction which is effective for general-purpose link prediction. Here, starting from CH3-L3 we propose Epitopological Sparse Meta-deep Learning (ESML) to apply Epitopological Learning to sparse training. In empirical experiments, we find that ESML learns ANNs with ultra-sparse hyperbolic (epi-)topology in which emerges a community layer organization that is meta-deep (meaning that each layer also has an internal depth due to power-law node hierarchy). Furthermore, we discover that ESML can in many cases automatically sparse the neurons during training (arriving even to 30% neurons left in hidden layers), this process of node dynamic removal is called percolation. Starting from this network science evidence, we design Cannistraci-Hebb training (CHT), a 4-step training methodology that puts ESML at its heart. We conduct experiments on 7 datasets and 5 network structures comparing CHT to dynamic sparse training SOTA algorithms and the fully connected counterparts. The results indicate that, with a mere 1% of links retained during training, CHT surpasses fully connected networks on VGG16, GoogLeNet, ResNet50, and ResNet152. This key finding is an evidence for ultra-sparse advantage and signs a milestone in deep learning. CHT acts akin to a gradient-free oracle that adopts CH3-L3-based epitopological learning to guide the placement of new links in the ultra-sparse network topology to facilitate sparse-weight gradient learning, and this in turn reduces the convergence time of ultra-sparse training. Finally, CHT offers the first examples of parsimony dynamic sparse training because, in many datasets, it can retain network performance by percolating and significantly reducing the node network size. Our code is available at: https://github.com/biomedical-cybernetics/Cannistraci-Hebb-training.

The integration of deep neural networks into sparse Synthetic Aperture Radar (SAR) imaging has been explored to enhance SAR imaging performance and reduce the system’s sampling rate. However, the scarcity of training samples and mismatches between the training data and the SAR system pose significant challenges to the method’s further development. In this paper, we propose a novel SAR imaging approach based on Deep Image Prior Powered by RED (DeepRED), enabling unsupervised SAR imaging without the need for additional training data. Initially, DeepRED is introduced as the regularization technique within the sparse SAR imaging model. Subsequently, variable splitting and the Alternating Direction Method of Multipliers (ADMM) are employed to solve the imaging model, alternately updating the magnitude and phase of the SAR image. Additionally, the SAR echo simulation operator is utilized as an observation model to enhance computational efficiency. Through simulations and real data experiments, we demonstrate that our method maintains imaging quality and system downsampling rate on par with deep neural network-based sparse SAR imaging, but without the requirement for training data.

Decision tree algorithms have been among the most popular algorithms for interpretable (transparent) machine learning since the early 1980s. On the other hand, deep learning methods have boosted the capacity of machine learning algorithms and are now being used for non-trivial applications in various applied domains. But training a fully-connected deep feed-forward network by gradient-descent backpropagation is slow and requires arbitrary choices regarding the number of hidden units and layers. In this paper, we propose near-optimal neural regression trees, intending to make it much faster than deep feed-forward networks and for which it is not essential to specify the number of hidden units in the hidden layers of the neural network in advance. The key idea is to construct a decision tree and then simulate the decision tree with a neural network. This work aims to build a mathematical formulation of neural trees and gain the complementary benefits of both sparse optimal decision trees and neural trees. We propose near-optimal sparse neural trees (NSNT) that is shown to be asymptotically consistent and robust in nature. Additionally, the proposed NSNT model obtain a fast rate of convergence which is near-optimal up to some logarithmic factor. We comprehensively benchmark the proposed method on a sample of 80 datasets (40 classification datasets and 40 regression datasets) from the UCI machine learning repository. We establish that the proposed method is likely to outperform the current state-of-the-art methods (random forest, XGBoost, optimal classification tree, and near-optimal nonlinear trees) for the majority of the datasets.

This paper introduces a novel method for accurately calculating the upper biomass of single trees using Light Detection And Ranging (LiDAR) point cloud data. The proposed algorithm involves classifying the tree point cloud into two distinct ones: the trunk point cloud and the crown point cloud. Each part is then processed using specific techniques to create a 3D model and determine its volume. The trunk point cloud is segmented based on individual stems, with each stem further divided into slices that are modeled as cylinders. On the other hand, the crown point cloud is analyzed by calculating its footprint and gravity center. The footprint is further divided into angular sectors, with each being used to create a rotating surface around the vertical line passing through the gravity center. All models are represented in a matrix format, simplifying the process of minimizing and calculating the tree’s upper biomass, consisting of crown biomass and trunk biomass. To validate the proposed approach, both terrestrial and airborne datasets are utilized. A comparison with existing algorithms in the literature confirms the effectiveness of the new method. The study shows that the proposed algorithm achieves an average fit between 0.01 m and 0.49 m for individual trees.

The production of recombinant proteins in Escherichia coli is often challenged by cytoplasmic expression due to proteolytic degradation and inclusion body formation. Extracellular expression can overcome these problems by simplifying downstream processing and improving protein yields. This study aims to compare the efficiency of two Bacillus subtilis chitosanase signal peptides in mediating extracellular secretion in E. coli. We identified a naturally occurring mutant signal peptide (mCsn2-SP) from B. subtilis CH2 chitosanase (CH2CSN), which is characterized by a deletion of six amino acids in the N-region relative to the signal peptide (Csn1-SP) from B. subtilis CH1 chitosanase (CH1CSN). The CH1CSN and CH2CSN genes were cloned into the pET-11a vector and protein secretion was evaluated in E. coli BL21(DE3) host cells. Expression was induced with 0.1 mM and 1 mM IPTG at 30°C for one and three days. CH2CSN showed higher secretion levels compared to CH1CSN under all experimental conditions, especially with 0.1 mM IPTG induction for 3 days, which resulted in a 2.37-fold increase in secretion. These results suggest that signal peptide deletion variants may have an effect on protein secretion efficiency and help to further understand the function of signal peptides.

Dynamic sparse training is an effective strategy to alleviate the training and inference demands of artificial neural networks. However, current sparse training methods face a challenge in achieving high levels of sparsity while maintaining performance comparable to that of their fully connected counterparts. The Cannistraci-Hebb training (CHT) method produces an ultra-sparse advantage compared to fully connected training in various tasks by using a gradient-free link regrowth method, which relies solely on the network topology. However, its rigid selection based on link prediction scores may lead to epitopological local minima, especially at the beginning of the training process when the network topology might be noisy and unreliable. In this article, we introduce the Cannistraci-Hebb training soft rule (CHTs), which applies a flexible approach to both the removal and regrowth of links during training, fostering a balance between exploring and exploiting network topology. Additionally, we investigate the network topology initialization using several approaches, including the bipartite scale-free and bipartite small-world network models. Empirical results show that CHTs can surpass the performance of fully connected networks with MLP architecture by using only 1% of the connections (99% sparsity) on the MNIST, EMNIST, and Fashion MNIST datasets and can provide remarkable results with only 0.1% of the links (99.9% sparsity). In some MLPs for image classification tasks, CHTs can reduce the active neuron network size to 20% of the original nodes (neurons), demonstrating a remarkable ability to generalize better than fully connected architectures, reducing the entire model size. This represents a relevant result for dynamic sparse training. Finally, we present evidence from larger network models such as Transformers, with 10% of the connections (90% sparsity), where CHTs outperform other prevalent dynamic sparse training methods in machine translation tasks.

The occurrence of chaotic instability of oscillations at the output of a single-stage amplifier on a powerful bipolar microwave transistor when a biharmonic signal is amplified is considered. It has been established that at a high level of the input signal at the output of the amplifier, the signal contains a significant chaotic component. Cases were experimentally studied when the frequency distance between the partial frequency components of a biharmonic signal is close to the gain band and when it is much smaller than this band. It has been established that in the first case, the chaos in oscillations is associated with the emergence of a sequence of trains of a forced oscillatory process with arbitrary initial phases and durations. In the second case, the appearance of a chaotic pedestal is associated with the chaos in the passive underexcited mode of the nonlinear circuit formed by the capacitance of the p-n junction and the input matching circuits of the amplifier stage.

Plant activators have emerged as promising alternatives to conventional pesticides for crop disease manage-ment due to their unique mode of action. By priming the plant's innate immune system, these compounds can induce systemic acquired resistance against a broad spectrum of pathogens without directly inhibiting their proliferation. Key advantages of plant activators include prolonged defense activity, lower effective dosages, and negligible risk of developing pathogen resistance. Among the various defensive pathways tar-geted, the salicylic acid (SA) signaling cascade has been extensively explored, leading to the successful devel-opment of commercial activators like benzothiadiazole for widespread application in crop protection. While the action sites of many SA-targeting activators have been preliminarily mapped to different steps along the pathway, a comprehensive understanding of their precise mechanisms remains elusive. This review provides a historical perspective on plant activator development and outlines diverse screening strategies employed across multiple levels, from whole-plant bioassays to molecular and transgenic approaches. We expound on the intricate components, biological relevance, and regulatory circuits governing the SA pathway, while criti-cally examining the structural features, bioactivities, and proposed modes of action of classical activators such as benzothiadiazole derivatives, salicylic acid analogs, and other small molecules. Insights from field trials as-sessing their practical applicability are also discussed. Furthermore, we highlight the current status, challenges, and future prospects in the realm of SA-targeting activator development globally, with a focus on recent en-deavors in China. Collectively, this comprehensive review aims to synthesize existing knowledge and provide a roadmap for future research toward developing more potent and mechanistically understood plant activa-tors that fortify crop immunity against disease.

Analysis of non-stationary and nonlinear sound signals obtained from dynamical processes is one of the greatest challenges in signal processing. Turning machine operation is a highly dynamic process persuaded by many events such as dynamical responses, chip formations and operational conditions of machining. Traditional and widely used fast Fourier transformation and spectrogram is not suitable for processing sound signals acquired from dynamical systems as its result have significant deficiencies because of stationary assumptions and having priori basis. The relatively new technique, Discrete Wavelet Transform, which uses Wavelet decomposition and the recently developed technique, Hilbert Huang Transform (HHT) which uses Empirical Mode Decomposition have notably better properties in the analysis of nonlinear and non-stationary sound signals. This paper presents a comparative study on the decomposition of multicomponent sound signals using Empirical Mode Decomposition and Wavelet Decomposition to highlight the suitability found in HHT to analyze tool-emitted sound signals received from turning processes. Apart from the short mathematical and theoretical foundations of the transformations, this paper demonstrates their decomposition strength using an experimental case study of tool flank wear monitoring in turning. It also concludes HHT is more suitable than DWT to analyze tool-emitted sound signals received from turning processes.

Weak signal spectral detection is a serious problem in many applications, especially the target possesses certain frequency band and under low signal-to-noise ratio (SNR). A kind of novel technique based on pre-whitening scale-transformation symmetric bistable parallel stochastic resonance (SR) is proposed to solve the problem. Firstly, the pre-whitening can ensure the even distribution of the receiving signal to fit the requirement of SR processing. Secondly, the scale- transformation can help to utilize the weak signal improvement property especially under low frequency band more effectively. Thirdly, the symmetric bistable parallel SR can try to reduce the variance of the clutter and additive noise fluently. Fourthly, by subtracting the steady state re-sponse of the selected symmetric bistable SR system from the parallel SR output, the weak signal spectral detection objective can be realized successfully. Simulation results based on the real sea clutter radar data guarantee the effectiveness and applicability of the proposed symmetric bistable PSR processing approach.

In contemporary construction, the prevalence of vibration serviceability issues in lightweight and slender structures has become increasingly common, owing to advancements in building materials and construction methods. While these structures often meet the criteria for ultimate limit states, they can still elicit complaints due to excessive vibrations induced by human activity. To address this challenge, the Integral Resonant Control (IRC) technique has emerged as a favored approach for actively damping vibrations in various systems. This study introduces a fresh perspective on implementing a multi-input multi-output (MIMO) IRC scheme for active vibration control (AVC) specifically tailored for pedestrian structures utilizing inertial mass actuators. Building upon a common framework and design methodology outlined in previous research, this work presents a novel application of MIMO IRC for AVC. The designed controller is rigorously tested and implemented on a laboratory floor structure to validate its efficacy.

The report details out programming approach for automating warehouse using Answer Set Programming.

In this paper, we introduce new formulas for calculating the restoring and repulsive magnetic forces between two non-coaxial circular loops with parallel axes. These formulas are derived from a modified version of Grover’s formula for mutual inductance between the coils in question. Utilizing these formulas, we compute the restoring and repulsive magnetic forces between two non-coaxial thick coils of rectangular cross-sections with parallel axes. In these calculations, we apply the filament method and conduct investigations to determine the optimal number of subdivisions for the coils in terms of computational time and accuracy. The method presented in this paper is also applicable to all conventional non-coaxial coils, such as disks, solenoids, and non-conventional coils like Bitter coils, all with parallel axes. This paper emphasizes the accuracy and computational efficiency of the calculations. Furthermore, the new method is validated according to several previously established methods

This paper investigates the potential of utilising multilevel quasi-interpolation techniques on Chebyshev sparse grids for complex numerical computations. The paper starts by laying down the motivations for choosing Chebyshev sparse grids and quasi-interpolation methods with Gaussian kernels. It delves into the practical aspects of implementing these techniques. Various numerical experiments are performed to evaluate the efficiency and limitations of the multilevel quasi-sparse interpolation methods with dimensions two dimension and three dimension. The work ultimately aims to provide a comprehensive understanding of the computational efficiency and accuracy achievable through this approach, comparing its performance with traditional methods.

Bacillus amyloliquefaciens GL18 has been proven to have good resistance ability and can promote the growth of Avena sativa cultivar ‘Qingyan 1’. Herein, Illumina high-throughput transcriptome sequencing technology was used to analyze the differential expression of genes between the interaction group (LB) and the control group (LCK) when ‘Qingyan 1’ roots interacted with GL18 bacterial suspension or sterile water for 12 h under 4 °C low-temperature stress. The gene function annotation information was obtained using Gene Ontology (GO) functional classification and enrichment analysis. Kyoto Encyclopedia of Genes and Genomes (KEGG) pathway enrichment analysis and annotation of differentially expressed genes was used to explore the related signal transduction pathway of ‘Qingyan 1’ response to cold stress induced by Bacillus GL18. The results showed that after ‘Qingyan 1’ seedlings interacted with GL18 bacterial suspension or sterile water for 12 h, comparing the LB with the LCK or CK (the control group at 26 °C), there were 12,061 and 25,489 differentially expressed genes, respectively. Their functions were mainly related to metabolic process, cellular process, catalytic activity, binding, and cellular parts, and they were significantly enriched in plant tissue growth and development, cell wall, organelle membrane synthesis, thiamine and its compounds, biosynthesis, polyamine decomposition, and other metabolic processes. Signal transduction was detected through KEGG pathway enrichment analysis, and corresponding genes, such as AUXI, PP2C, SNRK2, ABF, BRI1, and PIF4, were expressed. The expression of genes directly involved in plant growth was upregulated in the presence of GL18, as shown by real-time quantitative PCR analysis. It was speculated that the normal growth and development of ‘Qingyan 1’ under low-temperature stress promoted by GL18 is a result of the integration of multiple pathways in terms of regulating endogenous hormone metabolism, secondary metabolite synthesis, and photosynthesis.

High-frequency circuit performance is significantly impacted by impedance variations, particularly within the low-resistance regime. Traditional Ohm’s Law based modeling approaches often fail to accurately predict circuit behavior in these conditions, leading to design inaccuracies and potential system failures. The Standard Ohm’s Law based model’s prediction of infinite current as resistance approaches zero is physically unrealistic and hinders its application in practical scenarios. Despite the recognition of these limitations, existing models have not comprehensively addressed the complex impedance behavior observed in high-frequency circuits. To overcome these challenges, this paper introduces a modified version of the Ohm’s Law incorporating an exponential correction term. The Modified Ohm’s Law’s accuracy was evaluated through simulated experiments across a wide frequency range (1kHz to 1GHz) using various electronic components. The findings demonstrate the superior performance of the modified model in predicting currents under low-resistance and high-current conditions compared to the Standard Ohm’s Law model. By providing finite and accurate current values, the proposed model effectively mitigates the unrealistic infinite current predictions of the standard approach. The enhanced predictive capabilities of the Modified Ohm’s Law hold significant implications for high-frequency circuit design and analysis. Its application can lead to improved performance and reliability in power electronics, telecommunications, and other high-frequency systems. By incorporating non-linear impedance behavior, the model offers a more accurate representation of real-world circuit conditions. Future research should focus on refining the exponential term’s parameters to optimize the model's accuracy across a broader range of applications. Additionally, real-time implementation and hardware validation are essential to assess the model's practical utility in complex circuit environments.

We proposed a deep learning based chemometric data analysis technique. We trained L2 regularized sparse autoencoder end-to-end for reducing the size of the feature vector to handle the classic problem of curse of dimensionality in chemometric data analysis. We introduce a novel technique of automatic selection of nodes inside hidden layer of an autoencoder through pareto optimization. Moreover, linear regression, ϵ-SVR , and Gaussian process regressor are applied on the reduced size feature vector for the regression. We evaluated our technique on orange juice and wine dataset and results are compared against state-of-the-art methods. Quantitative results are shown on Normalized Mean Square Error (NMSE) and the results show considerable improvement in the state-of- the-art.

Clustering is an important task in data mining that has become more challenging due to the ever-increasing size of available datasets. To cope with these big data scenarios, a high-performance clustering approach is required. Sparse grid clustering is a density-based clustering method that uses a sparse grid density estimation as its central building block. The underlying density estimation approach enables the detection of clusters with non-convex shapes and without a predetermined number of clusters. In this work, we introduce a new distributed and performance-portable variant of the sparse grid clustering algorithm that is suited for big data settings. Our compute kernels were implemented in OpenCL to enable portability across a wide range of architectures. For distributed environments, we added a manager-worker scheme that was implemented using MPI. In experiments on two supercomputers, Piz Daint and Hazel Hen, with up to 100 million data points in a 10-dimensional dataset, we show the performance and scalability of our approach. The dataset with 100 million data points was clustered in 1198s using 128 nodes of Piz Daint. This translates to an overall performance of 352TFLOPS. On the node-level, we provide results for two GPUs, Nvidia's Tesla P100 and the AMD FirePro W8100, and one processor-based platform that uses Intel Xeon E5-2680v3 processors. In these experiments, we achieved between 43% and 66% of the peak performance across all compute kernels and devices, demonstrating the performance portability of our approach.

Reconstruction of fine-scale information from sparse data is often needed in practical fluid dynamics where the sensors are typically sparse and yet, one may need to learn the underlying flow structures or inform predictions through assimilation into data-driven models. Given that sparse reconstruction is inherently an ill-posed problem, the most successful approaches encode the physics into an underlying sparse basis space that spans the manifold to generate well-posedness. To achieve this, one commonly uses generic orthogonal Fourier basis or data specific proper orthogonal decomposition (POD) basis to reconstruct from sparse sensor information at chosen locations. Such a reconstruction problem is well-posed as long as the sensor locations are incoherent and can sample the key physical mechanisms. The resulting inverse problem is easily solved using $l_2$ minimization or if necessary, sparsity promoting $l_1$ minimization. Given the proliferation of machine learning and the need for robust reconstruction frameworks in the face of dynamically evolving flows, we explore in this study the suitability of non-orthogonal basis obtained from Extreme Learning Machine (ELM) auto-encoders for sparse reconstruction. In particular, we assess the interplay between sensor quantity and sensor placement for a given system dimension for accurate reconstruction of canonical fluid flows in comparison to POD-based reconstruction.

Article explores participant specific study of muscle inherehit dynamics hidden inside the diognostic electromyography (D-EMG) signals during load pull exercises, aiming to uncover underlying patterns and nonlinear behaviors. Employing a multi-step analytical framework, the study first evaluates signal stationarity through Quantile-Quantile (Q-Q) plot and surrogate data analyses, revealing insights into signal stability. Subsequent use of phase space reconstruction techniques exposes intrinsic dynamics within the EMG signals, visualized through Poincar´e maps, elucidating attractor geometry and system dynamics. Histogram analysis further dissects the Poincar´e maps, offering insights into signal behavior relative to physiological processes. Additionally, the study quantifies the largest Lyapunov exponent from the Poincar´e maps, providing a measure of dynamical complexity within the muscle EMG signals during load pull exercises. By integrating these methods, this research sheds light on the nuanced interplay between EMG signals and muscle activity during dynamic exercises, offering valuable insights for rehabilitation strategies.

Multispectral image (MSI) and hyperspectral image (HSI) fusion (MHIF) aims to address the challenge of acquiring high-resolution (HR) HSI images. This field combines a low-resolution (LR) HSI with an HR-MSI to reconstruct HR-HSI. Existing methods directly utilize transformers to perform feature extraction and fusion. Despite the demonstrated success, there exist two limitations: 1) Employing the entire transformer model for feature extraction and fusion fails to fully harness the transformer’s potential in integrating the spectral of the HSI and spatial information of the MSI. 2) HSI has a strong spectral correlation and exhibits sparsity in the spatial domain. Existing transformer-based models do not optimize this physical property, which makes their methods prone to spectral distortion. To accomplish these issues, this paper introduces a novel framework for MHIF called Sparse Mix-Attention Transformer (SAMformer). Specifically, to fully harness the advantages of the Transformer architecture, we propose a Spectral Mix Attention Block (SMAB), which concatenates the keys and values extracted from LR-HSI and HR-MSI to create a new multi-head attention module. This design facilitates the extraction of detailed long-range information across spatial and spectral dimensions. Besides, to address the spatial sparsity inherent in HSI, we incorporated a sparse mechanism within the core of SMAB called Sparse Spectral Mix Attention Block (SSMAB). In the SSMAB, we compute attention maps from queries and keys and select the K highly correlated values as the sparse attention map. This approach enables us to achieve a sparse representation of spatial information while eliminating spatially disruptive noise. Extensive experiments conducted on three benchmark datasets, namely Cave, Harvard, and Pavia Center, demonstrate the SMAformer method outperforms state-of-the-art methods.

Remote Photoplethysmography (rPPG) has emerged as a non-intrusive and promising physiological sensing capability in HCI research, gradually extending its applications in health-monitoring and clinical care contexts. With advanced machine learning models, recent datasets collected in real-world conditions have gradually enhanced the performance of rPPG methods in recovering heart-rate and heart-rate variability metrics. However, the signal quality of reference ground-truth PPG data in existing datasets is by and large neglected, while poor quality references negatively influence models. Here, this work introduces a new imaging blood volume pulse (iBVP) dataset of synchronized RGB and thermal infrared videos with PPG ground-truth signals from the ear and its high resolution signal quality labels, for the first time. Participants perform rhythmic breathing, head-movement, and stress-inducing tasks, which help reflect real-world variations in psycho-physiological states. This work conducts dense (per sample) signal quality assessment to discard noisy segments of ground-truth and corresponding video frames. We further present a novel end-to-end machine learning framework, iBVPNet that features an efficient and effective spatio-temporal feature aggregation for reliable estimation of BVP signals. Finally, this work examines the feasibility of extracting BVP signals from thermal video frames, which is underexplored. The iBVP dataset and source codes are publicly available for research use.

The realm of natural language processing has always been fascinated by the intricacies of sentence semantics. The emergence of context-aware word representations, especially from pre-trained models like ELMO and BERT, has revolutionized several semantic tasks including but not limited to, question answering, text categorization, and sentiment analysis. Despite these advancements, the integration of supplementary knowledge, particularly syntactic, to augment semantic comprehension in models remains an area ripe for exploration. This paper introduces the Syntactic Enhancement Network (SEN), a pioneering method for synergizing syntactic elements with established pre-trained language models. Our approach encompasses a dual-phase evaluation: initially, we delve into the syntactic augmentation of both RNN-based and Transformer-based language models; subsequently, we test our SEN's proficiency in two specific domains: the task of sentence completion and the extraction of biological relationships. The results are striking, with SEN achieving a stellar 91.2% accuracy in sentence completion—surpassing baseline models by a substantial 37.8%. In the context of biological relation extraction, SEN demonstrates competitive prowess with a 75.1% F1 score.

Scientific progress is increasingly dependent on knowledge in computation-ready forms. In the life sciences, among others, many scientists therefore extract and structure knowledge from the literature. In a process called manual curation, they enter knowledge into spreadsheets, or into databases where it serves their and many others' research. Valuable as these curation efforts are, the range and detail of what can practically be captured and shared remains limited, because of the constraints of current curation tools. Many important contextual aspects of observations described in literature simply do not fit in the form defined by these tools, and thus cannot be captured. Here we present the design of an easy-to-use, general-purpose method and interface, that enables the precise semantic capture of virtually unlimited types of information and details, using only a minimal set of building blocks. Scientists from any discipline can use this to convert any complex knowledge into a form that is easily readable and meaningful for both humans and computers. The method VSM forms a universal and high-level language for encoding ideas, and for interacting with digital knowledge.

In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k; 0 ≤ k ≤ n−1 or 1 ≤ k ≤ n, by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m = 5; 7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n^2m+1; m ≥ 0 as sum of row terms of corresponding triangle. In other words, in this manuscript are found and discussed the polynomials D_m(n,k) and U_m(n,k), such that, when being summed up over k in some range with respect to m and n returns the monomial n^2m+1.

In this paper, we introduce a way of representing a given mapping as the sum of odd and even mappings. Then, by using this representation, we investigate the stability of various forms for the general nonic functional equation.

AI research and implementations are growing, and so are the risks associated with AI (Artificial Intelligence) developments, especially when it’s difficult to understand exactly what they do and how they work, both at a localized level, and at deployment, in particular when distributed and on a large scale. Governments are pouring massive funding to promote AI research and education, yet research results and claims, as well as the effectiveness of educational programmes, can be difficult to evaluate given the limited reproducibility of computations based on ML (machine learning) and poor explainability, which in turn limits the accountability of the systems and can cause cascading systemic problems and challenges including poor reproducibility, reliability, and overall lack of trustworthiness. This paper addresses some of the issues in Knowledge Representation for AI at system level, identifies a number of knowledge gaps and epistemological challenges as root causes of risks and challenges for AI, and proposes that neurosymbolic and hybrid KR approaches can serve as mechanisms to address some of the challenges. The paper concludes with a postulate and points to related and future research

This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel dimension iteration sparse grid}) method, implements the sparse grid method based on a dimension iteration/reduction procedure, it does not need to store the integration points, nor does it compute the function values independently at each integration point, instead, it reuses the computation for function evaluations as much as possible by performing the function evaluations at all integration points in a cluster and iteratively along coordinate directions. It is shown numerically that the computational complexity (in terms of CPU time) of the proposed MDI-SG method is of polynomial order $O(Nd^3 )$ or better, compared to the exponential order $O(N(\log N)^{d-1})$ for the standard sparse grid method, where $N$ denotes the maximum number of integration points in each coordinate direction. As a result, the proposed MDI-SG method effectively circumvents the curse of dimensionality suffered by the standard sparse grid method for high-dimensional numerical integration.

This paper presents an innovative approach to dimensionality reduction and feature extraction in high-dimensional datasets, with a specific application focus on wood surface defect detection. The proposed framework integrates sparse modeling techniques, particularly Lasso and proximal gradient methods, into a comprehensive pipeline for efficient and interpretable feature selection. Leveraging pre-trained models such as VGG19 and incorporating anomaly detection methods like Isolation Forest and Local Outlier Factor, our methodology addresses the challenge of extracting meaningful features from complex datasets. Evaluation metrics such as accuracy and F1 score, alongside visualizations, are employed to assess the performance of the sparse modeling techniques. Through this work, we aim to advance the understanding and application of sparse modeling in machine learning, particularly in the context of wood surface defect detection.

We present a new penalized method for estimation in sparse logistic regression models with group structure. Group sparsity suggests us to consider the Group Lasso penalty. Being different from penalized log-likelihood estimation, our method can be viewed as a penalized weighted score function method. Under some mild conditions, we provide non-asymptotic oracle inequalities promoting group sparsity of predictors. A modified block coordinate descent algorithm based on a weighted score function is also employed. The net advantage of our algorithm over the existing Group Lasso-type procedures is that the tuning parameter can be pre-specified. The simulations show that this algorithm is considerably faster and more stable than competing methods. Finally, we illustrate our methodology with two real data sets.

Hyperspectral small target detection (HSTD) is a promising pixel-level detection task. However, due to the low contrast and imbalance number between the target and background spatially and high dimensions spectrally, it is a challenging one. To address these issues, this work proposes a representation learning-based graph and generative network for hyperspectral small target detection. The model builds a fusion network through frequency representation for HSTD, where the novel architecture incorporates irregular topological data and the spatial-spectral feature to improve its representation ability. Firstly, a graph convolutional network (GCN) module better models the non-local topological relationship between samples to represent the hyperspectral scene’s underlying data structure. The mini-batch-training pattern of the GCN decreases the high computational cost of building an adjacency matrix for high-dimensional data sets. In parallel, the generative model enhances the differentiation reconstruction and the deep feature representation ability with respect to the target spectral signature. Finally, a fusion module compensates for the extracted different types of HS features and integrates their complementary merits for hyperspectral data interpretation while increasing detection and background suppression capabilities. Experiments on different hyperspectral data sets demonstrate the advantages of the proposed architecture.

Complexity science studies physical phenomena that cannot be explained by the mere analysis of the single units of a system but requires to account for their interactions. A feature of complexity in connected systems is the emergence of mesoscale patterns in a geometric space, such as groupings in bird flocks. These patterns are formed by groups of points that tend to separate from each other, creating mesoscale structures. When multidimensional data or complex networks are embedded in a geometric space, some mesoscale patterns can appear respectively as clusters or communities, and their geometric separability is a feature according to which the performance of an algorithm for network embedding can be evaluated. Here, we introduce a framework for the definition and measure of the geometric separability (linear and nonlinear) of mesoscale patterns by solving the travelling salesman problem (TSP), and we offer experimental evidence on embedding and visualization of multidimensional data or complex networks, which are generated artificially or are derived from real complex systems. For the first time in literature the TSP’s solution is used to define a criterion of nonlinear separability of points in a geometric space, hence redefining the separability problem in terms of the travelling salesman problem is an innovation which impacts both computer science and complexity theory.

The RV144 trial represents the only vaccine trial to demonstrate any protective effect against HIV-1 infection. While the reason(s) for this protection are still being evaluated, it serves as justification for widespread efforts aimed at developing new, more effective HIV-1 vaccines. Advances in our knowledge of HIV-1 immunogens and host antibody responses to these immunogens are crucial to informing vaccine design. While the envelope (Env) protein is the only viral protein present on the surface of virions, it exists in a complex trimeric conformation and is decorated with an array of variable N-linked glycans, making it an important but difficult target for vaccine design. Thus far, efforts to elicit a protective humoral immune response using structural mimics of native Env trimers have been unsuccessful. Notably, the aforementioned N-linked glycans serve as a component of many of the epitopes crucial for the induction of potentially protective broadly neutralizing antibodies (bnAbs). Thus, a greater understanding of Env structural determinants, most critically Env glycosylation, will no doubt be of importance in generating effective immunogens. Recent studies have identified the HIV-1 Env signal peptide (SP) as an important contributor to Env glycosylation. Further investigation into the mechanisms by which the SP directs glycosylation will be important, both in the context of understanding HIV-1 biology and in order to inform HIV-1 vaccine design.

Digital filtering is a fundamental technique in digital signal processing, which operates on a digital sequence without any information on how the sequence was generated. This paper proposes a methodology for designing the equivalent of digital filtering for neuromorphic samples, which are a low power alternative to conventional digital samples. In the literature, filtering using neuromorphic samples is done by filtering the reconstructed analog signal, which is required to belong to a predefined input space. We show that this requirement is not necessary, and introduce a new method for computing the neuromorphic samples of the filter output directly from the input samples, backed by theoretical guarantees. We show numerically we can achieve a similar accuracy compared to the conventional method. However, given that we bypass the analog signal reconstruction step, our results show significantly reduced computation time for the proposed method and good performance even when signal recovery is not possible.

A consistent theory of quantum entanglement requires that constituent single-particle states belong to the same Hilbert space, the coherent eigenstates of a complete set of operators in a given representation, defined with respect to a shared continuous parameterization. Formulating such eigenstates for a single relativistic particle with spin, and applying them to the description of many-body states, presents well-known challenges. In this paper, we review the covariant theory of relativistic spin and entanglement in a framework first proposed by Stueckelberg and developed by Horwitz, Piron, et.\ al. This approach modifies Wigner's method by introducing an arbitrary timelike unit vector $n^\mu$ on which one induces a representation of $SL(2,C)$, rather than induce on the spacetime momentum $p^\mu$. Generalizing this approach, we construct relativistic spin states on an extended phase space $\{(x^\mu,p^\mu),(\zeta^\mu,\pi^\mu)\}$, inducing a representation on the momentum $\pi^\mu$, thus providing a novel dynamical interpretation of the timelike unit vector $n^\mu = \pi^\mu / M$. Studying the unitary representations of the Poincar\'e group on the extended phase space allows us to define basis quantities for quantum states and develop the gauge invariant electromagnetic Hamiltonian in classical and quantum mechanics. We write plane wave solutions for free particles and construct stable singlet states, and relate these to experiments involving temporal interference, analogous to the spatial interference known from double slit experiments.

Intelligent fault diagnosis techniques have replaced the time-consuming and unreliable human analysis, increasing the efficiency of fault diagnosis. Deep learning model can improve the accuracy of intelligent fault diagnosis with the help of its multilayer nonlinear mapping ability. This paper has proposed a novel method named Deep Convolutional Neural Networks with Wide First-layer Kernels (WDCNN). The proposed method uses raw vibration signals as input (data augmentation is used to generate more inputs), and uses the wide kernels in first convolutional layer for extracting feature and suppressing high frequency noise. Small convolutional kernels in the preceding layers are used for multilayer nonlinear mapping. AdaBN is implemented to improve the domain adaptation ability of the model. The proposed model addresses the problem that currently, the accuracy of CNN applied to fault diagnosis is not very high. WDCNN can not only achieve 100% classification accuracy on normal signals, but also outperform state of the art DNN model which is based on frequency features under different working load and noisy environment.

A comprehensive design framework is proposed for optimizing sparse MIMO (multiple-input, multiple-output) arrays to enhance multi-target detection. The framework emphasizes efficient utilization of antenna resources, including strategies for minimizing inter-element mutual coupling and exploring alternative grid-based sparse array (GSA) configurations by efficiently separating interacting elements. Alternative strategies are explored to enhance angular beamforming metrics, including beamwidth (BW), peak-to-sidelobe ratio (PSLR), and grating lobe limited field of view. Additionally, a set of performance metrics is introduced to evaluate virtual aperture effectiveness and beamwidth loss factors. The study employs the desirability function and explores optimization strategies for the partial sharing of antenna elements in multi-mode radar applications. A novel machine learning initialization approach is introduced for rapid convergence. Observations include the potential for peak-to-sidelobe ratio (PSLR) reduction in dense arrays and insights into GSA feasibility and performance compared to uniform arrays. The study validates the efficacy of the proposed framework through simulated and measured results. The study underscores the importance of effective sparse array processing in multi-target scenarios and highlights the advantages of the proposed design framework, offering clarity on sparse array efficiency and applicability in processing hardware providing clarity on its advantages over uniform and nonuniform arrays.

The performance of lattice-Boltzmann solver implementations usually depends mainly on memory access patterns. Achieving high performance requires then complex code which handles careful data placement and ordering of memory transactions. In this work, we analyse the performance of an implementation based on a new approach called the data-oriented language, which allows the combining of complex memory access patterns with simple source code. As a use case, we present and provide the source code of a solver for D2Q9 lattice and show its performance on GTX Titan Xp GPU for dense and sparse geometries up to 4096 2 nodes. The obtained results are promising, around 1000 lines of code allowed us to achieve performance in the range of 0.6 to 0.7 of maximum theoretical memory bandwidth (over 2.5 and 5.0 GLUPS for double and single precision, respectively) for meshes of size above 1024 2 nodes, which is close to the current state-of-the-art. However, we also observed relatively high and sometimes difficult to predict overheads, especially for sparse data structures. The additional issue was also a rather long compilation, which extended the time of short simulations, and a lack of access to low-level optimisation mechanisms.

Model-based image reconstruction has brought improvements in terms of contrast and spatial resolution to imaging applications such as magnetic resonance imaging and emission computed tomography. However, their use for pulse-echo techniques like ultrasound imaging is limited by the fact that model-based algorithms assume a finite grid of possible locations of scatterers in a medium -- which does not reflect the continuous nature of real world objects and creates a problem known as off-grid deviation. To cope with this problem, we present a method of dictionary expansion and constrained reconstruction that approximates the continuous manifold of all possible scatterer locations within a region of interest. The expanded dictionary is created using a highly coherent sampling of the region of interest, followed by a rank reduction procedure based on a truncated singular value decomposition. We develop a greedy algorithm, based on the Orthogonal Matching Pursuit (OMP), that uses a correlation-based non-convex constraint set that allows for the division of the region of interest into cells of any size. To evaluate the performance of the method, we present results of 2-dimensional ultrasound image reconstructions with simulated data in a nondestructive testing application. Our method succeeds in the reconstructions of sparse images from noisy measurements, providing higher accuracy than previous approaches based on regular discrete models.

This study introduces an innovative optimization method to identify the optimal configuration of a sparse symmetric 2D array for applications in security, particularly multistatic imaging. Utilizing Genetic Algorithms (GA) in a sophisticated optimization process, the research focuses on achieving the most favorable antenna distribution while mitigating the common issue of secondary lobes in sparse arrays. The main objective is to determine the ideal configuration from specific design parameters, including hardware specifications such as number of radiating elements, minimum spacing, operating frequency range, and image separation distance. The study employs a cost function based on the the point spread function (PSF), the system response to a point source, with the goal of minimizing the secondary lobe levels and maximizing their separation from the main lobe. Advanced simulation algorithms based on Physical Optics (PO) are used to validate the presented methodology and results.

We discuss the optimal control formulation for enhancement and denoising of satellite multiband images and propose to take it in the form of an L1-control problem for quasi-linear parabolic equation with non-local p[u]-Laplacian and with a cost functional of a tracking type. The main characteristic feature of the considered class of parabolic problems is the fact that the variable exponent p(t,x) and the anisotropic diffusion tensor D(t,x) are not well predefined a priori, but instead these characteristic non-locally depend on a solution of this problem, i.e., pu=p(t,x,u) and Du=D(t,x,u). We prove the existence of optimal pairs with sparse L1-controls using for that the indirect approach and a special family of approximation problems.

Cerebrovascular and airway structures are tubular structures used for transporting blood and gases, respectively, providing essential support for the normal activities of the human body. Accurately segmenting these tubular structures is the basis of morphology research and patho-logical detection. Nevertheless, accurately segmenting these structures from images presents great challenges due to their complex morphological and topological characteristics. To address this challenge, this paper proposes a framework UARAI based on the U-Net multi-scale reverse at-tention network and sparse convolution network. The framework utilizes a multi-scale structure to effectively extract the global and deep detail features of vessels and airways. Further, it enhances the extraction ability of fine-edge features by a joint reverse attention module. In addition, the sparse convolution structure is introduced to improve the features' expression ability without increasing the model's complexity. Finally, the proposed training sample cropping strategy re-duces the influence of block boundaries on the accuracy of tubular structure segmentation. The experimental findings demonstrate that the UARAI-based metrics, namely Dice and IoU, achieve impressive scores of 90.31% and 82.33% for cerebrovascular segmentation and 93.34% and 87.51% for airway segmentation, respectively. Compared to commonly employed segmentation tech-niques, the proposed method exhibits remarkable accuracy and robustness in delineating tubular structures such as cerebrovascular and airway. These results hold significant promise in facilitating medical image analysis and clinical diagnosis, offering invaluable support to healthcare profes-sionals.

Signal approximation, is the basic idea of signal processing and mathematical analysis where complex signals can be represented with simpler ones. This paper explores unifying two mathematical fundamentals, Dirichlet-type problems, and hyperbolic series identities, into signal approximation. In this paper, we address a well-known classic topic in mathematical analysis - the Dirichlet problem - to improve (the approximation of) signal using Fourier series. We also discuss using hyperbolic series representations to increase signal modeling flexibility. In this way, we hope to create new links that span some distance along this dimension and result in a somewhat theoretical view of signal behavior - present with the mathematical rigor needed for speculation but absent from an understanding capable of appropriately handling real-world complexity. This paper provides a theoretical investigation of the mechanics at play and reveals by analogy how these mathematical tools can potentially advance signal processing techniques and understanding. This paper illustrates Fourier series and fuzzy logic methods by two case studies on signal processing, satellite communication and financial risk measurement. The first case study performs signal approximation using the Fourier series and hyperbolic function identities to provide insight into how signals behave and are modeled. The second case study deals with applying fuzzy logic for risk evaluation of investment portfolios, emphasizing the utility in evasion systems solving uncertainty and imprecision problems related to financial decisions.

With the widespread use of new equipment such as distributed photovoltaics, distributed energy storage, electric vehicles, and distributed wind power, the control of low-voltage distribution networks (LVDNs) has become increasingly complex. Acquiring the most recent topological structure is essential for conducting accurate analysis and real-time control of LVDNs. The signal-injection-based topology identification algorithm is favored for its speed and efficiency. This study proposes a new signal-injection-based topology identification algorithm aimed at solving the issues of reduced completeness and correctness of identification caused by missing feature signal records (FSRs). By analyzing the correlations between FSRs of different positions, the algorithm employs vertical and horizontal completion methods to effectively address missing data, combined with inclusion detection algorithms, to identify the topology of LVDNs. Based on the study of actual LVDN data, the results indicate that the algorithm not only significantly improves the completeness and correctness of topology identification for LVDNs but can also increase the number of devices in operation by evaluating the status of topological equipment, further enhancing the topology identification performance.

As screen sizes are becoming larger and larger, which are beyond human’s physical limitation for direct touching interaction, remote controls are inevitable. However, as techniques applied so far, inertial gyroscopes are susceptible to position inaccuracies, and gesture recognition is limited by cameras’ focus depth and viewing angle. Grating antenna light trapping technology will be an ideal candidate providing the ghost point problem for multipoint inputs can be solved. Therefore, we propose a differential amplitude modulation scheme for grating antenna based multi beam optical touch, which can recognize different incidence points. Where, the amplitude of the incident beams was coded with different pulse width at first. Then, after been trapped by the grating antenna and been transferred into currents by the lined detector arrays, the incident points of the individual beams were recognized and differentiated. The scheme was successfully verified on an 18-inch screen, where two-point optical touch with position accuracy error under 3mm and response time less than 7ms under modulation frequency of 10kHz on both incident beams are obtained. This work paves a practical way for remote multi-point touch, which can make digital mouse in consistent to the users pointing direction obeying natural three-point one ling aiming rule instantaneously.

This article explores the intricate dynamics of complexity and emergence through the lens of a graphical model representing hippocampal functions. Utilizing a series of overlapping curves that intersect at varying degrees and frequencies, we create a visual metaphor for the sophisticated processes to store information observed in the hippocampus. This model not only depicts the spatial and frequency-related interactions of these curves but also illustrates the emergent patterns that arise from these interactions. These patterns exemplify the principles of complexity and emergence, where the collective behavior of simple elements results in intricate and unexpected outcomes. This graphical representation serves as a bridge between the abstract mathematical concepts of complexity theory and the tangible biological processes observed in neuroscience. By drawing parallels to the hippocampus, known for its role in memory formation and spatial navigation, the article sheds light on how complex systems, such as neural networks, exhibit properties that are more than just the sum of their parts. The model thus offers a unique perspective on understanding complex systems, not only in neuroscience but in broader scientific inquiries where complexity and emergent phenomena are pivotal.

The Collatz conjecture, a longstanding mathematical puzzle, posits that, regardless of the starting integer, iteratively applying a specific formula will eventually lead to the value 1. This paper introduces a novel approach to validate the Collatz conjecture by leveraging the binary representation of generated numbers. Each transition in the sequence is predetermined using the Collatz conjecture formula, yet the path of transitions is revealed to be intricate, involving alternating increases and decreases for each initial value. The study delves into the global flow of the sequence, investigating the behavior of the generated numbers as they progress toward the termination value of 1. The analysis utilizes the concept of probability to shed light on the complex dynamics of the Collatz conjecture. By incorporating probabilistic methods, this research aims to unravel the underlying patterns and tendencies that govern the convergence of the sequence. The findings contribute to a deeper understanding of the Collatz conjecture, offering insights into the inherent complexities of its trajectories. This work not only validates the conjecture through binary representation but also provides a probabilistic framework to elucidate the global flow of the sequence, enriching our comprehension of this enduring mathematical mystery.

VSM is a recently introduced method for entering and displaying any type of knowledge, in a form that is both semantically precise for computation and intuitive for human understanding. VSM is the combination of a new semantic model, and the design for a dedicated user interface to support it. Here we present the implementation of this user interface, as a sophisticated HTML-element, <vsm-box>, that can be embedded in any web-based curation app. We show how developers can use it for biocuration projects, customize it to particular end-user needs, and contribute to its growth. Vsm-box is open-source at https://github.com/vsmjs/vsm-box under the AGPL license, as a JavaScript (ES6) Vue.js web-component that runs in all modern web browsers. It is the capstone of the Vsmjs organization at https://github.com/vsmjs that groups its supporting modules. Extensive supplementary material on VSM and vsm-box is available at https://vsmjs.github.io.

Time-modulated sparse circular array (TMSCA) with elements uniformly excited is designed and synthesized in this paper. By utilizing rotationally symmetric structure, the array geometry and the time modulation of the TMSCA is presented, and the radiation patterns in frequency domain are formulated. In order to achieve the desired radiation pattern at the operating frequency and suppress the sideband radiation, the synthesis problem is established and solved by the proposed harmony search-convex programming (HS-CP) algorithm in two dependent optimizations. Two designs are presented, and the numerical results indicate that the TMSCA with rotationally symmetric structure has the advantages of designing time-modulated sparse arrays with superior performance.

In the era of big data, feature engineering has proved its efficiency and importance in dimensionality reduction and useful information extraction from original features. Feature engineering can be expressed as dimensionality reduction and is divided into two types of methods such as feature selection and feature extraction. Each method has its pros and cons. There are a lot of studies to combine these methods. Sparse autoencoder (SAE) is a representative deep feature learning method that combines feature selection with feature extraction. However, existing SAEs do not consider the feature importance during training. It causes extracting irrelevant information. In this paper, we propose a parallel guiding sparse autoencoder (PGSAE) to guide the information by two parallel guiding layers and sparsity constraints. The parallel guiding layers keep the main distribution using Wasserstein distance which is a metric of distribution difference, and it suppresses the leverage of guiding features to prevent overfitting. We perform our experiments using four datasets that have different dimensionality and number of samples. The proposed PGSAE method produces a better classification performance compared to other dimensionality reduction methods.

The Marchenko method is a data-driven way which makes it possible to calculate Green's functions from virtual points in the subsurface by the reflection data at the surface, only requiring a macro velocity model. This method requires collocated sources and receivers. However, in practice, subsampling of sources or receivers will cause gaps and distortions in the obtained focusing functions and Green's functions. To solve this problem, this paper proposes to integrate sparse inversion into the iterative Marchenko scheme. Specifically, we add sparsity constraints to the Marchenko equations and apply sparse inversion during the iterative process. Our work not only reduces the strict requirements on acquisition geometries, but also avoids the complexity and instability of direct inversion for Marchenko equations. This new method is applied to a two-dimensional numerical example with irregular sampled data. The result shows that it can effectively fill gaps of the obtained focusing functions and Green's functions in the Marchenko method.

Satellite scene classification is challenging because of the high variability inherent in satellite data. Although rapid progress in remote sensing techniques has been witnessed in recent years, the resolution of the available satellite images remains limited compared with the general images acquired using a common camera. On the other hand, a satellite image usually has a greater number of spectral bands than a general image, thereby permitting the multi-spectral analysis of different land materials and promoting low-resolution satellite scene recognition. This study advocates multi-spectral analysis and explores the middle-level statistics of spectral information for satellite scene representation instead of using spatial analysis. This approach is widely utilized in general image and natural scene classification and achieved promising recognition performance for different applications. The proposed multi-spectral analysis firstly learns the multi-spectral prototypes (codebook) for representing any pixel-wise spectral data, and then based on the learned codebook, a sparse coded spectral vector can be obtained with machine learning techniques. Furthermore, in order to combine the set of coded spectral vectors in a satellite scene image, we propose a hybrid aggregation (pooling) approach, instead of conventional averaging and max pooling, which includes the benefits of the two existing methods but avoids extremely noisy coded values. Experiments on three satellite datasets validated that the performance of our proposed approach is much more accurate than even the deep learning framework for spatial analysis.

Discussing quantum theory foundations, von Neumann noted that the measurement process should not be regarded in terms of a temporal evolution. A reason for his claim is insurmountability of the gap between reversible and irreversible processes. The time operator formalism that goes beyond such a gap is adequate framework for elaboration of the measurement problem. It considers signals to be stochastic processes, whether they correspond to variables or distribution densities. Signal processing like that utilizes statistical properties to perform its tasks, which is the definition of statistical signal processing. A hierarchy of the measurement process is indicated by crossing between states and devices, which implies an evolution in the temporal domain. The concept has generalized to an open system by the use of duality in frame theory.

The problem of event detection in general noisy signals arises in many applications; usually, either a functional form for the event is available, or a previous annotated sample with instances of the event that can be used to train a classification algorithm. There are situations, however, where neither functional forms nor annotated samples are available; then it is necessary to apply other strategies to separate and characterize events. In this work, we analyze 15 minute-long samples of an acoustic signal, and are interested in separating sections, or segments, of the signal which are likely to contain significative events. For that, we apply a sequential algorithm with the only assumption that an event alters the energy of the signal. The algorithm is entirely based on Bayesian methods.

The continuous flowing spacetime forms a spacetime group G, one of its fundamental groups is the Poincare group PO(1,3), and the matter and interaction fields are representations of its intrinsic spacetime group. As a kind of quantized space-time unit, space-time group elements generate both space-time manifolds and matter. Matter and fields are aggregates of the quantum space-time within them and determine their type: the Lorentz group SO(1,3) represents a rotating spacetime corresponding to visible matter and the translation group P^1,3 represents a translational spacetime corresponding to dark matter and dark energy. The aggregation mode of space-time degrees of freedom in matter reveals that charge conjugation symmetry is the inverse symmetry of internal time of charged particles, and the external parity breaking of neutrinos is also due to their internal spatial aggregation mode.

This paper is motivated by three main assumptions: (1) The currently dominant forms of knowledge representation (natural language text, formulas, graphics) are suboptimal to facilitate knowledge transfer between control engineering sub-fields and into potential application domains. (2) Formal knowledge representation (in general) is a promising supplementary approach, but (3) the established technologies so far have failed to be significantly adopted for formal representation of control engineering knowledge. Thus, after briefly reviewing existing representation methods, we introduce our own approach: The Python based imperative representation of knowledge (PyIRK) and its application to formulate the Ontology of Control Systems Engineering (OCSE). One of its main features is the possibility to represent the actual content of definitions and theorems as nodes and edges of a knowledge graph, which is demonstrated by selected elements from Lyapunov theory. While the approach is still experimental, the formalization already allows to apply methods of automated quality assurance and a semantic search mechanism. The current feature set of the framework is demonstrated on various examples before directions for further developments are discussed.

The paradigm of leveraging code as a dataset has recently gained traction, offering innovative solutions in domains such as automated commit message generation, pull request description automation, and program repair mechanisms. Consider the challenge in generating commit messages: traditional methods treat source code as a mere token sequence, applying neural machine translation models. This approach, however, overlooks the critical syntactic structures inherent in programming languages, which could offer deeper insights and improved accuracy. Building upon prior research, specifically the Code2Seq framework, which utilized Abstract Syntax Tree (AST) structural data for source code representation to automate method name generation, this paper extends and refines this concept. We introduce "CSR", a novel methodology adapted to represent code edits effectively. This paper investigates the impact of employing syntactic structure, focusing on the classification of code edits. Drawing inspiration from Code2Seq, "CSR" utilizes AST's structural properties, particularly the paths connecting leaf nodes, to enhance the task of code edit classification. This approach is rigorously evaluated on two distinct datasets, comprising fine-grained syntactic edits. Our comprehensive experiments reveal that incorporating syntactic structures does not significantly outperform simpler methodologies. While methods like Code2Seq and our proposed "CSR" show potential, our findings highlight that there is considerable scope for improvement and refinement before such techniques can be universally applied for learning representations of code edits. We anticipate that our findings will spark further research in this field, paving the way for more effective use of syntactic structures in code representation.

The evolution of sentence representation learning, especially with parse tree encoders, has shown remarkable progress. Traditional approaches predominantly rely on recursive encoding of tree structures, which impedes parallel processing capabilities. Additionally, these methods often overlook the significance of dependency tree arc labels. To overcome these limitations, we introduce the Syntax-Enhanced Transformer (SET), incorporating a novel dual-attention mechanism that integrates relation-focused attention alongside traditional self-attention. This design effectively encodes both dependency and spatial positional relationships within sentence dependency trees. Our approach innovatively incorporates syntactic information into the Transformer framework without compromising its inherent parallelizability. The SET demonstrates superior or comparable performance to contemporary methods across various sentence representation tasks, significantly enhancing computational efficiency.

Using classical clinical observations, we first outline an elementary conceptual model for the Mind Representation System, then move to a more elaborate mathematical model that refers to discrete cofibration with enriched fibers.

3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format. CityGML and CityJSON use polygonal modelling in order to represent geometries. True topological data structures have proven to be more computationally efficient for geometric analysis compared to polygonal modelling. In a previous study, we have introduced a method to topologically reconstruct CityGML models while maintaining the semantic information of the dataset, based solely on the combinatorial map (C-Map) data structure. As a result of the limitations of C-Map's semantic representation mechanism, the resulting datasets could suffer either from semantic information loss or the redundant repetition of them. In this article, we propose a solution for a more efficient representation of both geometry, topology and semantics by incorporating the C-Map data structure in the CityGML data model and implementing a CityJSON extension to encode the C-Map data. In addition, we provide an algorithm for the topological reconstruction of CityJSON datasets to append them according to this extension. Finally, we apply our methodology to three open datasets in order to validate our approach when applied to real-world data. Our results show that the proposed CityJSON extension can represent all geometric information of a city model in a lossless way, providing additional topological information for the objects of the model.

In the paper, by virtue of a Lévy–Khintchine representation and an alternative integral representation for the weighted geometric mean, the authors establish a Lévy–Khintchine representation and an alternative integral representation for the Toader–Qi mean. Moreover, the authors also collect an probabilistic interpretation and applications in engineering of the Toader–Qi mean.

The early elongation events in transcription or translational control in the N-terminal of genes are assuming critical roles in their heterologous expression. The secretory expression of the alkaline pectin lyase APL in B. subtilis were studied to explore the effects of the N-terminal 5-7 amino acids sequences of different signal peptides on gene transcription and protein secretion in this study. The first 5 amino acid sequences of the N-terminal of the signal peptide LipA were identified to play an important role in promoting the expression of APL for the first time. Meanwhile, it also revealed that the signal peptide LipA could lead to higher secretory expression than other signal peptides not because of its sequence structure associated with secretion is stronger but because the N-terminal sequences showed greater advantages in gene transcription. At this basis, the recombinant strain structed in this work showed a new record for the highest extracellular yields (12 295 U/ml) of APL in B. subtilis which was 1.9 times higher than that expressed in the recombinant Escherichia coli strain we had reported before. The novel theories revealed in this study would assuming significance roles for improving expression of foreign proteins in or out of the cells.

With the advancement of technology, signal modulation types are becoming increasingly diverse and complex. The phenomenon of signal time-frequency overlap during transmission poses significant challenges for the classification and recognition of mixed signals, including poor recognition capabilities and low generality. This paper presents a recognition model for fine-grained analysis of mixed signal characteristics, proposing a Geometry Coordinate attention mechanism and introducing a low-rank bilinear pooling module to more effectively extract signal features for classification. The model employs a residual neural network as its backbone architecture and utilizes the Geometry Coordinate attention mechanism for time-frequency weighted analysis based on information geometry theory. This analysis targets multiple-scale features within the architecture, producing time-frequency weighted features of the signal. These weighted features are further analyzed through a low-rank bilinear pooling module, combined with the backbone features, to achieve fine-grained feature fusion. This results in a fused feature vector for mixed signal classification. Experiments were conducted on a simulated dataset comprising 39,600 mixed signal time-frequency plots. The model was benchmarked against a baseline using a residual neural network. The experimental outcomes demonstrated an improvement of 9% in the exact match ratio and 5% in the Hamming score. These results indicate that the proposed model significantly enhances the recognition capability and generalizability of mixed signal classification.

Currently, obesity is a critical global public health burden. Numerous studies have demonstrated the regulation of the pathogenesis of obesity and metabolic abnormalities by the gut microbiota and microbial factors; however, their involvement in the various degrees of obesity is not yet understood well. Previously, obesity has been shown to be associated with decreased levels of vitamin B12. Considering exclusive microbial production of vitamin B12, we hypothesised that a decrease in cobalamin levels in obese individuals may be at least partially caused by its depleted production in the intestinal tract by the commensal microbiota. In the present study, our aim was to estimate the abundance of enzymes and metabolic pathways for vitamin B12 synthesis in the gut microbiota of mouse models of alimentary and genetically determined obesity, to evaluate the contribution of the obesogenic microbiome to vitamin B12 synthesis in the gut. We have defined a significantly lower representation of enzymes and metabolic pathways for vitamin B12 biosynthesis in obese mice compared to non-obese mice, wherein enzyme depletion was more pronounced in lepr(-/-) (db/db) mice, which developed severe obesity. The representation of enzymes involved in cobalamin synthesis is strongly correlated with representation of several microbes in high-fat diet fed mice, whereas there were almost no correlations in db/db mice. Therefore, the degree of obesity and the composition of the correspondent microbiota are the main contributors to the representation of genes and pathways for cobalamin biosynthesis in the mouse gut.

Microwave photonic (MWP) signal processors, which process microwave signals based on photonic technologies, bring advantages intrinsic to photonics such as low loss, large processing bandwidth, and strong immunity to electromagnetic interference. Optical microcombs can offer a large number of wavelength channels and compact device footprints, which make them powerful multi-wavelength sources for MWP signal processors to realize a variety of processing functions. In this paper, we experimentally demonstrate the capability of microcomb-based MWP signal processors to handle diverse input signal waveforms. In addition, we quantify the processing accuracy for different input signal waveforms, including Gaussian, triangle, parabolic, super Gaussian, and nearly square waveforms. Finally, we analyze the factors contributing to the difference in the processing accuracy among the different input waveforms, and our theoretical analysis well elucidates the experimental results. These results provide a guidance for microcomb-based MWP signal processors when processing microwave signals of various waveforms.

During HIV-1 virus assembly the genomic RNA (vRNA) is selected for packaging by the viral protein Gag because it contains a specific packaging signal, Psi. While there have been numerous studies of Gag-Psi interactions, there is almost no information on kinetic aspects of this interaction. We have investigated the kinetics of Gag binding to different RNAs using switchSENSE DRX2 technology. We measured the association rate of Gag binding to monomeric Psi, to a “Multiple Binding Site Mutant” Psi that is inactive for genome packaging in vivo, and to a scrambled Psi. We discovered that Gag binds more rapidly to Psi RNA than to the mutant or scrambled RNAs. Furthermore, rapid Gag association kinetics are retained within sub-regions of Psi: Gag associates more rapidly with RNA containing only the 3’ two of the three Psi stem-loops than with monomeric RNA containing the 5’ two stem-loops or a scrambled RNA. No differences were detectable with individual Psi stem-loops. Interestingly, the rate of binding of Gag molecules to Psi increases with increasing Gag concentration, suggesting cooperativity in binding. The results are consistent with the hypothesis that selectivity in packaging derives from kinetic differences in initiation of particle assembly.

This paper aims to unify q-derivative/q-integral and h-derivative/h-integral in a single definition, this will be called q−h-derivative/q−h-integral. These notions are further extended on finite interval [a,b] in the form of left and right q−h-derivatives and q−h-integrals. Some inequalities are studied for q−h-integrals which are directly connected with well known results. In diverse fields of science and engineering the theory based on q-derivatives/q-integrals and h-derivatives/h-integrals can be unified by using the concept of q−h-derivative/q−h-integral.

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.

In this article, our main purpose is to establish a new extension of Mittag-Leffler function by using the known extended beta function $\mathbf{B}_{\omega}(a,b;p)$ introduced in [1]. It led to a novel extension of the applicability of Mittag-Leffler function that introduced them as distributions defined for a specific set of functions. We also, investigate some of its important properties, namely recursion relation, Mellin transform and differential formulas.

P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is coNP. Whether NP = coNP is another fundamental question that it is as important as it is unresolved. In 1979, Fortune showed that if any sparse language is coNP-complete, then P = NP. We prove there is a possible sparse language in coNP-complete. In this way, we demonstrate the complexity class P is equal to NP.

Deep Learning is developing interesting tools which are of great interest for inverse imaging applications. In this work, we consider a medical imaging reconstruction task from subsampled measurements, which is an active research field where Convolutional Neural Networks have already revealed their great potential. However, the commonly used architectures are very deep and, hence, prone to overfitting and unfeasible for clinical usages. Inspired by the ideas of the green-AI literature, we here propose a shallow neural network to perform an efficient Learned Post-Processing on images roughly reconstructed by the filtered backprojection algorithm. The results obtained on images from the training set and on unseen images, using both the non-expensive network and the widely used very deep ResUNet show that the proposed network computes images of comparable or higher quality in about one fourth of time.

Increased data acquisition by uncalibrated, heterogeneous digital sensor systems such as smartphones present new challenges. Binary metrics are proposed for the quantification of cyber-physical signal characteristics and features, and a standardized constant-Q variation of the Gabor atom is developed for use with wavelet transforms. Two different continuous wavelet transform (CWT) reconstruction formulas are presented and tested under different signal to noise ratio (SNR) conditions. A sparse superposition of Nth order Gabor atoms worked well against a synthetic blast transient using the wavelet entropy and an entropy-like parametrization of the SNR as the CWT coefficient-weighting functions. The proposed methods should be well suited for sparse feature extraction and dictionary-based machine learning across multiple sensor modalities.

Since the beginning of the 21th century, infrared Nd:YVO4 pulsed lasers have been widely applied especially in some actual industrial processes. In the working process of a laser-aided etching device, the “match-head” effect must be effectively controlled by suppressing the first giant pulse for a solid-state Q-switched laser. In the process of optimizing the infrared Nd:YVO4 pulsed laser by adjusting the slope parameters of the radio frequency (RF) modulation to suppress the first giant pulse, it has been come across that some abnormal horizontally polarized emission with a very short time appears before the formal vertically polarized emission when the gate signal is artificially started. Actually, abnormal horizontally polarized emission will bring some unexpected machining traces during the production process and even greater dangers. The experimental results show that with the increase of the slope duration of a RF signal, the existence time of abnormal output horizontal polarized light will be shortened, and the horizontal giant pulse and vertical giant pulse are well suppressed. When the slope duration is greater than 0.18 ms both horizontal and vertical giant pulses will disappear. The horizontal polarized light can be thoroughly suppressed when the slope duration is greater than 13.7 ms. Compared with the method of adding polarizer to eliminate abnormal output horizontal polarized light, this method does not add elements in the laser, ensuring that the laser volume is relatively small, and does not affect the quality of the normal output laser. The research conclusion is thought to be of great practical significance especially for processing transparent materials.

Passive radar detection emerges as a pivotal method for environmental perception and target de-tection within radar applications. Leveraging its advantages, including minimal electromagnetic pollution and efficient spectrum utilization, passive radar methodologies have garnered increasing interest. In recent years, there has been an increasing selection of passive radar signal sources, and the emerging 5G has the characteristics of high frequency band, high bandwidth, and a large number of base stations, which make it have significant advantages in passive radar. Therefore, this paper introduces a passive radar target detection method based on 5G signals and designs a rotating target speed measurement experiment. In the experiment, this paper validated the method of de-tecting rotating targets using 5G signals and evaluated the measurement accuracy, providing a research foundation for passive radar target detection using 5G signals and detecting rotating targets such as drone rotors.

The cell’s capacity to integrate and respond to spatial information is a crucial feature of morphogenesis and development. The Planar Cell Polarity (PCP) pathway is a signaling mechanism, widely conserved across metazoans, providing spatial orientation along the plane of an epithelium in morphogenic processes ranging from insect wing patterning to mammalian cochleae. Although the core genes involved in the PCP pathway have been molecularly identified in the 1990s, the PCP signaling mechanism remains controversial. In this article I discuss the main players and previous models of PCP signaling reported in the literature, and propose a new model. According to it PCP is established through an homophobic signal by transmembrane protein Frizzled (Fz): 1) a Fz signal in one cell repeals Fz itself in the adjacent cell, thereby generating symmetry breaking; 2) the instructive PCP signal is conveyed through Fz interaction with atypical cadherin Flamingo (Fmi). More broadly, homophobic signaling may represent a novel mechanism for cell-cell signaling of spatial information through modulation of cell adhesion rather than canonical ligand-receptor binding.

This paper presents a study of different types of parametric signals with application to underwater acoustic communications. In all the signals, the carrier frequency is 200 kHz, which corresponds to the resonance frequency of the transducer under study and different modulations are presented and compared. In this sense, we study modulations with parametric sine sweeps (4 to 40 kHz) that represent binary codes (zeros and ones), getting closer to the application in acoustic communications. The different properties of the transmitting signals in terms of bit rate, directivity, efficiency and power needed are discussed as well.

Biases in Artificial Intelligence (AI) or Machine Learning (ML) systems due to skewed datasets problematise the application of prediction models in practice. Representation bias is a prevalent form of bias found in the majority of datasets. This bias arises when training data inadequately represents certain segments of the data space, resulting in poor generalisation of prediction models. Despite AI practitioners employing various methods to mitigate representation bias, their effectiveness is often limited due to a lack of thorough domain knowledge. To address this limitation, this paper introduces human-in-the-loop interaction approaches for representation debiasing of generated data involving domain experts. Our work advocates for a controlled data generation process involving domain experts to effectively mitigate the effects of representation bias. We argue that domain experts can leverage their expertise to assess how representation bias affects prediction models. Moreover, our interaction approaches can facilitate domain experts in steering data augmentation algorithms to produce debiased augmented data and validate or refine the generated samples to reduce representation bias. We also discuss how these approaches can be leveraged for designing and developing user-centred AI systems to mitigate the impact of representation bias through effective collaboration between domain experts and AI.

This is the first paper in a cycle investigating the exact solution of the loop equation for decaying unforced turbulence in three dimensions, which we have found in the previous work. In this paper, we prove the exact equivalence of this solution (the Euler ensemble) to the theory of Fermi particles on a ring. The continuum limit of this theory will be studied in the next papers.

The Semantic-Enhanced Tree-LSTM (SeT-LSTM) network, a novel advancement in the realm of linguistic modeling, marks a significant step forward from traditional Tree-based Long Short Term Memory (LSTM) networks. By intricately weaving in the nuances of typed grammatical dependencies, SeT-LSTMs offer a more nuanced understanding of language semantics. Traditional models often overlook the semantic shift caused by variations in word or phrase roles, a gap this paper aims to fill by focusing on the types of grammatical connections, or typed dependencies, within sentences. Our proposed architecture, dubbed the Semantic Relationship-Guided LSTM (SRG-LSTM), leverages a control mechanism to model the interplay between sequence elements. Additionally, we present a novel Tree-LSTM variant, the Semantic Dependency Tree-LSTM (SDT-LSTM), which integrates dependency parse structures with dependency types for more robust sentence embedding. The SDT-LSTM demonstrates superior performance in Semantic Relatedness Scoring and Sentiment Analysis compared to its predecessors. Qualitatively, it shows resilience to changes in sentence voice and heightened sensitivity to nominal alterations, aligning well with human intuition. This research underlines the pivotal role of grammatical relationships in sentence understanding and paves the way for further exploration in this domain.

Self-supervised learning is a method that learns general representation from unlabeled data. Masked image modeling (MIM), one of the generative self-supervised learning methods, has drawn attention showing state-of-the-art performance on various downstream tasks, though showing poor linear separability resulting from the token-level approach. In this paper, we propose a contrastive learning-based multi-view masked autoencoder for MIM, exploiting an image-level approach by learning common features from two different augmented views. We strengthen MIM by learning long-range global patterns from contrastive loss. Our framework adopts simple encoder-decoder architecture, learning rich and general representation by following a simple process: 1) two different views are generated from an input image with random masking and by contrastive loss, we can learn semantic distance of the representations generated by an encoder. By applying a high mask ratio, 80%, it works as strong augmentation and alleviates the representation collapse problem. 2) With reconstruction loss, decoder learns to reconstruct an original image from the masked image. We assess our framework by several experiments on benchmark datasets of image classification, object detection, and semantic segmentation. We achieve 84.3% fine-tuning accuracy on ImageNet-1K classification and 76.7% in linear probing, exceeding previous studies and show promising results on other downstream tasks. Experimental results demonstrate that our work can learn rich and general image representation by applying contrastive loss to masked image modeling.

Recognizing highly occluded objects is believed to arises from the interaction between the brain's vision and cognition controlling areas, although supporting neuroimaging data is currently limited. To explore the neural mechanism during this activity, we conducted an occlusion object recognition experiment using functional magnetic resonance imaging (fMRI). During magnet resonance examinations, 66 subjects engaged in object recognition tasks with three different occlusion degrees. Generalized linear model (GLM) analysis showed that the activation degree of occipital lobe (inferior occipital gyrus, middle occipital gyrus, and occipital fusiform gyrus) and dorsal anterior cingulate cortex (dACC) was related to the occlusion degree of the objects. Multivariate pattern analysis (MVPA) further unearthed a considerable surge in classification precision when dACC activation was incorporated as a feature. This suggested the combined role of dACC and occipital lobe in occluded object recognition tasks. Moreover, psychophysiological interaction (PPI) analysis disclosed that functional connectivity (FC) between the dACC and the occipital lobe was enhanced with increased occlusion, highlighting the necessity of FC between these two brain regions in effectively identifying exceedingly occluded objects. In conclusion, these findings contribute to understanding the neural mechanisms of highly occluded objects recognition, augmenting our appreciation of how the brain manages incomplete visual data.

This paper proposes a Grouped Contrastive Learning of self-supervised Sentence Representation (GCLSR), which can learn an effective and meaningful representation of sentences. Previous works maximize the similarity between two vectors to be the objective of contrastive learning, suffering from the high-dimensionality of the vectors. In addition, most previous works have adopted discrete data augmentation to obtain positive samples and directly employed contrastive framework of computer vision to perform contrastive training, which could hamper contrastive training because text data is discrete and sparse compared with image data. To address those issues, we propose a grouped contrastive learning framework, i.e., GCLSR, which divides the high-dimensional feature vector into several groups and respectively computes the groups’ contrastive losses to make use of more local information, eventually obtaining a more fine-grained sentence representation. In addition, in GCLSR, we design a new self-attention mechanism and a continuous as well as partial word vector augmentation (PWVA). For the discrete and sparse text data, the usage of self-attention could help model focus the informative words by measuring the importance of every word in a sentence. By using the PWVA, GCLSR can obtain high-quality positive samples used for contrastive learning. Experimental results demonstrate that our proposed GCLSR achieves an encouraging result on the challenging datasets of the standard semantic textual similarity (STS) task and transfer task.

This paper introduces a method to achieve optimal Gaussian estimation even when operating with low precision numerical representations of the full covariance matrix, such as 16-bit integer or 32-bit single precision formats, instead of more expensive double precision floating point representations (64 bits). The approximation's numerical error is accurately estimated in a conservative manner, resulting in minimal covariance inflation. When combined with a compressed estimator like the GCKF (Global Compressed Kalman Filter), which performs global updates at low frequency, this approach produces estimates that are nearly identical to the optimal ones. The deviation between the results obtained using this new approach and those obtained with the standard GCKF (which operates in double precision) is negligible. This new method is particularly relevant in high-dimensional estimation problems that require high-frequency operation. By leveraging the compressed operation of the GCKF, the estimation process applies the necessary approximation only during low-frequency global updates, using the single precision format instead of the more expensive double precision representations. The introduced numerical approximation is accurately estimated while maintaining a conservative approach, resulting in minimal covariance inflation. When combined with the GCKF, which performs global updates at low frequency, the estimates produced are almost identical to the optimal ones. This approach is particularly useful in high-dimensional estimation problems that require high-frequency operation. By representing the full covariance matrix in a low precision numerical format and applying appropriate scaling, memory usage is significantly reduced, offering substantial benefits for high-dimensional estimation problems and enabling real-time smoothing processes in such cases. By reducing the memory requirements for storing the full covariance matrix, the CPU avoids encountering a high number of page faults, resulting in improved processing performance. Lastly, the experimental section verifies the performance of the proposed approach in a single precision (32-bit floating point) GCKF SLAM process, assessing expected values and standard deviations of marginal PDFs.