Ishmam Abid, S. M. Zuhayer Anzum Fuad, Mohammad Jabed Morshed Chowdhury, Mehruba Sharmin Chowdhury, Md Sadek Ferdous
The circular economy has the potential to increase resource efficiency and minimize waste through the 4R framework of reducing, reusing, recycling, and recovering. Blockchain technology is currently considered a valuable aid in the transition to a circular economy. Its decentralized and tamper-resistant nature enables the construction of transparent and secure supply chain management systems, thereby improving product accountability and traceability. However, the full potential of blockchain technology in circular economy models will not be realized until a number of concerns, including scalability, interoperability, data protection, and regulatory and legal issues, are addressed. More research and stakeholder participation are required to overcome these limitations and achieve the benefits of blockchain technology in promoting a circular economy. This article presents a systematic literature review (SLR) that identified industry use cases for blockchain-driven circular economy models and offered architectures to minimize resource consumption, prices, and inefficiencies while encouraging the reuse, recycling, and recovery of end-of-life products. Three main outcomes emerged from our review of 41 documents, which included scholarly publications, Twitter-linked information, and Google results. The relationship between blockchain and the 4R framework for circular economy; discussion the terminology and various forms of blockchain and circular economy; and identification of the challenges and obstacles that blockchain technology may face in enabling a circular economy. This research shows how blockchain technology can help with the transition to a circular economy. Yet, it emphasizes the importance of additional study and stakeholder participation to overcome potential hurdles and obstacles in implementing blockchain-driven circular economy models.
{"title":"A Systematic Literature Review on the Use of Blockchain Technology in Transition to a Circular Economy","authors":"Ishmam Abid, S. M. Zuhayer Anzum Fuad, Mohammad Jabed Morshed Chowdhury, Mehruba Sharmin Chowdhury, Md Sadek Ferdous","doi":"arxiv-2408.11664","DOIUrl":"https://doi.org/arxiv-2408.11664","url":null,"abstract":"The circular economy has the potential to increase resource efficiency and\u0000minimize waste through the 4R framework of reducing, reusing, recycling, and\u0000recovering. Blockchain technology is currently considered a valuable aid in the\u0000transition to a circular economy. Its decentralized and tamper-resistant nature\u0000enables the construction of transparent and secure supply chain management\u0000systems, thereby improving product accountability and traceability. However,\u0000the full potential of blockchain technology in circular economy models will not\u0000be realized until a number of concerns, including scalability,\u0000interoperability, data protection, and regulatory and legal issues, are\u0000addressed. More research and stakeholder participation are required to overcome\u0000these limitations and achieve the benefits of blockchain technology in\u0000promoting a circular economy. This article presents a systematic literature\u0000review (SLR) that identified industry use cases for blockchain-driven circular\u0000economy models and offered architectures to minimize resource consumption,\u0000prices, and inefficiencies while encouraging the reuse, recycling, and recovery\u0000of end-of-life products. Three main outcomes emerged from our review of 41\u0000documents, which included scholarly publications, Twitter-linked information,\u0000and Google results. The relationship between blockchain and the 4R framework\u0000for circular economy; discussion the terminology and various forms of\u0000blockchain and circular economy; and identification of the challenges and\u0000obstacles that blockchain technology may face in enabling a circular economy.\u0000This research shows how blockchain technology can help with the transition to a\u0000circular economy. Yet, it emphasizes the importance of additional study and\u0000stakeholder participation to overcome potential hurdles and obstacles in\u0000implementing blockchain-driven circular economy models.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142213974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a multi-user green semantic communication system facilitated by a probabilistic knowledge graph (PKG). By integrating probability into the knowledge graph, we enable probabilistic semantic communication (PSC) and represent semantic information accordingly. On this basis, a semantic compression model designed for multi-user downlink task-oriented communication is introduced, utilizing the semantic compression ratio (SCR) as a parameter to connect the computation and communication processes of information transmission. Based on the rate-splitting multiple access (RSMA) technology, we derive mathematical expressions for system transmission energy consumption and related formulations. Subsequently, the multi-user green semantic communication system is modeled and the optimal problem with the goal of minimizing system energy consumption comprehensively considering the computation and communication process under given constrains is formulated. In order to address the optimal problem, we propose an alternating optimization algorithm that tackles sub-problems of power allocation and beamforming design, semantic compression ratio, and computation capacity allocation. Simulation results validate the effectiveness of our approach, demonstrating the superiority of our system over methods using Space Division Multiple Access (SDMA) and non-orthogonal multiple access (NOMA) instead of RSMA, and highlighting the benefits of our PSC compression model.
{"title":"Green Probabilistic Semantic Communication over Wireless Networks","authors":"Ruopeng Xu, Zhaohui Yang, Yijie Mao, Chongwen Huang, Qianqian Yang, Lexi Xu, Wei Xu, Zhaoyang Zhang","doi":"arxiv-2408.11446","DOIUrl":"https://doi.org/arxiv-2408.11446","url":null,"abstract":"In this paper, we propose a multi-user green semantic communication system\u0000facilitated by a probabilistic knowledge graph (PKG). By integrating\u0000probability into the knowledge graph, we enable probabilistic semantic\u0000communication (PSC) and represent semantic information accordingly. On this\u0000basis, a semantic compression model designed for multi-user downlink\u0000task-oriented communication is introduced, utilizing the semantic compression\u0000ratio (SCR) as a parameter to connect the computation and communication\u0000processes of information transmission. Based on the rate-splitting multiple\u0000access (RSMA) technology, we derive mathematical expressions for system\u0000transmission energy consumption and related formulations. Subsequently, the\u0000multi-user green semantic communication system is modeled and the optimal\u0000problem with the goal of minimizing system energy consumption comprehensively\u0000considering the computation and communication process under given constrains is\u0000formulated. In order to address the optimal problem, we propose an alternating\u0000optimization algorithm that tackles sub-problems of power allocation and\u0000beamforming design, semantic compression ratio, and computation capacity\u0000allocation. Simulation results validate the effectiveness of our approach,\u0000demonstrating the superiority of our system over methods using Space Division\u0000Multiple Access (SDMA) and non-orthogonal multiple access (NOMA) instead of\u0000RSMA, and highlighting the benefits of our PSC compression model.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"112 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142213977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Crowdsourcing (CS) faces the challenge of managing complex, skill-demanding tasks, which requires effective task assignment and retention strategies to sustain a balanced workforce. This challenge has become more significant in Volunteer Crowdsourcing Services (VCS). This study introduces Workforce Composition Balance (WCB), a novel framework designed to maintain workforce diversity in VCS by dynamically adjusting retention decisions. The WCB framework integrates the Volunteer Retention and Value Enhancement (VRAVE) algorithm with advanced skill-based task assignment methods. It ensures efficient remuneration policy for both assigned and unassigned potential volunteers by incorporating their potential levels, participation dividends, and satisfaction scores. Comparative analysis with three state-of-the-art baselines on real dataset shows that our WCB framework achieves 1.4 times better volunteer satisfaction and a 20% higher task retention rate, with only a 12% increase in remuneration. The effectiveness of the proposed WCB approach is to enhance the volunteer engagement and their long-term retention, thus making it suitable for functioning of social good applications where a potential and skilled volunteer workforce is crucial for sustainable community services.
{"title":"Sustainable Volunteer Engagement: Ensuring Potential Retention and Skill Diversity for Balanced Workforce Composition in Crowdsourcing Paradigm","authors":"Riya Samanta, Soumya K Ghosh","doi":"arxiv-2408.11498","DOIUrl":"https://doi.org/arxiv-2408.11498","url":null,"abstract":"Crowdsourcing (CS) faces the challenge of managing complex, skill-demanding\u0000tasks, which requires effective task assignment and retention strategies to\u0000sustain a balanced workforce. This challenge has become more significant in\u0000Volunteer Crowdsourcing Services (VCS). This study introduces Workforce\u0000Composition Balance (WCB), a novel framework designed to maintain workforce\u0000diversity in VCS by dynamically adjusting retention decisions. The WCB\u0000framework integrates the Volunteer Retention and Value Enhancement (VRAVE)\u0000algorithm with advanced skill-based task assignment methods. It ensures\u0000efficient remuneration policy for both assigned and unassigned potential\u0000volunteers by incorporating their potential levels, participation dividends,\u0000and satisfaction scores. Comparative analysis with three state-of-the-art\u0000baselines on real dataset shows that our WCB framework achieves 1.4 times\u0000better volunteer satisfaction and a 20% higher task retention rate, with only a\u000012% increase in remuneration. The effectiveness of the proposed WCB approach is\u0000to enhance the volunteer engagement and their long-term retention, thus making\u0000it suitable for functioning of social good applications where a potential and\u0000skilled volunteer workforce is crucial for sustainable community services.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142213976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Volunteer crowdsourcing (VCS) leverages citizen interaction to address challenges by utilizing individuals' knowledge and skills. Complex social tasks often require collaboration among volunteers with diverse skill sets, and their willingness to engage is crucial. Matching tasks with the most suitable volunteers remains a significant challenge. VCS platforms face unpredictable demands in terms of tasks and volunteer requests, complicating the prediction of resource requirements for the volunteer-to-task assignment process. To address these challenges, we introduce the Skill and Willingness-Aware Volunteer Matching (SWAM) algorithm, which allocates volunteers to tasks based on skills, willingness, and task requirements. We also developed a serverless framework to deploy SWAM. Our method outperforms conventional solutions, achieving a 71% improvement in end-to-end latency efficiency. We achieved a 92% task completion ratio and reduced task waiting time by 56%, with an overall utility gain 30% higher than state-of-the-art baseline methods. This framework contributes to generating effective volunteer and task matches, supporting grassroots community coordination and fostering citizen involvement, ultimately contributing to social good.
{"title":"Empowering Volunteer Crowdsourcing Services: A Serverless-assisted, Skill and Willingness Aware Task Assignment Approach for Amicable Volunteer Involvement","authors":"Riya Samanta, Biswajeet Sethi, Soumya K Ghosh","doi":"arxiv-2408.11510","DOIUrl":"https://doi.org/arxiv-2408.11510","url":null,"abstract":"Volunteer crowdsourcing (VCS) leverages citizen interaction to address\u0000challenges by utilizing individuals' knowledge and skills. Complex social tasks\u0000often require collaboration among volunteers with diverse skill sets, and their\u0000willingness to engage is crucial. Matching tasks with the most suitable\u0000volunteers remains a significant challenge. VCS platforms face unpredictable\u0000demands in terms of tasks and volunteer requests, complicating the prediction\u0000of resource requirements for the volunteer-to-task assignment process. To\u0000address these challenges, we introduce the Skill and Willingness-Aware\u0000Volunteer Matching (SWAM) algorithm, which allocates volunteers to tasks based\u0000on skills, willingness, and task requirements. We also developed a serverless\u0000framework to deploy SWAM. Our method outperforms conventional solutions,\u0000achieving a 71% improvement in end-to-end latency efficiency. We achieved a 92%\u0000task completion ratio and reduced task waiting time by 56%, with an overall\u0000utility gain 30% higher than state-of-the-art baseline methods. This framework\u0000contributes to generating effective volunteer and task matches, supporting\u0000grassroots community coordination and fostering citizen involvement, ultimately\u0000contributing to social good.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142213978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Natchapon Jongwiriyanurak, Zichao Zeng, June Moh Goo, Xinglei Wang, Ilya Ilyankou, Kerkritt Srirrongvikrai, Meihui Wang, James Haworth
Road traffic crashes cause millions of deaths annually and have a significant economic impact, particularly in low- and middle-income countries (LMICs). This paper presents an approach using Vision Language Models (VLMs) for road safety assessment, overcoming the limitations of traditional Convolutional Neural Networks (CNNs). We introduce a new task ,V-RoAst (Visual question answering for Road Assessment), with a real-world dataset. Our approach optimizes prompt engineering and evaluates advanced VLMs, including Gemini-1.5-flash and GPT-4o-mini. The models effectively examine attributes for road assessment. Using crowdsourced imagery from Mapillary, our scalable solution influentially estimates road safety levels. In addition, this approach is designed for local stakeholders who lack resources, as it does not require training data. It offers a cost-effective and automated methods for global road safety assessments, potentially saving lives and reducing economic burdens.
{"title":"V-RoAst: A New Dataset for Visual Road Assessment","authors":"Natchapon Jongwiriyanurak, Zichao Zeng, June Moh Goo, Xinglei Wang, Ilya Ilyankou, Kerkritt Srirrongvikrai, Meihui Wang, James Haworth","doi":"arxiv-2408.10872","DOIUrl":"https://doi.org/arxiv-2408.10872","url":null,"abstract":"Road traffic crashes cause millions of deaths annually and have a significant\u0000economic impact, particularly in low- and middle-income countries (LMICs). This\u0000paper presents an approach using Vision Language Models (VLMs) for road safety\u0000assessment, overcoming the limitations of traditional Convolutional Neural\u0000Networks (CNNs). We introduce a new task ,V-RoAst (Visual question answering\u0000for Road Assessment), with a real-world dataset. Our approach optimizes prompt\u0000engineering and evaluates advanced VLMs, including Gemini-1.5-flash and\u0000GPT-4o-mini. The models effectively examine attributes for road assessment.\u0000Using crowdsourced imagery from Mapillary, our scalable solution influentially\u0000estimates road safety levels. In addition, this approach is designed for local\u0000stakeholders who lack resources, as it does not require training data. It\u0000offers a cost-effective and automated methods for global road safety\u0000assessments, potentially saving lives and reducing economic burdens.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"40 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142213979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Joseph Briones, Jacob Calvert, Noah Egan, Shunhao Oh, Dana Randall, Andréa W. Richa
Local interactions of uncoordinated individuals produce the collective behaviors of many biological systems, inspiring much of the current research in programmable matter. A striking example is the spontaneous assembly of fire ants into "bridges" comprising their own bodies to traverse obstacles and reach sources of food. Experiments and simulations suggest that, remarkably, these ants always form one bridge -- instead of multiple, competing bridges -- despite a lack of central coordination. We argue that the reliable formation of a single bridge does not require sophistication on behalf of the individuals by provably reproducing this behavior in a self-organizing particle system. We show that the formation of a single bridge by the particles is a statistical inevitability of their preferences to move in a particular direction, such as toward a food source, and their preference for more neighbors. Two parameters, $eta$ and $beta$, reflect the strengths of these preferences and determine the Gibbs stationary measure of the corresponding particle system's Markov chain dynamics. We show that a single bridge almost certainly forms when $eta$ and $beta$ are sufficiently large. Our proof introduces an auxiliary Markov chain, called an "occupancy chain", that captures only the significant, global changes to the system. Through the occupancy chain, we abstract away information about the motion of individual particles, but we gain a more direct means of analyzing their collective behavior. Such abstractions provide a promising new direction for understanding many other systems of programmable matter.
{"title":"Single Bridge Formation in Self-Organizing Particle Systems","authors":"Joseph Briones, Jacob Calvert, Noah Egan, Shunhao Oh, Dana Randall, Andréa W. Richa","doi":"arxiv-2408.10830","DOIUrl":"https://doi.org/arxiv-2408.10830","url":null,"abstract":"Local interactions of uncoordinated individuals produce the collective\u0000behaviors of many biological systems, inspiring much of the current research in\u0000programmable matter. A striking example is the spontaneous assembly of fire\u0000ants into \"bridges\" comprising their own bodies to traverse obstacles and reach\u0000sources of food. Experiments and simulations suggest that, remarkably, these\u0000ants always form one bridge -- instead of multiple, competing bridges --\u0000despite a lack of central coordination. We argue that the reliable formation of\u0000a single bridge does not require sophistication on behalf of the individuals by\u0000provably reproducing this behavior in a self-organizing particle system. We\u0000show that the formation of a single bridge by the particles is a statistical\u0000inevitability of their preferences to move in a particular direction, such as\u0000toward a food source, and their preference for more neighbors. Two parameters,\u0000$eta$ and $beta$, reflect the strengths of these preferences and determine\u0000the Gibbs stationary measure of the corresponding particle system's Markov\u0000chain dynamics. We show that a single bridge almost certainly forms when $eta$\u0000and $beta$ are sufficiently large. Our proof introduces an auxiliary Markov\u0000chain, called an \"occupancy chain\", that captures only the significant, global\u0000changes to the system. Through the occupancy chain, we abstract away\u0000information about the motion of individual particles, but we gain a more direct\u0000means of analyzing their collective behavior. Such abstractions provide a\u0000promising new direction for understanding many other systems of programmable\u0000matter.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Eren Akyol, Ahmet Baha Ozturk, Iman Mokari Bolhassan, Murat Kuscu
Molecular communication (MC) is a bio-inspired method of transmitting information using biochemical signals, promising for novel medical, agricultural, and environmental applications at the intersection of bio-, nano-, and communication technologies. Developing reliable MC systems for high-rate information transfer remains challenging due to the complex and dynamic nature of application environments and the physical and resource limitations of micro/nanoscale transmitters and receivers. Microfluidics can help overcome many such practical challenges by enabling testbeds that can replicate the application media with precise control over flow conditions. However, existing microfluidic MC testbeds face significant limitations in chemical signal generation with programmable signal waveforms, e.g., in terms of pulse width. To tackle this, we previously proposed a practical microfluidic MC transmitter architecture based on the hydrodynamic gating technique, a prevalent chemical waveform generation method. This paper reports the experimental validation and characterization of this method, examining its precision in terms of spatiotemporal control on the generated molecular concentration pulses. We detail the fabrication of the transmitter, its working mechanism and discuss its potential limitations based on empirical data. We show that the microfluidic transmitter is capable of providing precise, programmable, and reproducible molecular concentration pulses, which would facilitate the experimental research in MC.
分子通信（MC）是一种利用生化信号传输信息的生物启发方法，有望在生物、纳米和通信技术的交叉领域实现新型医疗、农业和环境应用。由于应用环境的复杂性和动态性，以及微/纳米级发射器和接收器的物理和资源限制，开发可靠的 MC 系统以实现高速信息传输仍具有挑战性。然而，现有的微流体 MC 试验台在可编程信号波形（如脉冲宽度）的化学信号生成方面面临很大限制。为了解决这个问题，我们之前提出了一种基于流体动力门控技术的实用微流控发射器架构，这是一种有效的化学波形生成方法。本文报告了这一方法的实验验证和特征描述，从生成分子浓度脉冲的时空控制方面考察了这一方法的精确性。我们详细介绍了发射器的制造、工作机制，并根据经验数据讨论了其潜在的局限性。结果表明，微流控发射器能够提供精确、可编程、可重现的分子浓度脉冲，这将有助于 MC 的实验研究。
{"title":"Experimental Characterization of Hydrodynamic Gating-Based Molecular Communication Transmitter","authors":"Eren Akyol, Ahmet Baha Ozturk, Iman Mokari Bolhassan, Murat Kuscu","doi":"arxiv-2408.09835","DOIUrl":"https://doi.org/arxiv-2408.09835","url":null,"abstract":"Molecular communication (MC) is a bio-inspired method of transmitting\u0000information using biochemical signals, promising for novel medical,\u0000agricultural, and environmental applications at the intersection of bio-,\u0000nano-, and communication technologies. Developing reliable MC systems for\u0000high-rate information transfer remains challenging due to the complex and\u0000dynamic nature of application environments and the physical and resource\u0000limitations of micro/nanoscale transmitters and receivers. Microfluidics can\u0000help overcome many such practical challenges by enabling testbeds that can\u0000replicate the application media with precise control over flow conditions.\u0000However, existing microfluidic MC testbeds face significant limitations in\u0000chemical signal generation with programmable signal waveforms, e.g., in terms\u0000of pulse width. To tackle this, we previously proposed a practical microfluidic\u0000MC transmitter architecture based on the hydrodynamic gating technique, a\u0000prevalent chemical waveform generation method. This paper reports the\u0000experimental validation and characterization of this method, examining its\u0000precision in terms of spatiotemporal control on the generated molecular\u0000concentration pulses. We detail the fabrication of the transmitter, its working\u0000mechanism and discuss its potential limitations based on empirical data. We\u0000show that the microfluidic transmitter is capable of providing precise,\u0000programmable, and reproducible molecular concentration pulses, which would\u0000facilitate the experimental research in MC.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142213980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Every new generation of mobile networks brings significant advances in two segments, enhancement of the network parameters within the legacy technologies and introduction of new technologies enabling new paradigms in designing the networks. In the first class of enhancements the effort is to increase data rates, improve energy efficiency, enhance connectivity, reduce data transmission latency etc. In the second class of innovations for 6G and 7G, we anticipate focus on optimum integration of advanced ML and AI in general, and quantum computing with the continuous interest in the satellite networks for optimal quantum key distribution . By introducing quantum technology 7G will be able to speed up computing processes in the net, enhance network security as well as to enable distributed QC, which is a new paradigm in computer sciences. Using advanced networks as a basic ingredient of inter system integration, here we focus only on the second segment of anticipated innovations in networking and present a survey of the subset of potential technology enablers for the above concept with special emphasis on the inter dependency of the solutions chosen in different segments of the network. In Section II, we present several anticipated 6G/7G (system of systems type) network optimization examples resulting in a new paradigm of network optimization indicating a need for quantum computing and quantum computing based optimization algorithms. In Section III we survey work on quantum cryptography and QKD.
{"title":"Potential Enabling Technologies for 7G Networks: Survey","authors":"Savo Glisic","doi":"arxiv-2408.11072","DOIUrl":"https://doi.org/arxiv-2408.11072","url":null,"abstract":"Every new generation of mobile networks brings significant advances in two\u0000segments, enhancement of the network parameters within the legacy technologies\u0000and introduction of new technologies enabling new paradigms in designing the\u0000networks. In the first class of enhancements the effort is to increase data\u0000rates, improve energy efficiency, enhance connectivity, reduce data\u0000transmission latency etc. In the second class of innovations for 6G and 7G, we\u0000anticipate focus on optimum integration of advanced ML and AI in general, and\u0000quantum computing with the continuous interest in the satellite networks for\u0000optimal quantum key distribution . By introducing quantum technology 7G will be\u0000able to speed up computing processes in the net, enhance network security as\u0000well as to enable distributed QC, which is a new paradigm in computer sciences. Using advanced networks as a basic ingredient of inter system integration,\u0000here we focus only on the second segment of anticipated innovations in\u0000networking and present a survey of the subset of potential technology enablers\u0000for the above concept with special emphasis on the inter dependency of the\u0000solutions chosen in different segments of the network. In Section II, we\u0000present several anticipated 6G/7G (system of systems type) network optimization\u0000examples resulting in a new paradigm of network optimization indicating a need\u0000for quantum computing and quantum computing based optimization algorithms. In\u0000Section III we survey work on quantum cryptography and QKD.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work establishes a rigorous proof for the universality of the chemputer as a chemical synthesis machine, capable of constructing any stable and isolable molecule through a finite, expressible process. This process is governed by three key parameters: reagents, process conditions, and catalysts. Additionally, the study introduces dynamic error correction mechanisms integrated into each step of the synthesis pathway, ensuring real-time accuracy and reliability. The role of universally configurable hardware is also highlighted, with the introduction of a 'chempiling' function that translates synthesis pathways into executable hardware configurations. These advancements collectively demonstrate the chemputer's capability to perform any feasible chemical synthesis, thereby establishing it as a universal tool in chemical manufacturing and synthesis. I show that every finitely realizable chemical synthesis process that can exist within the bounds of physical laws can be perfectly instantiated and executed by a universal chemputer, provided that the process can be completed within the finite number of reagent input vessels, reaction vessels, and product output vessels available, and that the error correction mechanisms are sufficiently robust to maintain the accuracy of the synthesis within these constraints. Finally, I show that chemical reactions are not implicit functions, but are an emergent property coming from the combination of the reagents, process conditions, and catalysts.
{"title":"The Chemputer and Chemputation: A Universal Chemical Compound Synthesis Machine","authors":"Leroy Cronin","doi":"arxiv-2408.09171","DOIUrl":"https://doi.org/arxiv-2408.09171","url":null,"abstract":"This work establishes a rigorous proof for the universality of the chemputer\u0000as a chemical synthesis machine, capable of constructing any stable and\u0000isolable molecule through a finite, expressible process. This process is\u0000governed by three key parameters: reagents, process conditions, and catalysts.\u0000Additionally, the study introduces dynamic error correction mechanisms\u0000integrated into each step of the synthesis pathway, ensuring real-time accuracy\u0000and reliability. The role of universally configurable hardware is also\u0000highlighted, with the introduction of a 'chempiling' function that translates\u0000synthesis pathways into executable hardware configurations. These advancements\u0000collectively demonstrate the chemputer's capability to perform any feasible\u0000chemical synthesis, thereby establishing it as a universal tool in chemical\u0000manufacturing and synthesis. I show that every finitely realizable chemical\u0000synthesis process that can exist within the bounds of physical laws can be\u0000perfectly instantiated and executed by a universal chemputer, provided that the\u0000process can be completed within the finite number of reagent input vessels,\u0000reaction vessels, and product output vessels available, and that the error\u0000correction mechanisms are sufficiently robust to maintain the accuracy of the\u0000synthesis within these constraints. Finally, I show that chemical reactions are\u0000not implicit functions, but are an emergent property coming from the\u0000combination of the reagents, process conditions, and catalysts.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"282 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142214005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Student extracurricular activities play an important role in enriching the students' educational experiences. With the increasing popularity of Machine Learning and Natural Language Processing, it becomes a logical step that incorporating ML-NLP in improving extracurricular activities is a potential focus of study in Artificial Intelligence (AI). This research study aims to develop a machine learning workflow that will quantify the effectiveness of student-organized activities based on student emotional responses using sentiment analysis. The study uses the Bidirectional Encoder Representations from Transformers (BERT) Large Language Model (LLM) called via the pysentimiento toolkit, as a Transformer pipeline in Hugging Face. A sample data set from Organization C, a Recognized Student Organization (RSO) of a higher educational institute in the Philippines, College X, was used to develop the workflow. The workflow consisted of data preprocessing, key feature selection, LLM feature processing, and score aggregation, resulting in an Event Score for each data set. The results show that the BERT LLM can also be used effectively in analyzing sentiment beyond product reviews and post comments. For the student affairs offices of educational institutions, this study can provide a practical example of how NLP can be applied to real-world scenarios, showcasing the potential impact of data-driven decision making.
{"title":"Quantifying the Effectiveness of Student Organization Activities using Natural Language Processing","authors":"Lyberius Ennio F. Taruc, Arvin R. De La Cruz","doi":"arxiv-2408.08694","DOIUrl":"https://doi.org/arxiv-2408.08694","url":null,"abstract":"Student extracurricular activities play an important role in enriching the\u0000students' educational experiences. With the increasing popularity of Machine\u0000Learning and Natural Language Processing, it becomes a logical step that\u0000incorporating ML-NLP in improving extracurricular activities is a potential\u0000focus of study in Artificial Intelligence (AI). This research study aims to\u0000develop a machine learning workflow that will quantify the effectiveness of\u0000student-organized activities based on student emotional responses using\u0000sentiment analysis. The study uses the Bidirectional Encoder Representations\u0000from Transformers (BERT) Large Language Model (LLM) called via the\u0000pysentimiento toolkit, as a Transformer pipeline in Hugging Face. A sample data\u0000set from Organization C, a Recognized Student Organization (RSO) of a higher\u0000educational institute in the Philippines, College X, was used to develop the\u0000workflow. The workflow consisted of data preprocessing, key feature selection,\u0000LLM feature processing, and score aggregation, resulting in an Event Score for\u0000each data set. The results show that the BERT LLM can also be used effectively\u0000in analyzing sentiment beyond product reviews and post comments. For the\u0000student affairs offices of educational institutions, this study can provide a\u0000practical example of how NLP can be applied to real-world scenarios, showcasing\u0000the potential impact of data-driven decision making.","PeriodicalId":501168,"journal":{"name":"arXiv - CS - Emerging Technologies","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：