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.     

2.4GHz动态CMOS分频器的设计

对现阶段的主流高速CMOS分频器进行分析和比较,在此基础上设计一种采用TSPC(truesingle phase clock)和E-TSPC(extended TSPC)技术的前置双模分频器电路.该分频器大大提高了工作频率,采用0.6μm CMOS工艺参数进行仿真的结果表明,在5V电源电压下,最高频率达到3GHz,功耗仅为8mW.     

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

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

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

双波长稳频CO_2激光模糊控制系统的建模与优化

报导一种模糊逻辑控制系统的建模与优化方法。以此方法设计的模糊逻辑控制器，用于双波长稳频ＣＯ２激光器的控制得到令人满意的结果。     

Freelance 2000 DCS在轴流机上的应用

简要介绍了Freelance 2000 DCS的功能特点以及轴流机的控制要求.结合轴流机的控制特点，用Freelance 2000 DCS对原模拟电子系统进行改造，实现并改进了轴流机流量－静叶位置调节、防喘振控制、逻辑控制、状态监测、信息管理等功能。改造后的系统可靠性高、技术先进、信息管理功能强，其设计思想和方法均可供石化企业大型压缩机控制系统的设计和改造借鉴。     

一个用户接口管理系统

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

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

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

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