A New Blind Source Separation Algorithm Framework for Noisy Mixing Model Based on the Energy Concentration Characteristic in Signal Transform Domain

Blind source separation is a widely used technique to analyze multichannel data. In most real-world applications, noise is inevitable and will affect the quality of signal separation and even make signal separation failure. In this paper, a new signal processing framework is proposed to separate noisy mixing sources. It is composed of two different stages. The first step is to process the mixing signal by a certain signal transform method to make the expected signals have energy concentration characteristics in the transform domain. The second stage is formed by a certain BSS algorithm estimating the demixing matrix in the transform domain. In the energy concentration segment, the SNR can reach a high level so that the demixing matrix can be estimated accurately. The analysis process of the proposed algorithm framework is analyzed by taking the wavelet transform as an example. Numerical experiments demonstrate the efficiency of the proposed algorithm to estimate the mixing matrix in comparison with well-known algorithms.

Dynamic Application Partitioning and Task-Scheduling Secure Schemes for Biosensor Healthcare Workload in Mobile Edge Cloud

Currently, the use of biosensor-enabled mobile healthcare workflow applications in mobile edge-cloud-enabled systems is increasing progressively. These applications are heavyweight and divided between a thin client mobile device and a thick server edge cloud for execution. Application partitioning is a mechanism in which applications are divided based on resource and energy parameters. However, existing application-partitioning schemes widely ignore security aspects for healthcare applications. This study devises a dynamic application-partitioning workload task-scheduling-secure (DAPWTS) algorithm framework that consists of different schemes, such as min-cut algorithm, searching node, energy-enabled scheduling, failure scheduling, and security schemes. The goal is to minimize the energy consumption of nodes and divide the application between local nodes and edge nodes by applying the secure min-cut algorithm. Furthermore, the study devises the secure-min-cut algorithm, which aims to migrate data between nodes in a secure form during application partitioning in the system. After partitioning the applications, the node-search algorithm searches optimally to run applications under their deadlines. The energy and failure schemes maintain the energy consumption of the nodes and the failure of the system. Simulation results show that DAPWTS outperforms existing baseline approaches by 30% in terms of energy consumption, deadline, and failure of applications in the system.

A Quantum Circuit Optimization Framework Based on Pattern Matching

In the NISQ era, quantum computers have insufficient qubits to support quantum error correction, which can only perform shallow quantum algorithms under noisy conditions. Aiming to improve the fidelity of quantum circuits, it is necessary to reduce the circuit depth as much as possible to mitigate the coherent noise. To address the issue, we propose PaF , a Pattern matching-based quantum circuit rewriting algorithm Framework to optimize quantum circuits. The algorithm framework finds all sub-circuits satisfied in the input quantum circuit according to the given external pattern description, then replaces them with better circuit implementations. To extend the capabilities of PaF , a general pattern description format is proposed to make rewriting patterns in existing work become machine-readable. In order to evaluate the effectiveness of PaF , we employ the BIGD benchmarks in QUEKO benchmark suite to test the performance and the result shows that PaF provides a maximal speedup of [Formula: see text] by using few patterns.

Multisatellite Flyby Inspection Trajectory Optimization Based on Constraint Repairing

With the rapid development of on-orbit services and space situational awareness, there is an urgent demand for multisatellite flyby inspection (MSFI) that can obtain information about a large number of space targets with little fuel consumption in a short time. There are two kinds of constraints, namely inspection constraints (ICs) at each flyby point and transfer process constraints (TPCs) in the actual mission. Further considering the influence of discrete and continuous variables such as inspection sequence, time, and maneuver scheme, it is complex and difficult to solve MSFI. To optimize it efficiently, the task flow and the problem model are defined firstly. Then, the algorithm framework based on constraint repairing is given, which contains repair methods of the ICs and the TPCs. Finally, the proposed method is compared with the nonrepair optimization method in two numerical examples. The results indicate that when the constraints are hard to meet, it is better and more efficient than the nonrepair method.

A gene module identification algorithm and its applications to identify gene modules and key genes of hepatocellular carcinoma

To further improve the effect of gene modules identification, combining the Newman algorithm in community detection and K-means algorithm framework, a new method of gene module identification, GCNA-Kpca algorithm, was proposed. The core idea of the algorithm was to build a gene co-expression network (GCN) based on gene expression data firstly; Then the Newman algorithm was used to initially identify gene modules based on the topology of GCN, and the number of clusters and clustering centers were determined; Finally the number of clusters and clustering centers were input into the K-means algorithm framework, and the secondary clustering was performed based on the gene expression profile to obtain the final gene modules. The algorithm took into account the role of modularity in the clustering process, and could find the optimal membership module for each gene through multiple iterations. Experimental results showed that the algorithm proposed in this paper had the best performance in error rate, biological significance and CNN classification indicators (Precision, Recall and F-score). The gene module obtained by GCNA-Kpca was used for the task of key gene identification, and these key genes had the highest prognostic significance. Moreover, GCNA-Kpca algorithm was used to identify 10 key genes in hepatocellular carcinoma (HCC): CDC20, CCNB1, EIF4A3, H2AFX, NOP56, RFC4, NOP58, AURKA, PCNA, and FEN1. According to the validation, it was reasonable to speculate that these 10 key genes could be biomarkers for HCC. And NOP56 and NOP58 are key genes for HCC that we discovered for the first time.

Preimpact Fall Detection for Elderly Based on Fractional Domain

The aging population has become a growing worldwide problem. Every year, deaths and injuries caused by elderly people's falls bring huge social costs. To reduce the rate of injury and death caused by falls among the elderly and the following social cost, the elderly must be monitored. In this context, falls detecting has become a hotspot for many research institutions and enterprises at home and abroad. This paper proposes an algorithm framework to prealarm the fall based on fractional domain, using inertial data sensor as motion data collection devices, preprocessing the data by axis synthesis and mean filtering, and using fractional-order Fourier transform to convert the collected data from time domain to fractional domain. Based on the above, a multilayer dichotomy classifier is designed, and each node parameter selection method is given, which constructed a preimpact fall detection system with excellent performance. The experiment result demonstrates that the algorithm proposed in this paper can guarantee better warning effect and classification accuracy with fewer features.

A Color Restoration Algorithm for Diffractive Optical Images of Membrane Camera

In order to verify the technology of the membrane diffractive imaging system for Chinese next generation geo-stationary earth orbit (GEO) satellite, a series of ground experiments have been carried out using a membrane optical camera with 80 mm aperture (Φ80) lens. The inherent chromatic aberration due to diffractive imaging appears in the obtained data. To address the issue, an effective color restoration algorithm framework by matching, tailoring, and non-linearly stretching the image histograms is proposed in this letter. Experimental results show the proposed approach has good performances in color restoration of the diffractive optical images than previous methods. The effectiveness and robustness of the algorithm are also quantitatively assessed using various color deviation indexes. The results indicate that the chromatic aberration of diffractive images can be effectively removed by about 85%. Also, the proposed method presents reasonable computational efficiency.