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.     

Studies of gas-jet assisted RF-glow discharge atomic absorption spectrometry

The gas jet assisted glow discharge source has been employed for the RF-glow discharge atomic absorption spectrometry (RF-GDAAS). Data are described to illustrate the role of discharge power, pressure as well as gas flow rate on the sample loss rate, absorbance and self-bias potential. Results show that the optimum discharge conditions depend not only on the pressure and discharge power but also on the gas flow rate. The absorbance increases as much as 1 order of magnitude as the gas flow rate increases from 50 mL/min to 500 mL/min at a pressure of 3 mbar. The use of a gas-jet source allows the direct analysis of solids by RF-GDAAS.     

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.