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.

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.

pre-planting exposure stress on two-year-old, bare-root Corsican pine (Pinus nigra Arnold. ssp. laricio var. Corsicana) seedlings. Seedlings were lifted from a nursery and exposed to ambient conditions for periods of up to 192 h before being planted in minirhizotrons. Exposure decreased seedling water potential, CO2 assimilation rate, leaf conductance and new root elongation, and increased mort...

Spring planting is standard operational practice in the Central Hardwood Region, though little is known about potential impacts of low root temperature (RT) common during spring on establishment success of temperate deciduous forest tree species. The effects of low RT on growth, gas exchange, and root respiration following winter dormancy were studied in 1-year-old northern red oak (Quercus rub...

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

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

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

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

Winter wheat is one kind of important crop in China. It’s planting area is one key element to explain yield change. To obtain winter wheat planting area as soon as possible can provide scientific reference for our country’s making related policy. Basing on the cropping system in Shandong province, winter wheat is divided into two kinds “winter wheat sowed by machine-maize” and “people broadcast...

Five soybean cultivars, one each from Maturity Groups (MG) III, IV, V, VI, and VII, all susceptible to Heterodera glycines, were planted in H. glycines-infested soil in April, May, June, and July at multiple locations in Arkansas and Missouri. The purpose of the study was to determine whether planting early reduces yield losses due to H. glycines. The population levels of cysts, eggs, and secon...