Assessing the Error Probability of the Model Selection Test

The asymptotic error probability of Linhart's model selection test isevaluated, and compared with the nominal significance level. We examine thecase where the expected discrepancies of the candidate models from the truemodel are asymptotically equal. The local alternatives method is employed inthe limiting operation of the asymptotic evaluation. Although the errorprobability under the null hypothesis is actually shown to be equal to orless than the level for most situations, intolerable violations of the errorcontrol are observed for nested models: It is often erroneously concludedthat the smaller model is significantly better than the larger model. Toprevent this violation, a modification of Linhart's test statistic isproposed. The effectiveness of the proposed test is confirmed throughtheoretical analysis and numerical simulations.     

Intelligent Control Mechanism of Part Picking Operations of Automated Warehouse

This paper studies the part picking operations of a ut omated warehouse. It assumed the demand of picking orders of automated warehouse are dynamic generated. Once the picking orders of certain period of time are kn own, it is necessary to decide an efficient order picking sequence and routing t o minimize the total travel distance to complete those orders. Assumed there are n i items to be picked in order O i. Each item in the picking ord er is located in different locations in the warehouse. Since i...     

MIS新思维软件工具的设计与实现

本文针对目前陈旧的管理软件的设计方法提出了一种新的观点,同时探讨了为实现这种新观点而研制的软件工具的设计方法和实现技巧。     

会计职业道德建设浅议

分析了我国会计职业道德的现状,从会计职业道德具有相对稳定性、广泛的社会性等方面论述了会计职业道德的含义,并提出了会计职业道德体系建设的设想。     

基于微观渗流机理的宏观油藏数值模拟研究

处于高含水开发期油藏的剩余油分布主要受流体性质和岩石孔隙结构的影响，而经典数值模拟并没有考虑微观孔喉特征的影响。为此建立了描述微观孔喉特征的地层孔隙网络模型，并对构成网络的基本连线单元进行改进，使网络模型能更细致地描述油水分布特征和水驱油微观机理。利用逾渗理论计算了基于微观渗流机理的相对渗透率曲线，并将其应用到经典数值模拟计算中，实现了微观渗流机理与宏观数值模拟计算的结合。实例分析表明，利用该数值模拟计算方法得到的基于微观特征的剩余油分布更符合地下实际流体分布，其结果可为调剖堵水、化学驱提供技术参数。     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Information recovery from black holes

We argue that if black hole entropy arises from a finite number of underlying quantum states, then any particular such state can be identified from infinity. The finite density of states implies a discrete energy spectrum, and, in general, such spectra are non-degenerate except as determined by symmetries. Therefore, knowledge of the precise energy, and of other commuting conserved charges, determines the quantum state. In a gravitating theory, all conserved charges including the energy are given by boundary terms that can be measured at infinity. Thus, within any theory of quantum gravity, no information can be lost in black holes with a finite number of states. However, identifying the state of a black hole from infinity requires measurements with Planck scale precision. Hence observers with insufficient resolution will experience information loss. First Award in the 2006 Essay Competition of the Gravity Research Foundation.