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.     

项目引入法——可普遍采用的研究性学习模式

研究性学习是实施素质教育和创新教育的一种新型教学方式。在工科类课程的教学中 可采用引入一个工程项目,通过项目设计来学习研究新知识,完成教学计划。     

集成系统中工艺卡片填写与工序图绘制的研究

利用VBA实现CAD和CAPP系统集成，讨论了基于Word平台进行工艺卡填写，并在此基础上进行工艺卡填写和工序图并行输出的一般问题。工艺文件的填写是在CAPP数据库的支持下，直接读取CAD所提供的CAPP工艺数据文件，经推理机推理自动生产工艺过程；工序图绘制是在特征图表级和参数化绘图原理的基础上进行的。     

表达建筑设计思想的重要工具--轴测图

轴测图凭借平行投影的特点，传递着一种模型般的空间感。近年来国外对轴测图的研究开发和利用已达到很高层次。本文从建筑三维构图的角度，对轴测图的教研问题，轴测图与透视图的比较以及关于轴测图绘制手段进行讨论。     

High precision topographic data on Lop Nor basin's Lake "Great Ear" ? and the timing of its becoming a dry salt lake

High precision elevation measurements using DGPS were carried out along three representative tran- sects for the "Great Ear" area, a dry salt lake within the Lop Nor basin. Results indicate that the Lop Nor basin is only 5.2 m deep and its lowest point occurs at the center of the "Great Ear". In addition, the basin is asymmetric - steeper in the southwest (0.19‰) and gentler in the northeast (0.09‰). Points along the same "Great Ear" ring were found to have an identical elevation value, but different when from different ones (lower towards the center). The spacing of the "Great Ear" rings was found to be closely related with the surface steepness. The closer the "Great Ear" rings are spaced, the steeper the ground surface, and vice versa. These findings support the argument that the "Great Ear" rings are the former shoreline trails left behind by Lop Nor water during the last few episodes of recession towards its total dry up. A comprehensive analysis of the high precision elevation data, historical accounts, aerial and satellite photographs and imagery, and official topographic maps of the study area suggests that the "Great Ear" area in the Lop Nor basin was incorrectly mapped as being covered by a great body of water on the 1963 topographic maps. A re-interpretation of the 1958 aerial photographs and newer remote sensing imagery indicated that the "Great Ear" ring structure was already in place in 1958 and it continued to appear on the subsequent remote sensing data without any major changes. It is estimated that lake water in the "Great Ear" area of the Lop Nor basin disappeared between the late 1930s and early 1940s.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

Impact of Partial Separability on Large-Scale Optimization

ELSO is an environment for the solution oflarge-scale optimization problems. With ELSO the user is required to provide only code for the evaluation of a partially separable function. ELSO exploits the partialseparability structure of the function to computethe gradient efficiently using automatic differentiation.We demonstrate ELSO's efficiency by comparing thevarious options available in ELSO.Our conclusion is that the hybrid option in ELSOprovides performance comparable to the hand-coded option, while having the significantadvantage of not requiring a hand-coded gradient orthe sparsity pattern of the partially separable function.In our test problems, which have carefully coded gradients,the computing time for the hybrid AD option is within a factor of two of thehand-coded option.     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

一类It型非线性时滞关联随机大系统的分散鲁棒控制

在非线性项满足全局Lipschitz条件下,本文研究了一类It型非线性时滞关联随机大系统的分散鲁棒控制问题.系统的时滞是关于状态和控制输入的.基于Lyapunov泛函及线性矩阵不等式(LMI)的分析方法,得到了无记忆状态反馈控制器使整个时滞关联随机大系统可镇定的充分条件.     

锥形多层拉深模的设计

为了解决拉深时开裂及多次拉深的问题，探讨了锥形多层拉深模的设计方法．介绍了其结构及参数的确定．该模具改善了拉深件的质量，提高了效率，对类似零件的拉深有借鉴作用．