we consider an m/g/1 queue with regular and optional phase vacation and withstate dependent arrival rate. the vacation policy is after completion of service if there are no customers in the system, the server takes vacation consisting of k -phases, each phase is generally distributed. here the first phase is compulsory where as the other phases are optional. for this model the supplementary var...

in this paper,~some results on finite dimensional generating spaces of quasi-norm family are established.~the idea of equivalent quasi-norm families is introduced.~riesz lemma is established in this space.~finally,~we re-define b-s fuzzy norm and prove that it induces a generating space of quasi-norm family.

Journal of Turbulence Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713665472 Lagrangian dynamic SGS model for stochastic coherent adaptive large eddy simulation Oleg V. Vasilyev a; Giuliano De Stefano b; Daniel E. Goldstein c; Nicholas K. -R. Kevlahan d a Department of Mechanical Engineering, University of ...

The pair (GH , ·) is called a special loop if (G, ·) is a loop with an arbitrary subloop (H, ·) called its special subloop. A special loop (GH , ·) is called a second Smarandache Bol loop (S2ndBL) if and only if it obeys the second Smarandache Bol identity (xs · z)s = x(sz · s) for all x, z in G and s in H. The popularly known and well studied class of loops called Bol loops fall into this clas...

The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation [4]; for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors [2, 3]. ...

The group membership problem for permutation groups is perhaps the most important problem of computational group theory. Solution of this problem seems to depend intrinsically on constructing a strong generating set. Until now, recognizing if a set of generators is strong has been thought to be as hard as constructing a strong generating set from an arbitrary generating set. This paper shows ho...

Introduction to Gaussian Random Function Simulation The so-called Gaussian Random Function simulation (GRFS) differs substantially from the Sequential Gaussian simulation (SGS) from GSLIB. GRFS more accurately reproduces distributions. It is typically faster than SGS, with additional efficiencies due to its parallel architecture. GRFS also has an option to run a fast collocated cosimulation – f...

Long-term observations of vegetation phenology can be used to monitor the response of terrestrial ecosystems to climate change. Satellite remote sensing provides the most efficient means to observe phenological events through time series analysis of vegetation indices such as the Normalized Difference Vegetation Index (NDVI). This study investigates the potential of a Photochemical Reflectance ...

This paper describes a new representation for the solutions of the resource-constrained project scheduling problem (RCPSP) denoted Activity Set List. The most efficient heuristics for the problem use the activity list representation and the serial SGS method to construct the corresponding solution (schedule). The activity list may induce a search space of representations much larger then the sp...

The purpose of this paper is to justify the claim that a method for generating primes presented at EUROCRYPT'89 generates primes with virtually uniform distribution. Using convincing heuristic arguments, the conditional probability distributions of the size of the largest prime factor p 1 (n) of a number n on the order of N is derived, given that n satisses one of the conditions 2n+1 is prime, ...