寻找“丢失”的光驱

在利用Excel进行各种数据排序时，我们首先接触到的是Excel的菜单栏和工具栏中排序功能，这种方法的优点是操作简便，容易掌握，但这种方法有很多局限，排序后原来的数据顺序被改变，且不能对不连续的区域的数据进行排序，所以对一些有特殊要求的排序，用Rank函数来完成。     

采区保护煤柱的调整对村庄的影响分析

为了准确地确定工作测点在地表移动开始前的空间位置,在联测之后,地表开始移动之前,进行全面观测。内容包括:测定各测点的平面位置和工程,各测点间的距离,各测点偏离观测方向的距离,记录地表原有的破坏状况,并作出素描。文章对采区保护煤柱的调整对村庄的影响进行了分析。     

路堑边坡爆破施工对近临高压输电铁塔影响的数值模拟研究

借助于ANSYS/LS-DYNA非线性有限元分析软件,建立了贵州省三施高速公路近临高压输电铁塔路堑边坡爆破开挖的三维数值模型,模拟了路堑边坡爆破施工下输电铁塔的动力响应,并与现场实际采集的数据结果进行对比分析,结果表明输电铁塔塔基测点的三向爆破峰值振动速度随着爆源水平距离增大而减小的趋势.随着爆破位置、爆破深度、爆破距离的变化,塔基各测点速度随时间的变化趋势差异较大.通个塔基测点峰值速度与规范允许值相比可知路堑边坡爆破施工对高压输电铁塔的影响是在安全可控的范围内.     

路堑边坡爆破施工对近临高压输电铁塔影响的数值模拟研究

借助于ANSYS/LS-DYNA非线性有限元分析软件,建立了贵州省三施高速公路近临高压输电铁塔路堑边坡爆破开挖的三维数值模型,模拟了路堑边坡爆破施工下输电铁塔的动力响应,并与现场实际采集的数据结果进行对比分析,结果表明输电铁塔塔基测点的三向爆破峰值振动速度随着爆源水平距离增大而减小的趋势.随着爆破位置、爆破深度、爆破距离的变化,塔基各测点速度随时间的变化趋势差异较大.通个塔基测点峰值速度与规范允许值相比可知路堑边坡爆破施工对高压输电铁塔的影响是在安全可控的范围内.     

基于AutoCAD二次开发公路横断面数据解算的探讨

在公路工程中横断面测量贯通整个工程始终，从前期勘测到竣工验收期间需要进行多次测量，数据处理量大。在工作中全站仪外业采集的测点数据通常采用大地坐标系，而横断面的绘制采用的是相对坐标系，基于CAD平台进行二次开发探讨通过从数字图中拾取测点解算出对横断面数据至相桩号并输出到记事本中方便批量绘图。     

面向“百度”搜索引擎优化算法应用规律分析

面向主流搜索引擎"百度",针对搜索引擎的经典排序算法,分析得出影响主流搜索引擎排序可能的相关因素:网页的关键词频率、关键词密度、Alexa排名、外部链接数量、PR值、出站链接数量。使用站长工具收集百度中靠前的网页的可能相关因素的数据,通过筛选过滤后,利用统计图来观察规律,再根据可能的规律使用相应方法进行检验和拟合,通过研究发现在百度靠前的搜索结果中,网页的关键字密度和PageRank具有规律性,这些结果为各类企业规划电子商务网站时,进行搜索引擎优化提供参考依据。     

生产企业合同交货期确定及合同排序

讨论了企业订货合同管理中面临的决策问题以及解决途径。应用机器工件调度理论求解包括提前和延期惩罚的合同排序问题，给出了启发式排序规则和求解搜索策略。采用了3种启发式方法：1）接排序规则排序；2）对初始排序施加成对交换技术改善；3）射束搜索技术。实验结果表明，第3种求解质量具有明显优势，能得到令人满意的结果。     

N106白车身测点优化及其应用

对N106白车身测点进行优化,合理减少测点数量,提高测量设备的利用率和抽检频率,并对测量数据进行统计,以过程控制图和CII指数的形式暴露问题,加强数据对质量问题的反馈,提高数据资源的利用率,更有效地指导车间质量改进和过程能力控制。     

N106自车身测点优化及其应用

对N106白车身测点进行优化,合理减少测点数量,提高测量设备的利用率和抽检频率,并对测量数据进行统计,以过程控制图和CII指数的形式暴露问题,加强数据对质量问题的反馈,提高数据资源的利用率,更有效地指导车间质量改进和过程能力控制。     

失业率预测研究--基于网络搜索数据及改进的逐步回归模型

无论是从社会管理还是从经济发展的角度来考虑，失业均已成为目前各国十分关注的重点问题之一，学者们也一直在通过各种方法来预测失业率。近年来，随着网络的发展和搜索引擎的普及应用，学者们发展出一种利用网络搜索数据来观察和研究经济及社会问题的方法。随着这一方法的有效性被证明之后，它也被引入到失业率预测的研究领域中。文章利用Google推荐的关键词搜索数据，采用改进的逐步回归方法分层建立了三个模型预测失业率，并进行因果关系检验及有效性检验。实验结果表明，三个模型的拟合优度分别达到0.930、0.935、0.936，三期预测值的MAPE分别为1.20%、0.89%、0.57%。文章认为，这种方法能有效的处理网络搜索数据并进行相关的社会问题研究和经济问题的预测。     

A binary tree algorithm on change points detection

In this paper, an algorithm using binary trees is developed to detect the change points of a data set in which the data are assumed to be normally distributed. Usual BIC-type criteria are considered in the binary searching procedures when the number of change points is unknown. The algorithm is also extended to the switching regression models. Simulation study confirms that our algorithm is efficient compared with the ML-method. A real data example also verifies that the proposed procedure is appropriate.     

The method of endogenous gridpoints in theory and practice

The method of endogenous gridpoints (ENDG) significantly speeds up the solution to dynamic stochastic optimization problems with continuous state and control variables by avoiding repeated computations of expected outcomes while searching for optimal policy functions. I provide an interpolation technique for non-rectilinear grids that allow ENDG to be used in n-dimensional problems in an intuitive and computationally efficient way: the acceleration of ENDG with non-linear grid interpolation is nearly constant in the density of the grid. Further, ENDG has only been shown by example and has never been formally characterized. Using a theoretical framework for dynamic stochastic optimization problems, I formalize the method of endogenous gridpoints and present conditions for the class of models for which it can be used.     

带时间窗车辆路径问题的混合量子粒子群算法

针对带时间窗的车辆路径问题,采用混合量子粒子群算法对该问题进行了求解,该算法将量子粒子群算法与模拟退火算法相结合．充分发挥量子粒子群算法全局寻优能力强以及模拟退火算法局部寻优能力强的特点,从而能有效地避免早熟。仿真结果表明,该算法不仅收敛速度快,而且还具有较高的求解质量。     

A method for generating uniformly scattered points on the <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-norm unit sphere and its applications

Tashiro (Ann Inst Stat Math 29:295–300, 1977) studied methods for generating unform points on the surface of the regular unit sphere. The L _p -norm unit sphere is a generalization of the regular unit sphere. In this paper we propose a method associated with an algorithm for generating uniformly scattered points on the L _p -norm unit sphere and discuss its applications in statistical simulation, representative points of a wide class of multivariate probability distributions and optimization problems. Some examples are illustrated for these applications. This research was supported by The University of Hong Kong Research Grant and a University of New Haven 2005 and 2006 Summer Faculty Fellowships.     

改进菱形运动估计算法研究与实现

针对目前菱形运动估计搜索算法存在的问题,对不同宏块采用相同的搜索策略,而不能根据视频序列的特性,迅速缩小搜索的范围,造成搜索冗余。文章分析了运动矢量的分布相关性,提出了基于起点预测的改进菱形运动估计算法。该算法结合提前中止准则,能改进菱形算法的搜索流程。仿真结果表明,该算法在降低计算复杂度的同时,还可有效地保证搜索精度。     

A dual-clustering algorithm for a robust medical grid partition problem considering patient referral

The medical grid including hospitals at all levels is a new hierarchical diagnosis and treatment system. It is assumed to provide health services for residents in a certain area, allowing free referral of patients, so as to effectively utilize medical resources. Therefore, from the perspective of the government, the key issue is how to divide the medical grid in a robust and balanced manner. In this paper, various deterministic factors, such as hospital level, location and department, as well as uncertain factors, including patient distribution or population density, are considered in decision-making. To solve this problem, a dual-clustering algorithm based on K-means and K-medoids (DCKK) is developed with local search methods to minimize the average patient waiting and travelling time. The experimental results show that DCKK algorithm can generate better and more robust grid partition solutions than the existing mainstream algorithms in different scenarios. In addition, the rules between the number of medical grids and the number of patients, as well as the hospital sharing between medical grids, are also studied. Finally, a real medical grid partition case of Ji'nan, China, with forty hospitals in four urban areas, is studied, and five medical grids are recommended.     

基于改进遗传算法的TSP问题优化研究

旅行商问题（TSP问题）已经被证明属于NP完全问题。遗传算法是一种模拟自然界中生物的进化机制的优化策略．是一种基于群体、隐并行搜索策略，是求解TSP问题效率相当高的一种算法。因此．本文提出使用改进的遗传算法．即用个体数量控制选择策略以保证群体的多样性，用顺序交叉算子和部分路径翻转变异算子来提高算法的收敛速度．较好地解决了群体的多样性和收敛速度的矛盾。算法的分析和测试表明．该改进算法的是有效的。     

基于模拟退火算法的TSP问题研究

针对遗传算法求解TSP问题过程中出现的早熟现象,本文将模拟退火算法应用到TSP问题求解中,并进行了仿真实验。结果表明,该算法与遗传算法相比,可以更好地在全局范围内进行搜索。     

Shake-and-bake algorithms for the identification of nonredundant linear inequalities*

Two probabilistic shake-and-bake algorithms are presented to detect nonredundant constraints in a full dimensional system of linear inequalities. The algorithms proceed by generating a random sequence of points on the boundary of a polyhedron, and by searching for a nonredundant constraint in the direction of a random vector from each point in the sequence. The limiting distribution of the sequence of points generated by the algorithms is proven to be uniform on the boundary of the polyhedron.     

BUYING LOCAL IS NOT NECESSARILY GREEN

Environmentalists are urging consumers to stop buying imports that needed to be transported long distances. However, the domestic production of the same goods would typically involve a much greater use of resources and therefore be counter-productive.