初三几何第二学期期中自测题

Ａ组一、填空题 (每小题 3分 ,共 3 0分 )1 .圆和圆的位置关系有五种情况 :① ;②;③ ;④ ;⑤ .2 .设两圆的半径分别为Ｒ和ｒ(Ｒ >ｒ) ,圆心距为ｄ .①两圆外离 ｄ ;②两圆 ｄ =Ｒ +ｒ;③两圆相交 ｄ ;④两圆 ｄ =Ｒ -ｒ;⑤两圆内含 ｄ .3 .相交两圆的重要性质是 .4 .已知两圆外离 ,那么它们的公切线有条 ,两条外公切线的长 ,两条内公切线的长 .5.若两圆只有两条公切线 ,则两圆的位置关系是.6.的多边形叫正多边形 ,正多边形都是对称图形 .7.正ｎ边形的每个内角为 ,中心角为.8.任何正多边形都有一个圆和一个圆 ,这两个圆是圆 ,这个圆的…     

初三几何第二学期自测题

A组 一、填空题(每小题3分,共计30分) (1)如果两圆的公切线只有两条,那么这两个圆的位置关系是_. (2)如果一个多边形的内角和等于720°,那么这个多边形的边数是_. (3)已知正六边形的边长为a,则其内切圆与外接圆组成的圆环的面积为_. (4)两等圆⊙O1和⊙O2相交于A,B两点,且⊙O1经过圆心O2,则∠OAB=_. (5)若半径分别为1和2的两圆相切,则这两圆的     

求解欠定线性方程组稀疏解的算法

针对欠定线性方程组稀疏解的求解问题,文中提出两个改进的迭代重加权最小范数解算法(IRMNS)及一个光滑的0函数算法.其中,第一个算法基于 q(q∈(0,1])范数提出的,当q较小的时候,算法可以增强恢复稀疏解的能力;第二个算法是直接由0范数最小化问题提出的,它可以看做是第一个算法在q =0时的拓展;第三个算法是通过用一个光滑函数来近似0范数从而将原问题进行转化求解的.数值例子表明这三种算法都是快速有效的.     

圆的一个性质的探求

一、问题的提出在高级中学课本《平面解析几何》(必修 )第 68页上有这样一道例题 :已知一曲线是与两个定点Ｏ(0 ,0 )、Ａ(3 ,0 )距离的比为12 的点的轨迹 ,求这个曲线的方程 ,并画出曲线 .课本中给出本题的答案是 :所求的轨迹方程为 (ｘ+ 1) 2 +ｙ2 =4,它是以Ｃ(-1,0 )为圆心 ,ｒ =2为半径的圆 (如图 ) .一般地 ,我们还可以证明 :与两个定点Ｍ1 、Ｍ2 距离的比是一个常数ｍ(ｍ >0 ,ｍ≠ 1)的动点轨迹是一个圆 (证明从略 ) .现在我们要思考的问题是 ,这两个定点及定比与所得的圆是什么关系 ?对于一个圆 ,是否一定存在一对点 (唯一还是无穷多…     

巧用圆的直径式方程解题

已知圆的直径的两个端点分别为M（x1,Y1）,N（x2,Y2）,设点P（x,y）是该圆上的任意一点,则Mp=（z—zl,Y—Y1）,N--P：=（z—X2,Y—Y2）.     

求解雷达群监视目标群问题的拟物算法

解决了雷达群监视目标群这一国际军事学术界一直关注的基本问题.基于拟物的思路为求解三维的监视问题建立了数学模型,找到了快速实用的近似算法.以此算法为基础可以设计出一种为雷达部队和有关行政商业部门服务的跟踪和监视系统.     

关于可靠性设施布局问题的近似算法

设施布局问题的研究始于20世纪60年代,主要研究选择修建设施的位置和数量,以及与需要得到服务的城市之间的分配关系,使得设施的修建费用和设施与城市之间的连接费用之和达到最小.现实生活中, 受自然灾害、工人罢工、恐怖袭击等因素的影响,修建的设施可能会出现故障, 故连接到它的城市无法得到供应,这就直接影响到了整个系统的可靠性.针对如何以相对较小的代价换取设施布局可靠性的提升,研究人员提出了可靠性设施布局问题.参考经典设施布局问题的贪婪算法、原始对偶算法和容错性问题中分阶段分层次处理的思想,设计了可靠性设施布局问题的一个组合算法.该算法不仅在理论上具有很好的常数近似度,而且还具有运算复杂性低的优点.这对于之前的可靠性设施布局问题只有数值实验算法, 是一个很大的进步.     

圆幂定理(上)

<正>在圆的知识中,以下几个定理都与线段的乘积式有关,它们是:相交弦定理圆的弦相交于圆内的一点,各弦被这点分成的两条线段的乘积相等.图1(1)PA·PB=PC·PD.切割线定理由圆外一点向圆引两条割线.则在每条割线上,由该点到割线与圆的两个交点所成的两个线段的乘积相等,都等于切线的平方.图1(2)PA·PB=PC·PD=PE2.     

Goldbach猜想的一种新尝试(英文)

设N为大偶数,以D(N)表示将N表成两个素数之和的表法个数,即 D(N)=sum from N=P_1+P_3 (1)。Hardy和Littlewood利用“圆法”证明了下面的结果 D(N)=(?)(N)N/log~2N+R (1)这里 (?)(N) 2 multiply from p>2((1-1/(p-1)~2) multiply from p\N P>2 (1+1/p-2),(2) R=(sum from q>Q(μ~2(q)/φ~2(q))C_q(-N))N/log~2N+integral from E (S~2(α,N)e~(-2πtαN)dα) (3) S(α,N)=sum from p≤N (e~(2πiαp)),C_q(-N)=sum from n=1 to q (e~(2πiNh/q))Q=log~(16)N,E表示在通常意义下的余区间,这就提出了下面的猜想 D(N)～(?)(N)N/log~2·(4)熟知Goldbach猜想的困难在于误差项R的处理,至今“圆法”是提出猜想(4)的唯一的方法,本文提出了另一种途径来研究猜想(4)。而且方法是初等的,看起来是更为直接的方法。令 (?)(N)=sum from d≤N(Λ(d)Λ(N-d))。 显然 D(N)=(?)(N)/log~2N[1+O(log log N/log N)]+O(N/log~3N).本文证明了下面两个定理: 定理1 设N为大偶数,这里证明定理1的方法是初等的,这就建议我们提出猜想(4)。 定理2 用Bombieri定理可以证明 R_1=R_2=O(Nlog~(-1)N)。从上面两个定理看出,研究Goldbach猜想的困难,在于处理余项R_3。     

计算Hamilton矩阵特征值的一个稳定的有效的保结构的算法

提出了一个稳定的有效的保结构的计算Hamilton矩阵特征值和特征不变子空间的算法,该算法是由SR算法改进变形而得到的。在该算法中,提出了两个策略,一个叫做消失稳策略,另一个称为预处理技术。在消失稳策略中,通过求解减比方程和回溯彻底克服了Bunser Gerstner和Mehrmann提出的SR算法的严重失稳和中断现象的发生,两种策略的实施的代价都非常低。数值算例展示了该算法比其它求解Hamilton矩阵特征问题的算法更有效和可靠。     

Quasi-human seniority-order algorithm for unequal circles packing

In the existing methods for solving unequal circles packing problems, the initial configuration is given arbitrarily or randomly, but the impact of different initial configurations for existing packing algorithm to the speed of existing packing algorithm solving unequal circles packing problems is very large. The quasi-human seniority-order algorithm proposed in this paper can generate a better initial configuration for existing packing algorithm to accelerate the speed of existing packing algorithm solving unequal circles packing problems. In experiments, the quasi-human seniority-order algorithm is applied to generate better initial configurations for quasi-physical elasticity methods to solve the unequal circles packing problems, and the experimental results show that the proposed quasi-human seniority-order algorithm can greatly improve the speed of solving the problem.     

Packing cylinders on a cylinder with contact constraints

The problem of cylinder packing is investigated. The specific problem is to determine the maximum number of congruent cylinders that can be packed around a core cylinder of arbitrary dimensions. The constraint is that their circular face must keep in contact with the core cylinder and there may be no overlapping. Only right circular cylinders are considered. Mathematically, a lower and upper bound is determined. A quantitative result is also found using a modified genetic algorithm. The algorithm was found to reproduce the published results for the top and bottom circular faces of the core which reduces to the problem of packing congruent circles within a circle. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Historical Overview of the Kepler Conjecture

This paper is the first in a series of six papers devoted to the proof of the Kepler conjecture, which asserts that no packing of congruent balls in three dimensions has density greater than the face-centered cubic packing. After some preliminary comments about the face-centered cubic and hexagonal close packings, the history of the Kepler problem is described, including a discussion of various published bounds on the density of sphere packings. There is also a general historical discussion of various proof strategies that have been tried with this problem.     

Interval methods for verifying structural optimality of circle packing configurations in the unit square

The paper is dealing with the problem of finding the densest packings of equal circles in the unit square. Recently, a global optimization method based exclusively on interval arithmetic calculations has been designed for this problem. With this method it became possible to solve the previously open problems of packing 28, 29, and 30 circles in the numerical sense: tight guaranteed enclosures were given for all the optimal solutions and for the optimum value. The present paper completes the optimality proofs for these cases by determining all the optimal solutions in the geometric sense. Namely, it is proved that the currently best-known packing structures result in optimal packings, and moreover, apart from symmetric configurations and the movement of well-identified free circles, these are the only optimal packings. The required statements are verified with mathematical rigor using interval arithmetic tools.     

The Densest Packing of 19 Congruent Circles in a Circle

Dense packings of n congruent circles in a circle were given by Kravitz in 1967 for n = 2,..., 16. In 1969 Pirl found the optimal packings for n 10, he also conjectured the dense configurations for 11 n 19. In 1994, Melissen provided a proof for n = 11. In this paper we exhibit the densest packing of 19 congruent circles in a circle with the help of a technique developed by Bateman and Erdös.     

Packing up to 50 Equal Circles in a Square

The problem of maximizing the radius of n equal circles that can be packed into a given square is a well-known geometrical problem. An equivalent problem is to find the largest distance d, such that n points can be placed into the square with all mutual distances at least d. Recently, all optimal packings of at most 20 circles in a square were exactly determined. In this paper, computational methods to find good packings of more than 20 circles are discussed. The best packings found with up to 50 circles are displayed. A new packing of 49 circles settles the proof that when n is a square number, the best packing is the square lattice exactly when n≤ 36. Received April 24, 1995, and in revised form June 14, 1995.     

Packing congruent hyperspheres into a hypersphere

The paper considers a problem of packing the maximal number of congruent nD hyperspheres of given radius into a larger nD hypersphere of given radius where n = 2, 3, . . . , 24. Solving the problem is reduced to solving a sequence of packing subproblems provided that radii of hyperspheres are variable. Mathematical models of the subproblems are constructed. Characteristics of the mathematical models are investigated. On the ground of the characteristics we offer a solution approach. For n ≤ 3 starting points are generated either in accordance with the lattice packing of circles and spheres or in a random way. For n > 3 starting points are generated in a random way. A procedure of perturbation of lattice packings is applied to improve convergence. We use the Zoutendijk feasible direction method to search for local maxima of the subproblems. To compute an approximation to a global maximum of the problem we realize a non-exhaustive search of local maxima. Our results are compared with the benchmark results for n = 2. A number of numerical results for 2 ≤ n ≤ 24 are given.     

Producing dense packings of cubes

In this paper we consider the problem of packing a set of d-dimensional congruent cubes into a sphere of smallest radius. We describe and investigate an approach based on a function ψ called the maximal inflation function. In the three-dimensional case, we localize the contact between two inflated cubes and we thus improve the efficiency of calculating ψ. This approach and a stochastic algorithm are used to find dense packings of cubes in 3 dimensions up to n=20. For example, we obtain a packing of eight cubes that improves on the cubic lattice packing.     

A skyline heuristic for the 2D rectangular packing and strip packing problems

In this paper, we propose a greedy heuristic for the 2D rectangular packing problem (2DRP) that represents packings using a skyline; the use of this heuristic in a simple tabu search approach outperforms the best existing approach for the 2DRP on benchmark test cases. We then make use of this 2DRP approach as a subroutine in an “iterative doubling” binary search on the height of the packing to solve the 2D rectangular strip packing problem (2DSP). This approach outperforms all existing approaches on standard benchmark test cases for the 2DSP.