Set controllability of Markov jump switching Boolean control networks and its applications

In this article, a novel method is proposed for investigating the set controllability of Markov jump switching Boolean control networks (MJSBCNs). Specifically, the switching signal is described as a discrete-time homogeneous Markov chain. By resorting to the expectation and switching indicator function, an expectation system is constructed. Based on the expectation system, a novel verifiable condition is established for solving the set reachability of MJSBCNs. With the newly obtained results on set reachability, a necessary and sufficient condition is further derived for the set controllability of MJSBCNs. The obtained results are applied to Boolean control networks with Markov jump time delays. Examples are demonstrated to justify the theoretical results.     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

Immobilization of α-amylase in vinyl-polymer-based interpenetrating polymer networks

Semi-interpenetrating polymer networks (IPNs) of poly(ethylene glycol), poly(vinyl alcohol) and polyacrylamide were prepared as a support for enzyme immobilization and kinetic studies were performed for the immobilization of -amylase. The effect of IPN composition on the extent of immobilization was investigated and the percentage of relative activity of the immobilized enzyme was evaluated as a function of the chemical architecture of the IPNs, pH and temperature, taking starch as a substrate. The kinetic constants and the maximum reaction velocity were also evaluated. The IPNs were characterized by IR spectral analysis.     

DWDM上25.344 Mbit/s光监控信息传送系统的设计

采用25.344 Mbit/s光监控信息传送技术可以更好地满足当前密集波分复用(DWDM)系统中不断增加的网络监控信息和附加业务的需要.文章首先介绍了25.344 Mbit/s光监控信息传送系统的技术方案,然后详细描述了其帧结构、码型设计以及硬件实现的框图,最后介绍了该技术的优点.     

特斯拉线圈电网络模型的宽频等值化简

针对特斯拉线圈复杂的电网络模型,提出了利用求解非线性方程和优化目标函数建立等值网络的方法。该等值网络在宽频范围内,在阻抗参数、有载增益、输入阻抗、传输功率与传输效率方面,均与原网络近似等值。该方法应用电压、电流之积计算灵敏度,方便地获得雅可比矩阵和目标函数梯度。本文方法对“网络分析与综合”课程或“电路理论”课程的师生,以及科研人员,具有切实的启发作用。     

水体透射光谱结合主成分分析(PCA )改进化学需氧量(COD)含量估算研究

化学需氧量（Chemical Oxygen Demand,COD）是水体有机污染的一项重要指标,化学需氧量越高,表示水污染程度越严重。 为了解决传统的COD测量方法耗时较长,不利于快速、实时地获取水体中COD的信息等问题。本文提出了基于透射光谱测量结合主成分分析(Principal Component Analysis, PCA)改进水体COD含量估算模型。具体的,采集100组COD水体光谱信息,分别使用3种不同的高光谱数据预处理方法对光谱数据进行预处理,分析不同预处理方法对模型精度的影响,并基于不同的预处理方法分别建立高斯过程回归模型(Gaussian Process Regression, GPR)和BP神经网络模型,分析不同预处理方法对模型精度的影响;并对各模型结合PCA数据降维方法进行模型的改进,通过比较模型的精度选择最优模型进行水体COD含量的检测。结果显示,相比于原始光谱数据建立的GPR模型和BP神经网络模型,数据预处理后的模型精度明显提升;且结合PCA对预处理后的数据进一步降维处理后,模型精度得到了进一步的提升。其中,基于标准正态变量变换特征结合PCA改进BP神经网络模型基于PCA改进的BP神经网络模型R^2高达0.9940,均方根误差RMSE为0.022540。证明了基于PCA改进的BP神经网络数据降维方法对预处理后的光谱数据进行降维处理,有利于去除光谱中的冗余信息,提取特征信息,可以实现高光谱检测方法可以实现COD含量估算模型的优化,从而为传统COD测量方法存在的问题提出了一种新的解决思路。     

An Extensive Assessment of Network Embedding in PPI Network Alignment

Network alignment is a fundamental task in network analysis. In the biological field, where the protein–protein interaction (PPI) is represented as a graph, network alignment allowed the discovery of underlying biological knowledge such as conserved evolutionary pathways and functionally conserved proteins throughout different species. A recent trend in network science concerns network embedding, i.e., the modelling of nodes in a network as a low-dimensional feature vector. In this survey, we present an overview of current PPI network embedding alignment methods, a comparison among them, and a comparison to classical PPI network alignment algorithms. The results of this comparison highlight that: (i) only five network embeddings for network alignment algorithms have been applied in the biological context, whereas the literature presents several classical network alignment algorithms; (ii) there is a need for developing an evaluation framework that may enable a unified comparison between different algorithms; (iii) the majority of the proposed algorithms perform network embedding through matrix factorization-based techniques; (iv) three out of five algorithms leverage external biological resources, while the remaining two are designed for domain agnostic network alignment and tested on PPI networks; (v) two algorithms out of three are stated to perform multi-network alignment, while the remaining perform pairwise network alignment.     

Space-Air-Ground Integrated Mobile Crowdsensing for Partially Observable Data Collection by Multi-Scale Convolutional Graph Reinforcement Learning

Mobile crowdsensing (MCS) is attracting considerable attention in the past few years as a new paradigm for large-scale information sensing. Unmanned aerial vehicles (UAVs) have played a significant role in MCS tasks and served as crucial nodes in the newly-proposed space-air-ground integrated network (SAGIN). In this paper, we incorporate SAGIN into MCS task and present a Space-Air-Ground integrated Mobile CrowdSensing (SAG-MCS) problem. Based on multi-source observations from embedded sensors and satellites, an aerial UAV swarm is required to carry out energy-efficient data collection and recharging tasks. Up to date, few studies have explored such multi-task MCS problem with the cooperation of UAV swarm and satellites. To address this multi-agent problem, we propose a novel deep reinforcement learning (DRL) based method called Multi-Scale Soft Deep Recurrent Graph Network (ms-SDRGN). Our ms-SDRGN approach incorporates a multi-scale convolutional encoder to process multi-source raw observations for better feature exploitation. We also use a graph attention mechanism to model inter-UAV communications and aggregate extra neighboring information, and utilize a gated recurrent unit for long-term performance. In addition, a stochastic policy can be learned through a maximum-entropy method with an adjustable temperature parameter. Specifically, we design a heuristic reward function to encourage the agents to achieve global cooperation under partial observability. We train the model to convergence and conduct a series of case studies. Evaluation results show statistical significance and that ms-SDRGN outperforms three state-of-the-art DRL baselines in SAG-MCS. Compared with the best-performing baseline, ms-SDRGN improves 29.0% reward and 3.8% CFE score. We also investigate the scalability and robustness of ms-SDRGN towards DRL environments with diverse observation scales or demanding communication conditions.     

KEADA: Identifying Key Classes in Software Systems Using Dynamic Analysis and Entropy-Based Metrics

Software maintenance is indispensable in the software development process. Developers need to spend a lot of time and energy to understand the software when maintaining the software, which increases the difficulty of software maintenance. It is a feasible method to understand the software through the key classes of the software. Identifying the key classes of the software can help developers understand the software more quickly. Existing techniques on key class identification mainly use static analysis techniques to extract software structure information. Such structure information may contain redundant relationships that may not exist when the software runs and ignores the actual interaction times between classes. In this paper, we propose an approach based on dynamic analysis and entropy-based metrics to identify key classes in the Java GUI software system, called KEADA (identifying KEy clAsses based on Dynamic Analysis and entropy-based metrics). First, KEADA extracts software structure information by recording the calling relationship between classes during the software running process; such structure information takes into account the actual interaction of classes. Second, KEADA represents the structure information as a weighted directed network and further calculates the importance of each node using an entropy-based metric OSE (One-order Structural Entropy). Third, KEADA ranks classes in descending order according to their OSE values and selects a small number of classes as the key class candidates. In order to verify the effectiveness of our approach, we conducted experiments on three Java GUI software systems and compared them with seven state-of-the-art approaches. We used the Friedman test to evaluate all approaches, and the results demonstrate that our approach performs best in all software systems.     

面向神经形态感知的人工脉冲神经元的研究进展

近年来,随着人工智能技术和脉冲神经网络(SNN)的迅猛发展,人工脉冲神经元的研究逐渐兴起。人工脉冲神经元的研究对于开发具有人类智能水平的机器人、实现自主学习和自适应控制等领域具有重要的应用前景。传统的电子器件由于缺乏神经元的非线性特性,需要复杂的电路结构和大量的器件才能模拟简单的生物神经元功能,同时功耗也较高。因此,最近研究者们借鉴生物神经元的工作机制,提出了多种基于忆阻器等新型器件的人工脉冲神经元方案。这些方案具有功耗低、结构简单、制备工艺成熟等优点,并且在模拟生物神经元的多种功能等方面取得了显著进展。文章将从人工脉冲神经元的基本原理出发,综述和分析目前已有的各种实现方案。具体来说,将分别介绍基于传统电子器件和基于新型器件的人工脉冲神经元的实现方案,并对其优缺点进行比较。此外,还将介绍不同类型的人工脉冲神经元在实现触觉、视觉、嗅觉、味觉、听觉和温度等神经形态感知方面的应用,并对未来的发展进行展望。希望能够为人工脉冲神经元的研究和应用提供有益的参考和启示。