A combined method consisting of the mixed finite element method for flow and the discontinuous Galerkin method for transport is introduced for the coupled system of miscible displacement problem. A “cut-off” operatorM is introduced in the discontinuous Galerkin formular in order to make the combined scheme converge. Optimal error estimates in L(H) for concentration and in L(L) for velocity are ...

A Table Errata is submitted concerning a formula in terms of a sum of two Gauss hypergeometric functions for the Ferrers function of the second kind (associated Legendre function of the second kind “on the cut”). This error occurs on p. 167 of Magnus, Oberhettinger & Soni (1966) Formulas and Theorems for the Special Functions of Mathematical Physics (third enlarged edition, Springer-Verlag, New...

maximizing economic earnings is the most common goal in cut-off grade optimization of open-pit mining operations. when this is the case, the price of the product has a critical effect on optimum value of cut-off grade. this paper investigates the relationship between optimum cut-off grade and price to maximize total cash flow and net percent value (npv) of operation. in order to visualize this ...

in this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group g and give four equivalent conditions each ofwhich characterizes this relation. we demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. moreover, we study the behavior of these equivalence classes under theaction of a...

OBJECTIVES One method for assessing pathological retinal nerve fiber layer (NFL) appearance is by comparing the NFL to normative values, derived from healthy subjects. These normative values will be more specific when normal physiological differences are taken into account. One common variation is a split bundle. This paper describes a method to automatically detect these split bundles. METHO...

The minimum sum-of-squared error clustering problem is shown to be a concave continuous optimization problem whose every local minimum solution must be integer. We characterize its local minima. A procedure of moving from a fractional solution to a better integer solution is given. Then we adapt Tuy’s convexity cut method to find a global optimum of the minimum sum-of-squared error clustering p...

We investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For Ω ⊂ D = (0, 1), with d ≥ 2, we are given n random i.i.d. points on D whose membership in Ω is known. We consider the sample as a random geometric graph with connection distance ε > 0. We estimate the perimeter of Ω (relative to D) by the, appropriately rescaled, graph cut between the vertices...

Given the possibility of communication systems failing catastrophically, we investigate limits to communicating over channels that fail at random times. These channels are finitestate semi-Markov channels. We show that communication with arbitrarily small probability of error is not possible. Making use of results in finite blocklength channel coding, we determine sequences of blocklengths that...