Liner services network design and fleet deployment with empty container repositioning

Transportation demand of shipping container fluctuates due to the seasonality of international trade, thus, every 3–6 months, the liner company has to alter its current liner shipping service network, redeploy ships and design cargo routes with the objective of minimizing the total cost. To solve the problem, the paper presents a mixed integer linear program model. The proposed model incorporates several relevant constraints, such as weekly frequency, the transshipment of cargo between two or more service routes, and transport time. Extensive numerical experiments based on realistic date of Asia–Europe–Oceania shipping operations show that the proposed model can solve real-case problems efficiently by CPLEX. The results demonstrate that the model can reduce ship’s capacity consumption and raise ships’ capacity utilization.     

浅谈如何有效学习计算机软件知识

计算机软件知识的学习并不是完全线性的，而是不断循环往复、迭代的过程。本对如何深入、广泛、有效地学习计算机软件知识做出了一些探讨。     

一个用户接口管理系统

本文介绍了一个用户接口管理系统NUUIMS的设计和实现.重点叙述了该系统基于规范化目标用户接口模型的设计思想,系统组成及描述方法.文章也讨论了使用NUUIMS设计而成的用户接口的特点.     

渤中13-1油田井身结构优化研究

针对渤中 1 3- 1油田钻井过程中存在的主要问题 ,利用测井、地质、录井和钻井资料 ,对该油田的井身结构进行研究 ,设计出合理的井身结构 ,优化了套管程序 ,为进一步减少钻井过程中漏、喷、塌、卡等复杂情况的发生 ,提供了科学的理论依据     

C语言学习方法与实践的探讨

针对C语言程序设计课程本身的特点，分析学习过程中存在的问题，强调实践的必要性。结合一些学校课程改革和实践的经验．提出面向应用的，科学的学习内容、方法和模式。同时提高学习者的专业动手能力。     

Prolog逻辑程序的测试方法

Prolog逻辑程序设计语言具有不同于传统程序设计语言的特点.本文根据测试Prolog程序的实践,提出了一系列为Prolog程序生成测试用例的准则.按这些准则测试实际程序效果良好.这是在逻辑程序测试新领域迈出的一步.     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

二阶A型Cooper变换的增强型

对二阶Ａ型Ｃｏｏｐｅｒ变换进行增强，放宽可用性条件，并证明了其正确性，最后举例说明其应用。