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

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

2018
Zhao Jin Yaozong Ding Z. Jin Y. Z. Ding

In this paper, we will use the time series analysis method to predict the throughput of the research, through the establishment of time series SARIMA model, using the January-February 2017 domestic container throughput statistics of the main container port forecast from March 2017 to December 2020 container throughput data and analyze the trend of the throughput of major container ports in Chin...

2016
Rajesh Kanna

This paper presents a combinational Hybrid Genetic Algorithm (HGA) with packing tuning approach for solving Three Dimensional (3D) Single container arbitrary sized heterogeneous bin packing optimization problem, by considering practical constraints in the shipment container loading industries. Aim of this paper is to (i) pack 3D arbitrary sized heterogeneous bins in to a container. (ii) Improve...

2005
Mary Ann Ingram Mehmet F. Demirkol Daeyoung Kim

A new multi-antenna or multiple-input-multiple-output (MIMO) configuration is introduced for RF modulated backscatter in a multipath environment. RF modulated backscatter is used by semipassive RF tags to transmit without a power amplifier, and is therefore appropriate for applications with extreme power constraints such as sensor communications, electronic shelf tags, electronic toll collectio...

2015
Armando Cartenì

The current financial crisis seems to be seriously affecting the freight transport system. In this scenario, transport terminals play a crucial role to avert the risk of recession by increasing their efficiency and automation. Only in this way is it possible both to reduce the price of the services offered (loading, unloading, dwelling, logistic services ...) and increase terminal earnings. In ...

2009
Quang Hieu Ngo Keum-Shik Hong

In this paper, the skew control of the load (container) in the quay crane used in the dockside of a container terminal is investigated. The mathematical model of the 3-dimensional (3D) motions of the load is first derived. The container hooked to a spreader is suspended by four ropes in air. When the container is accelerated by the trolley or is disturbed by winds, it will make a rotational mot...

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
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...

Journal: :Symmetry 2022

Data hiding is the technique of embedding data into video or audio media. With development deep neural networks (DNN), quality images generated by novel methods based on DNN getting better. However, there still room for similarity between original and models which were trained existing frameworks to improve, it hard receiver distinguish whether container image from real sender. We propose a fra...

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.

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

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