UnivTrevesV1, PascalFrancis, Checkpoint, bibRecord, 000865

An EM algorithm for platoon arrival processes in discrete time

Identifieur interne : 000865 ( PascalFrancis/Checkpoint ); précédent : 000864; suivant : 000866

An EM algorithm for platoon arrival processes in discrete time

Auteurs : Lothar Breuer [Allemagne] ; Attahiru Sule Alfa [Canada]

Source :

Operations research letters [ 0167-6377 ] ; 2005.

RBID : Pascal:05-0387140

Descripteurs français

Pascal (Inist)
- Algorithme EM, Processus arrivée, Temps arrivée, Processus temps discret, Processus Markov, En ligne, Réseau file attente, Système attente, Estimation paramètre, Identification système.

English descriptors

KwdEn :
- Arrival process, Arrival time, Discrete time processes, EM algorithm, Markov process, On line, Parameter estimation, Queueing network, Queueing system, System identification.

Abstract

The platoon arrival process (PAP), a special case of Markovian arrival process (MAP), occurs in several practical queueing systems. Developing procedures for estimating its parameters is essential in order to successfully use it for representing arrival processes in real systems. We present an EM-based procedure for estimating the parameters of a PAP.

Affiliations:

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000A47
to stream PascalFrancis, to step Curation: 000447

Links to Exploration step

Pascal:05-0387140

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An EM algorithm for platoon arrival processes in discrete time</title>
<author><name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Mathematics & Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
<author><name sortKey="Alfa, Attahiru Sule" sort="Alfa, Attahiru Sule" uniqKey="Alfa A" first="Attahiru Sule" last="Alfa">Attahiru Sule Alfa</name>
<affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Department of Electrical & Computer Engineering, University of Manitoba</s1>
<s2>Winnipeg Manitoba, R3T 5V6</s2>
<s3>CAN</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Canada</country>
<placeName><settlement type="city">Winnipeg</settlement>
<region type="state">Manitoba</region>
</placeName>
<orgName type="university">Université du Manitoba</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">05-0387140</idno>
<date when="2005">2005</date>
<idno type="stanalyst">PASCAL 05-0387140 INIST</idno>
<idno type="RBID">Pascal:05-0387140</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A47</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000447</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000865</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000865</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An EM algorithm for platoon arrival processes in discrete time</title>
<author><name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Mathematics & Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
<author><name sortKey="Alfa, Attahiru Sule" sort="Alfa, Attahiru Sule" uniqKey="Alfa A" first="Attahiru Sule" last="Alfa">Attahiru Sule Alfa</name>
<affiliation wicri:level="4"><inist:fA14 i1="02"><s1>Department of Electrical & Computer Engineering, University of Manitoba</s1>
<s2>Winnipeg Manitoba, R3T 5V6</s2>
<s3>CAN</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Canada</country>
<placeName><settlement type="city">Winnipeg</settlement>
<region type="state">Manitoba</region>
</placeName>
<orgName type="university">Université du Manitoba</orgName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Operations research letters</title>
<title level="j" type="abbreviated">Oper. res. lett.</title>
<idno type="ISSN">0167-6377</idno>
<imprint><date when="2005">2005</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Operations research letters</title>
<title level="j" type="abbreviated">Oper. res. lett.</title>
<idno type="ISSN">0167-6377</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Arrival process</term>
<term>Arrival time</term>
<term>Discrete time processes</term>
<term>EM algorithm</term>
<term>Markov process</term>
<term>On line</term>
<term>Parameter estimation</term>
<term>Queueing network</term>
<term>Queueing system</term>
<term>System identification</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Algorithme EM</term>
<term>Processus arrivée</term>
<term>Temps arrivée</term>
<term>Processus temps discret</term>
<term>Processus Markov</term>
<term>En ligne</term>
<term>Réseau file attente</term>
<term>Système attente</term>
<term>Estimation paramètre</term>
<term>Identification système</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The platoon arrival process (PAP), a special case of Markovian arrival process (MAP), occurs in several practical queueing systems. Developing procedures for estimating its parameters is essential in order to successfully use it for representing arrival processes in real systems. We present an EM-based procedure for estimating the parameters of a PAP.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0167-6377</s0>
</fA01>
<fA02 i1="01"><s0>ORLED5</s0>
</fA02>
<fA03 i2="1"><s0>Oper. res. lett.</s0>
</fA03>
<fA05><s2>33</s2>
</fA05>
<fA06><s2>5</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>An EM algorithm for platoon arrival processes in discrete time</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>BREUER (Lothar)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>ALFA (Attahiru Sule)</s1>
</fA11>
<fA14 i1="01"><s1>Department of Mathematics & Computer Science, University of Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Electrical & Computer Engineering, University of Manitoba</s1>
<s2>Winnipeg Manitoba, R3T 5V6</s2>
<s3>CAN</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>535-543</s1>
</fA20>
<fA21><s1>2005</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>19373</s2>
<s5>354000124787160140</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2005 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>16 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>05-0387140</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Operations research letters</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>The platoon arrival process (PAP), a special case of Markovian arrival process (MAP), occurs in several practical queueing systems. Developing procedures for estimating its parameters is essential in order to successfully use it for representing arrival processes in real systems. We present an EM-based procedure for estimating the parameters of a PAP.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D01A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Algorithme EM</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>EM algorithm</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Algoritmo EM</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Processus arrivée</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Arrival process</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Proceso llegada</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Temps arrivée</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Arrival time</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Tiempo llegada</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="3" l="FRE"><s0>Processus temps discret</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="3" l="ENG"><s0>Discrete time processes</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Processus Markov</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Markov process</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Proceso Markov</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>En ligne</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>On line</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>En línea</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Réseau file attente</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Queueing network</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Red cola espera</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Système attente</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Queueing system</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Sistema fila espera</s0>
<s5>13</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Estimation paramètre</s0>
<s5>14</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Parameter estimation</s0>
<s5>14</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Estimación parámetro</s0>
<s5>14</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Identification système</s0>
<s5>15</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>System identification</s0>
<s5>15</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Identificación sistema</s0>
<s5>15</s5>
</fC03>
<fN21><s1>269</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
<affiliations><list><country><li>Allemagne</li>
<li>Canada</li>
</country>
<region><li>Manitoba</li>
<li>Rhénanie-Palatinat</li>
</region>
<settlement><li>Trèves (Allemagne)</li>
<li>Winnipeg</li>
</settlement>
<orgName><li>Université de Trèves</li>
<li>Université du Manitoba</li>
</orgName>
</list>
<tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Breuer, Lothar" sort="Breuer, Lothar" uniqKey="Breuer L" first="Lothar" last="Breuer">Lothar Breuer</name>
</region>
</country>
<country name="Canada"><region name="Manitoba"><name sortKey="Alfa, Attahiru Sule" sort="Alfa, Attahiru Sule" uniqKey="Alfa A" first="Attahiru Sule" last="Alfa">Attahiru Sule Alfa</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000865 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000865 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:05-0387140
   |texte=   An EM algorithm for platoon arrival processes in discrete time
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur l'Université de Trèves

An EM algorithm for platoon arrival processes in discrete time

An EM algorithm for platoon arrival processes in discrete time

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri