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

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

基于DSP技术的无位置传感器的无刷直流电动机控制

主要介绍对于基于DSP技术的无位置传感器的无刷直流电动机控制系统设计，重点介绍了如何采用单电阻检测相电流和转子位置估算的问题，同时，对于无刷直流电动机的启动控制也提出了解决方案。     

γ谱仪测量系统样品旋转装置研制

利用球体随机旋转性好的特点，将包装样品的容器装入球内并放在样品旋转台中，在两台速度不同，方向垂直的步进电机带动下，球在旋转台上随机转动，实现对包装容器内的样品进行连续随机扫描，以达到减小由于包装容器的非均匀性对测量结果的影响，样品旋转装置由球面板、四根支柱，底座、步进电机及步进电机控制电路组成。采用两台型号为５７ＢＹＧ５０３的步进电机驱动球体旋转，步进电机控制器可对两台电机进行单独控制，并具有正反转功能，其转速分为２、５、８、１２、１６、２０转／ｍｉｎ六档，可连续长时间工作。     

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.     

Non-neural BOLD variability in block and event-related paradigms

Block and event-related stimulus designs are typically used in fMRI studies depending on the importance of detection power or estimation efficiency. The extent of vascular contribution to variability in block and event-related fMRI-BOLD response is not known. With scaling, the extent of vascular variability in the fMRI-BOLD response during block and event-related design tasks was investigated. Blood oxygen level-dependent (BOLD) contrast data from healthy volunteers performing a block design motor task and an event-related memory task requiring performance of a motor response were analyzed from the regions of interest (ROIs) surrounding the primary and supplementary motor cortices. Average BOLD signal change was significantly larger during the block design compared to the event-related design. In each subject, BOLD signal change across voxels in the ROIs had higher variation during the block design task compared to the event-related design task. Scaling using the resting state fluctuation of amplitude (RSFA) and breath-hold (BH), which minimizes BOLD variation due to vascular origins, reduced the within-subject BOLD variability in every subject during both tasks but significantly reduced BOLD variability across subjects only during the block design task. The strong non-neural source of intra- and intersubject variability of BOLD response during the block design compared to event-related task indicates that study designs optimizing for statistical power through enhancement of the BOLD contrast (for, e.g., block design) can be affected by enhancement of non-neural sources of BOLD variability.     

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.