1.

Record Nr.

UNISA996466164403316

Autore

Daduna Hans

Titolo

Queueing Networks with Discrete Time Scale [[electronic resource] ] : Explicit Expressions for the Steady State Behavior of Discrete Time Stochastic Networks / / by Hans Daduna

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001

ISBN

3-540-44592-7

Edizione

[1st ed. 2001.]

Descrizione fisica

1 online resource (X, 142 p.)

Collana

Lecture Notes in Computer Science, , 0302-9743 ; ; 2046

Disciplina

519.8/2

Soggetti

Computer communication systems

Probabilities

Computer engineering

Computer system failures

Operating systems (Computers)

Information technology

Business—Data processing

Computer Communication Networks

Probability Theory and Stochastic Processes

Computer Engineering

System Performance and Evaluation

Operating Systems

IT in Business

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

State dependent Bernoulli Servers -- Closed Cycles of State Dependent Bernoulli Servers with Different Customer Types -- Open Tandems of State Dependent Bernoulli Servers with Different Customer Types -- Networks with Doubly Stochastic and Geometrical Servers -- General Networks with Batch Movements and Batch Services.

Sommario/riassunto

Building on classical queueing theory mainly dealing with single node queueing systems, networks of queues, or stochastic networks has been a field of intensive research over the last three decades. Whereas



the first breakthrough in queueing network theory was initiated by problems and work in operations research, the second breakthrough, as well as subsequent major work in the area, was closely related to computer science, particularly to performance analysis of complex systems in computer and communication science. The text reports on recent research and development in the area. It is centered around explicit expressions for the steady behavior of discrete time queueing networks and gives a moderately positive answer to the question of whether there can be a product form calculus in discrete time. Originating from a course given by the author at Hamburg University, this book is ideally suited as a text for courses on discrete time stochastic networks.

2.

Record Nr.

UNISA996201608603316

Titolo

Minimalist syntax [[electronic resource] /] / edited by Randall Hendrick

Pubbl/distr/stampa

Malden, MA, : Blackwell Pub., c2003

ISBN

1-281-32048-X

1-282-34347-5

9786611320485

9786612343476

0-470-75819-8

0-470-75834-1

0-470-70224-9

Edizione

[4th ed.]

Descrizione fisica

1 online resource (244 p.)

Collana

Generative syntax ; ; 7

Altri autori (Persone)

HendrickRandall

Disciplina

343.41078624

415

Soggetti

Grammar, Comparative and general - Syntax

Minimalist theory (Linguistics)

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Minimalist Syntax; Contents; Acknowledgments; List of Contributors; Introduction; 1 On Control; 2 On Logical Form; 3 Steps toward a



Minimal Theory of Anaphora; 4 Syntactic Variation, Historical Development, and Minimalism; 5 Phrase Structure; Index

Sommario/riassunto

Minimalist Syntax is a collection of essays that analyze major syntactic processes in a variety of languages, all unified by their perspective from within the Minimalist Program. Introduces important concepts in the Minimalist approach to syntactic theory. Emphasizes empirical consequences of the Minimalist approach through innovative analyses. Highlights the importance of Minimalist syntax in explaining features of natural languages. Includes contributions from leading syntacticians.