نتایج جستجو برای: tank container

تعداد نتایج: 26098  

2004
Lawrence Henesey

Container terminals world wide are trying to expand capacity and increase performance at a minimum of investments. Often the container terminal operations are changing to meet increased customer demands as well as to adapt to new technologies. The increasing costs of container terminal development do justify the use of computer simulation to assist in planning and policy making. A flexible simu...

2012
Mengrui Wu Yiping Wang Lianfu Deng Wei Chen Yi-Ping Li

Osteoclasts are the principle bone-resorbing cells. Precise control of balanced osteoclast activity is indispensable for bone homeostasis. Osteoclast activation mediated by RANK-TRAF6 axis has been clearly identified. However, a negative regulation-machinery in osteoclast remains unclear. TRAF family member-associated NF-κB activator (TANK) is induced by about 10 folds during osteoclastogenesis...

2012
René de Koster

Due to rapid growth in foreign trade using sea vessels, there is a growing focus in improving the infrastructure and operational efficiencies at the container terminals. Particularly, the operational responsiveness of loading and unloading of containers, affects the vessel idle times and profitability of the shipping liners. In this research, we determine optimal stack layout design, which mini...

2008
Li-Ping Yu Lih-Hsing Hsu

A k-container C(u, v) of a graph G is a set of kdisjoint paths joining u to v. A k-container C(u, v) of G is k∗-container if C(u, v) spans G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let κ(G) be the connectivity of G. In this paper, we prove that the n-dimensional burnt pancake graph Bn is n∗connected for any positive integer n.

2010
Lih-Hsing Hsu

A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k∗-container if it contains all vertices of G. A graph G is k∗connected if there exists a k∗-container between any two distinct vertices. In this paper, we prove that the n-dimensional fully connected cubic network FCCNn is 3 ∗-connected for n ≥ 2.

2016
Xianfeng Yang Zhiqiang Zhang Jialing Yang Yuxin Sun

The crashworthiness of helicopter fuel tank is vital to the survivability of the passengers and structures. In order to understand and improve the crashworthiness of the soft fuel tank of helicopter during the crash, this paper investigated the dynamic behavior of the nylon woven fabric composite fuel tank striking on the ground. A fluid-structure interaction finite element model of the fuel ta...

1994
Karen Daniels Zhenyu Li Victor Milenkovic

We present three diierent methods for nding solutions to the 2D translation-only containment problem: nd translations for k polygons that place them inside a given polygonal container without overlap. Both the container and the polygons to be placed in it may be nonconvex. First, we provide several exact algorithms that improve results for k = 2 or k = 3. In particular, we give an algorithm for...

2014
John J. BARTHOLDI Amar RAMUDHIN

We propose a new index, the Container Port Connectivity Index (CPCI), to measure the trade connectivity of ports within the network of container shipping. This index is based on both economics and network topology, and a distinctive feature is that the strength of a port is based on its position within the global structure of the shipping network and not just on local information such as the nu...

2012
Chen Chao Yan Wei

Being aimed at the influence of ship-size and cargo-demand changes on container shipping networks, to reveal the evolution process of container shipping networks structure form, this paper respectively designed the operation models for two major container shipping networks structure forms: Multi-port-calling network and Hub-and-spoke network, to maximizing the investment efficiency. Based on th...

2005
Kwang-Baek Kim

In this paper, we propose and evaluate a novel recognition algorithm for container identifiers that effectively overcomes these difficulties and recognizes identifiers from container images captured in various environments. The proposed algorithm, first, extracts the area containing only the identifiers from container images by using CANNY masking and bi-directional histogram method. The extrac...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید