Photophysical aspects of single-molecule detection by two-photon excitation with consideration of sequential pulsed illumination.

An important goal in single molecule fluorescence correlation spectroscopy is the theoretical simulation of the fluorescence signal stemming from individual molecules and its autocorrelation function. The simulation approaches developed up to now are based exclusively on continuous-wave (cw) illumination and consequently on cw-excitation. However, this approximation is no longer valid in the case of two-photon excitation, for which pulsed illumination is usually employed. We present a novel theoretical model for the simulation of the fluorescence signal of single molecules and its autocorrelation function with consideration of the time dependence of the excitation flux and thus of all illumination-dependent photoprocesses: two-photon excitation, induced emission and photobleaching. Further important characteristics of our approach are the consideration of the dependence of the photobleaching rate on illumination and the low intersystem-crossing rates of the studied coumarins. Moreover, using our approach, we can predict quantitatively the effect of the laser pulse width on the fluorescence signal of a molecule, that is, the contributions of the photobleaching and saturation effects, and thus we can calculate the optimal laser pulse width. The theoretical autocorrelation functions were fitted to the experimental data, and we could ascertain a good agreement between the resulting and the expected parameters. The most important parameter is the photobleaching constant sigma, the cross section of the transition Sn<--S1, which characterises the photostability of the molecules independent of the experimental conditions. Its value is 1.7 x 10(-23) cm2 for coumarin 153 and 5 x 10(-23) cm2 for coumarin 314.     

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.     

Feature generation based on relation learning and image partition for occluded person re-identification

In order to solve the challenging tasks of person re-identification(Re-ID) in occluded scenarios, we propose a novel approach which divides local units by forming high-level semantic information of pedestrians and generates features of occluded parts. The approach uses CNN and pose estimation to extract the feature map and key points, and a graph convolutional network to learn the relation of key points. Specifically, we design a Generating Local Part (GLP) module to divide the feature map into different units. Based on different occluded conditions, the partition mode of GLP has high flexibility and variability. The features of the non-occluded parts are clustered into an intermediate node, and then the spatially correlated features of the occluded parts are generated according to the de-clustering operation. We conduct experiments on both the occluded and the holistic datasets to demonstrate its effectiveness.     

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.     

Synthese und Struktur von Silber(II)-tetrafluoroaurat(III) Ag[AuF4]2

Synthesis and Structure of Silver(II) Tetrafluoroaurate(III) Ag[AuF₄]₂ Intensive green single crystals of Ag[AuF₄]₂ can be obtained by heating up micro crystalline Ag[AuF₄]₂ in autoclaves (p(F₂) ～ 200 bar, T ～ 400°C, t ～ 14 d). It crystallizes monoclinic, space group P2₁/n ? C; (No. 14) with a = 522.3(1), b = 1101.3(3), c = 550.5(2) pm, β = 94.98(3), Z = 2 and is isotypic with Pd[AuF₄]₂.     

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.