A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://core.ac.uk/download/pdf/82191500.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Filters
Gossiping Based Distributed Plan Monitoring
<span title="">2013</span>
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a>
</i>
Joint plan execution is gaining momentum due to its benefits in terms of cost effectiveness and operational agility. In this paper, we introduce a lightweight gossip based multi-agent distributed protocol for plan execution monitoring in a dynamic environment characterized by unreliable communication links and exogenous events. The information obtained from the monitoring process can be used as support for detecting plan deviations and applying corrective measures. The contribution of this
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2013.06.015">doi:10.1016/j.procs.2013.06.015</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hr4ytufi7vgjvehfvp6qxpgygy">fatcat:hr4ytufi7vgjvehfvp6qxpgygy</a>
</span>
more »
... consists in the elaboration of an agent centric information sharing mechanism that is resilient to adverse changes in the execution environment by exhibiting a high degree of tolerance to communication errors. The distributed monitoring procedure is elaborated along with a relevant case study and experimental results.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416100105/https://core.ac.uk/download/pdf/82191500.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/06/c906f043692035a0a0faa2096808076e3b20d773.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2013.06.015">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
elsevier.com
</button>
</a>
Towards a Distributed Plan Execution Monitoring Framework
<span title="">2013</span>
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a>
</i>
Distributed monitoring is challenging yet essential in order to address scalability issues observed in the context of large-scale plan execution. A formal framework can be very helpful in analyzing and reasoning about plan specification, execution, and monitoring. In this paper, we elaborate on a distributed monitoring calculus framework that allows specifying and executing plans for multi-agent systems in a distributed environment. The framework allows taking into account a highly dynamic and
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2013.06.144">doi:10.1016/j.procs.2013.06.144</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/itxjnmix5vhcrepqasxvjxkjzy">fatcat:itxjnmix5vhcrepqasxvjxkjzy</a>
</span>
more »
... ncertain environment that can be a contributor to the changing conditions possibly disrupting and causing the plan to fail. Furthermore, the calculus provides sound foundations for designing and evaluating monitoring algorithms and protocols. In order to achieve effective monitoring, we propose an automatabased approach, inspired by runtime security verification research initiatives. The proposed automata allow enforcing monitoring properties while the given plan is executed at the agent's side.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416173901/https://core.ac.uk/download/pdf/82621695.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/e5/a3/e5a3773b191a6469872d6d60879391ec3eb40d51.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2013.06.144">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
elsevier.com
</button>
</a>
The multi-depot split-delivery vehicle routing problem: Model and solution algorithm
<span title="">2014</span>
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w5jcgie76rehrmy3uf2hriydla" style="color: black;">Knowledge-Based Systems</a>
</i>
Logistics and supply-chain management may generate notable operational cost savings with increased reliance on shared serving of customer demands by multiple agents. However, traditional logistics planning exhibits an intrinsic limitation in modeling and implementing shared commodity delivery from multiple depots using multiple agents. In this paper, we investigate a centralized model and a heuristic algorithm for solving the multi-depot logistics delivery problem including depot selection and
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.knosys.2014.08.006">doi:10.1016/j.knosys.2014.08.006</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qdclxjq5ong7roulvmw5huw6w4">fatcat:qdclxjq5ong7roulvmw5huw6w4</a>
</span>
more »
... hared commodity delivery. The contribution of the paper is threefold. First, we elaborate a new integer linear programming (ILP) model, namely: Multi-Depot Split-Delivery Vehicle Routing Problem (MDSDVRP) which allows establishing depot locations and routes for serving customer demands within the same objective function. Second, we illustrate a fast heuristic algorithm leveraging knowledge gathering in order to find near-optimal solutions. Finally, we provide performance results of the proposed approach by analyzing known problem instances from different VRP problem classes. The experimental results show that the proposed algorithm exhibits very good performance when solving small and medium size problem instances and reasonable performance for larger instances.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829124313/http://cradpdf.drdc-rddc.gc.ca/PDFS/unc171/p801217_A1b.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/aa/50/aa5044421df1db9a72ab8bc4e70a0931916b8cda.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.knosys.2014.08.006">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
elsevier.com
</button>
</a>
Optimization of DND Multi-Depot Split-Load Pickup-Delivery Problem
<span title="">2019</span>
<i title="EDP Sciences">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4vlgvitw6fcmbay5hkyo2s2ime" style="color: black;">MATEC Web of Conferences</a>
</i>
This paper presents a solution approach to optimize vehicle routes for a multi-depot, multi-vehicle, pickup and delivery problem over a large ground transportation network. More precisely, we address ground transportation of orders for the Canadian Department of National Defence using heterogeneous vehicle fleets. The fleets consist of limited number of organizational vehicles hosted at pre-established depots and commercial order delivery services. The proposed approach involves leveraging an
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/matecconf/201929602009">doi:10.1051/matecconf/201929602009</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zylxdbh7rjgdvivfdk3u4qxwli">fatcat:zylxdbh7rjgdvivfdk3u4qxwli</a>
</span>
more »
... sertion cost gradient-descent heuristic followed by a greedy randomized adaptive search procedure. Experimental results generated using the historical orders of the organization indicate that the developed approach is effective in handling a wide range of scenarios and may generate near-optimal vehicle routes with an annual transportation cost reduction between 7.7% and 16.7%.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200208114138/https://www.matec-conferences.org/articles/matecconf/pdf/2019/45/matecconf_ictle19_02009.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/57/fe574df811431aee7c2fd371e5e0c1e63f2e9761.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/matecconf/201929602009">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
Publisher / doi.org
</button>
</a>
Control Flow Based Pointcuts for Security Hardening Concerns
[chapter]
<i title="Springer US">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/aiww23eosrc6bll4cpm2cdc3wu" style="color: black;">IFIP International Federation for Information Processing</a>
</i>
In some cases, little can be done to improve the situation, Laverdiere, Mourad, Soeanu, Debbabi especially for Commercial-Off-The-Shelf (COTS) software products that are no longer supported, or for in-house ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-73655-6_20">doi:10.1007/978-0-387-73655-6_20</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ifiptm/LaverdiereMSD07.html">dblp:conf/ifiptm/LaverdiereMSD07</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c75epgbvtbgddp7flryh645h5m">fatcat:c75epgbvtbgddp7flryh645h5m</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030094735/https://link.springer.com/content/pdf/10.1007%2F978-0-387-73655-6_20.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/06/ab/06ab61bb0c00533b1f1b21be8d56e683b765ca97.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-73655-6_20">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>
Page 7406 of Mathematical Reviews Vol. , Issue 2000j
[page]
<span title="">2000</span>
<i title="American Mathematical Society">
<a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a>
</i>
See also «00024.
78A General
2000)j:78002 78A25 53B50 Udriste, Constantin (R-PUB-M1; Bucharest) ; Postolache, Mihai (R-PUB-M1; Bucharest) ; Soeanu, Andrei (R-PUB-M1; Bucharest) Computer simulation of magnetic ...
<span class="external-identifiers">
</span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-10_2000j/page/7406" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Archive [Microfilm]
<div class="menu fulltext-thumbnail">
<img src="https://archive.org/serve/sim_mathematical-reviews_2000-10_2000j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
Page 4404 of Mathematical Reviews Vol. , Issue 2000f
[page]
<span title="">2000</span>
<i title="American Mathematical Society">
<a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a>
</i>
20001: 78009
2000f:78009 78A25 53C80
Udriste, Constantin (R-PUB-M1; Bucharest) ;
Postolache, Mihai (R-PUB-M1; Bucharest) ;
Soeanu, Andrei (R-PUB-M1; Bucharest)
Computer simulation of magnetic phase portraits ...
<span class="external-identifiers">
</span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-06_2000f/page/4404" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Archive [Microfilm]
<div class="menu fulltext-thumbnail">
<img src="https://archive.org/serve/sim_mathematical-reviews_2000-06_2000f/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
Page 3490 of Mathematical Reviews Vol. , Issue 2000e
[page]
<span title="">2000</span>
<i title="American Mathematical Society">
<a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a>
</i>
Nerantzi, Symmetric invariant non-degenerate bilin- ear forms on nilpotent Lie algebras (124-129); Constantin Udriste,
53 DIFFERENTIAL GEOMETRY
3490
Mihai Postolache and Andrei Soeanu, Computer simulation ...
<span class="external-identifiers">
</span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-05_2000e/page/3490" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Archive [Microfilm]
<div class="menu fulltext-thumbnail">
<img src="https://archive.org/serve/sim_mathematical-reviews_2000-05_2000e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
Page 2159 of Mathematical Reviews Vol. 32, Issue Index
[page]
<i title="American Mathematical Society">
<a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a>
</i>
(English summary) 2000j:78002
— (with Postolache, Mihai; Soeanu, Andrei) Computer simulation of magnetic phase portraits and geometric dynamics around piecewise rectilinear circuits. ...
M., (2000m:35005)
Udriste, Constantin (with Postolache, Mihai; Soeanu, Andrei) Computer simulation of magnetic phase portraits and geometric dynamics around piecewise rectilinear circuits. ...
<span class="external-identifiers">
</span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000_32_index_3/page/2159" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Archive [Microfilm]
<div class="menu fulltext-thumbnail">
<img src="https://archive.org/serve/sim_mathematical-reviews_2000_32_index_3/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
Page 1285 of Mathematical Reviews Vol. 32, Issue Index
[page]
<i title="American Mathematical Society">
<a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a>
</i>
(English summary) [Time-like connections] 2000e:53019
Shabanov, Sergei V. see Maulbetsch, Christian, 2000h:83078
Soeanu, Andrei see Udriste, Constantin et al., 2000):78002
Stavrinos, Panayiotis C. ...
(English summary) 2000m:83097
Udriste, A. see Udriste, Constantin et al., 2000i:78012a and 2000i:78012b
Udriste, Constantin (with Postolache, Mihai; Soeanu, Andrei) Computer simulation of magnetic phase ...
<span class="external-identifiers">
</span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000_32_index_2/page/1285" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Archive [Microfilm]
<div class="menu fulltext-thumbnail">
<img src="https://archive.org/serve/sim_mathematical-reviews_2000_32_index_2/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
Risk variables in evaluation of transport projects
<span title="">2017</span>
<i title="IOP Publishing">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ze5oxgkzabgozpk5uwjjucu7sa" style="color: black;">IOP Conference Series: Materials Science and Engineering</a>
</i>
Andrei Soeanu and collective pursued more attention to problematic of risks in paper Transportation risk analysis using probabilistic model checking. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1757-899x/236/1/012112">doi:10.1088/1757-899x/236/1/012112</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3lswfsaevjalxdgqopxusesl64">fatcat:3lswfsaevjalxdgqopxusesl64</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200309163022/https://dspace.vutbr.cz/xmlui/bitstream/handle/11012/137160/Varbuchta_2017_IOP_Conf._Ser.__Mater._Sci._Eng._236_012112.pdf;jsessionid=C26484AAF3500336956B670B05087CB1?sequence=4" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/4f/5d/4f5dc7701d5fd5aaac0981f405e23cbe943950c8.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1088/1757-899x/236/1/012112">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
iop.org
</button>
</a>
Page 1942 of Mathematical Reviews Vol. 32, Issue Index
[page]
<i title="American Mathematical Society">
<a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a>
</i>
Udriste
— (with Postolache, Mihai; Soeanu, Andrei) Computer simulation of magnetic phase portraits and geometric dynamics around piecewise rectilinear circuits. ...
Lychagin) 2000i:78012b 78A30 (53B50)
— (with Postolache, Mihai; Soeanu, Andrei) Computer simulation of magnetic phase portraits and geometric dynamics around piecewise rectilinear circuits. ...
<span class="external-identifiers">
</span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000_32_index_0/page/1942" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Archive [Microfilm]
<div class="menu fulltext-thumbnail">
<img src="https://archive.org/serve/sim_mathematical-reviews_2000_32_index_0/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
Reasoning About a Simulated Printer Case Investigation with Forensic Lucid
[chapter]
<span title="">2012</span>
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jajl7qtqc5cy7oavratsldrv2y" style="color: black;">Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering</a>
</i>
Thanks to Andrei Soeanu for presenting this work at ICDF2C 2011 on behalf of the authors. ...
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-35515-8_23">doi:10.1007/978-3-642-35515-8_23</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3la6ofpa5zg77ar7tgbw4g75oq">fatcat:3la6ofpa5zg77ar7tgbw4g75oq</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829233808/http://spectrum.library.concordia.ca/973949/1/flucid-printer-case-arXiv.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/10/70/1070a5c99eb487394fa92169b96feb9e246468d1.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-35515-8_23">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>