“三线合一”的应用

一 .什么是“三线合一”在等腰三角形中 ,顶角的平分线、底边上的高、底边上的中线互相重合 ,简称“三线合一” .二 .“三线合一”的应用如右图 1 ,在△ＡＢＣ中 ,(1 )∵ＡＢ =ＡＣ ,∠ 1 =∠ 2 ,∴ＡＤ⊥ＢＣ ,ＢＤ =ＤＣ .(2 )∵ＡＢ =ＡＣ ,ＢＤ =ＤＣ ,∴ＡＤ⊥ＢＣ ,∠ 1 =∠ 2 .(3 )∵ＡＢ =ＡＣ ,ＡＤ⊥ＢＣ ,∴ＢＤ =ＤＣ ,∠ 1 =∠ 2 .根据以上三个推理 ,灵活运用它们 ,是解题的关键 .例 1　一个等腰三角形底边上的高为 3ｃｍ ,那么它底求证 :ＰＡＰＢ=ＣＭＣＮ .(2 )当Ｐ不是边ＡＢ的中点时 ,ＰＡＰＢ=ＣＭＣＮ 是否仍然成立 ?请证明你的结论 .(北京市宣武区 2 0 0 1年初中升学统一考试题 )(1 )分析 :由于Ｐ是ＡＢ的中点 ,所以ＰＡ =ＰＢ ,从而 ＰＡＰＢ=1 .欲证 ＰＡＰＢ =ＣＭＣＮ,只需证 ＣＭＣＮ =1 ,即证ＣＭ =ＣＮ .连结ＰＣ ,因为ＡＣ =ＢＣ ,ＰＡ =ＰＢ ,根据“三线合一” ,得ＰＣ⊥ＡＢ ,ＰＣ平分∠ＡＣＢ ,即∠ＡＣＰ =∠ＢＣＰ .依题意得折痕ＭＮ⊥ＰＣ ,所以ＭＮ∥ＡＢ ,从而得∠ＣＭＮ=∠...     

一道全国联赛加试题的推广

2002年全国高中数学联赛加试第一题 :图 1问题　如图 1,在△ＡＢＣ中 ,∠Ａ =6 0° ,ＡＢ >ＡＣ ,点Ｏ是外心 ,两条高ＢＥ ,ＣＦ交于Ｈ点 ,点Ｍ、Ｎ分别在线段ＢＨ ,ＨＦ上 ,且满足ＢＭ =ＣＮ .求 ＭＨ +ＮＨＯＨ 的值 .分析　如图 1,ＭＨ =ＢＨ -ＢＭ ,ＮＨ =ＣＮ -ＣＨ ,又　ＢＭ =ＣＮ ,∴　ＭＨ +ＮＨ =ＢＨ -ＣＨ ,于是　 ＭＨ +ＮＨＯＨ =ＢＨ -ＣＨＯＨ .问题等价于求 ＢＨ -ＣＨＯＨ 的值 .下面我们来解答本题的一般情况 .推广题　在△ＡＢＣ中 ,ＡＢ >ＡＣ ,点Ｏ是外心 ,Ｈ是垂心 ,则　 ＢＨ -ＣＨＯＨ =2 (ｃｏｓＢ -ｃｏｓＣ)1-8…     

Chern Classes in Bivariant Theory Definitions of Brasselet and of Sabbah

ＣｈｅｒｎＣｌａｓｓｅｓｉｎＢｉｖａｒｉａｎｔＴｈｅｏｒｙＤｅｆｉｎｉｔｉｏｎｓｏｆＢｒａｓｓｅｌｅｔａｎｄｏｆＳａｂｂａｈ￥ＪｉａｎｙｉＺＨＯＵ（ＳｉＧｍＡＣＮＲＳ，ＣＩＲＭＬｕｍｉｎｙＣａｓｅ９１６，Ｆ－１３２８８ＭａｒｓｅｉｌｌｅＣｅｄｅｘ９；...     

单位球上不同Hardy空间之间的复合算子

本文研究了ＣＮ中单位球Ｂ上不同Ｈａｒｄｙ空间之间的复合算子,引入了η－Ｃａｒｌｅｓｏｎ测度,利用它作为工具给出了有界的或紧的复合算子Ｃ■： Ｈｐ（Ｂ） → Ｈｑ（Ｂ）的特征．     

一个三角形不等式的四面体移植

设△ＡＢＣ的边ＢＣ、ＣＡ、ＡＢ与外接圆半径、面积和半周长分别为ａ、ｂ、ｃ、Ｒ、△、ｓ．Ｐ是△ＡＢＣ内任意一点,ＡＰ、ＢＰ、ＣＰ分别交ＢＣ、ＣＡ、ＡＢ于Ｌ、Ｍ、Ｎ．１９６６年荷兰的Ｏ．Ｂｏｔｔｅｍａ建立了不等式：　　　ＡＬ·ＢＭ·ＣＮＳ△ＬＭＮ≥４ｓ（１）等号当且仅当Ｐ是△ＡＢＣ的内心时成立．类似上式,贵刊文［１］Ｐ２６刊载了刘键先生建立的不等式：ＡＬ·ＢＭ·ＣＮａ·ＰＬ＋ｂ·ＰＭ＋ｃ·ＰＮ≥△Ｒ（２）等号当且仅当△ＡＢＣ为锐角三角形且Ｐ为垂心时成立．文［２］给出了（２）式的简证,受其启发,笔者通…     

An Interpretation of the Poincare Morphism for Compact Toric Varieties

ＡｎＩｎｔｅｒｐｒｅｔａｔｉｏｎｏｆｔｈｅＰｏｉｎｃａｒéＭｏｒｐｈｉｓｍｆｏｒＣｏｍｐａｃｔＴｏｒｉｃＶａｒｉｅｔｉｅｓ￥Ｊｅａｎ－ＰａｕｌＢＲＡＳＳＥＬＥＴ（ＣＩＲＭ－Ｍａｒｓｅｉｌｌｅ－ＦｒａｎｃｅＳｉＧｍＡＣＮＲＳ，ＣＩＲＭＬｕｍｉｎｙＣａｓ...     

关于两直线垂直的证明

我们知道 ,当两条直线相交所成的四个角中 ,有一个角是直角时 ,我们就称这两条直线互相垂直 ,它是两条直线相交中的一种特殊位置关系 .证明两直线垂直的问题始终贯穿于整个初中阶段 ,它在几何问题证明中占有非常重要的位置 .为此 ,本文就证明两条直线垂直的方法进行归纳总结 ,供读者参考 .1.利用垂直的定义来证例 1　已知 :如图 1,在⊙Ｏ中 ,直径ＡＢ⊥ＣＤ ,分别在ＡＢ ,ＣＤ上取点Ｅ ,Ｆ ,使ＡＥ =ＣＦ .过Ｅ作弦ＣＮ ,过Ｆ作弦ＢＭ ,两弦相交于点Ｈ .求证 :ＣＮ⊥ＢＭ .分析 :欲证ＣＮ⊥ＢＭ ,只需证∠ＣＨＦ =90° ,即只需证∠ＨＥＢ +…     

数学问题解答

20 0 1年 5月号问题解答(解答由问题提供人给出 )1 31 1　ＡＢ是⊙Ｏ非直径的弦 ,半径ＯＣ ⊥ＡＢ于Ｍ ,Ｄ是ＯＢ的中点 ,Ｅ在劣弧ＢＣ上 ,且∠ＡＥＤ =∠ＡＣＯ ,ＡＥ交ＣＢ于Ｆ ,交ＣＯ于Ｎ .求证 :Ｓ△ＦＣＮＳ△ＤＭＯ =ＣＮＭＯ.(重庆市合川太和中学　陈开龙　 40 1 555)证明　如图 ,延长ＣＯ交⊙Ｏ于Ｐ ,连结ＥＰ ,ＦＤ .∵ＣＰ是直径 ,ＯＣ ⊥ＡＢ ,∴ＡＰ =ＢＰ ,故∠ 1 =∠ 2 ,ＡＣ =ＢＣ .∵∠ＡＥＤ =∠ＡＣＰ ,又∠ＡＥＰ =∠ＡＣＰ ,∴∠ＡＥＤ =∠ＡＥＰ ,即Ｅ ,Ｄ ,Ｐ三点共线 .∵ＯＢ =ＯＣ ,∴∠ 3=∠ 2 ∠ＯＢＣ =2∠ 2 …     

一个三角形不等式的四面体移植

设△ＡＢＣ的边ＢＣ ,ＣＡ ,ＡＢ与外接圆半径、面积和半周长分别为ａ,ｂ ,ｃ,Ｒ ,△ ,ｓ.Ｐ是△ＡＢＣ内的任意一点 ,ＡＰ ,ＢＰ ,ＣＰ分别交ＢＣ ,ＣＡ ,ＡＢ于Ｌ ,Ｍ ,Ｎ .1966年荷兰的Ｏ .Ｂｏｔｔｅｍａ建立了不等式 :ＡＬ·ＢＭ·ＣＮＳ△ＬＭＮ≥ 4ｓ ( 1)等号当且仅当Ｐ是△ＡＢＣ的内心时成立 .类似上式 ,文 [1]刊载了刘健先生建立的不等式 :ＡＬ·ＢＭ·ＣＮａ·ＰＬ ｂ·ＰＭ ｃ·ＰＮ≥ △Ｒ ( 2 )等号当且仅当△ＡＢＣ是锐角三角形且Ｐ为其垂心时成立 .文 [2 ]给出了 ( 2 )式的一种简证 ,受其启发 ,笔者通过探究 ,将 ( 2 )式…     

简证一个有价值的三角形不等式

设△ＡＢＣ的边ＢＣ、ＣＡ、ＡＢ与外接圆半径、面积和半周长分别为ａ、ｂ、ｃ、Ｒ、△、ｓ．Ｐ是△ＡＢＣ内任意一点,ＡＰ、ＢＰ、ＣＰ分别交ＢＣ、ＣＡ、ＡＢ于Ｌ、Ｍ、Ｎ．１９６６年荷兰的Ｏ．Ｂｏｔｅｍａ建立了不等式ＡＬＢＭＣＮＳ△ＬＭＮ≥４ｓ（１）等号当且仅...     

数控机床现场故障分布模型的统计研究

本文对２４台可换刀计算机数控机床的现场故障数据进行一年多的跟踪采集和数理统计分析，提出了整机故障分布的数学模型，为制订评估机床可靠性的特征量提供了理论依据。     

Considering manufacturing cost and scheduling performance on a CNC turning machine

A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a nonlinear relationship between the manufacturing cost and its required processing time on a CNC turning machine. If we consider total manufacturing cost (F₁) and total weighted completion time (F₂) objectives simultaneously on a single CNC machine, making appropriate processing time decisions is as critical as making job sequencing decisions. We first give an effective model for the problem of minimizing F₁ subject to a given F₂ level. We deduce some optimality properties for this problem. Based on these properties, we propose a heuristic algorithm to generate an approximate set of efficient solutions. Our computational results indicate that the proposed algorithm performs better than the GAMS/MINOS commercial solver both in terms of solution quality and computational requirements such that the average CPU time is only 8% of the time required by the GAMS/MINOS.     

Cyclic scheduling of a 2-machine robotic cell with tooling constraints

In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required operations as long as the required tools are stored in their tool magazines. However, this assumption may be unrealistic at times since the tool magazines have limited capacity and in many practical instances the required number of tools exceeds this capacity. In this respect, our study assumes that some operations can only be processed on the first machine while some others can only be processed on the second machine due to tooling constraints. Remaining operations can be processed on either machine. The problem is to find the allocation of the remaining operations to the machines and the optimal robot move cycle that jointly minimize the cycle time. We prove that the optimal solution is either a 1-unit or a 2-unit robot move cycle and we present the regions of optimality. Finally, a sensitivity analysis on the results is conducted.     

A new bounding mechanism for the CNC machine scheduling problems with controllable processing times

In this study, we determine the upper and lower bounds for the processing time of each job under controllable machining conditions. The proposed bounding scheme is used to find a set of discrete efficient points on the efficient frontier for a bi-criteria scheduling problem on a single CNC machine. We have two objectives; minimizing the manufacturing cost (comprised of machining and tooling costs) and minimizing makespan. The technological restrictions of the CNC machine along with the job specific parameters affect the machining conditions; such as cutting speed and feed rate, which in turn specify the processing times and tool lives. Since it is well known that scheduling problems are extremely sensitive to processing time data, system resources can be utilized much more efficiently by selecting processing times appropriately.     

Optimal allocation and processing time decisions on non-identical parallel CNC machines: ϵ-constraint approach

When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making optimal machine-job assignments and processing time decisions so as to minimize total manufacturing cost while the makespan being upper bounded by a known value, denoted as ?-constraint approach for a bicriteria problem. We then give optimality properties for the resulting single criterion problem. We provide alternative methods to compute cost lower bounds for partial schedules, which are used in developing an exact (branch and bound) algorithm. For the cases where the exact algorithm is not efficient in terms of computation time, we present a recovering beam search algorithm equipped with an improvement search procedure. In order to find improving search directions, the improvement search algorithm uses the proposed cost bounding properties. Computational results show that our lower bounding methods in branch and bound algorithm achieve a significant reduction in the search tree size that we need to traverse. Also, our recovering beam search and improvement search heuristics achieve solutions within 1% of the optimum on the average while they spent much less computational effort than the exact algorithm.     

Using ARMA models to forecast workpiece roundness error in a turning operation

The paper describes the methodology for developing autoregressive moving average (ARMA) models to represent the workpiece roundness error in the machine taper turning process. The method employs a two stage approach in the determination of the AR and MA parameters of the ARMA model. It first calculates the parameters of the equivalent autoregressive model of the process, and then derives the AR and MA parameters of the ARMA model. Akaike's Information Criterion (AIC) is used to find the appropriate orders m and n of the AR and MA polynomials respectively. Recursive algorithms are developed for the on-line implementation on a laboratory turning machine. Evaluation of the effectiveness of using ARMA models in error forecasting is made using three time series obtained from the experimental machine. Analysis shows that ARMA(3,2) with forgetting factor of 0.95 gives acceptable results for this lathe turning machine.     

数控机床的人因可靠性分析

应用可靠性工程的理论和方法,在分析数控机床操作工人人为差错分布规律的基础上,研究了数控机床人因可靠性数字特征的求法.     

Omnidirectional walking of legged robots with a failed leg

This paper studies omnidirectional walking of a hexapod robot with a locked joint failure by proposing crab gaits and turning gaits. Due to the reduced workspace of a failed leg, fault-tolerant gaits have limitations in their mobility. As for crab gaits, an accessible range of the crab angle is derived for a given configuration of the failed leg. As for turning gaits, the conditions on turning trajectories guaranteeing fault tolerance are derived for spinning gaits and circling gaits. Based on the principles of fault-tolerant gait planning, periodic crab gaits and turning gaits are proposed in which a hexapod robot realizes tripod walking after a locked joint failure, having a reasonable stride length and stability margin. The proposed fault-tolerant gaits are then applied to an obstacle avoidance problem of a hexapod robot with a locked joint failure. The kinematic constraints of fault-tolerant gaits should be considered in planning the robot trajectory.     

Capacity and tool allocation problem in flexible manufacturing systems

This study addresses an allocation problem that arises in the semiconductor industry and flexible manufacturing systems where the tools should be loaded on computer numerical controlled (CNC) machines to process a number of operations. The time and tool magazine capacities of the CNC machines and the number of available tools of each type are limited. The objective is to maximize the total weight of operation assignments. We present a mixed integer programming formulation of the problem and show that the problem is NP-hard in the strong sense. We show that the linear programming relaxation upper bound dominates the best possible Lagrangean relaxation upper bound. We develop several lower bounding procedures and a lower bounding procedure using Lagrangean relaxation approach. Our computational results show that the upper and lower bounding procedures produce near-optimal solutions in reasonable times.     

Path planning,modeling and simulation of an autonomous articulated heavy construction machine performing a loading cycle

This research presents path planning and tracking for an articulated large wheel loader during the travel portion of a loading cycle. The study proposes a methodology for path planning, modeling, simulation and control of such vehicles; the analysis focuses on all of these components together and explains the relation among them. The developed methodology for path planning takes into account the dynamics and the performance characteristics of the heavy construction articulated vehicles, it also takes into account the construction working site constraints. The path optimization criterion is based on distance and cusp minimization without neglecting the constraints imposed by the size of the vehicle and its stable turning radius. The proposed path planning methodology is an extension and an improvement for Reeds and Shepp algorithm for a point shortest path calculation. The optimal path is consisted of circular arcs and straight segments, the radius is constant and identical for each arc in the desired path, the radius assumed to be similar to the minimum turning radius of the machine. When optimizing articulated machine path; to best account for machine size and articulation; more than one approach are discussed and compared. The machine is modeled and simulated during tracing the pre-defined planned path. The machine model includes the main frames, tires and a steering controller. The developed PID controller is used to keep machine lateral position within the pre-defined path while traveling with constant speed. The results showed an acceptable optimized path which the machine is able to track closely.