In this article various pipes used for transporting of gas are introduced and pros and cons of each one are elucidated. The pipes are categorized in three different subgroups including metallic, polymeric and metallic-wire reinforced polymeric pipes. Metallic-wire reinforced polymeric pipes are nominated as the best option for usage in high pressure pipelines transporting natural gas. As a resu...

Organic semiconductors have emerged as potential alternatives to conventional inorganic materials due their numerous assets and applications. In this context, the star-shaped triindole core stands a promising system design new organic with enticing charge-transporting properties. Herein, we present synthesis of three thiophene-containing derivatives that feature N-alkyl chains different lengths...

the search for new stationary phases has been one of the predominant concerns in high performance liquid chromatography (hplc) in order to achieve better resolutions, longer column lives, and reduce the time of analysis. a chromatographic packing for separation of underivatized amino acids (aas) were prepared by dynamically coating 2-amino tetraphenyl prophyrin (atpp) on a c-18 reversed-phase p...

rotary atomizers are commonly used in spray dryers to atomize feed. one destructive effect of wheel rotation is the creation of a vacuum inside the wheel that conducts hot air from the chamber into the wheel and can lead to atomizer blockage and an explosion. the present work determined the air-pumping characteristics of a rotary atomizer with a 50 mm wheel diameter. the vacuum pressure and pow...

In this paper, to analyze the transport of autonomous robots, an artificial Capital market is used. Capital market is considered as a pier which loading and unloading of cargo is done. Autonomous robots load and unload from the ship to the warehouse wharf or vice versa. All the robots have the ability of transporting the loads, but depending on loads and the location of unloading (or loading) a...

In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bo...

In order to compute the packing dimension of orthogonal projections Falconer and Howroyd (1997) introduced a family of packing dimension profiles Dims that are parametrized by real numbers s > 0. Subsequently, Howroyd (2001) introduced alternate s-dimensional packing dimension profiles P-dims and proved, among many other things, that P-dimsE = DimsE for all integers s > 0 and all analytic sets ...

We consider the one-dimensional bin packing problem under the discrete uniform distributions U{j, k}, 1 ≤ j ≤ k − 1, in which the bin capacity is k and item sizes are chosen uniformly from the set {1, 2, . . . , j}. Note that for 0 < u = j/k ≤ 1 this is a discrete version of the previously studied continuous uniform distribution U(0, u], where the bin capacity is 1 and item sizes are chosen uni...

Abstract. The bin packing problem is to pack a list of reals in (0, 1] into unit-capacity bins using the minimum number of bins. Let R[A] be the limiting worst value for the ratio A(L)/L* as L* goes to x, where A(L) denotes the number ofbins used in the approximation algorithm A, and L* denotes the minimum number ofbins needed to pack L. Obviously, R[A] reflects the worst-case behavior of A. Fo...