Equilibrium polymerization in a solvent: Solution on the Bethe lattice

The lattice model for equilibrium polymerization in a solvent proposed by Wheeler and Pfeuty is solved exactly on a Bethe lattice (core of a Caylay tree) with general coordination numberq. Earlier mean-field results are reobtained in the limitq, but the phase diagrams show deviations from them for finiteq. Whenq=2, our results turn into the solution of the one-dimensional problem. Although the model is solved directly, without the use of the correspondence between the equilibrium polymerization model and the diluten0 model, we verified that the latter model may also be solved on the Bethe lattice, its solution being identical to the direct solution in all parameter space. As observed in earlier studies of the puren0 vector model, the free energy is not always convex. We obtain the region of negative susceptibility for our solution and compare this result with mean field and renormalization group (-expansion) calculations.     

On the Randić Index of Acyclic Conjugated Molecules

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))^−1/2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. We give a sharp lower bound on the Randić index of conjugated trees (trees with a perfect matching) in terms of the number of vertices. A sharp lower bound on the Randić index of trees with a given size of matching is also given Mei Lu: Partially supported by NNSFC (No. 60172005) Lian-zhu Zhang: Partially supported by NNSFC (No. 10271105) Feng Tian: Partially supported by NNSFC (No. 10431020)     

Fast folding and comparison of RNA secondary structures

Summary Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and base pairing probabilities.An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment.All computer codes are written in ANSI C. They include implementations of modified algorithms on parallel computers with distributed memory. Performance analysis carried out on an Intel Hypercube shows that parallel computing becomes gradually more and more efficient the longer the sequences are.

---

Schnelle Faltung und Vergleich von Sekundärstrukturen von RNA

Zusammenfassung Die im Vienna RNA package enthaltenen Computer Programme für die Berechnung und den Vergleich von RNA Sekundärstrukturen werden präsentiert. Ihren Kern bilden Algorithmen zur Vorhersage von Strukturen minimaler Energie sowie zur Berechnung von Zustandssumme und Basenpaarungswahrscheinlichkeiten mittels dynamischer Programmierung.Ein effizienter heuristischer Algorithmus für das inverse Faltungsproblem wird vorgestellt. Darüberhinaus präsentieren wir kompakte und effiziente Programme zum Vergleich von RNA Sekundärstrukturen durch Baum-Editierung und Alignierung.Alle Programme sind in ANSI C geschrieben, darunter auch eine Implementation des Faltungs-algorithmus für Parallelrechner mit verteiltem Speicher. Wie Tests auf einem Intel Hypercube zeigen, wird das Parallelrechnen umso effizienter je länger die Sequenzen sind.

     

结构方程模型在兴安落叶松林生长中的应用

【目的】通过结构方程模型,确定气候、土壤和海拔对兴安落叶松林生长指标的影响以及路径关系。【方法】选取年平均气温、年平均降水量、太阳辐射、土壤全氮含量、土壤有机碳密度和海拔作为影响因素,探究兴安落叶松地上生物量、地下生物量、树高与这些影响因素的关系,并利用AMOS 21.0软件构建衡量兴安落叶松生长的3个指标与气候、土壤和海拔的结构方程模型。【结果】兴安落叶松的地上生物量、地下生物量随着海拔、年平均降水量的增大呈现先增大后减少的趋势,树高随着海拔的增加而增加。地上和地下生物量随着土壤有机碳密度的增加而增加。海拔对兴安落叶松生长的总效应系数为0.200且是正向效应,海拔对兴安落叶松生长的直接效应(0.224)大于间接效应(-0.024);气候因子对兴安落叶松林生长的总影响系数为-0.771且是负向效应;土壤因子对兴安落叶松生长的总影响系数为-0.216,其对兴安落叶松林生长起到一定的抑制作用。【结论】根据结构方程模型的路径系数,气候因子的总影响系数绝对值最大,其次是土壤和海拔,兴安落叶松林静态生长主要受到气候因子的制约。     

N叉树上的离散时间量子随机行走

通过离散时间量子随机行走的框架,我们研究了在N叉树上的离散时间量子随机行走,该框架不需要硬币空间,仅仅只需要选择一个除了酉性再无其它限制的演化算子,并且包含了使用再生结构的轨道枚举和z变换.作为结果,我们在封闭形式中计算了在根处的振幅的生成函数.     

棉纺厂管理信息系统的研制

本文根据开发CTU-JMS管理信息系统已取得的成功经验,介绍CTU—JMS管理信息系统的运行环境;总体规划中运用的两种设计策略——“由顶向下”分析法和“由下至上”分析法;MIS中建立大型基础数据库采用的主要技术;MIS决策管理层的形成以及生产经营决策子系统的技术特点。为推进我国的纺织企业管理信息系统的开发和实现现代化管理作了探索。     

An exact algorithm for the capacitated shortest spanning arborescence

We are given a complete and loop-free digraphG=(V, A), whereV={1,...,n} is the vertex set,A={(i, j) :i, j V} the arc set, andr V is a distinguishedroot vertex. For each arc (i, j) A, letc _ij be the associatedcost, and for each vertexi, letq _i 0 be the associateddemand (withq _r =0). Moreover, a nonnegativebranch capacity, Q, is defined.A Capacitated Shortest Spanning Arborescence rooted at r (CSSA _r ) is a minimum cost partial digraph such that: (i) each vertexj r has exactly one entering arc; (ii) for each vertexj r, a path fromr toj exists; (iii) for each branch leaving vertexr, the total demand of the vertices does not exceed the branch capacity,Q. A variant of theCSSA _r problem (calledD-CSSA _r ) arises when the out-degree of the root vertex is constrained to be equal to a given valueD. These problems are strongly NP-hard, and find practical applications in routing and network design. We describe a new Lagrangian lower bound forCSSA _r andD-CSSA _r problems, strengthened in a cutting plane fashion by iteratively adding violated constraints to the Lagrangian problem. We also present a new lower bound based on projection leading to the solution of min-cost flow problems. The two lower bounds are then combined so as to obtain an overall additive lower bounding procedure. The additive procedure is then imbedded in a branch-and-bound algorithm whose performance is enhanced by means of reduction procedures, dominance criteria, feasibility checks and upper bounding. Computational tests on asymmetric and symmetric instances from the literature, involving up to 200 vertices, are given, showing the effectiveness of the proposed approach.     

秦淮河流域典型排涝泵站前池水质与降雨特征响应关系

为分析排涝泵站前池水质与降雨特征的响应关系,对南京市城区秦淮河沿线2个排涝泵站前池水质以及降水量开展高频在线自动监测,结合回归树方法分析了不同降雨强度、前期干旱时间条件下排涝泵站前池水质变化规律,探讨了不同类型排涝泵站前池水质的主要影响因素。结果表明:晴雨天均有生活污水汇入的A泵站前池氨氮质量浓度在大雨强下降低,中雨强下先升高后降低,小雨强下平缓上升,A泵站前池污染物质量浓度主要受降雨强度和次降水量影响;主要接收降雨径流,雨量大时有生活污水溢流汇入的B泵站,前池污染物质量浓度在大雨强下先升高后逐渐降低,中雨强下降低,小雨强下变化不大,B泵站前池水质主要受次降水量、前期干旱时间和降雨强度影响;2个泵站前池CODMn质量浓度变化与降雨的响应规律相似,但更多受到与前期干旱时间关联的地表径流冲刷作用影响;连续降雨均导致泵站前池氨氮质量浓度和CODMn质量浓度波动变化较大,而前期干旱时间越长,降雨发生后泵站前池水质越差。     

面向对象的二叉树装配模型研究

文章研究可装配性设计中的产品装配建模,提出一种以装配体为对象并能充分反映装配过程特点的二叉树装配模型。应用面向对象技术,建立了相应的数据结构及应用框架,为可装配性评价奠定了基础,也可做为通用的产品装配模型应用于ＣＡＰＰ等领域。     

苦丁茶树扦插繁殖的研究

采用不同种类和不同浓度的植物生长调节剂、不同苗段、插穗不同节数以及插穗不同剪叶量等几种处理方法,对苦丁茶树插穗生根的影响进行了试验,结果表明：在试验的几种促根药剂中,以浓度２００ｍｇ／Ｌ的ＮＡＡ对苦丁茶树插穗生根的效果最佳;在同样条件下,二段苗的发根能力是强;随着插穗节数的增多,其发根能力就增强,但综合考虑到成活率、扦插苗的长势、繁殖系数以及经济效益等因素,笔者认为以每插穗具两个节为宜;在相同条件下,每张叶剪去１／３再插穗的,其发根能力最强．