Accelerations for global optimization covering methods using second derivatives

Two improvements for the algorithm of Breiman and Cutler are presented. Better envelopes can be built up using positive quadratic forms. Better utilization of first and second derivative information is attained by combining both global aspects of curvature and local aspects near the global optimum. The basis of the results is the geometric viewpoint developed by the first author and can be applied to a number of covering type methods. Improvements in convergence rates are demonstrated empirically on standard test functions.Partially supported by an University of Canterbury Erskine grant.     

格序摸的f－覆盖

讨论了格序模的ｆ－模覆盖，给出了覆盖函子、ｆ－张量积函子和嵌入函子之间的关系．     

A method for calculating static transmission errors of plastic spur gears using FEM evaluation

There are many ways to calculate the static transmission errors of steel gears, but none is developed for plastic gears. Since the Young's modulus of the plastic material is lower than that of steel by two orders, the effects of large tooth deflection on the static transmission errors of plastic gears become significant. A multi-tooth contact analysis using finite element method for calculating the static transmission errors of plastic spur gears is established to compare with the existing method for steel spur gears. According to the comparison results, a modification of the existing method is proposed for plastic spur gears and verified by the same finite element contact analysis.     

指派问题匈牙利解法的又两个注记

本文就指派问题匈牙利解法中的一些方法提出两个注记，且为此提供一个较为简单的解法。     

关于解析函数单叶性的判则

对于在区域G内具有某些性质的解析函数f:G→C,本文定理1指出(G,f)是f(G)的有穷叶光滑非限覆盖曲面.作为应用,在定理3中讨论了B(0;1)内满足条件f(0)=f′(0)-1=0的解析函数的单叶性与其Taylor展式的系数及其边界值的关系.     

Symmetrically approximately continuous functions, consistent density theorems, and Fubini type inequalities

Using the continuum hypothesis, Sierpinski constructed a nonmeasurable function such that is countable for every Clearly, such a function is symmetrically approximately continuous everywhere.

Here we to show that Sierpinski's example cannot be constructed in ZFC. Moreover, we show it is consistent with ZFC that if a function is symmetrically approximately continuous almost everywhere, then it is measurable.

     

Locating Active Sensors on Traffic Networks

Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This paper refers to an active sensor when it reads identifications of vehicles, including their routes in the network, that the vehicles actively provide when they use the network. On the other hand, the conventional inductance loop detectors are passive sensors that mostly count vehicles at points in a network to obtain traffic volumes (e.g., vehicles per hour) on a lane or road of the network.This paper introduces a new set of network location problems that determine where to locate active sensors in order to monitor or manage particular classes of identified traffic streams. In particular, it focuses on the development of two generic locational decision models for active sensors, which seek to answer these questions: (1) “How many and where should such sensors be located to obtain sufficient information on flow volumes on specified paths?”, and (2) “Given that the traffic management planners have already located count detectors on some network arcs, how many and where should active sensors be located to get the maximum information on flow volumes on specified paths?”The problem is formulated and analyzed for three different scenarios depending on whether there are already count detectors on arcs and if so, whether all the arcs or a fraction of them have them. Location of an active sensor results in a set of linear equations in path flow variables, whose solution provide the path flows. The general problem, which is related to the set-covering problem, is shown to be NP-Hard, but special cases are devised, where an arc may carry only two routes, that are shown to be polynomially solvable. New graph theoretic models and theorems are obtained for the latter cases, including the introduction of the generalized edge-covering by nodes problem on the path intersection graph for these special cases. An exact algorithm for the special cases and an approximate one for the general case are presented.     

Covering the crosspolytope by equal balls

Summary We determine the minimal radius of <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>n=2$, $d$ or $2d$ congruent balls, which cover the $d$-dimensional crosspolytope.