木化石连续切片方法

初步结果表明,一些保存较好的木化石材料(或渗矿化材料),可先经过酸浸解,使其矿质杂屑离解并暴落出原实体材料,然后用金属刀进行连续切片。     

中外优秀男子百米跑运动员速度结构和技术特征比较分析

针对近年来我国短跑项目的低弥状态，通过中外优秀男子100米跑运动员的速度结构和技术特征进行分析认为：最大速度是制约我国男子100米跑的关键因素，而加速距离短是影响最大速度的主要因子．且我国男子短跑运动员保持最大速度的能力差及最大速度出现的时机不合理。     

Tighter approximation bounds for LPT scheduling in two special cases

$Q||C_{\max }$ denotes the problem of scheduling n jobs on m machines of different speeds such that the makespan is minimized. In the paper two special cases of $Q||C_{\max }$ are considered: case I, when $m?1$ machine speeds are equal, and there is only one faster machine; and case II, when machine speeds are all powers of 2 (2-divisible machines). Case I has been widely studied in the literature, while case II is significant in an approach to design so called monotone algorithms for the scheduling problem.We deal with the worst case approximation ratio of the classic list scheduling algorithm ‘Largest Processing Time (LPT)’. We provide an analysis of this ratio $\mathit{Lpt}/\mathit{Opt}$ for both special cases: For ‘one fast machine’, a tight bound of $(\sqrt{3}+1)/2\approx 1.3660$ is given. For 2-divisible machines, we show that in the worst case $1.3673<\mathit{Lpt}/\mathit{Opt}<1.4$. Besides, we prove another lower bound of $955/699>(\sqrt{3}+1)/2$ when LPT breaks ties arbitrarily.To our knowledge, the best previous lower and upper bounds were $(4/3,3/2?1/2m]$ in case I [T. Gonzalez, O.H. Ibarra, S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1) (1977) 155–166], respectively $[4/3?1/3m,3/2]$ in case II [R.L. Graham, Bounds on multiprocessing timing anomalies, SIAM Journal on Applied Mathematics 17 (1969) 416–429; A. Kovács, Fast monotone 3-approximation algorithm for scheduling related machines, in: Proc. 13th Europ. Symp. on Algs. (ESA), in: LNCS, vol. 3669, Springer, 2005, pp. 616–627]. Moreover, Gonzalez et al. conjectured the lower bound 4/3 to be tight in the ‘one fast machine’ case [T. Gonzalez, O.H. Ibarra, S. Sahni, Bounds for LPT schedules on uniform processors, SIAM Journal on Computing 6 (1) (1977) 155–166].     

Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality

In this paper, we address the development of a global optimization procedure for the problem of designing a water distribution network, including the case of expanding an already existing system, that satisfies specified flow demands at stated pressure head requirements. The proposed approach significantly improves upon a previous method of Sherali et al. (1998) by way of adopting tighter polyhedral relaxations, and more effective partitioning strategies in concert with a maximal spanning tree-based branching variable selection procedure. Computational experience on three standard test problems from the literature is provided to evaluate the proposed procedure. For all these problems, proven global optimal solutions within a tolerance of 10^–4% and/or within 1$ of optimality are obtained. In particular, the two larger instances of the Hanoi and the New York test networks are solved to global optimality for the very first time in the literature. A new real network design test problem based on the Town of Blacksburg Water Distribution System is also offered to be included in the available library of test cases, and related computational results are presented.     

韩国共性技术的创新发展对我国的启示

按照韩国经济发展过程总结了韩国共性技术创新发展的四个阶段,并从政府作用、实施策略和创新主体三方面阐述了各阶段特点,借此对我国共性技术的发展提供了一些借鉴与启示。     

Some remarks on compact constant mean curvature hypersurfaces in a halfspace of ℍ n+1

We consider embedded compact hypersurfacesM in a halfspace of hyperbolic space with boundaryM in the boundary geodesic hyperplaneP of the halfspace and with non-zero constant mean curvature. We prove the following. Let {M _n } be a sequence of such hypersurfaces withM _n contained in a disk of radiusr _n centered at a point P such thatr _n 0 and that eachM _n is a large. H-hypersurface,H > 1. Then there exists a subsequence of {M _n } converging to the sphere of mean curvatureH tangent toP at. In the case of smallH-hypersurfaces orH 1, if we add a condition on the curvature of the boundary, there exists a subsequence of {M _n } which are graphs. The convergence is smooth on compact subset of ³ .     

Further numerical methods for the Falkner-Skan equations: Shooting and continuation techniques

We consider in this paper the numerical solution of the Falkner-Skan differential equation, modelling under some similarity assumptions the boundary layer equation. We look for the extremal solution of this third order differential equation. The methods we use are basically the Newton method with a shooting process, which is coupled with a continuation method: they allow us to follow the solution arcs which contain regular and turning point solutions.     

铝合金稀土转化膜成膜工艺研究

应用正交实验设计 ,开发并研究了LY1 2铝合金 4价铈盐转化膜的成膜工艺及其膜层的耐蚀性能 .实验表明 :经稀土转化处理的铝合金其点蚀电位升高 ,自然腐蚀电位有所降低 ,从而降低了点蚀敏感性 ;试样极化阻力提高 70倍以上 ,耐蚀性能大大提高 ,与铬酸盐相当 ;另外 ,还结合电化学测试和表面分析 ,初步探讨了铝合金稀土转化膜的耐蚀机理     

铝塑复合管生产工艺的研究

铝塑复合管产品质量直接受塑料挤出机、模具、交流脉冲氩孤焊机、牵引机等设备的机械性能及原材料质量的影响。