浅谈程序设计中一题多解的教学方法

中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。     

Subdivision of work on construction projects

In order to control a project, construction management requires project information. This is obtained through accounting, estimating, cost management and scheduling functions which produce project reports. These reports are best obtained by subdividing the project into small parts. The ways in which each of these functions subdivides a project in order to produce its reports is discussed, together with a means of interrelating this information with a technique known as the work breakdown structure.     

锡矿山重复水利用的措施及效果

本介绍了锡矿山前闪星锑业有限责任公司如何加强对关键耗水工序的管理及提高重复水利用率的措施，并对所取得的效果进行了阐述，可供用水大户如何节水以借鉴。     

Simulation and optimization of tool-life in manufacturing centers

This paper presents the development of an optimization and a computer-simulation model to evaluate the process plans of a manufacturing center by analyzing the effect of tool failure on system performance. The GPSS/PC simulation program that is used in this study has been built with variables, functions and matrices so that many experiments could be conducted with the model. Sensitivity analysis is presented and the developed model has proven to be useful in determining optimum sequencing of parts for various operating policies.     

人支气管上皮靶细胞形态学参数的测量

支气管上皮靶细胞形态学参数对计算受氡子体照射的支气管的剂量是很重要的。本文介绍利用奥尔新兰-PAS 染色的外科切除人肺组织切片,测量基底细胞粘液细胞和的胞核深度与数目。结果表明,叶、段和小支气管的粘液细胞核深度分别为相应节段基底细胞的61%、69%和73%;此三节段粘液细胞的数目分别为基底细胞的53%、29%和28%,平均为37%。     

土壤因子对植物缺铁失绿的影响

本文主要从土壤 pH ,重碳酸盐 ,和氮素形态等几方面综述了各种土壤因子对土壤缺铁失绿的影响 ,并提出了进一步加强研究的方向     

Public grid computing participation: An exploratory study of determinants

Using the Internet, “public” computing grids can be assembled using “volunteered” PCs. To achieve this, volunteers download and install a software application capable of sensing periods of low local processor activity. During such times, this program on the local PC downloads and processes a subset of the project's data. At the completion of processing, the results are uploaded to the project and the cycle repeats.     

Minimum spanning trees made easier via multi-objective optimization

Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms.