Relevant bibliographies by topics / M/G/1 / Dissertations / Theses

Dissertations / Theses on the topic 'M/G/1'

To see the other types of publications on this topic, follow the link: M/G/1.
Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'M/G/1.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Prado, Silvia Maria. "Modelos alternativos em filas M/G/1." Universidade Federal de São Carlos, 2015. https://repositorio.ufscar.br/handle/ufscar/8693.

Full text
Abstract:
Submitted by Aelson Maciera (aelsoncm@terra.com.br) on 2017-04-25T19:31:06Z No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)
Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-05-02T13:03:01Z (GMT) No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)
Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-05-02T13:03:17Z (GMT) No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5)
Made available in DSpace on 2017-05-02T13:06:24Z (GMT). No. of bitstreams: 1 TeseSMP.pdf: 1382232 bytes, checksum: 8758d122cc415ab540988c4f92e38cc8 (MD5) Previous issue date: 2015-11-26
Não recebi financiamento
The main aim of this work is to develop alternative queuing models to M/ G/l, in which arrivals follow a Poisson process, the total number of customers on the system and the total number of service channels are unknown. Our interest is just to observe the service channel that will offer the maximum or minimum service time. Wherefore, the service distributions are obtained from the composition of the Conwav-Maxwell-Poisson distribution truncated at zero, used to model the number of service channels, with the general distribution to the maximum and minimum service time. Thus, we obtain new distributions for service time, which are called Maximum-Conwav-Maxwell-Poisson-general, denoted by MAXCOMPG distribution, and Minimum-Conwav-Maxwell-Poisson-general, denoted by MINCOMPG distribution, consequently, we obtain the queue models M/MAXCOMPG/1 and M/MINCOMPG/ 1, respectively. As general distributions, we use the distributions exponential, Weibull and Birnbaum Saunders, To illustrate the proposed queue models, a simulation study is done and also real data are used.
Este trabalho tem como objetivo apresentar modelos de filas alternativos ao M/G/l, nos quais as chegadas seguem um processo de Poisson, o número total de usuários no sistema e o número total de canais de atendimento são desconhecidos. Neste caso, observamos apenas o canal de serviço que irá oferecer o máximo ou o mínimo tempo de serviço. Para isto, as distribuições de serviço são obtidas a partir da composição da distribuição Conwav-Maxwell-Poisson truncada no ponto zero, usada para modelar o número de canais de atendimento, com uma distribuição geral para o máximo e o mínimo tempos de serviço. Desta forma, surgem novas distribuições de serviço que são denominadas de Máximo-Conwav-Maxwell-Poisson-geral, denotada por distribuição MAXCOMPG, e Mínimo-Conwav-Maxwell-Poisson-geral, denotada por distribuição MINCOMPG, e, assim, obtemos os modelos de fila M MAXCOMPG 1 e M MINCOMPG 1. Como distribuições gerais usamos as distribuições exponencial, Weibull e Birnbaum Saunders, Para ilustrar os modelos de fila propostos um amplo estudo de simulação é feito e dados reais também são utilizados.
APA, Harvard, Vancouver, ISO, and other styles
2

Böhm, Walter. "A transient Analysis of M/G/1 Queues with N-policy." Department of Statistics and Mathematics, WU Vienna University of Economics and Business, 1991. http://epub.wu.ac.at/738/1/document.pdf.

Full text
Abstract:
We consider an M/G/1 queueing model with N-policy operating. This means, that the server will start up only if a queue of a prescribed length has built up. For this model the time dependent distribution of the queue lenght is given by simple renewal arguments without resorting to integral transform techniques. (author's abstract)
Series: Forschungsberichte / Institut für Statistik
APA, Harvard, Vancouver, ISO, and other styles
3

Hou, Yunkui. "Stochastic optimal control of G/M/1 queueing system with breakdowns /." The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487694702782079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Slamet, Isnandar. "Transient analysis of M/G/1 queueing models: lattice path approach." Thesis, Curtin University, 2013. http://hdl.handle.net/20.500.11937/168.

Full text
Abstract:
In this thesis, we develop the explicit expression for pure incomplete busy period (PIBP) density function for M/G/1 queueing systems and for incomplete busy period (IBP) density function for M/G/1 queueing systems operating under (0,k) and (k ′, k) control policies. Under (0,k) control policy, the server goes on the vacation when the system becomes empty and re-opens for service immediately at the arrival of the kth customer. Under (k ′, k) control policy, the server starts serving only when the number of customers in the queue becomes k and remains busy as long as there are at least k ′ customers waiting for service. The explicit form of the incomplete busy period density and other measures of the system performance are not known.Our approach is to approximate general service time with Coxian 2-phase distribution and represent the queuing process as a lattice path by recording the state of the system at the point of transitions. Herein an arrival into the system is represented by a horizontal step and departure by a vertical step and shift from phase 1 to phase 2 by a diagonal step. Incomplete busy period can then be represented as lattice path starting from (k0, 0) to (m,n), m > n remaining below the barrier Y = X. Control policies imposes additional restrictions on the barrier. Next we use the lattice path combinatorics to count the feasible number of paths and corresponding probabilities.The above leads to the required density function that has simple probabilistic structure and can be computed using R. In this thesis, we also present the challenges in computing the density using R and illustrate the code and the results.
APA, Harvard, Vancouver, ISO, and other styles
5

Mak, Chi Kin School of Mathematics UNSW. "On complex reflection groups G(m, 1, r) and their Hecke algebras." Awarded by:University of New South Wales. School of Mathematics, 2003. http://handle.unsw.edu.au/1959.4/20777.

Full text
Abstract:
We construct an algorithm for getting a reduced expression for any element in a complex reflection group G(m, 1, r) by sorting the element, which is in the form of a sequence of complex numbers, to the identity. Thus, the algorithm provides us a set of reduced expressions, one for each element. We establish a one-one correspondence between the set of all reduced expressions for an element and a set of certain sorting sequences which turn the element to the identity. In particular, this provides us with a combinatorial method to check whether an expression is reduced. We also prove analogues of the exchange condition and the strong exchange condition for elements in a G(m, 1, r). A Bruhat order on the groups is also defined and investigated. We generalize the Geck-Pfeiffer reducibility theorem for finite Coxeter groups to the groups G(m, 1, r). Based on this, we prove that a character value of any element in an Ariki-Koike algebra (the Hecke algebra of a G(m, 1, r)) can be determined by the character values of some special elements in the algebra. These special elements correspond to the reduced expressions, which are constructed by the algorithm, for some special conjugacy class representatives of minimal length, one in each class. Quasi-parabolic subgroups are introduced for investigating representations of Ariki- Koike algebras. We use n x n arrays of non-negative integer sequences to characterize double cosets of quasi-parabolic subgroups. We define an analogue of permutation modules, for Ariki-Koike algebras, corresponding to certain subgroups indexed by multicompositions. These subgroups are naturally corresponding, not necessarily one-one, to quasi-parabolic subgroups. We prove that each of these modules is free and has a basis indexed by right cosets of the corresponding quasi-parabolic subgroup. We also construct Murphy type bases, Specht series for these modules, and establish a Young's rule in this case.
APA, Harvard, Vancouver, ISO, and other styles
6

Keilson, Julian, and Les D. Servi. "Extended Vacation Systems and the Universality of the M/G/1/K Blocking Formula." Massachusetts Institute of Technology, Operations Research Center, 1989. http://hdl.handle.net/1721.1/5382.

Full text
Abstract:
A simple blocking formula B(K) = (1 - p)EK [1 - pEK]- 1 relates the probability of blocking for the finite capacity M/G/1/K to EK, the steady state occupancy tail probability of the same system with infinite capacity. The validity of this formula is demonstrated for M/G/1 vacation systems augmented by an idle state, an umbrella for a host of priority systems and vacation systems related to M/G/1. A class of occupancy level dependent vacation systems introduced are shown to require a variant of this blocking formula.
APA, Harvard, Vancouver, ISO, and other styles
7

Whiting, P. A. "A class of G/M/1 priority queues and its application to performance analysis." Thesis, University of Strathclyde, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382422.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rýzner, Zdeněk. "Využití teorie hromadné obsluhy při návrhu a optimalizaci paketových sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219285.

Full text
Abstract:
This master's thesis deals with queueing theory and its application in designing node models in packet-switched network. There are described general principles of designing queueing theory models and its mathematical background. Further simulator of packet delay in network was created. This application implements two described models - M/M/1 and M/G/1. Application can be used for simulating network nodes and obtaining basic network characteristics like packet delay or packet loss. Next, lab exercise was created, in that exercise students familiarize themselves with basic concepts of queueing theory and examine both analytical and simulation approach to solving queueing systems.
APA, Harvard, Vancouver, ISO, and other styles
9

Fatnes, Johan Narvestad. "Flow-times in an M/G/1 Queue under a Combined Preemptive/Non-preemptive Priority Discipline. : Scheduled Waiting Time on Single Track Railway Lines." Thesis, Norwegian University of Science and Technology, Department of Mathematical Sciences, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10031.

Full text
Abstract:

A priority based rule for use during the process of scheduling trains oper- ating on a single track railway line was proposed by the Norwegian railway operator and owner, Jernbaneverket. The purpose of this study is to inves- tigate the effect of the suggested scheduling rule on the scheduled waiting times suffered by trains operating on a segment of the railway line. It is shown that the scheduling rule, under certain limiting assumptions, can be studied in the setting of queuing theory and that it has properties in common with a theoretical priority discipline combining two well docu- mented priority rules. The main part of this study is the development and analysis of a threshold based, combined preemptive/non-preemptive priority discipline. Under the combined discipline, preemptions are allowed during the early stage of processing only. Theoretical expressions for flow-times of jobs passing through the queuing system are reached through detailed studies of the non-preemptive and the preemptive priority discipline. The relationship between the suggested priority based scheduling rule and the theoretical, combined priority discipline is finally illustrated by sim- ulations. When adjusted for actual time spent by trains on traversing the line segment, the steady state solution for flow-times obtained from queuing theory yields an accurate expression for the trains’ average scheduled wait- ing times. The scheduling problem can in fact be modeled accurately by an M/G/1 queue under the combined priority discipline.

APA, Harvard, Vancouver, ISO, and other styles
10

Maraghi, Farzana Abdulla. "A study of some M[x]/G/1 type queues with random breakdowns and Bernouilli schedule server vacations based on a single vacation policy." Thesis, Brunel University, 2008. http://bura.brunel.ac.uk/handle/2438/5540.

Full text
Abstract:
Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production, human computer interaction, and so on. The classical queueing system, even vacation queues or queues subject to breakdown, might not be sufficiently realistic. The purpose of this research is to extend the work done on vacation queues and on unreliable queues by studying queueing systems which take into consideration both phenomena. We study the behavior of a batch arrival queueing system with a single server, where the system is subject to random breakdowns which require a repair process, and on the other hand, the server is allowed to take a vacation after finishing a service. The breakdowns are assumed to occur while serving a customer, and when the system breaks down, it enters a repair process immediately while the customer whose service is interrupted comes back to the head of the queue waiting for the service to resume. Server vacations are assumed to follow a Bernoulli schedule under single vacation policy. We consider the above assumptions for different queueing models: queues with generalized service time, queues with two-stages of heterogeneous service, queues with a second optional service, and queues with two types of service. For all the models mentioned above, it is assumed that the service times, vacation times, and repair times all have general arbitrary distributions. Applying the supplementary variable technique, we obtain probability generating functions of queue size at a random epoch for different states of the system, and some performance measures such as the mean queue length, mean waiting time in the queue, proportion of server's idle time, and the utilization factor. The results obtained in this research, show the effect of vacation and breakdown parameters upon main performance measures of interest. These effects are also illustrated using some numerical examples and graphs.
APA, Harvard, Vancouver, ISO, and other styles
11

Trojanowicz, Bogusz [Verfasser], M. [Akademischer Betreuer] Niedziela, G. [Akademischer Betreuer] Brabant, and R. [Akademischer Betreuer] Finke. "The role of adenylate-uridylate rich RNA-binding factor 1 (AUF1) in thyroid carcinoma progression / Bogusz Trojanowicz. Betreuer: M. Niedziela ; G. Brabant ; R. Finke." Halle, Saale : Universitäts- und Landesbibliothek Sachsen-Anhalt, 2010. http://d-nb.info/1025011376/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Silva, Ana Paula Ramos de Almeida e. "Viabilidades técnica e econômica de atmosfera com 5% de CO2 e 1 g m^-3 de PH3 para controle de Tribolium castaneum em diferentes temperaturas." Universidade Federal de Viçosa, 2001. http://www.locus.ufv.br/handle/123456789/11249.

Full text
Abstract:
Submitted by Nathália Faria da Silva (nathaliafsilva.ufv@gmail.com) on 2017-07-13T13:51:37Z No. of bitstreams: 1 texto completo.PDF: 406966 bytes, checksum: abd8716c362cf52ad877eda05b8eaefc (MD5)
Made available in DSpace on 2017-07-13T13:51:37Z (GMT). No. of bitstreams: 1 texto completo.PDF: 406966 bytes, checksum: abd8716c362cf52ad877eda05b8eaefc (MD5) Previous issue date: 2001-03-30
Fundação de Amparo à Pesquisa do Estado de Minas Gerais
Atualmente, têm-se encontrado grandes entraves no controle de pragas em unidades armazenadoras e processadoras de grãos. A necessidade de formas de controle rápidas, de baixo custo e com menor impacto ambiental tem induzido a geração de novas tecnologias e o melhor manejo das já existentes. A futura saída do brometo de metila do mercado gera a necessidade de se estudarem tecnologias que permitam um controle efetivo de pragas de grãos armazenados em período inferior a 24 h, especialmente em unidades processadoras de grãos. O trabalho desenvolvido teve por objetivo estudar a interação da utilização de fosfina (PH3) e dióxido de carbono (CO2) no controle de Tribolium castaneum (Herbst) (Coleoptera: Tenebrionidae) em diferentes temperaturas. Foram utilizados 40 adultos de T. castaneum em três repetições. Os tratamentos testados constituíram -se de uma atmosfera contendo 1 g m^-3 de fosfina (PH3) associada a 5% de CO2, nas temperaturas de 20, 25, 30, 35 e 40ºC. Em cada temperatura, foram avaliados cinco diferentes períodos de exposição, de acordo com os dados obtidos em testes preliminares. Os testes foram realizados em três câmaras metálicas, acondicionadas no interior de uma câmara climática, com controle de temperatura e umidade relativa. Após a avaliação de mortalidade em cada tratamento, realizou-se uma análise de próbite dos dados para determinar os tempos letais (TL) para controlar 50 e 95% da população de T. castaneum em cada temperatura estudada. Através de análise de regressão, obtiveram-se equações para determinar os TL50 e TL95 em função da temperatura. Ao utilizar-se a temperatura de 40ºC, verificou- se que é possível controlar 95% da população do inseto testado em aproximadamente 23 h. De acordo com os resultados obtidos, efetuou-se uma análise da viabilidade econômica da tecnologia proposta: considerando um aquecimento da estrutura a ser tratada, a tecnologia mostrou-se viável a 40ºC, em volumes superiores a 1.447 m³.
The control of stored grains and processing unities pests is going through great difficulties. The need of rapid, low cost and environmentally safe ways of controlling such pests induces the generation of new technologies and a better handling of the existing ones. The phasing out of methyl bromide is sparking the search for possible alternatives for effective pest control within a 24 hours period, especially for grain processing units. The accomplished work aimed to study the combination of phosphine (PH3) with carbon dioxide (CO2) in different temperatures on the control of Tribolium castaneum (Herbst) (Coleoptera: Tenebrionidae). Forty adults of T. castaneum were used in three replicates, and the treatments were modified atmospheres with 1 g m^-3 of phosphine combined with 5% of CO2 in the temperatures of 20, 25, 30, 35 and 40ºC. Five exposure periods for each temperature were used, according to results obtained in preliminary tests. The experiment was carried out in metallic chambers placed inside a climatic chamber with air temperature and relative humidity control. After the mortality evaluation of each treatment, probit analyses were carried out in order to determine the lethal times (LT) values to control 50 and 95% of T. castaneum population for each studied temperature. Afterwards, a regression analysis was used to obtain the equations of the LT50 and LT95 as a function of the temperature. For the temperature of 40ºC, it was possible to control 95% of the insect population with the proposed treatment in 23.2 hours. An analysis of the economical viability was then made using the results obtained on the research, comparing the proposed technology with two other one available, an increasing of the environment temperature was also studied. In the economical analysis, the treatment of 40ºC was better than the available one when the facilities to be treated are greater than 1447 m³.
APA, Harvard, Vancouver, ISO, and other styles
13

Ferretti, Erika. "Analisi delle funzionalità e delle prestazioni di un casello autostradale mediante un modello di coda multiclasse." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8120/.

Full text
Abstract:
Riguarda la realizzazione di un modello per l'analisi prestazionale di un casello autostradale, in grado di valutare performance e livello di qualità erogato all'utenza in relazione al rapporto esistente tra domanda e offerta di servizio. Trattandosi di un varco autostradale si tratterà di analizzare un problema relativo ad un certo numero di veicoli in attesa di ricevere un servizio caratterizzato da tempi e modalità diverse a seconda della tipologia veicolare e della tipologia di esazione utilizzata. Il problema viene affrontato tramite la teoria delle code che permette la valutazione dei relativi parametri prestazionali. Partendo dallo studio dei casi più semplici di coda M/M/1 vengono fatte valutazioni sui tempi di servizio arrivando a identificare il modello M/G/1 come più appropriato per un tale problema. Viene poi illustrata l'impostazione del modello con input e output relativi. Il modello viene infine applicato a una stazione reale della rete per evidenziare le valutazioni che è possibile ottenere da un modello così realizzato.
APA, Harvard, Vancouver, ISO, and other styles
14

Maeffert, Jana [Verfasser], G. v. [Gutachter] Minckwitz, M. [Gutachter] Kiechle, and W. [Gutachter] Lichtenegger. "Klinische Wertigkeit der Wachstumsfaktoren Vascular Endothelial Growth Factor (VEGF) und Insulin-like Growth Factor-1 (IGF-1) und des Bindungsproteins IGFBP-3 bei der Untersuchung von Frauen mit erhöhtem Brustkrebsrisiko / Jana Marie Maeffert ; Gutachter: G. v. Minckwitz, M. Kiechle, W. Lichtenegger." Berlin : Humboldt-Universität zu Berlin, 2003. http://nbn-resolving.de/urn:nbn:de:kobv:11-10019855.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Maeffert, Jana Marie [Verfasser], G. v. [Gutachter] Minckwitz, M. [Gutachter] Kiechle, and W. [Gutachter] Lichtenegger. "Klinische Wertigkeit der Wachstumsfaktoren Vascular Endothelial Growth Factor (VEGF) und Insulin-like Growth Factor-1 (IGF-1) und des Bindungsproteins IGFBP-3 bei der Untersuchung von Frauen mit erhöhtem Brustkrebsrisiko / Jana Marie Maeffert ; Gutachter: G. v. Minckwitz, M. Kiechle, W. Lichtenegger." Berlin : Humboldt-Universität zu Berlin, 2003. http://d-nb.info/1207628158/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Gatenby, Paul, Gytis Danta, Roger Tuck, Colin Andrews, and Carolyn Hawkins. "Cerebrovascular disease associated with antiphospholipid antibodies: more questions than answers." Master's thesis, BioMed Central, 2006. http://hdl.handle.net/10440/104.

Full text
Abstract:
Neurological syndromes occur in a significant number of patients with antiphospholipid antibodies. The optimal management for these patients however remains uncertain. Our study is a descriptive analysis looking retrospectively at 45 patients who presented to the principal tertiary referral centre in the Australian Capital Territory, with either cerebral arterial or venous thrombosis for which there was no obvious cause for their presentation when initially reviewed. The diagnosis was based on the clinical findings made by one of three neurologists attached to our centre. Radiological findings and the presence of either IgM or IgG anticardiolipin antibodies, IgG anti-beta-2 glycoprotein 1 antibodies or a lupus anticoagulant were then documented. In this group of patients three subgroups were identified: 1. Individuals that fulfilled the Sapporo Classification Criteria 2. Individuals with transiently positive antiphospholipid antibodies and 3. Individuals with persistently low positive antiphospholipid antibodies. The most interesting of these three groups are those individuals with transiently positive antiphospholipid antibodies. A potential cause for presentation was identified in only one patient of this group with documented infective endocarditis and bacteraemia. Comparison with the other two groups suggested that there was little in terms of clinical presentation, radiological findings or intercurrent risk factors for thrombotic disease to distinguish between them. With disappearance of antiphospholipid antibodies, the individuals within this group have not had further thrombotic events. Our observations emphasise the problems that continue to exist in relation to the occurrence of cerebrovascular disease in the context of antiphospholipid antibodies and the optimal management of these stratified groups. Our findings also raise an as yet unanswered question as to the signficance of these transiently positive antiphospholipid antibodies. In the absence of significant intercurrent risk factors our findings would suggest that in the group we describe that they are likely to be of clinical significance.
APA, Harvard, Vancouver, ISO, and other styles
17

Decelle, Sophie. "Majorana representations and the Coxeter Groups G^(m,n,p)." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/23992.

Full text
Abstract:
The work presented in this thesis is a contribution to Majorana theory as introduced by A. A. Ivanov in [Iva09]. Inspired by a theorem of S. Sakuma [Sak07], Majorana theory is an axiomatisation of seven properties of the Monster algebra VM, invariant under the Monster group M, and of some of its idempotents. For a finite group G generated by a G-invariant set T of involutions one can define what it means for G to have a Majorana representation with respect to T. It yields a G-invariant Majorana algebra X generated by a set A of idempotents called Majorana axes. To each axis a in A an automorphism Tau(a) of X called Majorana involution is associated, so that X, A and Tau(A) satisfy the Majorana axioms. In this thesis we give a review of the Majorana algebras already obtained and we motivate the following objective: the classification of all Majorana algebras V generated by three Majorana axes a_1, a_2 and a_3 such that V also contains a Majorana axis a_1,2 with associated automorphism Tau(a_1,2) := Tau(a_1) Tau(a_2). This objective requires the classification of all subgroups G :=< Tau(a_{i}) | i in [1;3]> of GL(V ), which are necessarily quotients of the Coxeter groups G^(m,n,p) := such that m, n, p belong to [1; 6] and the set of conjugates of x, y, xy and z is 6-transposition. We prove that all such groups are quotients of only eleven finite groups. Comparing with S. P. Norton's list of `triangle-point' configurations of 2A involutions in M [Nor85], we observe that nine of them 2A-embed in M. The next step is to answer which of those eleven groups can be generated by Majorana involutions. Using partial results already known, we manage to answer this question completely for one of the eleven groups isomorphic to L2(11). For the remaining ten groups we give technical restrictions on the structure of their possible Majorana algebras, thus laying the foundations for further progress.
APA, Harvard, Vancouver, ISO, and other styles
18

GONCALVES, IRACI M. P. "Monitoração e diagnóstico para detecção de falhas de sensores utilizando a metodologia GMDH." reponame:Repositório Institucional do IPEN, 2006. http://repositorio.ipen.br:8080/xmlui/handle/123456789/11382.

Full text
Abstract:
Made available in DSpace on 2014-10-09T12:51:19Z (GMT). No. of bitstreams: 0
Made available in DSpace on 2014-10-09T14:03:37Z (GMT). No. of bitstreams: 0
Tese (Doutoramento)
IPEN/T
Instituto de Pesquisas Energeticas e Nucleares - IPEN/CNEN-SP
APA, Harvard, Vancouver, ISO, and other styles
19

Gonçalves, Iraci Martinez Pereira. "Monitoração e diagnóstico para detecção de falhas de sensores utilizando a metodologia GMDH." Universidade de São Paulo, 2006. http://www.teses.usp.br/teses/disponiveis/85/85133/tde-04062012-144516/.

Full text
Abstract:
O sistema de detecção de falhas e diagnóstico é um sistema de suporte ao operador dedicado a funções específicas que alertam os operadores para problemas de falhas em sensores e atuadores, e auxiliam no diagnóstico antes que os limites normais de alarmes sejam atingidos. Sistemas de suporte ao operador surgiram para diminuir a complexidade dos painéis causada pelo grande aumento de informação disponível nas salas de controle das centrais nucleares. Neste trabalho foi desenvolvido um Sistema de Monitoração e Diagnóstico utilizando a metodologia GMDH (Group Method of Data Handling) aplicado ao reator de pesquisas do Ipen IEA-R1. O sistema faz a monitoração, comparando os valores calculados pelo modelo GMDH com os valores medidos. A metodologia desenvolvida foi aplicada inicialmente em modelos teóricos: um modelo teórico de trocador de calor e um modelo teórico do reator IEA-R1. Os resultados obtidos com os modelos teóricos propiciaram uma base para a aplicação da metodologia aos dados de operação do reator. Para a monitoração de dados de operação foram desenvolvidos três modelos GMDH: o primeiro utilizou apenas variáveis de processo, o segundo modelo foi desenvolvido considerando-se algumas variáveis nucleares e três variáveis de temperatura, e o terceiro modelo GMDH considerou todas as variáveis possíveis. Os três modelos apresentaram resultados excelentes, mostrando amplamente a viabilidade da utilização da metodologia GMDH na monitoração de dados de operação. A comparação entre os resultados dos três modelos desenvolvidos mostrou ainda a capacidade da metodologia GMDH de escolher as melhores variáveis para otimização do modelo. Para a implementação de um sistema de diagnóstico, foram adicionadas falhas sinteticamente aos valores das variáveis de temperatura. Os valores de falhas correspondem a uma descalibração da temperatura e o resultado da monitoração de dados com falhas foi utilizado para a elaboração de um sistema de diagnóstico simples e objetivo baseado na lógica nebulosa.
The fault detection and diagnosis system is an Operator Support System dedicated to specific functions that alerts operators to sensors and actuators fault problems, and guide them in the diagnosis before the normal alarm limits are reached. Operator Support Systems appears to reduce panels complexity caused by the increase of the available information in nuclear power plants control room. In this work a Monitoring and Diagnosis System was developed based on the GMDH (Group Method of Data Handling) methodology. The methodology was applied to the IPEN research reactor IEA-R1. The system performs the monitoring, comparing GMDH model calculated values with measured values. The methodology developed was firstly applied in theoretical models: a heat exchanger model and an IPEN reactor theoretical model. The results obtained with theoretical models gave a base to methodology application to the actual reactor operation data. Three GMDH models were developed for actual operation data monitoring: the first one using just the thermal process variables, the second one was developed considering also some nuclear variables, and the third GMDH model considered all the reactor variables. The three models presented excellent results, showing the methodology utilization viability in monitoring the operation data. The comparison between the three developed models results also shows the methodology capacity to choose by itself the best set of input variables for the model optimization. For the system diagnosis implementation, faults were simulated in the actual temperature variable values by adding a step change. The fault values correspond to a typical temperature descalibration and the result of monitoring faulty data was then used to build a simple diagnosis system based on fuzzy logic.
APA, Harvard, Vancouver, ISO, and other styles
20

Ding, Cheng. "Siglec-G is a negative regulator of NF-[kappa]B activation and has pivotal roles in B-1 cell development and resistance to sepsis /." Columbus, Ohio : Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1226876722.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Stefenon, Letícia Oberoffer. "ESTUDO DA DIN AMICA DE UM G´AS CONFINADO EM PLACAS PARALELAS HETEROG ENEAS UTILIZANDO O MODELO S." Universidade Federal de Santa Maria, 2011. http://repositorio.ufsm.br/handle/1/9970.

Full text
Abstract:
In this work, an analytical version of the method of discrete ordinates (ADO) is used in developing solutions to problems of rarefied gases confined by two infinite parallel plates with different chemical constitutions, that is, without the symmetry condition. The modeling of problems (Poiseuille Flow and Thermal Creep) are performed using the kinetic models of BGK and S, derived from the linearized Boltzmann equation. In order to describe the interaction between gas and surface, we use the core of Maxwell presenting a single accommodation coefficient and the Cercignani-Lampis core defined in terms of the coefficients of accommodation of tangential momentum and energy accommodation coefficient kinetics. A series of results are presented in order to establish a comparison of surface effects to the problems presented.
Neste trabalho, uma vers ao anal´ıtica do m´etodo de ordenadas discretas (ADO) ´e utilizada no desenvolvimento de solu¸c oes para problemas de gases rarefeitos confinados por duas placas paralelas infinitas com constitui¸c oes qu´ımicas diferentes, isto ´e, sem a condi¸c ao de simetria. A modelagem dos problemas (Fluxo de Poiseuille e Creep T´ermico) s ao realizados a partir dos modelos cin´eticos BGK e S, derivados da equa¸c ao linearizada de Boltzmann. A fim de descrever o processo de intera¸c ao entre o g´as e a superf´ıcie, utiliza-se o n´ucleo de Maxwell que apresenta um ´unico coeficiente de acomoda¸c ao e o n´ucleo de Cercignani-Lampis definido em termos dos coeficientes de acomoda¸c ao do momento tangencial e o coeficiente de acomoda¸c ao da energia cin´etica. Uma s´erie de resultados s ao apresentados a fim de estabelecer uma compara¸c ao dos efeitos de superf´ıcie para os problemas apresentados.
APA, Harvard, Vancouver, ISO, and other styles
22

Cadore, Gustavo Cauduro. "Neospora caninum: Imunoglobulinas como marcadores de infecção transplacentária e avaliação da susceptibilidade de cultivos celulares." Universidade Federal de Santa Maria, 2009. http://repositorio.ufsm.br/handle/1/10037.

Full text
Abstract:
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Neosporosis is a parasitic disease of wide distribution and great importance to the cattle industry, mainly due to its associated reproductive losses. The life cycle of Neospora caninum typified by the tree know infectious stages: tachyzoites, tissue cysts with bradyzoites, and oocysts. Transmission routes can be horizontal and/or vertical. The vertical transmission or transplacentally is the most frequent form of infection, and an important form of maintain the agent in herds. With aim of to determine the occurrence of anti-Neospora caninum antibodies in serum samples of 260 bovine fetuses, collected in a slaughter in the municipality of Santa Maria, in Rio Grande do Sul, Brazil. For detection antibodies anti-N. caninum indirect fluorescent antibody test was used and immunoglobulin G and M were detected, using a cut-off 1:25. Of the 260 serum samples tested, 15% (39/260) were positive for the presence of anti-N. caninum. Of these, in 38 the presence of IgG where detected (97.4%) and in six IgM were present (10.3%). Five samples (15.4%) tested were positive for both IgG and IgM. The results reaffirming the ability of N. caninum in determine fetal infection. The results presented on the first chapter indicated that the search of IgM anti-N. caninum is of very limited help in the detection of the transplacental infection in cattle. In second chapter, was evaluated the susceptibility to infection by N. caninum in different cell cultures, for the purpose of observe the ability in vitro multiplication this agent. For this, eight cell cultures were tested, among the cell cultures tested, four presented good susceptibility to agent: cell lines VERO (yield of 21.2 tachyzoites/cell) and MA-104 (17.1); primary bovine testicle (16.3) and lung cells (13.6). Primary bovine kidney (8.2 tachyzoites/cell), MDBK (5.1) and RK-13 cell lines (0.4) presented moderate to low sensitivity. No viable tachyzoites were detected in the culture of MDCK cells. These results demonstrate that MA-104 cells present adequate susceptibility to N. caninum compared to VERO cells, which have been largely used to multiply the parasite in vitro. Due to the easy manipulation, quick multiplication and relatively low nutritional equirements, these results indicate that MA-104 cells are adequate for multiplication of N. caninum in vitro.
A neosporose é uma doença parasitária de ampla distribuição e com grande importância para a bovinocultura, principalmente pelas perdas reprodutivas que determina. O ciclo do Neospora caninum caracteriza-se por apresentar três estágios infecciosos: os taquizoítos, os cistos teciduais contendo bradizoítos e os oocistos. Suas rotas de transmissão podem ser horizontal e/ou vertical. A infecção vertical ou transplacentária é a forma mais freqüente de infecção, sendo uma importante forma de manutenção do agente nos rebanhos. Com o objetivo de determinar a ocorrência de anticorpos anti-N. caninum em fetos bovinos, foram coletadas 260 amostras de soro em abatedouro localizado no município de Santa Maria, Rio Grande do Sul, Brasil. Para detecção de anticorpos anti-N. caninum, utilizou-se a técnica de imunofluorescência indireta com a presença de imunoglobulinas G e M (IgG e IgM), sendo analisada com ponto de corte de 1:25. Do número total de amostras testadas, 15% (39/260) foram positivas para anticorpos anti-N. caninum. Destas, em 38 (97,4%) foi detectada a presença de IgG anti-N. caninum e em seis (15,4%) de IgM. Em cinco amostras (12,8%) detectaram-se ambos, IgG e IgM. Os resultados reafirmam a capacidade do N. caninum determinar infecção fetal. Os resultados obtidos no primeiro capítulo desta dissertação permitiram demonstrar que a pesquisa de IgM foi de limitada importância na detecção da infecção via transplacentária em soro fetal bovino. No segundo capítulo, foi avaliada a susceptibilidade à infecção pelo N. caninum em diferentes cultivos celulares, com a finalidade de observar a capacidade de multiplicação deste agente in vitro. Para isto, foram testados oito cultivos, sendo que quatro apresentaram boa susceptibilidade a multiplicação pelo N. caninum: células VERO (produção de 21,2 taquizoítos/célula), MA-104 (17,1), cultivo primário de testículo (16,3) e pulmão bovino (13,6). O cultivo primário de rim bovino (8,2), células MDBK (5,1) e RK-13 (0,4) apresentaram baixa sensibilidade, enquanto células MDCK não produziram taquizoítos viáveis. Os resultados obtidos demonstram que as células MA-104 apresentaram susceptibilidade semelhante a das células VERO linhagem tradicionalmente utilizada para o cultivo deste protozoário. Pela facilidade de cultivo e rápida multiplicação, menor exigência nutricional e produção de taquizoítos em níveis semelhantes às células VERO, as células MA-104 demonstraram ser adequadas para a manutenção e multiplicação do N. caninum in vitro.
APA, Harvard, Vancouver, ISO, and other styles
23

Spahn, Christian. "Lebendiger Begriff - begriffenes Leben : zur Grundlegung der Philosophie des Organischen bei G. W. F. Hegel /." Würzburg : Königshausen & Neumann, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=2979996&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Seik, Bettina. "Eine G-DRG-gerechte Steuerung des Krankenhauses mit Hilfe einer Grouper-OLAP-Kalkulations-Box - GOK-BOX." Berlin Logos-Verl, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2865578&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Jungcurt, Nina. "Das Legimitätsproblem der G8 eine Analyse anhand des Legimitätsmodells von Fritz W. Scharpf." Saarbrücken VDM, Müller, 2003. http://deposit.d-nb.de/cgi-bin/dokserv?id=2982887&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Ditze, Stephan-Alexander. "America and the Americans in postwar British fiction an imagological study of selected novels." Heidelberg Winter, 2004. http://deposit.d-nb.de/cgi-bin/dokserv?id=2849617&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Pecina, Björn. "Fichtes Gott : vom Sinn der Freiheit zur Liebe des Seins /." Tübingen : Mohr Siebeck, 2007. http://deposit.ddb.de/cgi-bin/dokserv?id=2824192&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Edinger, Klaus-Peter. "Ökumenisches Krisen-Management wagen: sich der Krise "Fremdsein" stellen gelebte Ökumene einer Dekade Gemeindeaufbau in Deutschland und Südafrika ; mit 26 Längsschnitt-, Fall-Studien, {F-Gesprächen [Phi-Gesprächen] und Gesprächs-Analysen zur Verarbeitung der Krise "Fremdsein" bei Begegnungen "weisser" & "farbiger, schwarzer" Gemeindeglieder & Gemeinden (Gg& G)." Frankfurt am Main Lembeck, 2006. http://deposit.ddb.de/cgi-bin/dokserv?id=2748649&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Reuter, Christina. "Autorschaft als Kondeszendenz : Johann Georg Hamanns erlesene Dialogizität." Berlin de Gruyter, 2005. http://deposit.ddb.de/cgi-bin/dokserv?id=2634304&prov=M&dokv̲ar=1&doke̲xt=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Erchinger, Philipp. "Kontingenzformen : Realisierungsweisen des fiktionalen Erzählens bei Nashe, Sterne und Byron /." Würzburg : Königshausen & Neumann, 2009. http://deposit.d-nb.de/cgi-bin/dokserv?id=3178492&prov=M&dok%5Fvar=1&dok%5Fext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Morat, Daniel. "Von der Tat zur Gelassenheit konservatives Denken bei Martin Heidegger, Ernst Jünger und Friedrich Georg Jünger ; 1920 - 1960." Göttingen Wallstein-Verl, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=2881392&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Ke, Jau-Chuan, and 柯昭川. "Optimal Control of the M/G/1 and G/M/1 Queueing Systems with a Removable Server." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/70428949168136232742.

Full text
Abstract:
博士
國立中興大學
應用數學系
88
In this dissertation, we deal with the optimal control of a single removable server in M/G/1 and G/M/1 queueing systems operating under the N policy in which the server may be turned on at arrival epochs or off at service completion epochs. The server begins service only when the number of customers in the system reaches a certain number, say $N$ $(N \ge 1)$. The supplementary variable technique and the probability generating function technique are used to develop the exact steady-state results for the N policy M/G/1 and G/M/1 queueing systems with infinite capacity. Examples are presented to calculate the steady-state probability distribution of the number of customers in the N policy M/G/1 queueing system for three different service time distributions, including exponential, 2-stage Erlang and 2-state hyperexponential distributions. We provide two special cases in the N policy G/M/1 queueing system, such as the ordinary G/M/1 queueing system and the N policy M/M/1 queueing system. We use the maximum entropy principle to develop the approximate steady-state results for the N policy M/G/1 and G/M/1 queueing systems with infinite capacity. We perform comparative analysis between some exact results and the corresponding approximate results in the N policy M/G/1 queueing system for two different service time distributions, such as exponential and 3-stage Erlang distributions. We also provide comparative analysis between some exact results and the corresponding approximate results in the N policy G/M/1 queueing system for the exponential interarrival time distribution. We study the N policy M/G/1 and G/M/1 queueing systems with finite capacity $L$. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining service (or nterarrival) time, to establish the steady-state probability distributions of the number of customers in two finite queueing systems. To illustrate analytically for the two recursive methods, we present examples of different service time distributions, such as exponential, 3-stage Erlang and deterministic distributions, in the N policy M/G/1 queueing system and exponential interarrival time distribution in the N policy G/M/1 queueing system. We provide the numerical results of system characteristics for different service (or interarrival) time distributions in the N policy M/G/1 and G/M/1 queueing systems, including exponential, 2-stage hyperexponential, 4-stage Erlang and deterministic time distributions.
APA, Harvard, Vancouver, ISO, and other styles
33

Kuo, Ching-Chang, and 郭清章. "Interrelationships between F Policy and N Policy for M/G/1/K and G/M/1/K Queues with Startup Time." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/837p44.

Full text
Abstract:
博士
國立交通大學
工業工程與管理系所
96
This dissertation deals with the interrelationship between F policy and N policy. The F policy queuing problem investigates the most common issue of controlling arrival to a queuing system. The N policy queuing problem investigates the most common issue of controlling service. The optimal control arrival in M/G/1/K and G/M/1/K queues operating under the F policy and startup time is investigated in this dissertation. The definition of F policy is described as following: When the number of customers in the system reaches its capacity K (i.e. the system becomes full), no further arriving customers are allowed to enter the system until there are enough customers who have been served in the system. Consequently, the number of customers in the system decreases to a threshold value F (0<=F=1) for the first time until there are no customers present in the system. At that time, the server needs to take an exponential startup time with parameter γ to start servicing customers in the system. Through a series of the algorithm, the complementary interrelationship between the F policy and N policy queues is obtained. Therefore, the problem of F policy (N policy) queuing system with startup time gives the solution algorithm to the other problem. The two simple examples of 3-stage Erlang and exponential distribution to illustrate the interrelationship are provided.
APA, Harvard, Vancouver, ISO, and other styles
34

"A two priority M/G/1 queue with feedback." Massachusetts Institute of Technology, Operations Research Center, 1988. http://hdl.handle.net/1721.1/5385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Yu-Man, Chen, and 陳鈺曼. "The limiting probabilities for the M/G/1 queue." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/15730118749217505004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Chiang, Ling-Feng, and 姜玲鳳. "Performance Analysis of M/G/1 Queue with Capacity C." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/50469352082595244520.

Full text
Abstract:
碩士
亞洲大學
電腦與通訊學系碩士班
94
In contrast to the conventional queueing system assuming a server can serve custom at a given time, an alternative queueing system in which a server is assumed to be able to serve customs concurrently is proposed in this thesis. In practical applications, the central processor unit with multi-task capacity is a good example of the proposed system. We call this system a queueing system with capacity . This thesis deals with the mathematical analysis of the M/G/1 queue with capacity , with focus on the derivation of mean waiting time for a given set of parameters. In addition, we use the M/M/1 queue to do numerical computation so as to evaluate the impacts of arrival rate and service rate on the mean waiting time and system’s stability.
APA, Harvard, Vancouver, ISO, and other styles
37

Yang, Ze-Zhong, and 楊擇中. "Controllable M/G/1 Queueing System Using Probabilistic Global Search Lausanne." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/85333870839531440821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Hunt, Emma (Emma Thea Hasmik). "Some new algorithms for QBDs and block M/G/1 and GI/M/1 Markov chains / Emma Thea Hasmik Hunt." 2002. http://hdl.handle.net/2440/21850.

Full text
Abstract:
"July 12, 2002"
Bibliography: p. 130-137
viii, 160 leaves ; 30 cm.
Title page, contents and abstract only. The complete thesis in print form is available from the University Library.
Thesis (Ph.D.)--University of Adelaide, Dept. of Applied Mathematics, 2002
APA, Harvard, Vancouver, ISO, and other styles
39

Hunt, Emma (Emma Thea Hasmik). "Some new algorithms for QBDs and block M/G/1 and GI/M/1 Markov chains / Emma Thea Hasmik Hunt." Thesis, 2002. http://hdl.handle.net/2440/21850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Yang, Dong-Yuh, and 楊東育. "M/G/1 Queues with Second Optional Service, Server Breakdowns and Startup." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/61355931100287484833.

Full text
Abstract:
博士
國立交通大學
工業工程與管理系所
98
In this dissertation, we analyze the &lt;N, p>-policy and the &lt;T, p>-policy M/G/1 queues with second optional service, server breakdowns and general startup times. All arrived customers demand the first required service, and only some of the arrived customers demand a second optional service. The server needs a startup time before providing the first required service which follows a general distribution. By &lt;N, p>-policy we mean that the server is turned on when N customers have accumulated, but the server is turned off with probability p as the system becomes empty. The so-called &lt;T, p>-policy queue is characterized by the fact that if at least one customer is present in the queue after T time units have elapsed since the end of the busy period, the server can be switched on with probability p or leaves for a vacation of the same length T with probability (1-p). The main difference between the two randomized policies is that for an &lt;N, p>-policy a decision maker selects actions randomly at completion epoch when there are no customers in the system, whereas for a &lt;T, p>-policy a decision maker selects actions randomly at the beginning epoch of the service when at least one customer appears. For those two queueing systems, we develop various system performances by the convex combination property and the renewal reward theorem. The expected cost functions are established to determine the joint optimal threshold values of (N, p) and (T, p), respectively. Then we obtain the explicit closed-form of the joint optimal solutions for those two policies. Because of sensitivity investigation on the queueing system with critical input parameters may provide some answers for the system analyst. A sensitivity analysis is provided to discuss how the system performances can be affected by the input parameters (or cost parameters) in the investigated queueing service model. For illustration purpose, numerical results are also presented. Furthermore, it is rather difficult to derive the steady-sate probability explicitly for those two queueing systems. The maximum entropy approach has been widely applied in queueing theory to analyze different queueing models. Here, we use this approach to approximate the steady-state probability distributions of the queue length for those two queues. Then the approximate expected waiting time in the queue can be obtained by the maximum entropy solutions. Subsequently, we perform comparative analysis between the approximate results with established exact results for various service time, repair time and startup time distributions with specific parameter values. Our numerical investigations showed that the relative error percentages of the approximate method are quite small. Based on the numerical results, one can demonstrate that the maximum entropy approach is accurate enough and provides a helpful method for analyzing more complicated queueing models.
APA, Harvard, Vancouver, ISO, and other styles
41

王立萍. "Comparative Analysis for the N Policy M/G(G)/1 Queueing System with a Removable and Unreliable Server." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/37194755696347299083.

Full text
Abstract:
碩士
國立中興大學
應用數學系
91
This thesis analyzes a single removable and unreliable server in the N policy M/G/1 queueing system in which the server breaks down according to a Poisson process and the repair time obeys an arbitrary distribution. The maximum entropy method is used to develop the approximate steady-state probability distributions of the N policy M/G(G)/1 queueing system, where the second and the third symbols denote service time and repair time distributions, respectively. A study of the derived approximate results, compared to the exact results for the M/M(M)/1, M/E3(E4)/1, M/H2(H3)/1 and M/D(D)/1 queueing systems, suggest that the maximum entropy principle provides a useful method for solving complex queueing systems.
APA, Harvard, Vancouver, ISO, and other styles
42

"Due-date setting and priority sequencing in a multiclass M/G/1 queue." Massachusetts Institute of Technology, Operations Research Center, 1988. http://hdl.handle.net/1721.1/5081.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

莊思倫. "A maximum entropy principle to the N policy M/G/1 queueing system." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/12553747422775514440.

Full text
Abstract:
碩士
國立中興大學
應用數學系
88
In this thesis, the maximum entropy principle is used to analyze the N policy M/G/1 queueing system. We first derive the steady state solutions for the N policy M/G/1 queueing system by using the maximum entropy principle. Next, we use the derived results to obtain the mean waiting time in the queue. Finally, we present numerical comparisons between the established exact results and the corresponding approximate results to the ordinary M/M/1, M/E2/1, and M/H2/1 queueing systems and the N policy M/M/1, M/E2/1, and M/H2/1 queueing systems.
APA, Harvard, Vancouver, ISO, and other styles
44

Huang, Kai Bin, and 黃凱斌. "Analysis of the M[x]/G/1 Queueing System with Randomized Vacation Policy." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/16714286049999517281.

Full text
Abstract:
博士
國立交通大學
工業工程與管理系所
98
This dissertation examines an M[x]/G/1 queueing system with a randomized vacation policy and at most J vacations. Whenever the system is empty, the server immediately takes a vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1-p. This pattern continues until the number of vacations taken reaches J. If the system is empty by the end of the Jth vacation, the server becomes idle in the system until at least one customer waiting in the queue. In this dissertation, we investigate the following three queueing systems: Reliable server queueing system, un-reliable server queueing system and un-reliable server with a delayed repair queueing system. For the three systems considered in our dissertation, using the supplementary technique, we develop the system size distribution as well as other important system characteristics, such as the system size distribution at busy period initiation epoch, the queue size distribution at a departure epoch, and the distributions of busy period and idle period, etc. Further, for the un-reliable server we also develop main reliability indices of the presented model. Using the renewal reward theorem, a cost model is constructed to determine the optimal randomized vacation policy. Based on the cost model, a heuristic approach is provided to search the joint optimum values of p and J. Some numerical results are presented for illustrative purpose. Our study presents an extension of the existing vacation queueing model and the analysis of the proposed model will provide a useful performance evaluation tool for more general situations arising in real word.
APA, Harvard, Vancouver, ISO, and other styles
45

Li, Hung-Yi, and 李泓毅. "The Tail Probability of The Limiting Distribution of The M/G/1 Queue." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/82371574361065787772.

Full text
Abstract:
碩士
國立交通大學
統計學研究所
94
This thesis is to find the behavior of tail limiting distribution of M/G/1 queue in steady-state. Our method includes embedded Markov chain , and in steady state we could know the period between two consecutive custom departure times are identical distribution , but not independent. We prove the series of period between two consecutive custom departure times are adapted to strong law of large numbers. By using the recursive form we show in this paper that the tail of the probabilities decay geometrically as the number of the customers grow large. Next we extend it to guess the behavior of tail limiting distribution of the general M/G/s Queue.
APA, Harvard, Vancouver, ISO, and other styles
46

Ko, Ming-Yang, and 柯銘揚. "Analysis of the Busy Period for a Controllable M/G/1 System with Bicriterion Policy." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/18219900234514440974.

Full text
Abstract:
博士
國立臺灣科技大學
工業管理系
97
Abstract Busy period is an important system characteristic for the controllable queueing systems. This study mainly for the controllable M/G/1 systems with -policy (bicriterion policy) performs some statistically inference and comparative analysis of the busy period. An operating policy is called a -policy if it prescribes the following conditions: (i) turn the server off when the system becomes empty, (ii) if the server is off and the number of customers in the system reaches the predetermined threshold N, then turn the server on with probability p and leave the server off with probability (1-p), (iii) do not turn the server on at other epochs. This thesis is divided into four major parts. Firstly, we propose an estimator for the expected busy period (denoted by ) of a controllable M/G/1 queueing system in which the server applies a bicriterion policy during his idle period. We show that this estimator is a strongly consistency estimator. From the simulation results, we show that the proposed estimator is a consistent estimator for , which agrees with the theoretical results. Secondly, using this estimator, we construct new confidence intervals for , which are based on five bootstrap methods. Another a numerical simulation study is conducted in order to demonstrate performance of the proposed bootstrap confidence intervals for . Thirdly, we investigate the accuracy of the five bootstrap confidence intervals by calculating the coverage percentage and the relative coverage. Fourthly, we present a sensitivity investigation of the by means of a factorial design statistical analysis. We studies the effect of four important factors (parameters) on . A 24 factorial experimental design is used to evaluate the sensitivity analysis of parameters on the . Based on the analysis of variance, we find the main effect and interaction effect of the significant factors on the system characteristics.
APA, Harvard, Vancouver, ISO, and other styles
47

Chen, Jia-Yu, and 陳家祐. "Cost Optimization and Comparative Analysis of the N Policy M/G/1 Queue with Working Breakdowns." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/21311040665956296064.

Full text
Abstract:
博士
國立中興大學
應用數學系所
103
This dissertation examines a new issue about the N policy queueing model with working breakdowns. The so-called N policy is to turn the server on when N customers are present in the system, and turn the server off only when none is present. In many practical situations, the server breaks down at any time while in operation, and it still works at a lower service rate rather than completely stops service during the breakdown period, which is called working breakdowns. Helping the decision maker to use their own existing equipment to obtain the minimal cost and maximal efficiency is an important goal of ours. How to make a good logistics management is an art. We first study an M/M/1 queue with working breakdowns under the N policy. The server is subject to working breakdowns only when there is at least one customer in the system. We utilize the probability generating function technique to develop the steady-state probabilities of the number of customers in the system as well as several system performance measures. The useful formulae for computing the stability condition is obtained by means of the probability generating function technique. We construct the total expected cost function per unit time and formulate an optimization problem in order to find the minimum cost. The Quasi-Newton’s method is implemented to determine the optimal threshold N, the optimal fast service rate and the optimal slow service rate simultaneously at minimum cost. We present numerical examples to illustrate the Quasi-Newton’s method and perform sensitivity analysis. Next, we deal with the N policy M/G/1 queue with working breakdowns. The supplementary variable and probability generating function techniques are utilized to develop the steady-state probabilities. Conditions for a stable queue, that is steady-state, are provided. The two-stage optimization method is implemented to simultaneously determine the optimal threshold N, and the joint optimal values of the fast service rate and the slow service rate to satisfy the stability constraint at minimum cost. We provide numerical results to illustrate the effectiveness of the two-stage optimization method and perform sensitivity analysis. Finally, we investigate maximum entropy analysis to the N policy M/G/1 queue with working breakdowns. We employ maximum entropy approach with several known constraints to develop the approximate formulae for the steady-state probability distributions of the queue length and the expected waiting time in the queue. We perform a comparative analysis between the approximate results with established exact results for four different service time distributions, such as exponential, 2-stage Erlang, 2-stage hyper-exponential, and deterministic. It is demonstrated from numerical results that the maximum entropy approach is quite accurate for practical purpose, which is a useful method for solving complex queueing systems.
APA, Harvard, Vancouver, ISO, and other styles
48

Hsu, Shu-Wei, and 許書維. "Optimal Control of the N Policy M/G/1 Queue with Server Breakdowns,Startup and Second Optional Service." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/64485416347239373587.

Full text
Abstract:
碩士
中興大學
應用數學系所
95
This paper studies the N policy M/G/1 queue with server breakdowns, startup and second optional service. The service times of the first essential service are assumed to follow a general distribution and that of second optional service with another general distribution. A customer may leave the system either after the first essential service with probability (1-θ) or at the completion of the first essential service may immediately go for a second optional service with probability θ(0<θ<1). When the queue length reaches to a predetermined value N(N>1), the server requires a startup time before providing service until the system is again empty. We analyze various system performance and steady-state results are derived explicitly. The total expected cost per customer per unit time is developed to determine the optimal value N at a minimum cost. Analytic results for sensitivity analysis are also derived.
APA, Harvard, Vancouver, ISO, and other styles
49

Gao, Bin-Chen, and 高斌城. "Optimal control of the < p,N >-policy M/G/1 queue with server vacations, startup and breakdowns." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/32606362765987079048.

Full text
Abstract:
碩士
中興大學
應用數學系所
95
This thesis deals with the optimal control of the < p,N >-policy M/G/1 queue with server vacations, startup and breakdowns. It is assumed that customers arrive following a Poisson process. Service times, startup times and repair times obey general distribution. The server is turned off and takes a vacation when the system is empty. When the server returns from a vacation and finds the number of customers in the waiting line is less than N, he will go on another vacation. Once N or more customers are accumulated in the system, turn the server on with probability p and leave the server off with probability (1-p). If the server is immediately turned on, it is temporarily unavailable to serve the waiting customers. He needs a startup time before providing service until there are no customers in the system. We develop various system performance measures and the total expected cost per unit time, in which p and N are decision variables. An efficient procedure is used to determine the joint optimal threshold values (p*,N*) , so as to minimize the cost function. Keywords: < p,N >-policy, server vacations, a startup time, the joint optimal threshold values, the cost function.
APA, Harvard, Vancouver, ISO, and other styles
50

Huang, Kai-Bin. "A maximum entropy approach for the < p, N >-policy M/G/1 queue with a removable and unreliable server." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0005-1107200610424700.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'M/G/1' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography