Transport studies in boron-ion implanted type II<Emphasis Type="Italic">a</Emphasis> diamond

We have investigated low-temperature electrical transport mechanisms in the surface layer of a type IIa diamond which has been heavily implanted with boron-ions at low temperatures and then annealed at high temperatures. The boron atoms occupy substitutional sites giving rise to a heavily doped wide-bandgap semiconductor. The dc-conductivity results suggest that for the maximum boron doping that has been achieved, the diamond sample is close to the insulator-metal transition. A model to account for the observed increase in activated boron centres with ion dose is presented. On the insulating side of the transition, the data are interpreted in terms of variable-range hopping laws.     

Magnetic structure of graphite ribbon

Anoble mechanism of spin polarization is proposed for finite graphite sheet with edge. For graphite ribbon with zigzag edge, there appear peculiar ‘edge states’. These localized states comprise nearly flat band at the Fermi level, which easily causes magnetic instability. Magnetic structure is suggested from Hartree-Fock analysis of the Hubbard model, where huge magnetic moments are induced at around both of edges by weak HubbardU and are coupled antiferromagnetically with each other.     

A Mössbauer spectroscopic study of cobalt-iron molybdates

Fe _x Co_1–x MoO₄ compounds prepared by coprecipitation were studied by XRD, electrical conductivity and mainly by absorption and emission Mössbauer spectroscopy. FeMoO₄ and CoMoO₄ samples were shown to contain Fe³⁺ and Co³⁺, respectively, in solid solution. Three kinds of Fe _x Co_1–x MoO₄ solids can be described. Forx0.16: one has a -Co(Fe²⁺, Fe³⁺)MoO₄ solid solution. For 0.17x0.25: one has the same solid solution with its surface rich in Fe³⁺. Forx0.26: one has the same solid solution with only bulk Fe³⁺, and ferric molybdate. Studies of reduction by hydrogen and of catalytic reaction of mechanical mixtures of CoMoO₄ and ferric molybdate support these statements.     

Solutions of logarithmic type for elliptic and hypoelliptic equations

LetK be an algebraically closed field withp:=char (K)>0 andX a bielliptic curve over Spec(K) with genus≥6 and such that the canonical model ofX is ordinary. In this paper we determine all the possible gap sequences of Weierstrass points on such curves.     

Λ-Shaped Policies to Schedule Deteriorating Jobs

We study a problem of scheduling deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting times. We consider the case of a single machine and linear job-independent deterioration. The objective is to minimize the sum of weighted completion times, with weights proportional to the basic processing times. The optimal schedule is shown to be Λ-shaped, i.e. the sequence of the basic processing times has a single local maximum. Moreover, we show that the problem is solved in O(N log N) time. In the last section we test heuristics for the case of general weights.     

Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach

This paper deals with approximate analysis methods for open queueing networks. External and internal flows from and to the nodes are characterized by renewal processes with discrete time distributions of their interarrival times. Stationary distributions of the waiting time, the queue size and the interdeparture times are obtained using efficient discrete time algorithms for single server (GI/G/1) and multi-server (GI/D/c) nodes with deterministic service. The network analysis is extended to semi-Markovian representations of each flow among the nodes, which include parameters of the autocorrelation function.     

Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach

The paper presents an application oriented procedure for solving the project management duration/resource tradeoff problem. A procedure is presented for reducing a project from a normal to a crash duration state at a minimum amount of additional resource expenditure assuming a linear utilization functions. The procedure is network based using a graphical Cut Search Approach to locate the minimal resource level at each reduction in total project duration. Activity-on-arc networks and flow networks are utilized. The paper is presented for practical application and for conceptual development as compared to a theoretical treatment.