煤矸石堆积模型

本文就煤矿堆积煤矸石费用问题建立数学模型 ,就不同的征地方式 (建矿初期一次性征完 2 0年所需用地和分批征地方式 )和煤矸石堆数进行了分析讨论 ,得出结论 :在建矿初期一次性征完所需用地 ,且所有煤矸石全堆成一堆的方案是最优的 ,并就不同的出矸率计算出该最优方案的总费用 ,最后给出对不同的出矸率处理矸石的最低年度平均费用公式     

煤矸石堆积问题的征地费用模型

本文研究了煤矸石堆积问题的征地模型 .根据问题所给信息 ,建立了一定简化条件下求征地面积和运矸电费的模型 ,针对不同贷款限额 ,提出了最优征地计划     

煤矸石堆放的最低费用预测

本文主要研究如何对原地区煤矿堆积煤矸石制订出合理的年度征地方案 ,并对最低费用进行预测 .由于要考虑存贷款、地价上涨、煤矸石的产量以及电费计算等诸多因素的变化 ,人工计算的工作量巨大 ,而且短时间内不能完成 .因此 ,我们通过建立不同的数学模型利用计算机来解决这个复杂的问题 .本文最终从出矸率和自然安息角的各种不同值中 ,找出了对应费用最小的合理方案 ,并对原问题中未涉及到的《土地法》的因素进行了讨论     

煤矸石堆积经费问题的几点讨论

本文讨论了土地征用策略 ,分别在不考虑银行存、贷款利率和考虑银行存、贷款利率时的分堆情况 ,以及在考虑银行存、贷款利率时平均单位体积的矸石处理经费与安息角 ,出矸率的关系     

用图像提取近岸堆积冰特征参数的方法研究

为获取渤海近岸堆积冰特征参数,发展了集数码照相拍摄、GPS定位和全站仪测高为一体的确定近岸堆积冰特征参数调查技术.通过现场堆积冰外边缘线踏勘,堆积冰外边缘断面的等距离正面摄影和全站仪冰面起伏高程测量,获得堆积冰宽度、堆积冰边缘断面高度、堆积冰表面高度和起伏角度等几何特征参数.综合分析发现:堆积冰的最大外边缘线不超过0m等水深线;辽东湾堆积冰高度一般小于2m,最大2.8m;堆积断面起伏的平均切角22°;高潮位时沿岸堆积冰丘表面平缓,低潮位时相同冰丘表面陡峭.     

并罐式无钟炉顶装料行为的离散元模拟及实验研究

通过离散元模拟和物理实验相结合的方法研究了并罐式无钟炉顶装料过程中颗粒的流动行为.结果表明:DEM模拟能很好地再现实验结果;料罐内部颗粒间力的分布不均匀,强力链主要分布在料罐下部和斜墙附近;料罐内颗粒流动为偏斜式漏斗流,可分为准呆滞区、流动加速区、两侧墙壁附近的剪切层,料罐内颗粒流动模式影响着颗粒的排放顺序,并进一步影响颗粒的下落轨迹及其在炉内的分布;颗粒流动轨迹受料罐出口闸门开度的影响,为保证稳定布料,应将闸门开度控制在合理的范围内;颗粒堆积过程中,堆尖位置随着料流落点位置而变化,堆尖半径大于落点半径.     

麦粒分堆问题的两种解法

问题 1　一堆麦子有ｎ (ｎ≥ 2 )个麦粒 ,把它任意分成两堆 ,记下这两堆麦粒数的乘数 .在以下的过程中 ,只要某堆麦子的麦粒数大于 1,就把这堆麦子分成两堆 ,并记下这两堆麦子的麦粒数的乘积 ,直至每堆麦子只有 1粒为止 .试求上述所有乘积之和 .解法 1　设所求乘积之和是ａｎ,我们首先用不完全归纳法探求规律 .往常 ,我们都是对ｎ的一些特殊值进行探索和归纳 ,而现在我们换一个角度 ,对麦子的分堆方式进行归纳 .本题隐含了“ａｎ 与分堆方式无关 ,只与ｎ有关” .据此 ,我们设计出如下便于计算的分堆方式 :ｎ1ｎ - 11ｎ- 2211由此算出ａｎ=…     

基于AP聚类和集合覆盖模型的农电营业区域电费缴纳点选址研究

农电营业区域的电费缴纳点选址研究是解决用电客户缴费难、购电难的关键课题之一,而当前大数据环境为电费缴纳点的合理布局提供了一个新的研究思路.首先通过运用基于数据点间"消息传递"的AP聚类算法从大量用电客户中筛选出候选电费缴纳选址点,然后采用集合覆盖模型对候选电费缴纳选址点进行再优化,得到最优选址点.并以赤峰市宁城县居民电力缴费记录与低压数据明细为例,为实现"村村都有缴费点"的建设目标,对较少用电客户的台区进行最优电费缴纳点选址研究.在此基础上,对最优电费缴纳点选址下的供电营业厅资源配置进行了分析,为供电公司在农电营业区域电费缴纳点的选址布局提供决策支持.     

可用归纳法来解的两则游戏趣题

题1甲乙两人玩下面的游戏：甲先将一堆以个石子分成三堆,每堆至少一个石子,且有一堆石子的数目大于另外两堆中每一堆石子的数目,然后,乙用同样的方法分石子数目最多的一堆．甲乙交换进行,谁分最后一次谁就获胜．对于形如n=a^b（正整数a、b〉1）的数,哪些使得乙有获胜策略？     

砂粒堆积床瞬态导热的理论分析

提出了简化的双相系统模型描述砂堆中的瞬态热传导过程,分析结果表明砂粒堆积床中的瞬态导热过程不能再用单相一维Fourier导热定律描述,同时也不存在C-V方程所描述的热波现象,分析与实验结果相符合.由于两相介质对瞬变温度(热源)响应速度不同,产生了相间的热交换,这种热交换对于每一相介质相当于源或汇,因此若用统一的当量导温系数描述多孔介质的瞬态导热,必然会出现偏离Fourier一维导热定律所描述的结果.     

Recognition of logically related regions based heap abstraction

This paper presents a novel set of algorithms for heap abstraction, identifying logically related regions of the heap. The targeted regions include objects that are part of the same component structure (recursive data structure). The result of the technique outlined in this paper has the form of a compact normal form (an abstract model) that boosts the efficiency of the static analysis via speeding its convergence. The result of heap abstraction, together with some properties of data structures, can be used to enable program optimizations like static deallocation, pool allocation, region-based garbage collection, and object co-location.More precisely, this paper proposes algorithms for abstracting heap components with the layout of a singly linked list, a binary tree, a cycle, and a directed acyclic graph. The termination and correctness of these algorithms are studied in the paper. Towards presenting the algorithms the paper also presents concrete and abstract models for heap representations.     

Bounds for min-max heaps

Very recently a new data structure, called a min-max heap, was presented for implementing the double-ended priority queue. A min-max heap onn keys is constructed inO(n) time; the minimum and maximum keys are found in constant time, and the operations of deleting the minimum, deleting the maximum and inserting a new key into the heap are performed inO(logn) time. In addition, the data structure can be stored implicitly, i.e. in an array ofn elements without using any additional pointers.In this paper, we present lower bound results on the number of comparisons required, in the worst case, for the operations i) to construct a min-max heap on a given set of keys; ii) to convert a min-max heap into a max-min heap; and iii) to merge two min-max heaps into one min-max heap. New upper bounds for the convert and merge operations are also derived. It is found that the main difference between traditional heaps and min-max heaps lies in the time needed to perform the merge operation. While traditional heaps can be merged efficiently, it is shown that min-max heaps are not sublinearly mergeable. Even the seemingly simple task of converting a min-max heap into a max-min heap cannot be performed in less than linear time.This research was supported by the Natural Science and Engineering Council of Canada under Grant No. A0392. (A preliminary version of this paper was presented at the 24th Annual Allerton Conference on Communication, Control and Computing.)     

齐次生产函数条件下长期成本函数的确定方法

文章研究一般性齐次生产函数条件下长期成本函数的确定方法，证明了长期成本函数是关于产量的幂函数，并指出了长期边际成本函数和长期平均成本函数之间的特殊关系。     

Improving worst-case behavior of heaps

It is possible to improve the worst-case behavior of operations on heaps, when counting number of comparisons between elements in the heap, by modifying the traditional binary heap. The improvement suggested is the use of a heap with scattered leaves. This method can be combined with the use of a ternary heap for even greater improvement.Some other improvements of worst-case behavior compared to standard algorithms are discussed at the end of the paper, where the gain of at least (N-2) comparisons when sortingN elements with HEAPSORT is of great interest in implementations. An algorithm for inserting a new element in a heap inO(log logn) comparisons between elements is mentioned.     

煤矸石堆积问题的解答及引出的思考

本文首先给出煤矸石堆积问题的参考答案 ,其次介绍学生答卷中由于对出矸率及征地方式的理解不同而导出的不同解答 ,最后从学生答卷中发现到的缺点和错误提出一些在数学建模教学中值得思考的问题和建议 .     

坑口电厂低碳经济发展系统动力学仿真研究

通过分析坑口电厂低碳经济系统的复杂结构特征和动态反馈机制,建立了坑口电厂低碳经济系统动力学模型,描述系统内部各要素之间的相互关系,并以平煤集团坑口电厂为例,对不同发展方案下的坑口电厂低碳经济系统进行仿真模拟.结果表明:科技投资、环保投资、能源利用率、能源消费结构等因素是影响坑口电厂低碳经济发展的关键因素;可以通过优化能源消费结构,提高煤矸石消耗比例;增加科技投资和环保投资,提高能源利用和转换效率,降低污染物和二氧化碳排放量,从而达到高效率、低能耗、低排放的低碳经济发展模式.     

带阀点效应水火联合调度问题的一种半定凸松弛求解法

水火联合调度问题是电力系统中一类复杂的优化问题。合理安排调度周期内的水火电出力,确定一个最优发电计划,可以带来巨大的经济效益。在实际系统中,汽轮机调汽阀开启时出现的拔丝现象会使机组耗量特性产生阀点效应。忽略阀点效应,在一定程度上降低求解的精度。本文考虑带阀点效应的水火联合调度问题。该问题非凸非光滑,且带有非线性约束,直接使用确定性全局优化方法求解是相当困难的。本文使用高效的半定规划求解此问题。首先用耗量特性函数的初始周期代替其余有限的周期,并对其进行二次拉格朗日插值拟合。再通过引进0-1变量,得到整个耗量特性函数的近似,进而把问题松弛为半定规划模型。最后,采用凸规划应用软件包CVX求解一个仿真算例,得到一个近似全局最优解。     

A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection

In road construction projects, earthwork is planned together with horizontal and vertical alignments. This study focuses on earthwork operations that basically include cutting the hills and filling the holes on the road path. The candidate borrow and waste sites can also be used to obtain or heap earth when the available cut and fill amounts are not balanced or operating these sites reduces the total earthwork cost. Total earthwork cost contains the transportation cost and the overall cost related to opening the candidate sites. The problem is to determine which borrow and waste sites to operate, and the earth flows between cut, fill, waste, and borrow sites such that the total cost is minimized. It is shown that the problem is a generalization of the well-known lot-sizing problem. A fixed charge network flow problem formulation is presented, and a polynomial time dynamic programming algorithm is developed for solving the problem.