Filters








946 Hits in 1.2 sec

Towards Multi-container Deployment on IoT Gateways [article]

Koustabh Dolui, Csaba Kiraly
<span title="2018-10-04">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Stringent latency requirements in advanced Internet of Things (IoT) applications as well as an increased load on cloud data centers have prompted a move towards a more decentralized approach, bringing storage and processing of IoT data closer to the end-devices through the deployment of multi-purpose IoT gateways. However, the resource constrained nature and diversity of these gateways pose a challenge in developing applications that can be deployed widely. This challenge can be overcome with
more &raquo; ... ntainerization, a form of lightweight virtualization, bringing support for a wide range of hardware architectures and operating system agnostic deployment of applications on IoT gateways. This paper discusses the architectural aspects of containerization, and studies the suitability of available containerization tools for multi-container deployment in the context of IoT gateways. We present containerization in the context of AGILE, a multi-container and micro-service based open source framework for IoT gateways, developed as part of a Horizon 2020 project. Our study of containerized services to perform common gateway functions like device discovery, data management and cloud integration among others, reveal the advantages of having a containerized environment for IoT gateways with regard to use of base image hierarchies and image layering for in-container and cross-container performance optimizations. We illustrate these results in a set of benchmark experiments in this paper.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.07753v1">arXiv:1810.07753v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mn3fq3opkjaflp3tnfttvpnljy">fatcat:mn3fq3opkjaflp3tnfttvpnljy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191025034024/https://arxiv.org/pdf/1810.07753v1.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/ae/b8/aeb821f5b740acf09eb3abe1ddecc75566984524.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.07753v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Tree-compositions and orientations

András Frank, Csaba Király
<span title="">2013</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/z7xgofryqjgkxjlwzlky45v4li" style="color: black;">Operations Research Letters</a> </i> &nbsp;
Király).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.orl.2013.03.009">doi:10.1016/j.orl.2013.03.009</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jz4nnujqmndbtgdmm7vwsywyky">fatcat:jz4nnujqmndbtgdmm7vwsywyky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922013327/http://web.cs.elte.hu/%7Efrank/cikkek/FrankJ64.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/47/5d/475d6235f38f2a93840d1a1cd32c8035ff15b4d1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.orl.2013.03.009"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Balanced generic circuits without long paths

Csaba Király, Ferenc Péterfalvi
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/civgv5utqzhu7aj6voo6vc5vx4" style="color: black;">Discrete Mathematics</a> </i> &nbsp;
The authors are also grateful to Bill Jackson for several helpful comments and to Zoltán Király who called their attention to [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2012.03.031">doi:10.1016/j.disc.2012.03.031</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ylplleudtnen5ckbtujhpliasu">fatcat:ylplleudtnen5ckbtujhpliasu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304022301/https://core.ac.uk/download/pdf/82528216.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/26/e2/26e25c5379f9bc20751dfd95a7b6e821a30b6d72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.disc.2012.03.031"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Sufficient conditions for the global rigidity of periodic graphs [article]

Viktoria E. Kaszanitzky, Csaba Kiraly, Bernd Schulze
<span title="2018-04-21">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
the generic global rigidity of body-hinge frameworks with symmetries (where the bodies are connected in pairs by d − 2-dimensional hinges) such as in the (finite) generic version established by Jordán, Király  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.08008v1">arXiv:1804.08008v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wo7s5z3ahbahjbep22x4yrhunq">fatcat:wo7s5z3ahbahjbep22x4yrhunq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909013816/https://arxiv.org/pdf/1804.08008v1.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/eb/1c/eb1cd0b0989286df32b8a6b7071111c552092ba1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1804.08008v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On Maximal Independent Arborescence Packing

Csaba Király
<span title="">2016</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hn6wut4eynat5my6xdfsebg7fm" style="color: black;">SIAM Journal on Discrete Mathematics</a> </i> &nbsp;
In this paper, we generalize the results of Kamiyama, Katoh and Takizawa [7] to solve the following problem. Given a digraph D = (V, A) and a matroid on an abstract set S = {s 1 , . . . , s k } along with a map π : S → V ; give k edgedisjoint arborescences T 1 , . . . , T k with roots π(s 1 ), . . . , π(s k ) such that for any v ∈ V the set {s i : v ∈ T i } is independent and its rank reaches the theoretical maximum. We also give a simplified proof for the result of Fujishige [5] from the result of Kamiyama et al.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/130938396">doi:10.1137/130938396</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xcdo3qld5netzont4qhuat2kge">fatcat:xcdo3qld5netzont4qhuat2kge</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190303174038/http://pdfs.semanticscholar.org/b967/8d9c795ef0beb81f551f71f235e43d4d7867.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/b9/67/b9678d9c795ef0beb81f551f71f235e43d4d7867.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/130938396"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

SenseApp 2015

Csaba Kiraly, Andreas Reinhardt
<span title="">2015</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2zaau7xitzdupllip6mf432p5m" style="color: black;">2015 IEEE 40th Local Computer Networks Conference Workshops (LCN Workshops)</a> </i> &nbsp;
Dr Csaba Kiraly Bruno Kessler Foundation, Trento, Italy Dr Andreas Reinhardt Technische Universität Clausthal, Clausthal-Zellerfeld, Germany Technical Program Committee Zinaida Benenson University of  ...  Kiraly Bruno Kessler Foundation Italy Vinay Kumar Kolar IBM Research India Olaf Landsiedel Chalmers University of Technology Sweden Chieh-Jan Mike Liang Microsoft Research P.R.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lcnw.2015.7365898">doi:10.1109/lcnw.2015.7365898</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/lcn/KiralyR15.html">dblp:conf/lcn/KiralyR15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vaci6h6rcrcnlkprawwrs4n4fu">fatcat:vaci6h6rcrcnlkprawwrs4n4fu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307010601/http://pdfs.semanticscholar.org/d82c/732676d859366d7024b68632ad337e610c7a.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/d8/2c/d82c732676d859366d7024b68632ad337e610c7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/lcnw.2015.7365898"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

On Minimally Highly Vertex-Redundantly Rigid Graphs

Viktória E. Kaszanitzky, Csaba Király
<span title="2015-03-11">2015</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/yxooi3wjmbgqtbp7l4evjeuj4i" style="color: black;">Graphs and Combinatorics</a> </i> &nbsp;
A graph G = (V, E) is called k-rigid in R d if |V | ≥ k + 1 and after deleting any set of at most k − 1 vertices the resulting graph is rigid in R d . A k-rigid graph G is called minimally k-rigid if the omission of an arbitrary edge results in a graph that is not k-rigid. B. Setvatius showed that a 2-rigid graph in R 2 has at least 2|V | − 1 edges and this bound is sharp. We extend this lower bound for arbitrary values of k and d and show its sharpness for the cases where k = 2 and d is
more &raquo; ... ry and where k = d = 3. We also provide a sharp upper bound for the number of edges of minimally k-rigid graphs in R d for all k.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00373-015-1560-3">doi:10.1007/s00373-015-1560-3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kqez7gtcpvd2jfpg4a3rocibs4">fatcat:kqez7gtcpvd2jfpg4a3rocibs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304133826/http://pdfs.semanticscholar.org/c760/8ae488810a8951613b91c077c76e31360944.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/c7/60/c7608ae488810a8951613b91c077c76e31360944.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00373-015-1560-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

BIONETS: BIO-inspired NExt generaTion networkS [chapter]

Iacopo Carreras, Imrich Chlamtac, Hagen Woesner, Csaba Kiraly
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The amount of information in the new emerging all-embracing pervasive environments will be enormous. Current Internet protocol conceived almost forty years ago, were never planned for these emerging pervasive environments. The communications requirements placed by these protocols on the low cost sensor and tag nodes are in direct contradiction to the fundamental goals if these nodes, being small, inexpensive and maintenance free. This situation needs therefore a radically different approach to
more &raquo; ... ommunication in these systems, especially since pervasive and ubiquitous networks are expected to be the key drivers of the all encompassing Internet of the coming decades. The fundamental disparity between the need for extremely dispensable, low cost devices, such as sensors or tags, and increasing communications load per device due to the presence of billions of nodes, that is creating an unbridgeable paradox, is therefore an insurmountable obstacle on the way to adoption when conventional networking architectures are being considered. Biological systems provide insights into principles which can be adopted to completely redefine the basic concepts of control, structure, interaction and function of the emerging pervasive environments. The study of the rules of genetics and evolution combined with mobility, leads to the definition of service oriented communication systems which are autonomous, and autonomously self-adaptive. The objective of this article is to ascertain how this paradigm shift, which views a network only as a randomly self-organizing by-product of a collection of self-optimizing services, may become the enabler of the new world of omnipresent low cost pervasive environments of the future.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11520184_19">doi:10.1007/11520184_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pon6kjbrqfdsfddrxrae47rzha">fatcat:pon6kjbrqfdsfddrxrae47rzha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190226144450/http://pdfs.semanticscholar.org/801e/31daa373043f664083c4eb7ca0e454a9456b.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/80/1e/801e31daa373043f664083c4eb7ca0e454a9456b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11520184_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Virtual museum of congenital heart defects: digitization and establishment of a database for cardiac specimens

Laszlo Kiraly, Balint Kiraly, Krisztian Szigeti, Csaba Zsolt Tamas, Sandor Daranyi
<span title="">2019</span> <i title="AME Publishing Company"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/loautdcoere2pnt4xwr4hiv3yi" style="color: black;">Quantitative Imaging in Medicine and Surgery</a> </i> &nbsp;
Education and training of morphology for medical students, and professionals specializing in pediatric cardiology and surgery has traditionally been based on hands-on encounter with congenitally malformed cardiac specimens. Large international archives are no longer widely available due to stricter data protection rules, a reduced number of autopsies, attrition rate of existing specimens, and most importantly due to a higher survival rate of patients. Our Cardiac Archive houses about 400
more &raquo; ... specimens with congenital heart disease. The collection spans almost 60 years and thus goes back to pre-surgical era. Unfortunately, attrition rate due to desiccation has led to an increased natural decay in recent years. The present multi-institutional project focuses on saving the collection by digitization. Specimens are scanned by high-resolution micro-CT/MRI. Virtual 3D-models are segmented and a comprehensive database is built. We now report an initial feasibility study with six test specimens that provided promising results, however, adequate presentation of the intracardiac anatomy, including septa and cardiac valves requires further refinements. Computer assisted design methods are necessary to overcome consequences of pathological examination, shrinkage and/or distortion of the specimens. For a next step, we anticipate an expandable web-based virtual museum with interactive reference and training tools. Web access for professional third parties will be provided by registration/subscription. In a future phase, segmental wall motion data could be added to virtual models. 3D-printed models may replace actual specimens and serve as hands-on surgical training to elucidate complex morphologies, promote surgical emulation, and extract more accurate procedural knowledge based on such a collection.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21037/qims.2018.12.05">doi:10.21037/qims.2018.12.05</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/30788253">pmid:30788253</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC6351808/">pmcid:PMC6351808</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gp77picz4vdufhyvdwl2s44o3m">fatcat:gp77picz4vdufhyvdwl2s44o3m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191203012452/http://europepmc.org/backend/ptpmcrender.fcgi?accid=PMC6351808&amp;blobtype=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/f0/4b/f04b16d3d7ad206f7e15b1ff04b0849f9eefc698.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.21037/qims.2018.12.05"> <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> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6351808" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Packing of arborescences with matroid constraints via matroid intersection

Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa
<span title="2019-04-02">2019</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o653fqsowvcyrhw6p4gdmpdkwm" style="color: black;">Mathematical programming</a> </i> &nbsp;
Király  ...  Király [21]). Let D = (V , A) be a directed graph, {s 1 , . . . , s k } a multiset of vertices in V , and M a matroid with ground set {s 1 , . . . , s k } and rank function r .  ...  Király [21] ). Let D = (V + s, A) be a rooted digraph, andM 1 = (∂ s (V ), r 1 ) amatroid.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-019-01377-0">doi:10.1007/s10107-019-01377-0</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ch6taw33vffdxjgpudlnnmhc3y">fatcat:ch6taw33vffdxjgpudlnnmhc3y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501125938/https://link.springer.com/content/pdf/10.1007%2Fs10107-019-01377-0.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/07/a9/07a96b14c62d2699bb66d8d46ae451eb76e5c296.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10107-019-01377-0"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Analysis of SIP, RSVP, and COPS Interoperability [chapter]

Csaba Király, Zsolt Pándi, Tien Van Do
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The All-IP network concept with end-to-end QoS provisioning has received particular attention in 3GPP recently. The UMTS proposals, however, have not yet solved some protocol interoperability issues. This paper analyzes the IP Multimedia Subsystem from the aspect of call control, resource reservation and network policing interoperability from the viewpoint of implementations. More specifically, the experiences based on a prototype implementation of the IMS based on SIP, RSVP and COPS are
more &raquo; ... d and conclusions are drawn to support the standardization process, as well as future implementations. The considered architecture is general and can be applied also to fixed IP networks.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36480-3_52">doi:10.1007/3-540-36480-3_52</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r5k5mjevtjcrxlf5wflvhq35fq">fatcat:r5k5mjevtjcrxlf5wflvhq35fq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705060907/http://cntic90.hit.bme.hu/~zspandi/publ/2003/camready4.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/f6/a2/f6a27e7ba77cf9781e58d94b477862a5340c21c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36480-3_52"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Offloading Execution from Edge to Cloud: a Dynamic Node-RED Based Approach [article]

Román Sosa, Csaba Kiraly, Juan D. Parra Rodriguez
<span title="2018-10-26">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Fog computing enables use cases where data produced in end devices are stored, processed, and acted on directly at the edges of the network, yet computation can be offloaded to more powerful instances through the edge to cloud continuum. Such offloading mechanism is especially needed in case of modern multi-purpose IoT gateways, where both demand and operation conditions can vary largely between deployments. To facilitate the development and operations of gateways, we implement offloading
more &raquo; ... ly as part of the IoT rapid prototyping process embedded in the software stack, based on Node-RED. We evaluate the implemented method using an image processing example, and compare various offloading strategies based on resource consumption and other system metrics, highlighting the differences in handling demand and service levels reached.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.11287v1">arXiv:1810.11287v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xhju4ga44jefrgpw5d7uknjovq">fatcat:xhju4ga44jefrgpw5d7uknjovq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200906084818/https://arxiv.org/pdf/1810.11287v1.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/22/c4/22c48163ff727f61490d98e4af3615018f041ecc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1810.11287v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Mapping of quantitative trait loci for ethanol preference in quasi-congenic strains

Csaba Vadasz, Mariko Saito, Andrea Balla, Istvan Kiraly, Csaba Vadasz, Beatrix Gyetvai, Eva Mikics, David Pierson, Donna Brown, James C. Nelson
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pwsciyin5jbqhiqijdvfdc4gdi" style="color: black;">Alcohol</a> </i> &nbsp;
Ethanol preference, a component of alcoholism, has been known for four decades to differ greatly between C57BL/6 and BALB/c inbred mouse strains. For mapping quantitative trait loci (QTLs) that affect ethanol preference , we used a set of B6.C Recombinant QTL Introgression (RQI) strains, which carry about 5% of the donor BALB/cJ (C) genome on a C57BL/6ByJ (B6) background. After characterizing males of the progenitor and RQI strains for variations in ethanol preference, we scanned their genome
more &raquo; ... r polymorphisms at 244 dinucleotide-repeat marker loci known to differ between B6 and C. Because of the introgression of BALB/c-type QTLs onto the B6 background, some strains showed ethanol preference significantly lower or higher than that of the background strain, suggesting that genetic interaction between ethanol preference QTLs and the background can be operative. The genomic region showing the strongest influence on ethanol preference was on mouse chromosome 15, and corresponds to human chr.12 q11-q13.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0741-8329(99)00068-3">doi:10.1016/s0741-8329(99)00068-3</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/10719795">pmid:10719795</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4ch65mfn65dtvb6hjklnrhffm4">fatcat:4ch65mfn65dtvb6hjklnrhffm4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809064627/http://rqigenetics.org/pdf/Vadasz%202000%20Mapping%20of%20quantitative.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/97/a4/97a4c68ff1a778199ad2e90fc9c3129f164d7f98.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0741-8329(99)00068-3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Deadline-Based Differentiation in P2P Streaming

Csaba Kiraly, Renato Lo Cigno, Luca Abeni
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lgc2un3ucjf3fgwb7o42q3s7d4" style="color: black;">2010 IEEE Global Telecommunications Conference GLOBECOM 2010</a> </i> &nbsp;
Splitting a P2P video distribution in multiple media flows with different priorities is an interesting approach for developing flexible and adaptive streaming systems, ranging from VoD to TV. Such an approach can both yield satisfactory quality to all end users and be light in network resources usage, because low-priority flows can be discarded a-priori when target peers do not have enough resources to receive them. This paper focuses on chunk-based video distribution in unstructured meshes,
more &raquo; ... pting a push strategy (the sender takes the scheduling decision) based on buffer map exchange to avoid sending duplicated chunks. A deadline-based scheduling algorithm is proposed, where different flows of chunks are prioritized using different deadline postponing parameters for each flow. Some experimental results show good differentiation properties and streaming performance much better than with strict priority enforcement. Also, PSNR measures on real video streams show improvements compared to both strict priority and single stream distribution.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/glocom.2010.5683450">doi:10.1109/glocom.2010.5683450</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/globecom/KiralyCA10.html">dblp:conf/globecom/KiralyCA10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mzo727mglvea3femfguk2e6r5m">fatcat:mzo727mglvea3femfguk2e6r5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830054641/http://disi.unitn.it/~kiraly/preprints/kiraly-globecom2010-extended.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/36/37/3637c6a1f217db78602194ab50ecb3643538bea5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/glocom.2010.5683450"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

On packing spanning arborescences with matroid constraint

Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin‐ichi Tanigawa
<span title="2019-08-16">2019</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ukzsjb6a6zhyxnjl6nb2mmjc6m" style="color: black;">Journal of Graph Theory</a> </i> &nbsp;
ORCID Csaba Király http://orcid.org/0000-0001-8081-9056 Theorem 1 . 2 ( 12 Durand de Gevigney et al [3]). Let D V s A ( = ( + , ), ) be a matroidrooted digraph.  ...  This conjecture appeared also in a paper of Bérczi, Király, and Kobayashi [2] . More formally, the conjecture is the following.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.22484">doi:10.1002/jgt.22484</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fxw7r3cyjfgktbvhjykhzjy65u">fatcat:fxw7r3cyjfgktbvhjykhzjy65u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200306113517/https://ir.cwi.nl/pub/28836/28836.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/2e/bc/2ebc30f8f58b01c0bc6db74a56a95505e859d6f4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.22484"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 946 results