Computing upward topological book embeddings of upward planar digraphs

We describe a unified approach for studying book, point-set, and simultaneous embeddability problems of upward planar digraphs. The approach is based on a linear time strategy to compute an upward planar drawing of an upward planar digraph such that all vertices are collinear. Besides having impact in relevant application domains of graph drawing and computational geometry, the presented results open new research directions in the area of upward planarity with constraints of the positions of the vertices.     

Photo-Controlled Macroscopic Self-Assembly Based on Photo-Switchable Hetero-Complementary Quadruple Hydrogen Bonds

A photo-switchable hetero-complementary quadruple H-bonding array, which consists of an azobenzene-derived ureidopyrimidinone (UPy) module ( Azo-UPy ) and a nonphotoactive diamidonaphthyridine (DAN) derivative ( Napy-1 ), is constructed based on a reversible photo-locking approach. Upon UV (390 nm)/Vis (460 nm) light irradiations, photo-switchable quadruple H-bonded dimerization between Azo-UPy and Napy-1 can be achieved with exhibiting 4.8×10⁴-fold differences in binding strength (ON/OFF ratios). Furthermore, smart polymeric gels with unique photo-controlled macroscopic self-assembly behavior can be fabricated by introducing such quadruple H-bonding array as photo-regulable noncovalent interfacial connections.     

关于一类二次哈密尔顿系统在二次扰动下的极限环个数问题

本文研究了一类具有两个鞍点和一个中心的通用二次哈密尔顿向量场在二次扰动下的三参数开折，证明极限环的最小上界为２。     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.     

采用多元化的教学手段,提高物理人才的综合素质——南开大学物理学基础科学人才培养基地建设经验介绍

介绍了南开大学国家物理学基础科学研究人才培养基地在十多年的建设中,通过多元化的教学手段提高学生的学习自主性,通过加强科研训练提高物理人才综合素质的经验和取得的成果.     

一种基于GIS的选址问题及算法

本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较.     

A search technique for global optimization in a chaotic environment

We describe a new algorithm which uses the trajectories of a discrete dynamical system to sample the domain of an unconstrained objective function in search of global minima. The algorithm is unusually adept at avoiding nonoptimal local minima and successfully converging to a global minimum. Trajectories generated by the algorithm for objective functions with many local minima exhibit chaotic behavior, in the sense that they are extremely sensitive to changes in initial conditions and system parameters. In this context, chaos seems to have a beneficial effect: failure to converge to a global minimum from a given initial point can often be rectified by making arbitrarily small changes in the system parameters.