Electronically Reconfigurable Memristive Neuron Capable of Operating in Both Excitation and Inhibition Modes.

Threshold switching (TS) memristors are promising candidates for artificial neurons in neuromorphic systems. However, they often lack biological plausibility, typically functioning solely in an excitation mode. The absence of an inhibitory mode limits neurons' ability to synergistically process both excitatory and inhibitory synaptic signals. To address this limitation, we propose a novel memristive neuron capable of operating in both excitation and inhibition modes. The memristor's threshold voltage can be reversibly tuned using voltages of different polarities because of its bipolar TS behavior, enabling the device to function as an electronically reconfigurable bi-mode neuron. A variety of neuronal activities such as all-or-nothing behavior and tunable firing probability are mimicked under both excitatory and inhibitory stimuli. Furthermore, we develop a self-adaptive neuromorphic vision sensor based on bi-mode neurons, demonstrating effective object recognition in varied lighting conditions. Thus, our bi-mode neuron offers a versatile platform for constructing neuromorphic systems with rich functionality.

Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem.

Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of the n vertices into disjoint subsets V1 and V2 such that the number of edges between them is as large as possible. Classically, it is an NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning and network science to clustering. In this paper, we propose a biomolecular and a quantum algorithm to solve the maximum cut problem for any graph G. The quantum algorithm is inspired by the biomolecular algorithm and has a quadratic speedup over its classical counterparts, where the temporal and spatial complexities are reduced to, respectively, [Formula: see text] and [Formula: see text]. With respect to oracle-related quantum algorithms for NP-complete problems, we identify our algorithm as optimal. Furthermore, to justify the feasibility of the proposed algorithm, we successfully solve a typical maximum cut problem for a graph with three vertices and two edges by carrying out experiments on IBM's quantum simulator.

CRISPR-Enabled Graphene-Based Bio-Cyber Interface Model for In Vivo Monitoring of Non-Invasive Therapeutic Processes.

In this paper, we present a model of the bio-cyber interface for the Internet of Bio-Nano Things application. The proposed model is inspired by the gains of integrating the Clustered Regularly Interspace Short Palindromic Repeats (CRISPR) technology with the Graphene-Field effect transistor (GFET). The capabilities of the integrated system are harnessed to detect nucleic acids transcribed by another component of the bio-cyber interface, a bioreporter, on being exposed to the signalling molecule of interest. The proposed model offers a label-free real-time signal transduction with multi-symbol signalling capability. We model the entire operation of the interface as a set of simultaneous differential equations representing the process's kinetics. The solution to the model is obtained using a numerical method. Numerical results show that the performance of the interface is influenced by parameters such as the concentrations of the input signalling molecules, the surface receptor on the bioreporter, and the CRISPR complex. The interface's performance also depends considerably on the elimination rate of the signalling molecules from the body. For multi-symbol molecular signalling, the rate of degradation of the transcribed RNAs influences the system's susceptibility to inter-symbol interference.

A-GSTCN: An Augmented Graph Structural-Temporal Convolution Network for Medication Recommendation Based on Electronic Health Records.

Medication recommendation based on electronic health records (EHRs) is a significant research direction in the biomedical field, which aims to provide a reasonable prescription for patients according to their historical and current health conditions. However, the existing recommended methods have many limitations in dealing with the structural and temporal characteristics of EHRs. These methods either only consider the current state while ignoring the historical situation, or fail to adequately assess the structural correlations among various medical events. These factors result in poor recommendation quality. To solve this problem, we propose an augmented graph structural-temporal convolutional network (A-GSTCN). Firstly, an augmented graph attention network is used to model the structural features among medical events of patients' EHRs. Next, the dilated convolution combined with residual connection is applied in the proposed model, which can improve the temporal prediction capability and further reduce the complexity. Moreover, the cache memory module further enhances the model's learning of the history of EHRs. Finally, the A-GSTCN model is compared with the baselines through experiments, and the efficiency of the A-GSTCN model is verified by Jaccard, F1 and PRAUC. Not only that, the proposed model also reduces the training parameters by an order of magnitude.

Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks.

A dominating set of a graph [Formula: see text] is a subset U of its vertices V, such that any vertex of G is either in U, or has a neighbor in U. The dominating-set problem is to find a minimum dominating set in G. Dominating sets are of critical importance for various types of networks/graphs, and find therefore potential applications in many fields. Particularly, in the area of communication, dominating sets are prominently used in the efficient organization of large-scale wireless ad hoc and sensor networks. However, the dominating set problem is also a hard optimization problem and thus currently is not efficiently solvable on classical computers. Here, we propose a biomolecular and a quantum algorithm for this problem, where the quantum algorithm provides a quadratic speedup over any classical algorithm. We show that the dominating set problem can be solved in [Formula: see text] queries by our proposed quantum algorithm, where n is the number of vertices in G. We also demonstrate that our quantum algorithm is the best known procedure to date for this problem. We confirm the correctness of our algorithm by executing it on IBM Quantum's qasm simulator and the Brooklyn superconducting quantum device. And lastly, we show that molecular solutions obtained from solving the dominating set problem are represented in terms of a unit vector in a finite-dimensional Hilbert space.

RNN-K: A Reinforced Newton Method for Consensus-Based Distributed Optimization and Control Over Multiagent Systems.

With the rise of the processing power of networked agents in the last decade, second-order methods for machine learning have received increasing attention. To solve the distributed optimization problems over multiagent systems, Newton's method has the benefits of fast convergence and high estimation accuracy. In this article, we propose a reinforced network Newton method with K -order control flexibility (RNN-K) in a distributed manner by integrating the consensus strategy and the latest knowledge across the network into local descent direction. The key component of our method is to make the best of intermediate results from the local neighborhood to learn global knowledge, not just for the consensus effect like most existing works, including the gradient descent and Newton methods as well as their refinements. Such a reinforcement enables revitalizing the traditional iterative consensus strategy to accelerate the descent of the Newton direction. The biggest difficulty to design the approximated Newton descent in distributed settings is addressed by using a special Taylor expansion that follows the matrix splitting technique. Based on the truncation on the Taylor series, our method also presents a tradeoff effect between estimation accuracy and computation/communication cost, which provides the control flexibility as a practical consideration. We derive theoretically the sufficient conditions for the convergence of the proposed RNN-K method of at least a linear rate. The simulation results illustrate the performance effectiveness by being applied to three types of distributed optimization problems that arise frequently in machine-learning scenarios.

Genetic-based adaptive momentum estimation for predicting mortality risk factors for COVID-19 patients using deep learning.

The mortality risk factors for coronavirus disease (COVID-19) must be early predicted, especially for severe cases, to provide intensive care before they develop to critically ill immediately. This paper aims to develop an optimized convolution neural network (CNN) for predicting mortality risk factors for COVID-19 patients. The proposed model supports two types of input data clinical variables and the computed tomography (CT) scans. The features are extracted from the optimized CNN phase and then applied to the classification phase. The CNN model's hyperparameters were optimized using a proposed genetic-based adaptive momentum estimation (GB-ADAM) algorithm. The GB-ADAM algorithm employs the genetic algorithm (GA) to optimize Adam optimizer's configuration parameters, consequently improving the classification accuracy. The model is validated using three recent cohorts from New York, Mexico, and Wuhan, consisting of 3055, 7497,504 patients, respectively. The results indicated that the most significant mortality risk factors are: CD 8 + T Lymphocyte (Count), D-dimer greater than 1 Ug/ml, high values of lactate dehydrogenase (LDH), C-reactive protein (CRP), hypertension, and diabetes. Early identification of these factors would help the clinicians in providing immediate care. The results also show that the most frequent COVID-19 signs in CT scans included ground-glass opacity (GGO), followed by crazy-paving pattern, consolidations, and the number of lobes. Moreover, the experimental results show encouraging performance for the proposed model compared with different predicting models.

Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum's Computers.

In this paper, we propose a bio-molecular algorithm with O( n 2) biological operations, O( 2n-1 ) DNA strands, O( n ) tubes and the longest DNA strand, O( n ), for inferring the value of a bit from the only output satisfying any given condition in an unsorted database with 2n items of n bits. We show that the value of each bit of the outcome is determined by executing our bio-molecular algorithm n times. Then, we show how to view a bio-molecular solution space with 2n-1 DNA strands as an eigenvector and how to find the corresponding unitary operator and eigenvalues for inferring the value of a bit in the output. We also show that using an extension of the quantum phase estimation and quantum counting algorithms computes its unitary operator and eigenvalues from bio-molecular solution space with 2n-1 DNA strands. Next, we demonstrate that the value of each bit of the output solution can be determined by executing the proposed extended quantum algorithms n times. To verify our theorem, we find the maximum-sized clique to a graph with two vertices and one edge and the solution b that satisfies b2 ≡ 1 (mod 15) and using IBM Quantum's backend.

Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.

In this paper, we propose a bio-molecular algorithm with O( n2 + m ) biological operations, O( 2n ) DNA strands, O( n ) tubes and the longest DNA strand, O( n ), for solving the independent-set problem for any graph G with m edges and n vertices. Next, we show that a new kind of the straightforward Boolean circuit yielded from the bio-molecular solutions with m NAND gates, ( m +n × ( n + 1 )) AND gates and (( n × ( n + 1 ))/2) NOT gates can find the maximal independent-set(s) to the independent-set problem for any graph G with m edges and n vertices. We show that a new kind of the proposed quantum-molecular algorithm can find the maximal independent set(s) with the lower bound Ω ( 2n/2 ) queries and the upper bound O( 2n/2 ) queries. This work offers an obvious evidence for that to solve the independent-set problem in any graph G with m edges and n vertices, bio-molecular computers are able to generate a new kind of the straightforward Boolean circuit such that by means of implementing it quantum computers can give a quadratic speed-up. This work also offers one obvious evidence that quantum computers can significantly accelerate the speed and enhance the scalability of bio-molecular computers. Next, the element distinctness problem with input of n bits is to determine whether the given 2n real numbers are distinct or not. The quantum lower bound of solving the element distinctness problem is Ω ( 2n×(2/3) ) queries in the case of a quantum walk algorithm. We further show that the proposed quantum-molecular algorithm reduces the quantum lower bound to Ω (( 2n/2 )/( [Formula: see text]) queries. Furthermore, to justify the feasibility of the proposed quantum-molecular algorithm, we successfully solve a typical independent set problem for a graph G with two vertices and one edge by carrying out experiments on the backend ibmqx4 with five quantum bits and the backend simulator with 32 quantum bits on IBM's quantum computer.

A survey on attack detection, estimation and control of industrial cyber-physical systems.

Cyber-physical systems (CPSs) are complex systems that involve technologies such as control, communication, and computing. Nowadays, CPSs have a wide range of applications in smart cities, smart grids, smart manufacturing and intelligent transportation. However, with integration of industrial control systems with modern communication technologies, CPSs would be inevitably exposed to increasing security threats, which could lead to severe degradation of the system performance and even destruction of CPSs. This paper presents a survey on recent advances on security issues of industrial cyber-physical systems (ICPSs). We specifically discuss two typical kinds of attacks, i.e., Denial-of-Service (DoS) attack and Deception attack, and present recent results in terms of attack detection, estimation, and control of ICPSs. Classifications of current studies are analyzed and summarized based on different system modeling and analysis methods. In addition, advantages and disadvantage of various methodologies are also discussed. Finally, the paper concludes with some potential future research directions on secure ICPSs.

Spectral Analysis of Epidemic Thresholds of Temporal Networks.

Many complex systems can be modeled as temporal networks with time-evolving connections. The influence of their characteristics on epidemic spreading is analyzed in a susceptible-infected-susceptible epidemic model illustrated by the discrete-time Markov chain approach. We develop the analytical epidemic thresholds in terms of the spectral radius of weighted adjacency matrix by averaging temporal networks, e.g., periodic, nonperiodic Markovian networks, and a special nonperiodic non-Markovian network (the link activation network) in time. We discuss the impacts of statistical characteristics, e.g., bursts and duration heterogeneity, as well as time-reversed characteristic on epidemic thresholds. We confirm the tightness of the proposed epidemic thresholds with numerical simulations on seven artificial and empirical temporal networks and show that the epidemic threshold of our theory is more precise than those of previous studies.

Fast and scalable distributed deep convolutional autoencoder for fMRI big data analytics.

In recent years, analyzing task-based fMRI (tfMRI) data has become an essential tool for understanding brain function and networks. However, due to the sheer size of tfMRI data, its intrinsic complex structure, and lack of ground truth of underlying neural activities, modeling tfMRI data is hard and challenging. Previously proposed data modeling methods including Independent Component Analysis (ICA) and Sparse Dictionary Learning only provided shallow models based on blind source separation under the strong assumption that original fMRI signals could be linearly decomposed into time series components with corresponding spatial maps. Given the Convolutional Neural Network (CNN) successes in learning hierarchical abstractions from low-level data such as tfMRI time series, in this work we propose a novel scalable distributed deep CNN autoencoder model and apply it for fMRI big data analysis. This model aims to both learn the complex hierarchical structures of the tfMRI big data and to leverage the processing power of multiple GPUs in a distributed fashion. To deploy such a model, we have created an enhanced processing pipeline on the top of Apache Spark and Tensorflow, leveraging from a large cluster of GPU nodes over cloud. Experimental results from applying the model on the Human Connectome Project (HCP) data show that the proposed model is efficient and scalable toward tfMRI big data modeling and analytics, thus enabling data-driven extraction of hierarchical neuroscientific information from massive fMRI big data.

Receiver-Side TCP Countermeasure in Cellular Networks.

Cellular-based networks keep large buffers at base stations to smooth out the bursty data traffic, which has a negative impact on the user's Quality of Experience (QoE). With the boom of smart vehicles and phones, this has drawn growing attention. For this paper, we first conducted experiments to reveal the large delays, thus long flow completion time (FCT), caused by the large buffer in the cellular networks. Then, a receiver-side transmission control protocol (TCP) countermeasure named Delay-based Flow Control algorithm with Service Differentiation (DFCSD) was proposed to target interactive applications requiring high throughput and low delay in cellular networks by limiting the standing queue size and decreasing the amount of packets that are dropped in the eNodeB in Long Term Evolution (LTE). DFCSD stems from delay-based congestion control algorithms but works at the receiver side to avoid the performance degradation of the delay-based algorithms when competing with loss-based mechanisms. In addition, it is derived based on the TCP fluid model to maximize the network utility. Furthermore, DFCSD also takes service differentiation into consideration based on the size of competing flows to shorten their completion time, thus improving user QoE. Simulation results confirmed that DFCSD is compatible with existing TCP algorithms, significantly reduces the latency of TCP flows, and increases network throughput.

Variations in power of opinion leaders in online communication networks.

Online social media has completely transformed how we communicate with each other. While online discussion platforms are available in the form of applications and websites, an emergent outcome of this transformation is the phenomenon of 'opinion leaders'. A number of previous studies have been presented to identify opinion leaders in online discussion networks. In particular, Feng (2016 Comput. Hum. Behav. 54, 43-53. (doi:10.1016/j.chb.2015.07.052)) has identified five different types of central users besides outlining their communication patterns in an online communication network. However, the presented work focuses on a limited time span. The question remains as to whether similar communication patterns exist that will stand the test of time over longer periods. Here, we present a critical analysis of the Feng framework both for short-term as well as for longer periods. Additionally, for validation, we take another case study presented by Udanor et al. (2016 Program 50, 481-507. (doi:10.1108/PROG-02-2016-0011)) to further understand these dynamics. Results indicate that not all Feng-based central users may be identifiable in the longer term. Conversation starter and influencers were noted as opinion leaders in the network. These users play an important role as information sources in long-term discussions. Whereas network builder and active engager help in connecting otherwise sparse communities. Furthermore, we discuss the changing positions of opinion leaders and their power to keep isolates interested in an online discussion network.

Estimating Graph Robustness Through the Randic Index.

Graph robustness-the ability of a graph to preserve its connectivity after the loss of nodes and edges-has been extensively studied to quantify how social, biological, physical, and technical systems withstand to external damages. In this paper, we prove that graph robustness can be quickly estimated through the Randic index, a parameter introduced in chemistry to study organic compounds. We prove that Erdos-Renyj (ER) graphs are a good specimen of robust graphs because they lack of a clear modular structure; we derive an analytical expression for the Randic index of ER graphs and use ER graphs as an effective term of comparison to decide about graph robustness. Experiments on real datasets from different domains (scientific collaboration networks, content-sharing systems, co-purchase networks from an e-commerce platform, and a road network) show that real-life large graphs are more robust than ER ones with the same number of nodes and edges. We also observe that if node degree distribution closely follows a power law, then few edges contribute for more than half of the Randic index, thus indicating that the selective removal of those edges has devastating impact on graph robustness. Finally, we describe sampling-based algorithms to efficiently but accurately approximate the Randic index.

Providing Healthcare-as-a-Service Using Fuzzy Rule Based Big Data Analytics in Cloud Computing.

With advancements in information and communication technology, there is a steep increase in the remote healthcare applications in which patients can get treatment from the remote places also. The data collected about the patients by remote healthcare applications constitute big data because it varies with volume, velocity, variety, veracity, and value. To process such a large collection of heterogeneous data is one of the biggest challenges which requires a specialized approach. To address this challenge, a new fuzzy rule based classifier is presented in this paper with an aim to provide Healthcare-as-a-Service. The proposed scheme is based upon the initial cluster formation, retrieval, and processing of the big data in cloud environment. Then, a fuzzy rule based classifier is designed for efficient decision making for data classification in the proposed scheme. To perform inferencing from the collected data, membership functions are designed for fuzzification and defuzzification processes. The proposed scheme is evaluated on various evaluation metrics, such as average response time, accuracy, computation cost, classification time, and false positive ratio. The results obtained confirm the effectiveness of the proposed scheme with respect to various performance evaluation metrics in cloud computing environment.

Anti-ISI Demodulation Scheme and Its Experiment-Based Evaluation for Diffusion-Based Molecular Communication.

In diffusion-based molecular communication, the most common modulation technique is based on the concentration of information molecules. However, the random delay of molecules due to the channel with memory causes severe inter-symbol interference (ISI) among consecutive signals. In this paper, we propose a detection technique for demodulating signals, the increase detection algorithm (IDA), to improve the reliability of concentration-encoded diffusion-based molecular communication. The proposed IDA detects an increase (i.e., a relative concentration value) in molecule concentration to extract the information instead of detecting an absolute concentration value. To validate the availability of IDA, we establish a real physical tabletop test bed. And we evaluate the proposed demodulation technique using bit error rate (BER) and demonstrate by the tabletop molecular communication platform that the proposed IDA successfully minimizes and even isolates ISI, so that a lower BER is achieved than the common demodulation technique.

Biological Oscillators in Nanonetworks-Opportunities and Challenges.

One of the major issues in molecular communication-based nanonetworks is the provision and maintenance of a common time knowledge. To stay true to the definition of molecular communication, biological oscillators are the potential solutions to achieve that goal as they generate oscillations through periodic fluctuations in the concentrations of molecules. Through the lens of a communication systems engineer, the scope of this survey is to explicitly classify, for the first time, existing biological oscillators based on whether they are found in nature or not, to discuss, in a tutorial fashion, the main principles that govern the oscillations in each oscillator, and to analyze oscillator parameters that are most relevant to communication engineer researchers. In addition, the survey highlights and addresses the key open research issues pertaining to several physical aspects of the oscillators and the adoption and implementation of the oscillators to nanonetworks. Moreover, key research directions are discussed.

A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment.

Implantable medical devices (IMDs) are man-made devices, which can be implanted in the human body to improve the functioning of various organs. The IMDs monitor and treat physiological condition of the human being (for example, monitoring of blood glucose level by insulin pump). The advancement of information and communication technology enhances the communication capabilities of IMDs. In healthcare applications, after mutual authentication, a user (for example, doctor) can access the health data from the IMDs implanted in a patient's body. However, in this kind of communication environment, there are always security and privacy issues, such as leakage of health data and malfunctioning of IMDs by an unauthorized access. To mitigate these issues, in this paper, we propose a new secure remote user authentication scheme for IMDs communication environment to overcome security and privacy issues in existing schemes. We provide the formal security verification using the widely accepted Automated Validation of Internet Security Protocols and Applications tool. We also provide the informal security analysis of the proposed scheme. The formal security verification and informal security analysis prove that the proposed scheme is secure against known attacks. The practical demonstration of the proposed scheme is performed using the broadly accepted NS2 simulation tool. The computation and communication costs of the proposed scheme are also comparable with the existing schemes. Moreover, the scheme provides additional functionality features, such as anonymity, untraceability, and dynamic implantable medical device addition.

Design and Analysis of an Efficient Energy Algorithm in Wireless Social Sensor Networks.

Because mobile ad hoc networks have characteristics such as lack of center nodes, multi-hop routing and changeable topology, the existing checkpoint technologies for normal mobile networks cannot be applied well to mobile ad hoc networks. Considering the multi-frequency hierarchy structure of ad hoc networks, this paper proposes a hybrid checkpointing strategy which combines the techniques of synchronous checkpointing with asynchronous checkpointing, namely the checkpoints of mobile terminals in the same cluster remain synchronous, and the checkpoints in different clusters remain asynchronous. This strategy could not only avoid cascading rollback among the processes in the same cluster, but also avoid too many message transmissions among the processes in different clusters. What is more, it can reduce the communication delay. In order to assure the consistency of the global states, this paper discusses the correctness criteria of hybrid checkpointing, which includes the criteria of checkpoint taking, rollback recovery and indelibility. Based on the designed Intra-Cluster Checkpoint Dependence Graph and Inter-Cluster Checkpoint Dependence Graph, the elimination rules for different kinds of checkpoints are discussed, and the algorithms for the same cluster checkpoints, different cluster checkpoints, and rollback recovery are also given. Experimental results demonstrate the proposed hybrid checkpointing strategy is a preferable trade-off method, which not only synthetically takes all kinds of resource constraints of Ad hoc networks into account, but also outperforms the existing schemes in terms of the dependence to cluster heads, the recovery time compared to the pure synchronous, and the pure asynchronous checkpoint advantage.