Separately harmonic and subharmonic functions

Let u(x, y) be defined in B ₁×B ₂ where B ₁ ^m and B ₂ ⁿ , and assume that u(x, ·) harmonic for every fixed x and u(·, y) is subharmonic for every fixed y. We show that if u(·, y) is, in addition, C ² for each y then u is subharmonic in B ₁×B ₂ in both variables jointly.     

A new heuristic algorithm solving the linear ordering problem

The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized.     

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.     

Electroweak tests with τ leptons at LEP

We report on two sensitive tests of lepton universality carried out by the 4 LEP experiments at the Z⁰ pole. From measurements of the τ polarization in e⁺ e^?→τ ⁺ τ ^?, the ratios of the vector and axial vector coupling constants of the electron and the tau lepton to the weak neutral current are obtained to beg _{v e} /g _{a e} =0.066±0.015 andg _{V τ} /g _{A τ} =0.070±0.009 respectively. From measurement of the τ lifetime and the τ leptonic branching ratios, the ratio of the coupling constants describing weak leptonic decays of the τ and the μ is measured to beG _τ /G _μ =0.996±0.008.     

Standard<Emphasis Type="Italic">SU</Emphasis>(5) supergravity grand unification model and predictions

A review is given of the StandardSU(5) supergravity model. This model has passed an important check regarding unification of the electro-weak and the strong couplings using high precision LEP data. It is shown that for a significant domain of the parameter space the model also satisfies constraints on the SUSY spectrum from CDF and LEP, as well as proton stability and cosmological relic density constraints.     

Jauch-Piron system of imprimitivities for phonons. I. Localizability in discrete space

This paper is devoted to a discussion of the notion of localizability for phonons, i.e., quasiparticles arising from the harmonic vibrations of a system ofn atoms bound to one another by elastic forces. The natural tools for the analysis of localizability are the projection operatorsÊ() acting on the Hilbert space of one-phonon states, where is an arbitrary subset of the set that consists ofn vectors specifying the equilibrium positions ofn atoms. The expectation value ofÊ() is the probability that the phonon belongs to the atoms whose equilibrium positions are characterized by the elements of . For a strongly localizable phonon all of the projection operatorsÊ() commute with one another, whereas in the case of a weakly localizable phonon the operatorsÊ(₁) andÊ(₂) do not commute when ₁ and ₂ overlap. With the aid of the Jauch-Piron quantum theory of localization in space, the present paper describes the method of obtainingÊ() and also shows that if in the system ofn atoms there exist normal modes of zero frequency, then the phonon is only weakly localizable. Given the explicit expression forÊ(), one can define the number-of-phonons operator as well as the quasiparticle analogue (given in a companion paper) of the Wigner distribution function.     

Domination inequality for martingale transforms of a Rademacher sequence

Letf _n = Σ _k=1 ⁿ v _k r _k ,n=1,…, be a martingale transform of a Rademacher sequence (r _n)and let (r _n ^′ ) be an independent copy of (r _n).The main result of this paper states that there exists an absolute constantK such that for allp, 1≤p<∞, the following inequality is true: In order to prove this result, we obtain some inequalities which may be of independent interest. In particular, we show that for every sequence of scalars (a _n)one has where is theK-interpolation norm between ℓ₁ and ℓ₂. We also derive a new exponential inequality for martingale transforms of a Rademacher sequence. This research was supported in part by an NSF grant and an FRPD grant at NCSU.