共查询到20条相似文献,搜索用时 78 毫秒
1.
本文对钻井布局问题的研究 ,是从全局搜索入手 ,逐步深入讨论了各种算法的有效性、适用性和复杂性 ,得到不同条件下求最多可利用旧井数的较好算法 .对问题 1 ,我们给出了全局搜索模型、局部精化模型与图论模型 ,讨论了各种算法的可行性和复杂度 .得到的答案为 :最多可使用 4口旧井 ,井号为 2 ,4 ,5,1 0 .对问题 2 ,我们给出了全局搜索、局部精化和旋转矢量等模型 ,并对局部精化模型给出了理论证明 ,答案为 :最多可使用 6口旧井 ,井号为 1 ,6,7,8,9,1 1 ,此时的网格逆时针旋转 4 4.37度 ,网格原点坐标为 (0 .4 7,0 .62 ) .对问题 3,给出判断 n口井是否均可利用的几个充分条件、必要条件和充要条件及其有效算法 相似文献
2.
3.
本对钻井布局问题的研究,首先给出图论模型对问题1得出最多可利用4口旧井,井号为2、4、5、10。利用矩形对角线法对问题2得出最多可利用6口旧井,井号为1、6、7、8、9、11。同时利用矩形对角线法给出判定这些井均可利用的条件和算法。 相似文献
4.
5.
最佳粮库地址的选择 总被引:3,自引:2,他引:1
管理部门通常要选择适当的地方建造粮库 ,所需服务范围已知 ,各部门运输量给定 .需为他们选择合适的地方 ,使总运费最少 .某乡的九个村 (A,B,C,… ,H,I)如图 1 ,各村距离给出 ,并标明它们各自上缴公粮数 .管理部门希望在村内或道路上建立一个粮库 ,最大限度地减少运输费用 .问题的解法有几种方案 ,对于本题来说 ,穷举搜索法是可行的 .另外 ,我们提出一种分析求解法 ,可找到优化解 .它利用图论的基础知识先求出图 1的各顶点间的最小路径 ,再进一步求出图的绝对中心 (即粮库的地址 ) ,其中的有关计算利用了 C++语言程序 .在此基础上 ,还可对问题的参数作更精细的分析 .概括地说 ,穷举搜索法对于简单的区域是行之有效的 .但对于更加一般化的问题 ,利用计算机可快捷准确地得到答案 .通过建立模型 ,我们得到下面两个结论 :(1 )我们找到最优解是 E点 ,其总运费为 1 2 775元 .(2 )模型具有广泛性 ,对于更一般的区域 ,可利用计算机总可以求出最优解 . 相似文献
6.
《中学生数学》2004,(14)
哑二生堡l1.原方程变形为 虿1 z 2===4, .·. j一4.2.①当z “2);②一n≤z≤2时,方程化为 z n 2一z===2a (*)只有方程(*)与z无关,且n一2为定值,.‘. 方程的解为一2≤z≤2,a一2;③当z一2>0,即z>2时,方程为 1 z一1 ÷a且z>2,.·. 方程的解为z一1 虿1口(口>2).3.方案一:AB=2:2(n--b),a一6可以做出; 方案二:AB一6(n一6)一6; 方案三:AB=7(n一6)一口; 方案四:‘.。 6a一7b=2, .’. 可将6—4垂直平分即得; 方案五:作6口,再减去7b; 方案六:作2口一2b; 方案七:作36—2n;1.配… 相似文献
7.
林甲富 《数学的实践与认识》1999,29(3)
本文用初等的方法研究(+∞∑n-1)1/n2m(m∈N)的求和问题. 这个问题最先由Euler[8]解决.文献[1][6]给出了另两种求解方法.特别地,对于m=1的情形,即(+∞∑n-1)1/n2=∏2/6,已有许多不同的证明方法,可见文献[2][3][4][5]以及那里的参考文献.本文的想法,主要受文献[5][6]的启发而来的. 相似文献
8.
9.
10.
本文首先给出了Z4-线性码C4(m,D)的一个大的自同构子群.然后,利用该自同构子群得到了C4(m,6)当m为奇数时的Lee重量分布的一个约化公式.最后,利用该约化公式及计算机搜索得到C4(7,6)的Lee重量分布.C4(7,6)经Gray映射后得的二元非线性码与最优二元线性码[256,37,92]有相同的参数. 相似文献
11.
《Communications in Nonlinear Science & Numerical Simulation》2010,15(11):3647-3732
A 135-sector inventory and embodiment analysis for carbon emissions and resources use by Chinese economy 2007 is presented in this paper by an ecological input–output modeling based on the physical entry scheme. Included emissions and resources belong to six categories as: (1) greenhouse gas (GHG) in terms of CO2, CH4, and N2O; (2) energy in terms of coal, crude oil, natural gas, hydropower, nuclear power, and firewood; (3) water in terms of freshwater; (4) exergy in terms of coal, crude oil, natural gas, grain, bean, tuber, cotton, peanut, rapeseed, sesame, jute, sugarcane, sugar beet, tobacco, silkworm feed, tea, fruits, vegetables, wood, bamboo, pulp, meat, egg, milk, wool, aquatic products, iron ore, copper ore, bauxite, lead ore, zinc ore, pyrite, phosphorite, gypsum, cement, nuclear fuel, and hydropower; (5) and (6) solar and cosmic emergies in terms of sunlight, wind power, deep earth heat, chemical power of rain, geopotential power of rain, chemical power of stream, geopotential power of stream, wave power, geothermal power, tide power, topsoil loss, coal, crude oil, natural gas, ferrous metal ore, non-ferrous metal ore, non-metal ore, cement, and nuclear fuel. Accounted based on the embodied intensities are carbon emissions and resources use embodied in the final use as rural consumption, urban consumption, government consumption, gross fixed capital formation, change in inventories, and export, as well as in the international trade balance. The resulted database is basic to environmental account of carbon emissions and resources use at various levels. 相似文献
12.
Luis B. Morales 《组合设计杂志》2000,8(4):261-273
In this paper we formulate the construction of difference families as a combinatorial optimization problem. A tabu search algorithm is used to find an optimal solution to the optimization problem for various instances of difference families. In particular, we construct six new difference families which lead to an equal number of new balanced incomplete block designs with parameters: (49, 98, 18, 9, 3), (61, 122, 20, 10, 3), (46, 92, 20, 10, 4), (45, 90, 22, 11, 5), (85, 255, 24, 8, 2) and (34, 85, 30, 12, 10). © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 261–273, 2000 相似文献
13.
14.
熊良鹏 《应用泛函分析学报》2014,(2):138-145
研究了在单位开圆盘内单叶解析且规范化的复系数函数族gφ1,φ2,φ3,φ4(m1,m2,m3,m4;λ)的一些性质,给出了其子族gφ1,φ2,φ3,φ4(m1,m2,m3,m4;λ)在内闭一致收敛拓扑下的极值点和支撑点,并讨论解决了gφ1,φ2,φ3,φ4(m1,m2,m3,m4;λ)与凸函数相关的一些半径问题,推广了近来的一些研究结果. 相似文献
15.
16.
17.
Lebesgue proved in 1940 that each 3-polytope with minimum degree 5 contains a 5-vertex for which the set of degrees of its neighbors is majorized by one of the following sequences(6, 6, 7, 7, 7), (6, 6, 6, 7, 9), (6, 6, 6, 6, 11)(5, 6, 7, 7, 8), (5, 6, 6, 7, 12), (5, 6, 6, 8, 10), (5, 6, 6, 6, 17)(5, 5, 7, 7, 13), (5, 5, 7, 8, 10), (5, 5, 6, 7, 27), (5, 5, 6, 6,∞), (5, 5, 6, 8, 15), (5, 5, 6, 9, 11)(5, 5, 5, 7, 41), (5, 5, 5, 8, 23), (5, 5, 5, 9, 17), (5, 5, 5, 10, 14), (5, 5, 5, 11, 13).We prove that each 3-polytope with minimum degree 5 without vertices of degree from 7 to 10 contains a 5-vertex whose set of degrees of its neighbors is majorized by one of the following sequences: (5, 6, 6, 5, ∞), (5, 6, 6, 6, 15), and (6, 6, 6, 6, 6), where all parameters are tight. 相似文献
18.
《Optimization》2012,61(5):695-705
Griffiths, D.F. (ed.):Numerical Analysis. Proceedings of the 10th Biennial Conference held at Dundee, Scotland, Jun 28-Juli 1, 1983. Lecture Notes in Mathematics. Vol. 1066. SpringerVerlag Berlin, Heidelberg, New York, Tokyo 1984, XI, 275 p. DM 33.50, ISBN 2-540-13344-5. Gross, D.; C.M. Harris:Fundamentals of Queueing Theory. 2. Ed. John Wiley & Sons Limited New York, Chichester, Brisbane, Toronto 1985, XII, 587 p., £ 43.95, ISBN0-471-89067-7. Miklosöko.; J.E.Kotov (eds.):Algorithms, Software and Hardware of Parallel Computers. Springer-Verlag Berlin, Heidelberg, New York, Tokyo 1984, 181 figs., 380 p., DM 89,-,ISBN 3-540-13657-6. Dolcetta, I.C.; W.H. Fleming; T.Zolezzr (eds.):Recent Mathematical Methods in Dynamic Programming. Proceedings Corti. Rome, Mar 26-28, 1984. Lecture Notes in Mathematics. Vol. 1119. Springer-Verlag Berlin, Heidelberg, New York, Tokyo 1985, VI, 202 S.DM 31,50, ISBN 3-540-15217-2. Demyanov, V.F.; D.Pallaschke (eds.):Nondifferentiable Optimization:Motivations and Applications. Proceedings, Sopron, Hungary 1984. Lecture Notes in Economics and Mathematical Systems. Vol. 255. Springer-Verlag Berlin, Heidelberg, New York, Tokyo 1985, VI, 349 S. Kiwiel, K.C.:Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics. VoL 1133. Springer-Verlag Berlin, Heidelberg, New York, Tokyo 1985, 'T1, 362 S., DM 51,50, ISBN 3-540-15642-9. Remmert, R.:Funktionentheorie. Vol. 1. Grundwisaen Mat.hematik. Vol. 5. Springer-Verlag Berlin, Heidelberg, New York, Tokyo 1984, 65 Abb., XIII, 324 S., DM 44,-, ISBN:3;540-12782-8. Walsh, G. R.:An Introduction to Linear Programming. 2. Ed. John Wiley & Sons Chichester, New York, Brisbane, Toronto, Singapore 1985, IX, 240 p., ISBN 0-471-90719-7. Törnig, W.;M. Kaspar:Numerische Ldsung von partiellen Differentialgleichungen der Technik. Mathematische Methoden in der Technik.. Bd.. 1. B. G. Teubner Stuttgart 1985, 181 S., DM 34,-, ISBN 3-519-02613-9. Neunzert, H.(ed.):Proceedings of the Conference JIathematics in Industry, Oct 24 - 28, 1983 Oberwolfach. B. G. Teubner Stuttgart 1984, 287 S., 52,- DM, ISBN 3-519-02610-4. Lösch, M.:Fixpunkt-Schätzvertahren für Modelle mit rationaien Erwartungen.. Mathematical Systems in Economics:" Vol. 94. Verlagsgruppe Athenäum, Hain, Hanstein Königstein 1984; 312 S.,DM 68,-,ISBN 3-445-02387-5. Bultheel, A.; P.Dewilde (eds.):Rational Approximation in Systems Engineering. Birkhäuser Verlag Basel 1983, 244 pp., sFr. 72,-. ISBN 3-7643-3159-3. Harrison, J. M.:Brownian ])Iotion and Stochastic Flow Systems. John Wiley & Sons New York, Chichester, Brisbane 1985, XIX, 140 pp., 36.95 £ ISBN 471-81939-5. 相似文献
19.
C. Koukouvinos S. Kounias J. Seberry C. H. Yang J. Yang 《Designs, Codes and Cryptography》1994,4(3):327-340
Normal sequences of lengthsn=18, 19 are constructed. It is proved through an exhaustive search that normal sequences do not exist forn=17, 21, 22, 23. Marc Gysin has shown that normal sequences do not exist forn=24. So the first unsettled case isn=27.Base sequences of lengths 2n–1, 2n–1,n,n are constructed for all decompositions of 6n–2 into four squares forn=2, 4, 6, ..., 20 and some base sequences forn=22, 24 are also given. So T-sequences (T-matrices) of length 71 are constructed here for the first time. This gives new Hadamard matrices of orders 213, 781, 1349, 1491, 1633, 2059, 2627, 2769, 3479, 3763, 4331, 4899, 5467, 5609, 5893, 6177, 6461, 6603, 6887, 7739, 8023, 8591, 9159, 9443, 9727, 9869. 相似文献