Design and Experimental Characterization of Low‐Volume PM10/2.5/1.0 Trichotomous Sampler Inlet

This paper presents the development and laboratory evaluation of a PM10/2.5/1.0 trichotomous sampling inlet that consists of two main parts: a previously designed PM10 size‐selective inlet part and a PM2.5/1.0 two‐stage virtual impactor, which was newly fabricated and attached serially to the PM10 size selective inlet part. Particles are collected in three locations through the trichotomous sampling inlet to provide for not only particle concentration measurements of PM10, PM2.5 and PM1.0, but also those of PM2.5–10 and PM1.0–2.5.     

A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.     

Effect of Ru crystal orientation on the adhesion characteristics of Cu for ultra-large scale integration interconnects

The adhesion of Cu on Ru substrates with different crystal orientations was evaluated. The crystal orientation of sputter deposited Ru could be changed from (1 0 0) to (0 0 1) by annealing at 650 °C for 20 min. The adhesion of Cu was evaluated by the degree of Cu agglomeration on Ru. Cu films on annealed Ru films with the (0 0 1) crystal orientation showed 28% lower RMS values and 50% lower Ru surface coverage than Cu as-deposited on Ru having the (1 0 0) crystal orientation after annealing at 550 °C for 30 min, which suggest that Cu wettability on the Ru(0 0 1) was better than that on the Ru(1 0 0) plane. The low lattice misfit of 4% between Cu(1 1 1) and Ru(0 0 1) may be the reason for this good adhesion property.     

Structural and electrical properties of core–shell structured GaP nanowires with outer Ga2O3 oxide layers

This paper presents a review of our current experimental research on GaP nanowires grown by a vapor deposition method. Their structural, electrical, opto-electric transport, and gas-adsorption properties are reviewed. Our structural studies showed that a GaP nanowire consisted of a core–shell structure with a single-crystalline GaP core and an outer Ga₂O₃ layer. The individual GaP nanowires exhibited n-type field effects. Their electron mobilities were in the range of about 6 to 22 cm²/V s at room temperature. When the nanowires were illuminated with an ultraviolet light source, an abrupt increase of conductance occurred resulting from carrier generation in the nanowire and de-adsorption of adsorbed OH^- or O₂ ^- ions on the Ga₂O₃ surface shell. Using an intrinsic Ga₂O₃ shell layer as a gate dielectric, top-gated GaP nanowire field-effect transistors were fabricated and characterized. Like other metal oxide nanowires, the carrier concentration and mobility of GaP nanowires were significantly affected by the surface molecular adsorption of OH or O₂. The GaP nanowire devices were fabricated as sensors for NO₂, NH₃, and H₂ gases by using a simple metal decoration technique. PACS 73.63.-b; 72.80.Ey; 85.35.-p     

Assessment of thermal expansion coefficient of methylsilsesquioxane thin film

For the methylsilsesquioxane film whose optical birefringence is almost zero, it was recently reported that its vertical thermal expansion coefficient (CTE) was approximately one order of magnitude larger than the lateral CTE. Though the birefringence is not an absolute predictor of anisotropic behavior, the discrepancy in both the CTEs was so remarkable that it was essential to investigate whether the anisotropy was intrinsic property or not. If the effect of Poisson's ratio is considered in the calculation of the vertical CTE and when elastic modulus measured by surface acoustic wave spectroscopy is used in the assessment of the lateral CTE, both the CTEs are coincident with each other. Therefore, it can be concluded that the discrepancy in the CTEs can be attributed to a higher in‐plane polymer chain orientation but it can also arise from the misleadingly assumed modulus and Poisson's ratio. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 3109–3120, 2006     

A family of maximal surfaces in Lorentz-Minkowski three-space

We prove the existence of an infinite family of complete spacelike maximal surfaces with singularities in Lorentz-Minkowski three-space and study their properties. These surfaces are distinguished by their number of handles and have two elliptic catenoidal ends.

     

Stowage planning in maritime container transportation

We consider a stowage-planning problem of arranging containers on a container ship in the maritime transportation system. Since containers are accessible only from the top of the stack, temporary unloading and reloading of containers, called shifting, is unavoidable if a container required to be unloaded at the current port is stacked under containers to be unloaded at later ports on the route of the ship. The objective of the stowage planning problem is to minimize the time required for shifting and crane movements on a tour of a container ship while maintaining the stability of the ship. For the problem, we develop a heuristic solution method in which the problem is divided into two subproblems, one for assigning container groups into the holds and one for determining a loading pattern of containers assigned to each hold. The former subproblem is solved by a greedy heuristic based on the transportation simplex method, while the latter is solved by a tree search method. These two subproblems are solved iteratively using information obtained from solutions of each other. To see the performance of the suggested algorithm, computational tests are performed on problem instances generated based on information obtained from an ocean container liner. Results show that the suggested algorithm works better than existing algorithms.     

The Recognition of Double Euler Trails in Series-Parallel Networks

Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese₁, e₂,…,e_kis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network.     

On CCE graphs of doubly partial orders

Let D be a digraph. The competition-common enemy graph (CCE graph) of D has the same set of vertices as D and an edge between vertices u and v if and only if there are vertices w and x in D such that (w,u), (w,v), (u,x), and (v,x) are arcs of D. We call a graph a CCE graph if it is the CCE graph of some digraph. In this paper, we show that if the CCE graph of a doubly partial order does not contain C₄ as an induced subgraph, it is an interval graph. We also show that any interval graph together with enough isolated vertices is the CCE graph of some doubly partial order.     

Polynomial decay rate for the dissipative wave equation

Using Fourier integral operators with special amplitude functions, we analyze the stabilization of the wave equation in a three-dimensional bounded domain on which exists a trapped ray bouncing up and down infinitely between two parallel parts of the boundary.