Start‐up class models in multiple‐class queues with N‐policy

In this paper, we consider multipleclass queueing systems with Npolicy in which the idle server starts service as soon as the number of customers in the startup class reaches threshold N. We consider the cases of FCFS and nonpreemptive priority. We obtain the Laplace–Stieltjes transform of the waiting times of each class of customers. We also show some results for the general behavior of such systems.     

Simulation optimization of buffer allocations in production lines with unreliable machines

We use a recent simulationbased optimization method, sample path optimization, to find optimal buffer allocations in tandem production lines where machines are subject to random breakdowns and repairs, and the product is fluidtype. We explore some of the functional properties of throughput of such systems and exploit these properties to prove the almost sure convergence of our optimization technique, under a regularity condition on the steady state. Utilizing a generalized semiMarkov process (GSMP) representation of the system, we derive recursive expressions to compute onesided directional derivatives of throughput, from a single simulation run. Finally, we give computational results for lines with up to 50 machines. We also compare results for smaller lines with the results from a more conventional method, stochastic approximation, whenever applicable. In these numerical studies, our method performed quite well on problems that are considered difficult by current computational standards.     

On the Completeness and Decidability of the Horn‐Like Fragment of the First‐Order Linear Temporal Logic

We prove the completeness and decidability of the Hornlike sequents, specifically, the socalled D₂sequents (of the firstorder linear temporal logic) considered in the author's paper [Lith. Math. J., 41(3), 266–281 (2001)]. In this paper, with the help of the infinitary calculus G_L, grounded by the author in his earlier papers, for D₂sequents we construct a D₂Sat calculus of the socalled saturated type consisting of decidable deductive procedures replacing the omegarule for the always operator. In the present paper, in order to prove the completeness and decidability of the calculus D₂Sat, we construct the socalled invariant decidable calculus D₂IN. We prove the equivalence of the calculi D₂IN, D₂Sat, and G _L ^** for the socalled saturated D₂sequents. From this equivalence, by reducing an arbitrary D₂sequent to a saturated D₂sequent, and also from the completeness of the G _L ^** calculus and decidability of the invariant calculus D₂IN, we deduce the completeness and decidability of the calculus D₂Sat in the class of D₂sequents.     

Spatial shape‐preserving interpolation using ν‐splines

We present a global iterative algorithm for constructing spatial G ²continuous interpolating splines, which preserve the shape of the polygonal line that interpolates the given points. Furthermore, the algorithm can handle data exhibiting two kinds of degeneracy, namely, coplanar quadruples and collinear triplets of points. The convergence of the algorithm stems from the asymptotic properties of the curvature, torsion and Frénet frame of splines for large values of the tension parameters, which are thoroughly investigated and presented. The performance of our approach is tested on two data sets, one of synthetic nature and the other of industrial interest.     

Tableaus with Invertible Rules for Many‐Valued Modal Propositional Logics

We investigate tableaubased theorem proving for some families of manyvalued modal propositional logics. We consider manyvalued counterparts of wellknown twovalued modal logics obtained from various combinations of four basic properties of the accessibility relation, i.e., reflexivity, transitivity, seriality, and Euclideaness. For each of these logics we introduce tableau systems with certain invertible rules. We prove soundness and completeness of the presented tableau systems.     

Relative E ‐Theory

The Etheory of A. Connes and N. Higson provides a new realization of Khomology based on the notion of asymptotic morphisms. In this paper we define relative Etheory, associating to a C*algebra A and an ideal I the Abelian groups Enrel(A;I). These groups are related to the Etheory groups of A and I in the familiar way by a long exact sequence and excision isomorphisms. The definition of relative Etheory is motivated by the properties of first order, elliptic differential operators on complete Riemannian manifolds. Applications will be considered in a future publication.     

A two‐level queueing network model with blocking and non‐blocking messages

We analyze a novel twolevel queueing network with blocking, consisting of N level1 parallel queues linked to M level2 parallel queues. The processing of a customer by a level1 server requires additional services that are exclusively offered by level2 servers. These level2 servers are accessed through blocking and nonblocking messages issued by level1 servers. If a blocking message is issued, the level1 server gets blocked until the message is fully processed at the level2 server. The queueing network is analyzed approximately using a decomposition method, which can be viewed as a generalization of the wellknown twonode decomposition algorithm used to analyze tandem queueing networks with blocking. Numerical tests show that the algorithm has a good accuracy.     

(φ,ξ,η,λ)‐Structures of Parabolic Type

We consider (,,,)structures of parabolic type on hypersurfaces of dual spaces and study the rank of the affinor . We consider almost contact metric structures of parabolic type of the first kind on hypersurfaces of 4dimensional dual metric space. We study the properties of these structures and give examples of normal, integrable, and Sasakian parabolic structures.     

Stability Tests for Two Common Classes of Linear Time‐Delay and Hybrid Systems

The stability of linear timedelay systems with point internal delays is difficult to deal with in practice because of the fact that their characteristic equation is usually of transcendent type rather than of polynomial type. This feature usually causes the system to possess an infinite number of poles. In this paper, stability tests for this class of systems are obtained based either on extensions of classical tests applicable to delayfree systems or on approaches within the framework of twodimensional digital filters. Some of those twodimensional stability tests are also proved to be useful for stability testing of a common class of linear hybrid systems which involve coupled continuous and digital substates after a slightadhoc adaptation of the tests for that situation.     

Spaces over a Category and Assembly Maps in Isomorphism Conjectures in K‐ and L‐Theory

We give a unified approach to the Isomorphism Conjecture of Farrell and Jones on the algebraicKandLtheory of integral group rings and to the Baum–Connes Conjecture on the topologicalKtheory of reducedC*algebras of groups. The approach is through spectra over the orbit category of a discrete groupG.We give several points of view on the assembly map for a family of subgroups and characterize such assembly maps by a universal property generalizing the results of Weiss and Williams to the equivariant setting. The main tools are spaces and spectra over a category and their associated generalized homology and cohomology theories, and homotopy limits.     

Risk programming for agricultural resource allocation: A multidimensional risk approach

This paper develops an approach to deal with risk in agricultural decisions. Although the model is in line with the Prospect ranking theory and the Partitioned multiobjective risk method, which recognise the multidimensional character of any risk measure taken in agricultural decisionmaking problems, its behavioural hypothesis and analytical development are totally different. The way in which the approach works is illustrated through a simple but wellknown example in agricultural planning.     

A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes

We consider a finitecapacity singleserver vacation model with closedown/setup times and Markovian arrival processes (MAP). The queueing model has potential applications in classical IP over ATM or IP switching systems, where the closedown time corresponds to an inactive timer and the setup time to the time delay to set up a switched virtual connection (SVC) by the signaling protocol. The vacation time may be considered as the time period required to release an SVC or as the time during which the server goes to set up other SVCs. By using the supplementary variable technique, we obtain the queue length distribution at an arbitrary instant, the loss probability, the setup rate, as well as the Laplace–Stieltjes transforms of both the virtual and actual waiting time distributions.     

On Statistical Properties of the Lerch Zeta‐Function

A discrete limit theorem for the Lerch zetafunction on the complex plane is proved.     

Capacity analysis of an automated kit transportation system

In this paper, we present a capacity analysis of an automated transportation system in a flexible assembly factory. The transportation system, together with the workstations, is modeled as a network of queues with multiple job classes. Due to its complex nature, the steadystate behavior of this network is not described by a productform solution. Therefore, we present an approximate method to determine the capacity of the network. We first study a number of key elements of the system separately and subsequently combine the results of this analysis in an Approximate Mean Value Analysis (AMVA) algorithm. The key elements are a buffer/transfer system (the bottleneck of the system), modeled as a preemptiverepeat priority queue with identical deterministic service times for the different job classes, a set of elevators, modeled as vacation servers, a number of work cells, modeled as multiserver queues, and several nonaccumulating conveyor belts, modeled as ample servers. The AMVA algorithm exploits the property that the initial multiclass queueing network can be decomposed into a sequence of singleclass queueing networks and hence is very efficient. Comparison of numerical results of the AMVA algorithm for the throughputs for the different job classes to simulation results shows that the AMVA algorithm is also accurate. For several series of instances, the maximum relative error that we found was only 4.0%.     

On K‐Theory of Simplicial Rings and Degreewise Constructions

We give a measure of the difference between Waldhausen's definition of the Ktheory of a simplicial ring and the definition we obtain by extending Quillen's definition degreewise. This has computational advantages as the degreewise Ktheory sometimes is simpler to work with.     

Chern Classes in Alexander–Spanier Cohomology

In this article we construct explicit cocycles in the AlexanderSpanier cohomological complex, representing the Chern character of an element in Ktheory     

A Population Dynamics Model with Parental Care

A model for an agestructured unlimited population dynamics with parental care of offspring is presented (migration of individuals is not taken into account). The model consists of six partial integrodifferential equations for single males, single females, pairs with offspring under parental care, pairs without offspring under parental care, and offspring of the male and female sex. A class of separable solutions is constructed.     

Resource allocation in the North Sea demersal fisheries: A goal programming approach

The management of a fishery is a complex task generally involving multiple, often conflicting, objectives. These objectives typically include economic, biological and social goals such as improving the income of fishers, reducing the catch of depleted species and maintaining employment.Multicriteria decision making (MCDM) techniques appear wellsuited to such a management problem, allowing compromises between conflicting objectives to be analysed in a structured framework. In comparison to other fields, such as water resource planning, forestry and agriculture, there have been few applications of MCDM to fisheries.In this paper, a goal programming model of the North Sea demersal fishery is presented. The model is used to demonstrate the potential applicability of this type of approach to the analysis and development of fisheries management plans with multiple objectives. Alternative scenarios are considered for the problem, and tradeoffs between given objectives are also highlighted and discussed.     

Equivariant Riemann–Roch for G ‐Quasi‐Projective Varieties‐I

Let G denote a complex linear algebraic group. In this paper we establish several forms of equivariant Riemann–Roch valid for the category of Gquasiprojective complex varieties. The main application is to the operation of convolution that appears in the construction of modules over convolution algebras, for example the Hecke algebras associated to a complex reductive group as well as in the representation theory of quantum groups. The paper concludes with a discussion of some of these applications. The results in this paper hold mostly at the level of Grothendieck groups. The second part of this paper will discuss the extension to higher Ktheory in detail.