Combined Metabolomic and Quantitative RT-PCR Analyses Revealed the Synthetic Differences of 2-Acetyl-1-pyrroline in Aromatic and Non-Aromatic Vegetable Soybeans

Aroma is an important economic trait of vegetable soybeans, which greatly influences their market value. The 2-acetyl-1-pyrroline (2AP) is considered as an important substance affecting the aroma of plants. Although the 2AP synthesis pathway has been resolved, the differences of the 2AP synthesis in the aromatic and non-aromatic vegetable soybeans are unknown. In this study, a broad targeted metabolome analysis including measurement of metabolites levels and gene expression levels was performed to reveal pathways of aroma formation in the two developmental stages of vegetable soybean grains [35 (S5) and 40 (S6) days after anthesis] of the ‘Zhexian No. 8’ (ZX8, non-aromatic) and ZK1754 (aromatic). The results showed that the differentially accumulated metabolites (DAMs) of the two varieties can be classified into nine main categories including flavonoids, lipids, amino acids and derivatives, saccharides and alcohols, organic acids, nucleotides and derivatives, phenolic acids, alkaloids and vitamin, which mainly contributed to their phenotypic differences. Furthermore, in combination with the 2AP synthesis pathway, the differences of amino acids and derivatives were mainly involved in the 2AP synthesis. Furthermore, 2AP precursors’ analysis revealed that the accumulation of 2AP mainly occurred from 1-pyrroline-5-carboxylate (P5C), not 4-aminobutyraldehyde (GABald). The quantitative RT-PCR showed that the associated synthetic genes were 1-pyrroline-5-carboxylate dehydrogenase (P5CDH), ∆¹-pyrroline-5-carboxylate synthetase (P5CS), proline dehydrogenase (PRODH) and pyrroline-5-carboxylate reductase (P5CR), which further verified the synthetic pathway of 2AP. Furthermore, the betaine aldehyde dehydrogenase 2 (GmBADH2) mutant was not only vital for the occurrence of 2AP, but also for the synthesis of 4-aminobutyric acid (GABA) in vegetable soybean. Therefore, the differences of 2AP accumulation in aromatic and non-aromatic vegetable soybeans have been revealed, and it also provides an important theoretical basis for aromatic vegetable soybean breeding.     

消费者对强化营养食品的认知与购买行为分析——基于南京市消费者的调查

根据南京市消费者关于强化营养食品的调查数据,考察消费者对于强化营养食品的认知水平,运用二元Logistic回归模型分析了影响消费者强化营养食品购买行为的主要因素。结果表明,消费者对于强化营养食品的认知度较低,对强化营养食品的强化剂成分信任度偏低,安全性关注程度较高;消费者的学历、健康状况、家庭结构、家庭月纯收入、产品因素、态度因素、健康动机和市场因素,对强化营养食品的购买行为具有显著影响。      

一种共享份分块构造的异或区域递增式视觉密码方案

该文依据授权子集的个数将共享份划分若干块,按照共享份分块构造的设计思路,结合(n, n)异或单秘密视觉密码的加密矩阵,构造了异或区域递增式视觉密码的秘密分享与恢复流程。与现有方案相比,该方案可以实现解密区域图像的完全恢复,且明显减小了共享份的大小。     

差分选择策略在复杂多目标优化问题中的研究

在多目标进化算法中,如何提高生成解的质量一直是研究的热点与难点.为解决以上问题,该算法从差分进化算法与计算资源分配策略2个方向进行了研究.根据多目标问题从决策空间到目标空间的映射关系以及差分进化算法基本原理,提出了一种基于双种群的多目标差分选择策略.它利用2个种群来区分个体间收敛性差别,在调整差分参数以适应多目标算法特性的基础上,以收敛性差别为依据选择参与差分运算的个体,从而提高差分算法性能,加快子代个体收敛.另外,根据子代个体收敛速率的不同,动态调整计算资源的分配,进一步提高算法收敛性.与ε-MOEA和MOEA/D-DRA在一系列复杂的多目标优化问题上进行了对比实验,结果表明了所提策略的有效性.     

基于粗糙集理论的不完备数据填补方法

ROUSTIDA算法具有较好的数据填补能力,但依然会出现一些不完备信息。利用了可扩充辨识所反映的对象间的属性差异信息,对遗失属性进行填充,从而使改进后的ROUSTIDA算法的填充能力得到了很大的改善,同时还具备了初步排除噪声数据的能力,在性能上也有了很大的提高,实验表明改进的算法具有很好的实用价值。     

关于复迭代的Julia集的注记

提出了把复迭代的Julia集及充满Julia集的概念作一定程度的拓广(原先在文献中所认为的Julia集仍是拓广后的Julia集),后指出当指定任何一个三角形区域之后,它必可是某个复迭代的Julia集。并讨论了一些相关的问题,为建立分形集合分析理论的基础进行了初步探索。     

拐点计数法及其在材料科学中的应用

采用集合论的形式对一种体视学新方法,即拐点计数法及相应的体视学基本关系式进行了描述和推导,使之更加条统、准确和明瞭。并进而讨论了它们在材料科学中的各种可能应用及有关问题。     

汽包水位自动调节中主汽流量的一种计算方法

给水三冲量自动调节中,通常采用调节级压力与主汽流量的关系曲线来计算实际主汽流量。通过分析Alstom某600MW空冷汽轮机的结构,通常采用的流量计算方法并不适用;并对目前的三冲量调节中采用的主汽流量,提出了一种更适合的计算方法。     

基于多层脉冲神经网络的非接触液位检测方法

尽管基于深度学习的非接触液位检测方法能够较好地完成检测任务,但其对计算资源的较高要求使其不适用于算力受限的嵌入式设备。为解决上述问题,该文首先提出了基于多层脉冲神经网络的非接触液位检测方法;其次,提出了单帧和帧差脉冲编码方法将视频流时间动态性编码成可重构的脉冲模式;最后在实际场景中对模型进行测试。实验结果表明,所提方法具有较高应用价值。     

Input Structure Design for Structural Controllability of Complex Networks

This paper addresses the problem of the input design of large-scale complex networks. Two types of network components, redundant inaccessible strongly connected component (RISCC) and intermittent inaccessible strongly connected component (IISCC) are defined, and a subnetwork called a driver network is developed. Based on these, an efficient method is proposed to find the minimum number of controlled nodes to achieve structural complete controllability of a network, in the case that each input can act on multiple state nodes. The range of the number of input nodes to achieve minimal control, and the configuration method (the connection between the input nodes and the controlled nodes) are presented. All possible input solutions can be obtained by this method. Moreover, we give an example and some experiments on real-world networks to illustrate the effectiveness of the method.