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.     

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.     

The magnetic properties of Be-codoped GaMnN grown via molecular beam epitaxy

GaMnN and Be-codoped GaMnN were grown via molecular beam epitaxy using a single GaN precursor and their structural and magnetic properties were examined. X-ray diffraction and superconducting quantum interference device (SQUID) measurements revealed that the grown layers are homogeneous without precipitates. The saturation magnetization of GaMnN has increased from ∼4 to ∼16 emu/cm³ via codoping of Be. The d–d exchange interaction between Mn atoms was discussed for the ferromagnetism of GaMnN.     

Oil Migration in Chocolate

Oil migration in filled chocolates limits shelf life due to texture changes and loss of visual appeal. Spatial and temporal oil concentration changes of a two-layer chocolate and peanut butter filling system, which models a filled chocolate, were monitored by magnetic resonance imaging. Formulations of chocolate varied with respect to particle size, milk fat content and emulsifier level. Sorption-time experimental data was used to establish the best fit diffusion coefficient for a Fickian diffusion model. On the basis of the comparison of spatial experimental data to the model, Fickian diffusion alone does not account for oil migration. Authors' address: Michael J. McCarthy, Department of Food Science and Technology, University of California, One Shields Avenue, Davis, CA 95616, USA     

Wilcoxon signed rank test using ranked-set sample

Ranked-set sampling is useful when measurements are destructive or costly to obtain but ranking of the observations is relatively easy. The Wilcoxon signed rank test statistic based on the ranked-set sample is considered. We compared the asymptotic relative efficiencies of the RSS Wilcoxon signed rank test statistic with respect to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic. Throughout the ARE’s, the proposed test statistic is superior to the SRS Wilcoxon signed rank test statistic and the RSS sign test statistic.     

A simulated annealing algorithm for resource constrained project scheduling problems

This paper presents a simulated annealing algorithm for resource constrained project scheduling problems with the objective of minimising makespan. In the search algorithm, a solution is represented with a priority list, a vector of numbers each of which denotes the priority of each activity. In the algorithm, a priority scheduling method is used for making a complete schedule from a given priority list (and hence a project schedule is defined by a priority list). The search algorithm is applied to find a priority list which corresponds to a good project schedule. Unlike most of priority scheduling methods, in the suggested algorithm some activities are delayed on purpose so as to extend search space. Solutions can be further improved by delaying certain activities, since non-delay schedules are not dominant in the problem (the set of non-delay schedules does not always include an optimal solution). The suggested algorithm is flexible in that it can be easily applied to problems with an objective function of a general form and/or complex constraints. The performance of the simulated annealing algorithm is compared with existing heuristics on problems prepared by Patterson and randomly generated test problems. Computational results showed that the suggested algorithm outperformed existing ones.