Distributed Systems

2021


  1. Multi-Energy Management of Buildings in Smart Grids (), University of Groningen, .

    BibTeX



    urldoi
  2. Automated Service Composition Using AI Planning and Beyond (), Chapter in (M. Aiello, A. Bouguettaya, D. A. Tamburri, W. J. van den Heuvel, eds.), Springer International Publishing, .

    BibTeX



    urldoi
  3. TCEP: Transitions in Operator Placement to Adapt to Dynamic Network Environments. (, , , , and ), In In Journal of Computer and Systems Sciences (JCSS), Special Issue on Algorithmic Theory of Dynamic Networks and its Applications., Elsevier, volume 122, .

    BibTeX



    urldoi
  4. OpenBNG: Central office network functions on programmable data plane hardware (, , , , , , , , , and ), In International Journal of Network Management, Wiley, volume 31, .

    BibTeX



    urldoi
  5. SVNN: an efficient PacBio-specific pipeline for structural variations calling using neural networks (, and ), In BMC bioinformatics, BioMed Central, volume 22, .

    BibTeX



  6. Adaptive On-the-fly Changes in Distributed Processing Pipelines (, , and ), In Frontiers in Big Data, Frontiers, .

    BibTeX



  7. A multi-robot allocation model for multi-object based on Global Optimal Evaluation of Revenue (, , , and ), In International Journal of Advanced Robotic Systems, volume 9, .

    Abstract

    The problem of global optimal evaluation for multi-robot allocation has gained attention constantly, especially in a multi-objective environment, but most algorithms based on swarm intelligence are difficult to give a convergent result. For solving the problem, we established a Global Optimal Evaluation of Revenue method of multi-robot for multi-tasks based on the real textile combing production workshop, consumption, and different task characteristics of mobile robots. The Global Optimal Evaluation of Revenue method could traversal calculates the profit of each robot corresponding to different tasks with global traversal over a finite set, then an optimization result can be converged to the global optimal value avoiding the problem that individual optimization easy to fall into local optimal results. In the numerical simulation, for fixed set of multi-object and multi-task, we used different numbers of robots allocation operation. We then compared with other methods: Hungarian, the auction method, and the method based on game theory. The results showed that Global Optimal Evaluation of Revenue reduced the number of robots used by at least 17%, and the delay time could be reduced by at least 16.23%.


    Keywords: global optimal, multi-robot, path planning, response time, task allocation


    BibTeX



    urldoi
  8. Digital Twins: an enabler for digital transformation ( and ), Chapter in The Digital Transformation handbook, .

    BibTeX



    url
  9. Accelerating the Performance of Data Analytics using Network-centric Processing (), In The 15th ACM International Conference on Distributed and Event-based Systems (DEBS '21), June 28-July 2, 2021, Virtual Event, Italy, ACM New York, NY, USA, .

    BibTeX



    doi
  10. Leveraging Flexibility of Time-Sensitive Networks for dynamic Reconfigurability (, , , , and ), In Proceedings of IFIP Networking 2021, IFIP, .

    BibTeX



    url
  11. Leveraging PIFO Queues for Scheduling in Time-Sensitive Networks (, , , , , and ), In In the Proceedings of the IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN 2021)., IEEE, .

    BibTeX



    urldoi
  12. P4-CoDel: Experiences on Programmable Data Plane Hardware (, , , , and ), In Proceedings of the IEEE International Conference on Communications (ICC 2021): Next-Generation Networking and Internet Symposium, IEEE, .

    BibTeX



    urldoi
  13. Towards QoE-Driven Optimization of Multi-Dimensional Content Streaming (, , , , , , and ), In Proceedings of the Conference on Networked Systems 2021 (NetSys 2021), European Association of Software Science and Technology, .

    BibTeX



    urldoi
  14. "log data compliance" (, , and ), .

    Abstract

    This disclosure relates to a computer analysing log data. The computer receives log data comprising traces having log events from respective process executions. The computer creates a stream of log events, wherein the stream is sorted by the event time. The computer iterates over the stream of log events, and for each log event, executes update functions that define updates of a set of variables based on the log events. The set of variables comprises at least one cross-trace variable to calculate an updated value of the set of variables. The update functions define updates of the cross-trace variable in response to the log events of the traces. The computer further executes evaluation functions on the set of variables to determine compliance in relation to the log data based on the updated value. The evaluation functions represent compliance rules based on the set of variables including the cross-trace variable.


    BibTeX



    urlpdf