弹性锥环的对数与承载能力的关系

本文通过对弹性链环联接的工作原理简单介绍，分别对单对环和多对环的受力进行分析，从而对多对环联接时环的对数对承载能力的影响进行探讨．理论计算表明，联接所能传递扭矩的增加量随弹性环对数的增加而减少，故弹性环对数不宜多于四对．     

基于EPL的分布式时钟同步方法

工业以太网协议Ethernet POWERLINK(EPL)分布式站点的时钟同步方法并不能在实时运行过程中保持很高的同步精度,无法满足特定环境下的控制要求。研究了工业以太网协议EPL的两种时钟同步机制,通过数理计算分析了时钟同步误差产生的原因,针对误差较大的缺点,提出了减小误差的方法。通过迭代计算消除了主从站同步报文往返的路径延迟,并设计基于现场可编程门阵列(FPGA)的集线器(Hub)用于EPL菊花链网络拓扑结构,有效地克服了时钟同步报文往返传输延时不一致的缺点,测试结果表明新方法明显优于协议自身的时钟同步方法,对于实现基于EPL的高精度分布式时钟同步网络具有重要意义。     

宁波建设上海航运中心南翼国际枢纽港的定位与模式选择

文章依据宁波港目前的发展条件提出将宁波建设成上海国际航运中心双枢纽港之一的发展目标，指出在宁波进行国际枢纽港建设中，所面临的国际国内港口竞争激烈、经济腹地狭小、集装箱吞吐量较小以及海关特殊监管区域对于港口发展拉动作用弱等问题。为解决这些问题，必须进行港口集团的上市、拓展宁波港的集疏运网络，加大力度进行港口的软环境建设，探索梅山保税港区发展的新思路。     

Coupling protein complex analysis to peptide based proteomics

Proteolysis is a central component of most proteomics methods. Unfortunately much of the information relating to the structural diversity of proteins is lost during digestion. This paper describes a method in which the native proteome of yeast was subjected to preliminary fractionation by size exclusion chromatography (SEC) prior to trypsin digestion of SEC fractions and reversed phase chromatography-mass spectral analysis to identify tryptic peptides thus generated. Through this approach proteins associated with other proteins in high molecular mass complexes were recognized and identified. A focus of this work was on the identification of Hub proteins that associate with multiple interaction partners. A critical component of this strategy is to choose methods and conditions that maximize retention of native structure during the various stages of analysis prior to proteolysis, especially during cell lysis. Maximum survival of protein complexes during lysis was obtained with the French press and bead-beater methods of cell disruption at approximately pH 8 with 200 mM NaCl in the lysis buffer. Structure retention was favored by higher ionic strength, suggesting that hydrophobic effects are important in maintaining the structure of protein complexes. Recovery of protein complexes declined substantially with storage at any temperature, but storage at -20°C was best when low temperature storage was necessary. Slightly lower recovery was obtained with storage at -80°C while lowest recovery was achieved at 4°C. It was concluded that initial fractionation of native proteins in cell lysates by SEC prior to RPC-MS/MS of tryptic digests can be used to recognize and identify proteins in complexes along with their interaction partners in known protein complexes.     

Proprietor and customer costs in the incomplete hub location-routing network topology

The hub location problem finds the location of hubs and allocates the other nodes to them. It is widely supposed the network created with the hub nodes is complete in the extensive literature. Relaxation of this basic supposition forms the present work. The model minimizes the cost of the proprietor, including the fixed costs of hubs, hub links and spoke links. Costs of hub and spoke links are contemplated as fixed cost or maintenance cost. Moreover, the model considers routing costs of customers who want to travel from origins to destinations. In this study, we offer a model to the multiple allocations of the hub location problems, under the incomplete hub location-routing network design. This model is easily transformed to other hub location problems using one or more constraints. No network format is dictated on the hub network. We suggest a set of valid inequalities for the formulation. Some lower bounds are developed using a Lagrangian relaxation approach and the valid inequalities. Computational analyses evaluate the performances of the lower bounding implementations and valid inequalities. Furthermore, we explore the effects of several factors on the design and solution time of the problem formulation.     

Optimizing fuzzy p-hub center problem with generalized value-at-risk criterion

In this study, we reduce the uncertainty embedded in secondary possibility distribution of a type-2 fuzzy variable by fuzzy integral, and apply the proposed reduction method to p-hub center problem, which is a nonlinear optimization problem due to the existence of integer decision variables. In order to optimize p-hub center problem, this paper develops a robust optimization method to describe travel times by employing parametric possibility distributions. We first derive the parametric possibility distributions of reduced fuzzy variables. After that, we apply the reduction methods to p-hub center problem and develop a new generalized value-at-risk (VaR) p-hub center problem, in which the travel times are characterized by parametric possibility distributions. Under mild assumptions, we turn the original fuzzy p-hub center problem into its equivalent parametric mixed-integer programming problems. So, we can solve the equivalent parametric mixed-integer programming problems by general-purpose optimization software. Finally, some numerical experiments are performed to demonstrate the new modeling idea and the efficiency of the proposed solution methods.     

An exact solution procedure for a cluster hub location problem

This paper proposes a new (MIP) model formulation and a new solution procedure for the hub network design problem under a non-restrictive policy introduced by Sung and Jin [Sung, C.S., Jin, H.W., 2001. Dual-based approach for a hub network design problem under non-restrictive policy. European Journal of Operational Research 132 (1), 88–105]. The model formulation contains significantly fewer variables so that optimal solutions for the LP-relaxation of the model can be determined for large instances using standard procedures for LP-models. Furthermore, the LP-relaxation provides very tight lower bounds. Computational results are given, which demonstrate that the new model formulation allows for solving much larger instances. It turned out that the new (exact) solution procedure, which utilises the new model formulation, is faster than the heuristic proposed by Sung and Jin (2001). It is also shown that the problem is np-hard.     

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique

This paper deals with the uncapacitated multiple allocation hub location problem. The dual problem of a four-indexed formulation is considered and a heuristic method, based on a dual-ascent technique, is designed. This heuristic, which is reinforced with several specifical subroutines and does not require any external linear problem solver, is the core tool embedded in an exact branch-and-bound framework. Besides, the heuristic provides the branch-and-bound algorithm with good lower bounds for the nodes of the branching tree. The results of the computational experience (with the classical CAB and AP data sets) are included, showing the great effectiveness of this approach: instances with up to 120 nodes are solved.     

Hub location–allocation in intermodal logistic networks

Within the context of intermodal logistics, the design of transportation networks becomes more complex than it is for single mode logistics. In an intermodal network, the respective modes are characterized by the transportation cost structure, modal connectivity, availability of transfer points and service time performance. These characteristics suggest the level of complexity involved in designing intermodal logistics networks. This research develops a mathematical model using the multiple-allocation p-hub median approach. The model encompasses the dynamics of individual modes of transportation through transportation costs, modal connectivity costs, and fixed location costs under service time requirements. A tabu search meta-heuristic is used to solve large size (100 node) problems. The solutions obtained using this meta-heuristic are compared with tight lower bounds developed using a Lagrangian relaxation approach. An experimental study evaluates the performance of the intermodal logistics networks and explores the effects and interactions of several factors on the design of intermodal hub networks subject to service time requirements.