A paper studies a closed queueing network containing a server station and k client stations. The server station is an infinite server queueing system, and client stations are single server queueing systems with autonomous service, i.e. every client station serves customers (units) only at random instants generated by strictly stationary and ergodic sequence of random variables. The total number...

The paper studies a closed queueing network containing a server station and k client stations. The server station is an infinite server queueing system, and client stations are single server queueing systems with autonomous service, i.e. every client station serves customers (units) only at random instants generated by strictly stationary and ergodic sequence of random variables. The total numb...

In this paper we put forward a way of modelling reasoning with cases as it is described by writers such as Levi. This style of reasoning concentrates on finding and refining particular distinctions amongst cases which bear on the outcome. It thus contrasts with work such as HYPO in which such distinctions are the product of initial analysis of the domain, and so come already fixed. We provide a...

In this paper we describe an approach to the problem of weighting various factors that contribute to an analysis or outcome of a problem situation and discuss issues about weighting as they touch upon our case-based reasoned HY@O. In HYPO, we take the approach of delaying for as long as possible any assignment of weights-and of symbolically comparing the “weights” of competing factors. We call ...

We propose a model of price formation in Double Auction markets which employs the strong simplifying assumption that agents neglect strategic feedback effects and regard themselves as playing a Game against Nature. Agents otherwise are strict expected utihty maximizers employing Bayesian updating procedures. We prove the optimality of simple (‘aggressive reservation price’) strategies in our ge...

In this short paper we introduce some novel arguments based on legal cases represented as sets of dimensions. Although there has been much work on arguments based on factors, there has been relatively little recent work which has exploited dimensional representations. The arguments that we consider have a flavour quite distinct from those generated from cases represented as factors, which lack ...

SUMMARY Posterior consistency and the parallel behaviour of consistency of maximum likelihood estimators is analyzed in nonparametric statistical problems. The framework is the hypo-Strong Law of Large Numbers, a form of " one-sided " Uniform Law of Large Numbers.

The paper studies closed queueing networks containing a server station and k client stations. The server station is an infinite server queueing system, and client stations are single server queueing systems with autonomous service, i.e. every client station serves customers (units) only at random instants generated by strictly stationary and ergodic sequence of random variables. The total numbe...

In previous work we presented argumentation schemes to capture the CATO and value based theory construction approaches to reasoning with legal cases with factors. We formalised the schemes with ASPIC+, a formal representation of instantiated argumentation. In ASPIC+ the premises of a scheme may either be a factor provided in a knowledge base or established using a further argumentation scheme. ...

Abstract. This paper obtains all solvable 3-Lie algebras with the m-dimensional filiform 3-Lie algebra N (m ≥ 5) as a maximal hypo-nilpotent ideal, and proves that the m-dimensional filiform 3-Lie algebra N can’t be as the nilradical of solvable non-nilpotent 3-Lie algebras. By means of one dimensional extension of Lie algebras to the 3-Lie algebras, we get some classes of solvable Lie algebras...