InforLorV4, Hal, Corpus, bibRecord, 002568

Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems

Identifieur interne : 002568 ( Hal/Corpus ); précédent : 002567; suivant : 002569

Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems

Auteurs : René Schott ; G. Stacey Staples

Source :

Advances in Applied Clifford Algebras [ 0188-7009 ] ; 2015.

RBID : Hal:hal-00603748

English descriptors

mix :
- message routing, operator calculus, semigroup algebras, shortest paths.

Abstract

Classical approaches to routing problems invariably require construction of trees and the use of heuristics to prevent combinatorial explosion. The operator calculus approach presented herein, however, allows such explicit tree constructions to be avoided. Introduced here is the notion of generalized zeon algebras and their associated operator calculus. The inherent combinatorial properties of generalized zeons make them useful for routing problems by implicitly pruning the underlying tree structures. As an application, an operator calculus approach to multi-constrained path problems is described.

Url:

https://hal.archives-ouvertes.fr/hal-00603748

Links to Exploration step

Hal:hal-00603748

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems</title>
<author><name sortKey="Schott, Rene" sort="Schott, Rene" uniqKey="Schott R" first="René" last="Schott">René Schott</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-388679" status="VALID"><orgName>Probabilités et statistiques</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://iecl.univ-lorraine.fr/equipesIECL_probstat.html</ref>
</desc>
<listRelation><relation active="#struct-211251" type="direct"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7502" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-211251" type="direct"><org type="laboratory" xml:id="struct-211251" status="VALID"><idno type="IdRef">180064606</idno>
<idno type="RNSR">199712570F</idno>
<idno type="IdUnivLorraine">[UL]RSB--</idno>
<orgName>Institut Élie Cartan de Lorraine</orgName>
<orgName type="acronym">IECL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Université de Lorraine, Boulevard des Aiguillettes BP 70239 54506 Vandoeuvre-les-Nancy CedexIle du Saulcy - 57 045 Metz Cedex 01</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://iecl.univ-lorraine.fr/</ref>
</desc>
<listRelation><relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7502" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7502" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Staples, G Stacey" sort="Staples, G Stacey" uniqKey="Staples G" first="G. Stacey" last="Staples">G. Stacey Staples</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-25888" status="VALID"><orgName>Department of Mathematics and Statistics - Southern Illinois University</orgName>
<desc><address><addrLine>College of Arts and Sciences ; Southern Illinois University Edwardsville ; Edwardsville, Illinois 62026</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.siue.edu/artsandsciences/math/</ref>
</desc>
<listRelation><relation active="#struct-300932" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300932" type="direct"><org type="institution" xml:id="struct-300932" status="VALID"><orgName>Southern Illinois University Edwardsville</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-00603748</idno>
<idno type="halId">hal-00603748</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00603748</idno>
<idno type="url">https://hal.archives-ouvertes.fr/hal-00603748</idno>
<date when="2015">2015</date>
<idno type="wicri:Area/Hal/Corpus">002568</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems</title>
<author><name sortKey="Schott, Rene" sort="Schott, Rene" uniqKey="Schott R" first="René" last="Schott">René Schott</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-388679" status="VALID"><orgName>Probabilités et statistiques</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://iecl.univ-lorraine.fr/equipesIECL_probstat.html</ref>
</desc>
<listRelation><relation active="#struct-211251" type="direct"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7502" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles><tutelle active="#struct-211251" type="direct"><org type="laboratory" xml:id="struct-211251" status="VALID"><idno type="IdRef">180064606</idno>
<idno type="RNSR">199712570F</idno>
<idno type="IdUnivLorraine">[UL]RSB--</idno>
<orgName>Institut Élie Cartan de Lorraine</orgName>
<orgName type="acronym">IECL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>Université de Lorraine, Boulevard des Aiguillettes BP 70239 54506 Vandoeuvre-les-Nancy CedexIle du Saulcy - 57 045 Metz Cedex 01</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://iecl.univ-lorraine.fr/</ref>
</desc>
<listRelation><relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7502" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect"><org type="institution" xml:id="struct-413289" status="VALID"><idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc><address><addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7502" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Staples, G Stacey" sort="Staples, G Stacey" uniqKey="Staples G" first="G. Stacey" last="Staples">G. Stacey Staples</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-25888" status="VALID"><orgName>Department of Mathematics and Statistics - Southern Illinois University</orgName>
<desc><address><addrLine>College of Arts and Sciences ; Southern Illinois University Edwardsville ; Edwardsville, Illinois 62026</addrLine>
<country key="US"></country>
</address>
<ref type="url">http://www.siue.edu/artsandsciences/math/</ref>
</desc>
<listRelation><relation active="#struct-300932" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-300932" type="direct"><org type="institution" xml:id="struct-300932" status="VALID"><orgName>Southern Illinois University Edwardsville</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
<series><title level="j">Advances in Applied Clifford Algebras</title>
<idno type="ISSN">0188-7009</idno>
<imprint><date type="datePub">2015</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>message routing</term>
<term>operator calculus</term>
<term>semigroup algebras</term>
<term>shortest paths</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Classical approaches to routing problems invariably require construction of trees and the use of heuristics to prevent combinatorial explosion. The operator calculus approach presented herein, however, allows such explicit tree constructions to be avoided. Introduced here is the notion of generalized zeon algebras and their associated operator calculus. The inherent combinatorial properties of generalized zeons make them useful for routing problems by implicitly pruning the underlying tree structures. As an application, an operator calculus approach to multi-constrained path problems is described.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems</title>
<author role="aut"><persName><forename type="first">René</forename>
<surname>Schott</surname>
</persName>
<email>schott@loria.fr</email>
<idno type="halauthor">144065</idno>
<affiliation ref="#struct-388679"></affiliation>
<affiliation ref="#struct-2406"></affiliation>
</author>
<author role="aut"><persName><forename type="first">G. Stacey</forename>
<surname>Staples</surname>
</persName>
<email></email>
<idno type="halauthor">144066</idno>
<affiliation ref="#struct-25888"></affiliation>
</author>
<editor role="depositor"><persName><forename>René</forename>
<surname>Schott</surname>
</persName>
<email>schott@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2011-06-27 11:42:52</date>
<date type="whenWritten">2011-06-27</date>
<date type="whenModified">2016-03-22 09:17:37</date>
<date type="whenReleased">2011-06-27 13:54:05</date>
<date type="whenProduced">2015</date>
<date type="whenEndEmbargoed">2011-06-27</date>
<ref type="file" target="https://hal.archives-ouvertes.fr/hal-00603748/document"><date notBefore="2011-06-27"></date>
</ref>
<ref type="file" subtype="author" n="1" target="https://hal.archives-ouvertes.fr/hal-00603748/file/staceyQoSjune11.pdf"><date notBefore="2011-06-27"></date>
</ref>
</edition>
<respStmt><resp>contributor</resp>
<name key="112746"><persName><forename>René</forename>
<surname>Schott</surname>
</persName>
<email>schott@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">hal-00603748</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00603748</idno>
<idno type="halBibtex">schott:hal-00603748</idno>
<idno type="halRefHtml">Advances in Applied Clifford Algebras, Springer Verlag, 2015</idno>
<idno type="halRef">Advances in Applied Clifford Algebras, Springer Verlag, 2015</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="IECN">IECN - Institut Elie Cartan Nancy</idno>
<idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems</title>
<author role="aut"><persName><forename type="first">René</forename>
<surname>Schott</surname>
</persName>
<email>schott@loria.fr</email>
<idno type="halAuthorId">144065</idno>
<affiliation ref="#struct-388679"></affiliation>
<affiliation ref="#struct-2406"></affiliation>
</author>
<author role="aut"><persName><forename type="first">G. Stacey</forename>
<surname>Staples</surname>
</persName>
<idno type="halAuthorId">144066</idno>
<affiliation ref="#struct-25888"></affiliation>
</author>
</analytic>
<monogr><idno type="localRef">Prépublication de l'Institut Elie Cartan, 2011/18</idno>
<idno type="halJournalId" status="VALID">9674</idno>
<idno type="issn">0188-7009</idno>
<idno type="eissn">1661-4909</idno>
<title level="j">Advances in Applied Clifford Algebras</title>
<imprint><publisher>Springer Verlag</publisher>
<date type="datePub">2015</date>
<date type="dateEpub">2015</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><keywords scheme="author"><term xml:lang="en">operator calculus</term>
<term xml:lang="en">semigroup algebras</term>
<term xml:lang="en">shortest paths</term>
<term xml:lang="en">message routing</term>
</keywords>
<classCode scheme="classification">68W30 ; 81R05</classCode>
<classCode scheme="halDomain" n="math.math-pr">Mathematics [math]/Probability [math.PR]</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Classical approaches to routing problems invariably require construction of trees and the use of heuristics to prevent combinatorial explosion. The operator calculus approach presented herein, however, allows such explicit tree constructions to be avoided. Introduced here is the notion of generalized zeon algebras and their associated operator calculus. The inherent combinatorial properties of generalized zeons make them useful for routing problems by implicitly pruning the underlying tree structures. As an application, an operator calculus approach to multi-constrained path problems is described.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

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

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 002568 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:hal-00603748
   |texte=   Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	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 la recherche en informatique en Lorraine

Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems

Generalized Zeon Algebras: Theory and Application to Multi-Constrained Path Problems

Source :

English descriptors

Abstract

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