Properties of connected graphs having minimum degree distance

The degree distance of a connected graph, introduced by Dobrynin, Kochetova and Gutman, has been studied in mathematical chemistry. In this paper some properties of graphs having minimum degree distance in the class of connected graphs of order n and size m≥n−1 are deduced. It is shown that any such graph G has no induced subgraph isomorphic to P₄, contains a vertex z of degree n−1 such that G−z has at most one connected component C such that |C|≥2 and C has properties similar to those of G.For any fixed k such that k=0,1 or k≥3, if m=n+k and n≥k+3 then the extremal graph is unique and it is isomorphic to K₁+(K_1,k+1∪(n−k−3)K₁).     

电感耦合等离子体质谱(ICP-MS)及其联用技术在核工业领域的应用进展

综述了电感耦合等离子体质谱(ICP-MS)及其联用分析技术的进展,论述了其在相关核工业及环境领域中分析痕量或超痕量的放射性同位素、长寿命核素、元素形态等的应用。讨论了电感耦合等离子体质谱及联用技术的发展趋势,并对目前存在的主要问题及可能的解决方案进行了讨论。     

具有固定时滞的经济周期模型的动态分析

在经济活动中,投资行为和资本存量存在一定的时滞效应,这会影响经济周期模型的动态行为,进而使得投资政策对经济的稳定调整复杂化.考虑到资本存量的预期时间以及投资时滞对经济活动的影响,采用Hopf分岔理论,研究具有固定时滞的经济周期模型的均衡点的稳定性以及形成经济周期的条件.研究发现,投资过程中的投资时滞,以及投资决策中对于资本存量的预测时间构成经济周期产生的诱因;同时可通过政府投资政策调整达到预期均衡目标,这对保持经济周期稳定及经济政策制定有一定的指导作用.     

Development of models for prediction of the antioxidant activity of derivatives of natural compounds

Antioxidants are important for maintaining the appropriate balance between oxidizing and reducing species in the body and thus preventing oxidative stress. Many natural compounds are being screened for their possible antioxidant activity. It was found that a mushroom pigment Norbadione A, which is a pulvinic acid derivative, shows an antioxidant activity; the same was found for other pulvinic acid derivatives and structurally related coumarines. Based on the results of in vitro studies performed on these compounds as a part of this study quantitative structure–activity relationship (QSAR) predictive models were constructed using multiple linear regression, counter-propagation artificial neural networks and support vector regression (SVR). The models have been developed in accordance with current QSAR guidelines, including the assessment of the models applicability domains. A new approach for the graphical evaluation of the applicability domain for SVR models is suggested. The developed models show sufficient predictive abilities for the screening of virtual libraries for new potential antioxidants.     

Exploiting the performance of dictionary-based bio-entity name recognition in biomedical literature

Bio-entity name recognition is the key step for information extraction from biomedical literature. This paper presents a dictionary-based bio-entity name recognition approach. The approach expands the bio-entity name dictionary via the Abbreviation Definitions identifying algorithm, improves the recall rate through the improved edit distance algorithm and adopts some post-processing methods including Pre-keyword and Post-keyword expansion, Part of Speech expansion, merge of adjacent bio-entity names and the exploitation of the contextual cues to further improve the performance. Experiment results show that with this approach even an internal dictionary-based system could achieve a fairly good performance.     

The Hamilton–Waterloo Problem for ‐Factors and ‐Factors

The Hamilton–Waterloo problem asks for a 2‐factorization of (for v odd) or minus a 1‐factor (for v even) into ‐factors and ‐factors. We completely solve the Hamilton–Waterloo problem in the case of C₃‐factors and ‐factors for .     

Decomposition algorithms for the tree edit distance problem

We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.     

GLOBAL ANALYSIS OF A CLASS OF CUBIC SYSTEMS

ＧＬＯＢＡＬＡＮＡＬＹＳＩＳＯＦＡＣＬＡＳＳＯＦＣＵＢＩＣＳＹＳＴＥＭＳＷａｎｇＸｉａｎ（王现）（ＮａｎｊｉｎｇＵｎｉｖｅｒｓｉｔｙ，南京大学，邮编：２１００９３）Ａｂｓｔｒａｃｔ：Ｔｈｅｐａｐｅｒｇｉｖｅｓａｃｏｍｐｌｅｔｅｇｏｌｂａｌｐｈａｓｅｐ...     

第II类双边拆卸线平衡问题建模与优化

报废汽车体积大,废弃物污染大,拆卸过程复杂,将作业任务均衡分配难。为此,本文对工作站数量确定的双边拆卸线平衡问题进行研究,建立问题数学模型,设计一种变邻域蛙跳算法。所提算法在寻优过程中采用变邻域搜索提高族群局部搜索效率;引入个体学习机制加快精英个体进化速度;提出基于二分法的节拍时间调整策略加快对最优节拍的搜索。最后,通过算例对算法性能进行验证并通过实例说明任务在拆卸线上平衡分配的重要性。