March 2024 - FMIndia - example.com

IARCS Verification Seminar Series -- Talk by Azadeh Farzan on April 2 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Azadeh Farzan, a Professor in the Computer Science Department of University of Toronto. The talk is scheduled on Tuesday, April 02, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NGxmbmFvYX…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/), and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Coarser Equivalences for Causal Concurrency Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: In this talk, I will discuss relaxations of trace equivalence with the goal of maintaining its algorithmic advantages. Specifically, for the problem of checking, in a streaming setting, if two arbitrary steps of a concurrent program run are causally concurrent (i.e. they can be reordered in an equivalent run) or causally ordered (i.e. they always appear in the same order in all equivalent runs), trace equivalence yields constant-space algorithms. I will discuss how certain relaxations, provably, do not yield similar efficient algorithms. Then, I will introduce a new commutativity-based notion of equivalence called grain equivalence that is strictly more relaxed than trace equivalence, and yet yields a constant space algorithm for the same problem. This notion of equivalence uses commutativity of grains, which are sequences of atomic steps, in addition to the standard commutativity from trace theory. I will discuss two distinct cases when the grains are contiguous subwords of the input program run and when they are not, formulate the precise definition of causal concurrency in each case, and show that they can be decided in constant space, despite being strict relaxations of the notion of causal concurrency based on trace equivalence. Bio: Azadeh Farzan is a Professor in the Computer Science Department of University of Toronto. She received her PhD from the University of Illinois at Urbana-Champaign. Her interests are in Software Verification, Programming Languages, Formal Methods, and Security, with an emphasis on concurrency-related issues.

1 month, 3 weeks

1
0
0 0

IEEE DASC 2024-Call for Papers-Deadline 15 Jun 2024

by Qin Liu

Please accept our apologies if you receive multiple copies of IEEE DASC 2024 Preliminary Call for Papers (CFPs). =====================CALL FOR PAPERS============================= The 22nd IEEE International Conference on Dependable, Autonomic and Secure Computing IEEE DASC 2024 http://cyber-science.org/2024/dasc/ joint conference IEEE DASC/PICom/CBDCom/CyberSciTech 2024 5-8 November 2024 - Boracay Island, Malay, Philippines =====================INTRODUCTION============================= As computer and communication systems, and other systems such as Cyber-Physical Systems (CPS), Internet of Things (IoT), and Autonomous Robotic Systems, become increasingly large and complex, their Dependability and Security play critical roles in supporting next-generation science, engineering, and commercial applications. It remains a challenge to design, analyze, evaluate, and improve the dependability and security of a large-scale computing environment. Trusted and autonomic computing/autonomous systems need synergistic research efforts covering many disciplines, from natural sciences to social sciences. It requires scientific and technological advances in a variety of fields, as well as new software, architectures, and communication technology that support the integration of the constituent technologies. IEEE DASC 2024 will be held during November 5-8, 2024, in Boracay Island, Malay, Philippines, co-located with IEEE CyberSciTech 2024, IEEE PICom 2024, and IEEE CBDCom 2024. It aims to bring together computer scientists, industrial engineers, and researchers to discuss and exchange theoretical and implementation results, novel designs, work-in-progress, experience, case studies, and trend-setting ideas in the areas of dependability, security, trust, and/or autonomic computing, and autonomous systems. =====================TRACKS AND TOPICS============================= - Track 1: Dependable and Fault-tolerant Computing - Track 2: Network and System Security and Privacy - Track 3: Autonomic Computing and Autonomous Systems - Track 4: Industrial Applications and Emerging Techniques - Track 5: Autonomic and Secure Computing with AI/ML Topics of interest include, but are not restricted to: - Self-Organization and Organic Computing - Cognitive Computing and Self-Aware Computing - Energy Management in Autonomic Computing and Autonomous Systems - Dependable & Fault-tolerant Computing in Big Data, CPS, IoT, SDN, and Real-time System - Hardware and Software Reliability, Verification and Testing - Security and Privacy in Cloud/Fog/Edge Computing, Mobile and Pervasive Computing, Big Data, CPS and IoT systems - Artificial Intelligence Techniques in Network and System Security and Privacy - Autonomic and Autonomous Issues in Cloud/Fog/Edge Computing, Mobile and Pervasive Computing, Big Data, CPS and IoT systems - Software/Apps/Tools Development for Dependable and Secure Applications - IoT and Sensor Network, Big Data, Smart Grid, Aerospace, Transportation Applications =====================IMPORTANT DATES========================== Paper Submission Due: 15 Jun 2024 Authors Notification: 15 Aug 2024 Camera-ready Submission: 15 Sep 2024 =====================SUBMISSION INSTRUCTION=================== Authors are invited to submit their original research work that has not previously been submitted or published in any other venue. Regular, work-in-progress (WiP), workshop, and special session papers need to be submitted in IEEE CS Proceedings format. IEEE formatting info: http://www.ieee.org/conferences_events/conferences/publishing/templates.html All the accepted papers will be published by IEEE in the Conference Proceedings (IEEE-DL and EI indexed). Best Paper Awards will be presented to high quality papers. Selected papers will be recommended to prestigious journal Special Issues. Some papers originally submitted as full papers can be accepted as short papers during the review process. In such cases, the authors will need to reduce the paper accordingly when preparing the camera-ready version. At least one of the authors of any accepted paper is requested to register and present the paper at the conference. Regular Tracks: 6-8 pages - WiP/Workshop/Special Session Tracks: 4-6 pages =====================ORGANIZING COMMITTEE============================= -Honorary Chairs- - Tadashi Dohi, Hiroshima University, Japan - Mohammed Atiquzzaman, Univ. of Oklahoma, USA -General Chairs- - Zakirul Alam Bhuiyan, Fordham University, USA - Kenichi Kourai, Kyushu Inst. of Tech., Japan -General Executive Chairs- - Moayad Aloqaily, Mohamad Bin Zayed Univ., UAE - Bernady O. Apduhan, Kyushu Sangyo Univ., Japan -Program Chairs- - Wenjia Li, New York Institute of Technology, USA - Aniello Castiglione, University of Salerno, Italy -Program Co-chairs- - Mohamed Rahouti, Fordham University, USA - Wei Wang, Beijing Jiaotong University, China - Adnan Anwar, Deakin University, Australia - Shan Jiang, The Hong Kong Polytechnic University, Hong Kong - Changqing Luo, Virginia Commonwealth Univ., USA - Lei Chen, Georgia Southern University, USA -Workshop & Special Session Chairs- - Preeti Mishra, Doon University, India - Arafatur Rahman, University of Wolverhampton, UK -WiP & LBI Chairs- - Saqib Ali, Univ. of Agri. Faisalabad, Pakistan - Mrinal Kanti Bhowmik, Tripura University, India -Publicity Chairs- - Mubashir Rehmani, Cork Inst. of Tech., Ireland - Junjun Zheng, Hiroshima University, Japan - Qin Liu, Hunan University, China - Senthil Kumar, Mepco Schlenk Eng. College, India - Yuhong Liu, Santa Clara University, USA -Steering Committee- - Jianhua Ma, Hosei University, Japan - Laurence T. Yang, St. Francis Xavier Univ., Canada - Yuanshun Dai, Univ. of Elec. Sci. & Tech. of China, China - Tadashi Dohi, Hiroshima University, Japan - Zakirul Alam Bhuiyan, Fordham University, USA Program Committee: Please check the "Program Committee" web page on the conference website for details: http://cyber-science.org/2024/dasc/tpc/ Contact: Please email inquiries concerning DASC 2024 to Prof. Zakirul Alam Bhuiyan: zakirulalam AT gmail DOT com. -- Dr. Qin Liu College of Computer Science and Electronic Engineering Hunan University Changsha, Hunan Province,P.R. China, 410082 Mobile: +86-13548577157 Email: gracelq628(a)hnu.edu.cn; gracelq628(a)126.com Homepage: https://qinliu-hnu.github.io/

1 month, 3 weeks

1
0
0 0

QEST+FORMATS: Final Call for Papers

by Patrick Totzke

======================================================== FINAL CALL FOR PAPERS ======================================================== The joint event for the International Conferences on Quantitative Evaluation of SysTems (QEST) and on Formal Modeling and Analysis of Timed Systems (FORMATS) 9-13 September 2024, Calgary, Canada, as part of the CONFEST 2024 umbrella conference https://www.qest-formats.org/ IMPORTANT DATES (UPDATED) Abstract deadline: 10 April 2024 (Anytime on Earth) Paper deadline: 15 April 2024 (Anytime on Earth) Author notification: 31 May 2024 Camera ready submission: 17 June 2024 Conference: 9-13 September 2024 SCOPE AND TOPICS The two flagship conferences of QEST (International Conference on Quantitative Evaluation of SysTems) and FORMATS (International Conference on Formal Modeling and Analysis of Timed Systems) are pursuing a strategic process of joining forces and sparking a new joint conference for quantitative modelling, analysis, and verification. This year, the two conferences form the QEST+FORMATS joint conference in 2024, which will be held on 9-13 September 2024 in Calgary, Canada, as part of the CONFEST 2024 umbrella conference. The joint conference is the leading forum for the quantitative evaluation and verification of systems, which aims to promote the study of fundamental and practical aspects of systems with quantitative nature (such as probability, timing, and cost), and brings together researchers from different disciplines that share interests in the modelling, design and analysis of computational systems. Systems of interest include biological and chemical systems; computer networks; cyber-physical systems; critical infrastructures; data-driven AI systems; energy systems; hardware and software systems; industrial systems; and mobility networks. The QEST+FORMATS joint conference also aims to attract researchers interested in real-time issues in hardware design, performance analysis, real-time software, scheduling, semantics and verification of timed, hybrid and probabilistic systems. Topics and scientific areas of interest include: - Models and metrics for the correctness, performance, reliability, safety, and security of systems (stochastic, probabilistic, and non-deterministic models including Markov chains, Markov decision processes, automata, Petri nets, process algebra, max-plus algebra, and their variations); - Languages and methods for the specification of quantitative properties of systems; - Techniques, algorithms, and data structures for analysis, evaluation, and verification of the models mentioned above, e.g., for model checking, testing, constraint solving, scheduling, optimization, and worst-case execution time analysis; - Quantitative and probabilistic aspects of programming; - Data-driven and machine-learning techniques for the analysis, prediction, and verification of quantitative properties of systems; - Case studies that highlight the role of quantitative specification, modelling, and evaluation in the design and analysis of systems, with emphasis on emerging problems and technologies; - Novel software tools to support the practical application of research results in all of the above areas; The joint QEST+FORMATS conference is open to theoretical, experimental, and applicative research and will set up an artifact evaluation process. Papers may advance the state of the art on empirical approaches, simulation methods, analysis techniques, and applications to industrially relevant case studies. The joint conference will have two tracks associated with QEST and FORMATS. The authors are required to select one of these tracks when submitting their papers. This is only used to facilitate the review process. This year, QEST+FORMATS will incorporate a special session on: - Data-driven verification and synthesis of cyber-physical systems. We encourage the submission of papers on all data-driven approaches related to the formal analysis, verification, and synthesis of cyber-physical systems, including learning techniques for safety-critical systems and safe learning of such systems. SUBMISSIONS QEST+FORMATS 2024 considers three types of papers (authors will be able to specify the type of contribution upon submission): - Research papers: Theoretical, methodological, and application-based contributions that advance the understanding on a topic or issue, describe the development of new analysis processes and techniques, or apply quantitative methods to relevant case studies. - Tool papers: New tools and the formalisms they support. focusing on the software architecture and practical implementation and use. Tool papers must be accompanied by an artifact in the Artifact Evaluation. - Work-in-progress papers: We offer an opportunity to present preliminary results and receive feedback from the community. Work-in-progress contributions are not required to be fully worked-out approaches, for example regarding validation or technical depth; however the presented ideas should be mature enough to appreciate soundness and how they advance our knowledge. Research and tool papers can be regular or short: - Regular papers must not exceed 14 pages, excluding references. - Short papers should be limited to 7 pages, also excluding references. All papers can have an appendix containing supporting material. Note that reviewers are not required to read the appendix to fully assess the merits of the paper. Work-in-progress papers must not exceed 4 pages including references. All papers must be submitted in Springer’s LNCS format. All submitted papers must be unpublished and not be submitted for publication elsewhere. Papers should be submitted electronically using EasyChair: https://easychair.org/conferences/?conf=qestformats2024 Springer encourages authors to include their ORCIDs in their papers. Authors should consult Springer’s authors’ guidelines and use Springer’s LaTeX templates for the preparation of their papers. Submitted papers not complying with the above guidelines may be rejected without undergoing review. The top two best papers of the conference will be selected for the QEST Award and the FORMATS Oded Maler Award. PUBLICATIONS All accepted papers will be presented and discussed at the conference by one of the authors. The QEST+FORMATS 2024 proceedings will be published in the Springer LNCS series and indexed by ISI Web of Science, Scopus, ACM Digital Library, dblp, Google Scholar. All submitted papers will be evaluated by at least three reviewers on the basis of their originality, technical quality, scientific or practical contribution to the state of the art, methodology, clarity, and adequacy of references. ARTIFACT EVALUATION Reproducibility of experimental results is crucial to foster an atmosphere of trustworthy, open, and reusable research. To improve and reward reproducibility, QEST+FORMATS 2024 includes a dedicated Artifact Evaluation (AE). Submission of an artifact is mandatory for tool papers (both regular and short), and optional but encouraged for research papers where it can support the results presented in the paper. Artifacts will be reviewed concurrently with the paper review process, and accepted papers with a successfully evaluated artifact will receive a badge to be shown on the published paper's title page. Detailed guidelines for preparation and submission of artifacts will be available on the conference website. Exceptions to the submission guidelines may be granted by the PC chairs in cases where the tool cannot in any reasonable way be run by the AE committee. SPECIAL ISSUES A selection of the best papers (excluding work-in-progress papers) will be invited to submit an extended version of their work to special issues in the International Journal on Software Tools for Technology Transfer (STTT) and the Performance Evaluation (PEVA) journals. COMMITTEES Program Chairs Jane Hillston, Edinburgh University, UK Sadegh Soudjani, Max Planck Institute, Germany Track Chairs Morteza Lahijanian, UC Boulder, USA (QEST) Masaki Waga, Kyoto University, Japan (FORMATS) Publicity Chairs Jyotirmoy Deshmukh, University of Southern California, USA Patrick Totzke, University of Liverpool, UK Jie An, National Institute of Informatics (NII) in Tokyo, Japan Artifact Evaluation Chairs Tobias Meggendorfer, Lancaster University Leipzig, Germany Andrea Vandin, Sant'Anna School for Advanced Studies, Italy For any questions, feel free to contact the program chairs Jane Hillston (Jane.Hillston(a)ed.ac.uk) and Sadegh Soudjani (sadegh(a)mpi-sws.org).

1 month, 3 weeks

1
0
0 0

IARCS Verification Seminar Series -- Talk by Suman Sadhukhan on March 19 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Suman Sadhukhan, a postdoctoral researcher at University of Haifa. The talk is scheduled on Tuesday, March 19, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=M2xsZmdnaG…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/), and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Bidding Games on Graphs - In theory and in practice. Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: In a two-player zero-sum graph game, the players move a token throughout the game, producing an infinite play, which determines the winner of the game. Bidding games are graph games in which in each turn, a bidding (auction) determines which player moves the token: the players have budgets, and in each turn, both players simultaneously submit the bids that do not exceed the available budgets. The higher bidder moves the token, and pays the bid to the lower bidder (called Richman bidding). The standard solution concept of interest in bidding games are threshold budgets: the necessary and sufficient budget for winning the game. In this survey talk, on the theoretical side, we will explore discrete bidding games, where the keyword discrete stands for the bids having a fixed granularity. We obtain membership in NP ∩ coNP for solving parity bidding games with exponentially succinct representation. This will be followed by our newly proposed application of bidding games to a decentralized synthesis problem for multi-objective decision making. Here, synthesized policies express their scheduling urgency via bids and a bounded budget guarantees long-run fairness. Moreover, our proposed solution framework is modular, in the sense that if one objective changes, we may still combine the policy for the other objective without having the need to recompute it from scratch. These works have been in collaboration with Guy Avni and Kaushik Mallik. Bio: Suman Sadhukhan is currently a postdoctoral researcher at the University of Haifa, primarily working with Guy Avni on Bidding Games on Graphs. He obtained his PhD in 2022 from Inria Rennes where he was advised by Nathalie Bertrand, Nicolas Markey and Ocan Sankur, and worked on dynamic network congestion games from a verification perspective. He is interested in, but not restricted to, Games on Graphs, studying different game theoretic models from formal verification and reactive synthesis viewpoint. Prior to his PhD training, he was a student at Chennai Mathematical Institute where he studied Theoretical Computer Science and Mathematics.

2 months

1
0
0 0

IARCS Verification Seminar Series -- Talk by Suman Sadhukhan on March 19 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Suman Sadhukhan, a postdoctoral researcher at University of Haifa. The talk is scheduled on Tuesday, March 19, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=M2xsZmdnaG…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/), and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Bidding Games on Graphs - In theory and in practice. Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: In a two-player zero-sum graph game, the players move a token throughout the game, producing an infinite play, which determines the winner of the game. Bidding games are graph games in which in each turn, a bidding (auction) determines which player moves the token: the players have budgets, and in each turn, both players simultaneously submit the bids that do not exceed the available budgets. The higher bidder moves the token, and pays the bid to the lower bidder (called Richman bidding). The standard solution concept of interest in bidding games are threshold budgets: the necessary and sufficient budget for winning the game. In this survey talk, on the theoretical side, we will explore discrete bidding games, where the keyword discrete stands for the bids having a fixed granularity. We obtain membership in NP ∩ coNP for solving parity bidding games with exponentially succinct representation. This will be followed by our newly proposed application of bidding games to a decentralized synthesis problem for multi-objective decision making. Here, synthesized policies express their scheduling urgency via bids and a bounded budget guarantees long-run fairness. Moreover, our proposed solution framework is modular, in the sense that if one objective changes, we may still combine the policy for the other objective without having the need to recompute it from scratch. These works have been in collaboration with Guy Avni and Kaushik Mallik. Bio: Suman Sadhukhan is currently a postdoctoral researcher at the University of Haifa, primarily working with Guy Avni on Bidding Games on Graphs. He obtained his PhD in 2022 from Inria Rennes where he was advised by Nathalie Bertrand, Nicolas Markey and Ocan Sankur, and worked on dynamic network congestion games from a verification perspective. He is interested in, but not restricted to, Games on Graphs, studying different game theoretic models from formal verification and reactive synthesis viewpoint. Prior to his PhD training, he was a student at Chennai Mathematical Institute where he studied Theoretical Computer Science and Mathematics.

2 months

1
0
0 0

Postdoctoral fellowship: monitoring cyberphysical systems with quantities

by Étienne André

Dear all, A 12-month postdoctoral fellowship funded by CNRS on *monitoring cyberphysical systems with quantities* is available at LIPN, Université Sorbonne Paris Nord, starting anytime (and in any case September 2024 latest). *Full subject online*: https://lipn.univ-paris13.fr/~andre/sujets/postdoc-CNRS-monitoring.pdf /A key challenge in monitoring is to formalize complex requests involving quantities such as "the vehicle always remains at a minimum distance from other vehicles, with energy consumption maintained below a predefined threshold (where this threshold is not necessarily known a priori with full precision), except in the event of exceptional danger at most one minute per hour"; and then to detect possible violations of these requests on huge quantities of data./ /This implies being able to define expressive quantitative formalisms, as well as efficient verification algorithms./ /This post-doctoral fellowship fits within this framework, with both theoretical and algorithmic/implementation aspects./ / / /The goal of the postdoctoral fellowship may include:/ /- propose expressive formalisms (logics, automata) capturing quantitative values in multiple dimensions (time, cost, energy, etc.);/ /- propose efficient monitoring algorithms;/ /- implement these algorithms and evaluate them against benchmarks./ *Application*: informal contact by email first (preferred) at andre.etienne (at) lipn13 (dot) fr ; or direct application via https://emploi.cnrs.fr/Offres/CDD/UMR7030-ETIAND-002/Default.aspx?lang=EN Best, -- Étienne André Université Sorbonne Paris Nord https://lipn.univ-paris13.fr/~andre/

2 months, 2 weeks

1
0
0 0

CFP IEEE Edge 2024, Shenzhen, China.

by Nitin Auluck

IEEE EDGE 2024 - CALL FOR PAPERS https://conferences.computer.org/edge/2024/ Edge computing, as the convergence of computing and communications executed close to data collection and places of storage and application, provides a paradigm that offers several research and application opportunities across a wide range of domains. At the same time, it raises many fundamental and unprecedented research and development problems and challenges. The 2024 IEEE International Conference on Edge Computing and Communications (IEEE EDGE 2024) aims to continue to be recognized a prime international forum for both researchers and industry practitioners to exchange the latest fundamental advances in state of the art and practice of edge computing, identify emerging research topics, and define the future of edge computing. IEEE EDGE is affiliated with IEEE World Congress on Services (SERVICES). IEEE EDGE 2024 will feature a comprehensive high-quality technical program including research track, tutorial and demonstration. IEEE EDGE 2024 will also include an attractive industry program aimed at practitioners, with keynotes and panels from prominent research, industry leaders, and technological exhibits. IEEE EDGE 2024 invites original papers addressing all aspects related to edge computing theories, technologies and applications. Topics of interest include but are not limited to the following: · Edge Computing Architectures · Edge Computing and Communications Theories · Edge Computing and Network Functions Virtualization · Edge Computing in Multi-cloud environments · Edge Centric Convergence of IoT & Cloud Computing · Collaborative Edge & Cloud Computing · Storage and Caching at the Edge · Edge Access Networks & Systems · Services for Edge Computing · CPU/GPU and Hardware for Edge Computing · Benchmarks and Workloads for Performance of Edge Systems · AI Enabled Edge Computing · Generative AI Continuum - from Edge to Cloud · Artificial Intelligence and ML at the Edge · QoS & QoE at the Edge · Signal Processing in Edge Computing · Edge Computing for Vehicular System & Network · Edge Computing for 5G/6G Network & Systems IMPORTANT DATES (ANYWHERE ON EARTH) * December 1, 2023: EasyChair open for DRAFT submissions * March 17, 2024: EasyChair closes for NEW submissions * March 24, 2024: EasyChair closes for revisions and uploads * May 6, 2024: Acceptance notification * July 7-13, 2024: SERVICES Congress in Shenzhen, China ORGANISING TEAM IEEE EDGE 2024 GENERAL CHAIRS Shuiguang Deng, Zhejiang University Nirmit Desai, IBM Research Gopal Pingali, Accenture IEEE EDGE 2024 PROGRAM CHAIRS Javid Taheri, Karlstad University Shiqiang Wang, IBM Research K. V. Subramaniam, AMD IEEE EDGE 2024 PUBLICITY CHAIRS Nitin Auluck, Indian Institute of Technology, Ropar Luiz F. Bittencourt, University of Campinas, Brazil Antonino Galletta, University of Messina, Italy Honghao Gao, Shanghai University, China Gautam Srivastava, Brandon University, Canada (TBC) -- Dr. Nitin Auluck / डॉ. नितिन औलक | Associate Professor / सह - प्राध्यापक Room #114, S. Ramanujan Block / कमरा #११४, एस. रामानुजम ब्लॉक Department of Computer Science & Engineering / कंप्यूटर विज्ञान और अभियांत्रिकी विभाग Indian Institute of Technology Ropar / भारतीय प्रौद्योगिकी संस्थान रोपड़ | Rupnagar, Punjab, India, 140001 / रूपनगर, पंजाब, भारत, १४०००१ nitin(a)iitrpr.ac.in | nauluck(a)ieee.org | http://www.iitrpr.ac.in/cse/nitin -- **CONFIDENTIALITY NOTICE: The contents of this email message and any attachments are intended solely for the addressee(s) and may contain confidential and/or privileged information and may be legally protected from disclosure. If you are not the intended recipient of this message or their agent, or if this message has been addressed to you in error, please immediately alert the sender by reply email and then delete this message and any attachments. If you are not the intended recipient, you are hereby notified that any use, dissemination, copying, or storage of this message or its attachments is strictly prohibited.* *

2 months, 2 weeks

1
0
0 0