基于网络切片的网络效用最大化虚拟资源分配算法

为了实现网络资源的动态分配,提高网络资源利用率,满足用户业务多样性带来的切片网络差异需求,该文提出一种基于网络效用最大化的虚拟资源分配算法。该算法采用商业化模式将频谱资源作为收益载体,并对不同切片网络进行差异化定价。同时将计算资源和回程链路作为开销,还考虑了切片网络对计算资源和频谱资源的差异性需求,最后以最大化网络收益建立效用模型。并通过拉格朗日对偶分解设计了分布式迭代算法对效用模型进行求解。仿真结果表明,该算法提高了服务用户比例,并使得网络资源获得最大收益。     

一种新的程序变体测试方法

在对程序分片技术研究的基础上,提出一种新的片变体测试方法。通过实例说明,该方法能更有效地提高变体测试的准确性及测试效率。     

下向分层胶结充填采矿法在前河公司的应用

下向分层胶结充填采矿法是开采矿岩破碎、开采技术条件复杂的难采矿体最有效的采矿方法之一.针对前河金矿矿体破碎、形态复杂的开采技术条件,依据采矿方法选择原则和影响因素,详细介绍了下向分层胶结充填采矿法回采及充填工艺过程,推广应用取得了良好的经济效益和社会效益.     

激光测量点云的数据处理方法研究

激光测量技术具有高分辨率、快速、非接触和数字化的特点,其应用日益广泛。基于激光测量的散乱点云,研究测量点云的数据处理方法。在分析通常的数据处理流程与方法的基础上,重点研究了如何应用数据的虚拟切割技术和测量点云的虚拟投影技术。点云虚拟切割技术主要包括径向/轴向切割技术、柱面切割技术与指定切割半径处的轴向截面切割技术。点云虚拟投影技术主要包括规则特征投影技术和轴向旋转投影技术。基于点云的虚拟投影,阐述了零件的参数提取策略。通过基于激光测量的零件数字化检测的实践表明所提出的点云数据处理方法与策略是行之有效的。     

诸暨金矿下向分层进路胶结充填法的应用

该采矿法的适用条件，脉内外天井采准方案的布置，采矿充填工艺；充填系统，充填体稳定性及其出现的问题；技术经济指标和经济效益。     

Experience with logical code analysis in software maintenance

Formal program specification and logical analysis are often used for program derivation and proofs of correctness. The basic tools include the logic of predicate calculus and Dijkstra's weakest precondition calculations. Recent work has shown that these tools are also very useful in the maintenance phase of the software life-cycle. This paper reports experience working with software maintenance teams to apply formal methods. Formal logical analysis is invaluable for isolating defects, determining code corrections, eliminating side-effects, and code re-engineering. Logical analysis works well in software maintenance because many defects can be isolated to small segments of code. These small segments can then be analyzed manually or with code analysis tools. The result is lowered software maintenance costs due to the benefits of defect prevention, reduction of code complexity metrics, productivity improvements, and better specifications and documentation. It would be beneficial to use logical code analysis in the earlier phases of the software life-cycle, such as quality assurance and inspection.     

Using Dynamic Information in the Interprocedural Static Slicing of Binary Executables

Although the slicing of programs written in a high-level language has been widely studied in the literature, relatively few papers have been published on the slicing of binary executable programs. The lack of existing solutions for the latter is really hard to understand since the application domain for slicing binaries is similar to that for slicing high-level languages. Furthermore, there are special applications of the slicing of programs without source code like source code recovery, code transformation and the detection of security critical code fragments. In this paper, in addition to describing the method of interprocedural static slicing of binaries, we discuss how the set of the possible targets of indirect call sites can be reduced by dynamically gathered information. Our evaluation of the slicing method shows that, if indirect function calls are extensively used, both the number of edges in the call graph and the size of the slices can be significantly reduced.Ákos Kiss obtained his M.Sc. in Computer Science from the University of Szeged in 2000. He is currently working on his Ph.D. thesis and his chosen field of research is the analysis and optimization of binary executables. He was the chief programmer of a code compaction project which sought to reduce ARM binaries. He is also interested in GCC and in open source developmentJudit Jász obtained her M.Sc. in Computer Science recently from the University of Szeged and is currently a Ph.D student. Her main research interest is adapting slicing methods—originally intended for high-level languages—to binary executables. She is also actively working on improving the GCC compiler.Tibor Gyimóthy is the head of the Software Engineering Department at the University of Szeged in Hungary. His research interests include program comprehension, slicing, reverse engineering and compiler optimization. He has published over 60 papers in these areas and was the leader of several software engineering R&D projects. He is the Program Co-Chair of the 21th International Conference on Software Maintenance, which will be held in Budapest, Hungary in 2005.     

基于STL数据模型动态拓扑重构的快速切片算法

分析了现有金属激光立体成形(MLSF)切片算法,提出了一种基于STL模型动态拓扑重构的快速切片算法.根据STL模型中三角面片的几何信息和切片厚度,通过建立分组矩阵,减小了三角面片遍历的次数;通过构建三角面片之间的局部动态拓扑关系,减小了切片平面与三角面片的求交计算次数;并根据切片过程中大部分三角面片的毗邻关系不发生改变这一事实,提出了动态拓扑重构的算法,减小了切片过程中三角面片毗邻关系的查找次数,从而提高了切片算法的整体效率.在该算法的基础上,使用Visual C 和OpenGL开发了金属激光立体成形软件系统.