车间人员配置规划研究

本文针对兰州交通大学机械工程实践中心的教学任务、设备数量及容纳量,建立了金工实习指导人员的最优人员配置数学模型,并对模型进行了求解,得到了各工种的人员配置及不同实习时间下的人员调度表,该模型的计算结果与实际运行情况基本相符,对实际人员分配和调度具有指导意义。     

金工实习指导人员配置规划研究

针对大学机械工程实践中心的教学任务、设备数量及容纳量,建立了金工实习指导人员的最优人员配置数学模型,并对模型进行了求解,得到了各工种的人员配置及不同实习时间下的人员调度表,该模型的计算结果与实际运行情况基本相符,对实际人员分配和调度具有指导意义.     

基于组合赋权的装配线作业人员优化配置

文章以装配线多技能作业人员为研究对象,首先依据作业人员在装配工位完成相应生产任务的历史数据,通过计算质量、时间和数量3个方面的评价因子,使用组合赋权评价方法确定各因子的动态权重,计算人员胜任力指数;基于胜任力指数实时矩阵,构建了以整条装配线上人员胜任力指数总和最大为目标的人员优化配置模型,并采用启发式求解算法进行优化求解,通过实例验证了所述方法的可行性和实用性。     

工人技能部分柔性的流水车间调度问题

本文针对工人技能部分柔性的流水车间调度问题(FSPPSF),建立了目标为最小化完工时间的FSPPSF模型,利用分支定界法求解给定技能矩阵的FSPPSF(S).针对不同工人技能的柔性度进行计算实验,得出柔性度和相对运行效益率的关系,为决策者如何制定培训新工人方案提供重要依据.     

基于蚁群算法的虚拟企业生产任务调度优化研究

描述了虚拟企业生产任务调度的层次框架,该调度框架包括虚拟企业全局调度和合作伙伴局部调度两个层次.针对虚拟企业调度层的优化问题,综合考虑虚拟企业生产任务的时序逻辑关系、作业时间和生产任务集等影响因素,建立了以任务总作业时间最小化为目标的数学模型,并基于蚁群算法对上述优化模型进行了求解.应用实例与算法比较验证了优化模型与求解算法的有效性.     

混合工作日历下柔性作业车间多目标调度优化方法

针对混合工作日历下柔性作业车间多目标调度的困难,提出了一种基于NSGA Ⅱ的多目标优化方法。基于设备工作日历的时间推算机制,设计了时间推算函数;采用"分段"方式对工序和设备进行编码;采用"分段"交叉和变异方式进行交叉和变异操作;采用"遗传算子改进策略"保证交叉、变异操作后子代个体的可行性,以减少计算量;采用基于设备工作日历的时间推算函数于解码操作中,用于准确计算工序的起止时刻,以保证调度方案的可行性;采用2种技术于解码操作中,用于缩短生产周期,以提高调度方案的质量:一是将工序时间细分为设备调整时间和加工时间,使下道工序的设备可提前调整,二是安排工序时采用正向可插入式挤压调度方法。结果表明:提出的方法能在可接受的计算时间内得到有效的混合工作日历下柔性作业车间多目标调度Pareto解集供调度人员决策。     

数控加工中心任务与刀具集成调度模型及改进自适应遗传算法

为解决数控加工中心任务与刀具的集成优化调度问题,以生产总成本最小为优化目标,建立了考虑任务交货期和工步并行加工的数控加工中心任务与刀具集成调度模型,产生面向数控加工中心任务与刀具的协同优化调度结果。为实现对该调度模型的优化求解,提出了一种改进自适应遗传算法,设计了合理的编码方式和自适应进化操作,并通过任务-刀具关联矩阵保证搜索过程中解的可行性,从而显著提高了算法的收敛性能和求解效率。算例结果表明,该模型能够最大限度地降低加工成本和拖期率,同时算法的收敛速度和稳定性也得到了明显提高,大大降低了问题求解的迭代次数。     

基于多智能体技术的虚拟企业任务调度

采用多智能体技术构建了虚拟企业任务调度运行模型,该模型包括管理智能体、任务智能体、资源智能体等.针对模型中的调度优化问题,以资源智能体所承担的生产任务为对象,综合考虑资源智能体自身已确定的生产任务、完成虚拟企业生产任务所需作业时间及转运时间等因素,建立了以制造时间最小化为目标的优化调度模型,并给出了粒子群优化求解算法.最后以工业机械手制造实例说明了任务调度模型及求解算法的有效性.     

基于遗传算法的维修服务人员选派问题研究

企业接到客户的维修请求后,首先要对同一时间段的维修任务进行汇总,生成服务任务表,然后选择合适的维修人员去执行任务,以满足客户需求。但每个维修人员所拥有的技能不同,维修能力存在差异。因此,如何高效的选派维修人员进行维修是企业需要解决的关键问题之一。针对维修服务人员的智能选派问题,建立了任务-团队技能不匹配度模型,并采用一种基于遗传算法的智能选派方法进行求解,最后的仿真实验表明了模型和算法的有效性。     

基于改进遗传算法的多目标柔性作业车间节能调度问题

为降低柔性作业车间调度中的能耗,在分析柔性作业车间调度问题研究现状和不足的基础上,以完工时间、机器能耗和工人操作机器的舒适度作为柔性作业车间调度问题的多目标函数。利用改进遗传算法对其进行优化研究。算法中采用权重法对种群进行初始化处理以获得较好的解;采用快速解码获得需要的总适应度值;利用改进的交叉及变异操作,避免非法解的产生;利用精英保留策略保留优秀基因,提高求解效率和求解质量。通过对具体案例仿真验证算法的有效性。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.