Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3593929/v1
Nguyen Éric, Tsuruoka Ari
Abstract Leveraging distant supervision for relation extraction has emerged as a robust method to harness large text corpora, widely adopted to unearth new relational facts from unstructured text. Prevailing neural approaches have made significant strides in relation extraction by representing sentences in compact, low-dimensional vectors. However, the incorporation of syntactic nuances when modeling entities remains underexplored. Our study introduces a novel method for crafting syntax-aware entity embeddings to boost neural relation extraction. We start by encoding entity contexts within dependency trees through tree-GRU to generate sentence-level entity embeddings. We then apply both intra-sentence and inter-sentence attention mechanisms to distill entity embeddings at the sentence set level, considering every occurrence of the pertinent entity pair. The culmination of our methodology is the fusion of sentence and entity embeddings for relation classification. Our experiments on a benchmark dataset indicate that our approach harnesses the full potential of informative instances, thereby setting new benchmarks for relation extraction performance.
{"title":"Semantic Relational Extraction via Learning Syntactic Structural Representation","authors":"Nguyen Éric, Tsuruoka Ari","doi":"10.21203/rs.3.rs-3593929/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3593929/v1","url":null,"abstract":"Abstract Leveraging distant supervision for relation extraction has emerged as a robust method to harness large text corpora, widely adopted to unearth new relational facts from unstructured text. Prevailing neural approaches have made significant strides in relation extraction by representing sentences in compact, low-dimensional vectors. However, the incorporation of syntactic nuances when modeling entities remains underexplored. Our study introduces a novel method for crafting syntax-aware entity embeddings to boost neural relation extraction. We start by encoding entity contexts within dependency trees through tree-GRU to generate sentence-level entity embeddings. We then apply both intra-sentence and inter-sentence attention mechanisms to distill entity embeddings at the sentence set level, considering every occurrence of the pertinent entity pair. The culmination of our methodology is the fusion of sentence and entity embeddings for relation classification. Our experiments on a benchmark dataset indicate that our approach harnesses the full potential of informative instances, thereby setting new benchmarks for relation extraction performance.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"9 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136228770","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3603107/v1
Zhicheng Lin, Jun Li, Yongcui Li
Abstract The colored traveling salesman problem (CTSP) generalizes the well-known multiple traveling salesman problem (MTSP) by utilizing colors to describe the accessibility of cities to individual salesmen. Many serial algorithms have been developed to solve CTSP instances. This work presents a distributed solving method for CTSP for the first time. First, a cloud container-based distributed solving framework for CTSP is designed and implemented in a pipeline style. A superscale CTSP can be decomposed into many TSPs to solve in parallel to reduce computational complexity dramatically. Second, following the framework, we develop a distributed Delaunay-triangulation-based variable neighborhood search (DDVNS) algorithm. In DDVNS, a two-stage initialization is exploited to generate each TSP solution. Then, Delaunay-triangulation-based variable neighborhood search (DVNS) is applied to search for the local TSP optima within a neighborhood delicately. In addition, the solutions are improved further by reallocating the multicolor cities and repeating the search progress. Finally, the extensive experiments show that DDVNS outperforms the state-of-the-art serial algorithms regarding search efficiency and solution quality. Notably, We can achieve a satisfactory solution in a superscale case of 16 salesmen and 160000 cities within 15 minutes, which breaks the existing solving record of CTSPs.
{"title":"A Cloud Container-Based Distributed Solving Approach to Superscale Colored Traveling Salesman Problems","authors":"Zhicheng Lin, Jun Li, Yongcui Li","doi":"10.21203/rs.3.rs-3603107/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3603107/v1","url":null,"abstract":"Abstract The colored traveling salesman problem (CTSP) generalizes the well-known multiple traveling salesman problem (MTSP) by utilizing colors to describe the accessibility of cities to individual salesmen. Many serial algorithms have been developed to solve CTSP instances. This work presents a distributed solving method for CTSP for the first time. First, a cloud container-based distributed solving framework for CTSP is designed and implemented in a pipeline style. A superscale CTSP can be decomposed into many TSPs to solve in parallel to reduce computational complexity dramatically. Second, following the framework, we develop a distributed Delaunay-triangulation-based variable neighborhood search (DDVNS) algorithm. In DDVNS, a two-stage initialization is exploited to generate each TSP solution. Then, Delaunay-triangulation-based variable neighborhood search (DVNS) is applied to search for the local TSP optima within a neighborhood delicately. In addition, the solutions are improved further by reallocating the multicolor cities and repeating the search progress. Finally, the extensive experiments show that DDVNS outperforms the state-of-the-art serial algorithms regarding search efficiency and solution quality. Notably, We can achieve a satisfactory solution in a superscale case of 16 salesmen and 160000 cities within 15 minutes, which breaks the existing solving record of CTSPs.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136229344","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3596004/v1
Soham Gokhale
Abstract We study the stochastic Landau-Lifshitz-Bloch equation perturbed by pure jump noise. In order to understand and also control the fluctuations and jumps observed in the hysteresis loop, we add noise and an external control to the effective field. We consider the control operator as one that can depend, even nonlinearly on both the control and the associated solution process. We reformulate the problem as a relaxed control problem by using random Young measures and show that the relaxed problem admits an optimal control. The proof employs the Aldous condition for establishing tightness of laws and a modified version of the Skorohod Theorem for obtaining subconvergence of laws.
{"title":"Relaxed optimal control for the stochastic Landau-Lifshitz-Bloch equation with jump noise","authors":"Soham Gokhale","doi":"10.21203/rs.3.rs-3596004/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3596004/v1","url":null,"abstract":"Abstract We study the stochastic Landau-Lifshitz-Bloch equation perturbed by pure jump noise. In order to understand and also control the fluctuations and jumps observed in the hysteresis loop, we add noise and an external control to the effective field. We consider the control operator as one that can depend, even nonlinearly on both the control and the associated solution process. We reformulate the problem as a relaxed control problem by using random Young measures and show that the relaxed problem admits an optimal control. The proof employs the Aldous condition for establishing tightness of laws and a modified version of the Skorohod Theorem for obtaining subconvergence of laws.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"7 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136229345","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3600836/v1
Eszter Udvary
Abstract There is an increasing need for quantum communication applications, including true random numbers and quantum key distribution. The Amplified Spontaneous Emission (ASE) is a quantum physics process, which can play a significant role in both cases. A physical model for detecting and acquiring the ASE noise is developed. The photon probability is calculated, and the relationship with system parameters is presented. Experimental results quantitatively validate the physical model; the simulation results all significantly fit the corresponding experimental data well.
{"title":"Modeling of Amplified Spontaneous Emission Noise for Quantum Communication Applications","authors":"Eszter Udvary","doi":"10.21203/rs.3.rs-3600836/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3600836/v1","url":null,"abstract":"Abstract There is an increasing need for quantum communication applications, including true random numbers and quantum key distribution. The Amplified Spontaneous Emission (ASE) is a quantum physics process, which can play a significant role in both cases. A physical model for detecting and acquiring the ASE noise is developed. The photon probability is calculated, and the relationship with system parameters is presented. Experimental results quantitatively validate the physical model; the simulation results all significantly fit the corresponding experimental data well.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"1 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136229520","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3011042/v3
Abstract The full text of this preprint has been withdrawn, as it was submitted in error. Therefore, the authors do not wish this work to be cited as a reference. Questions should be directed to the corresponding author.
{"title":"Vehicle Tracking System using Sensor Fusion with Signal Loss Compensation","authors":"","doi":"10.21203/rs.3.rs-3011042/v3","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3011042/v3","url":null,"abstract":"Abstract The full text of this preprint has been withdrawn, as it was submitted in error. Therefore, the authors do not wish this work to be cited as a reference. Questions should be directed to the corresponding author.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"8 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136228824","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3005487/v2
Abstract The full text of this preprint has been withdrawn, as it was submitted in error. Therefore, the authors do not wish this work to be cited as a reference. Questions should be directed to the corresponding author.
{"title":"Automotive Tracking System with Signal Lost Compensation","authors":"","doi":"10.21203/rs.3.rs-3005487/v2","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3005487/v2","url":null,"abstract":"Abstract The full text of this preprint has been withdrawn, as it was submitted in error. Therefore, the authors do not wish this work to be cited as a reference. Questions should be directed to the corresponding author.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"8 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136228825","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3592915/v1
Mohammad Alrabie
Abstract The premise behind implementing artificial intelligence in healthcare comes from the initiative that aims towards improving the healthcare standards, services, and accessibilities in a time and cost-efficient manner. The conceptual framework is based on the null hypothesis which states that there is no relationship between implementing artificial intelligence in healthcare and doctor’s redundancy. Having used the 2-tailed One-Sample T-Test to test that hypothesis on IBM SPSS, in order to successfully reject the hypothesis, and present an alternatively more accurate hypothesis that is more accurately representative. Additionally, DICE framework has also been presented in order to calculate the success/failure likelihoods of implementing artificial intelligence in healthcare. We conclude that artificial intelligence significantly impacts cost reduction in the long term, as well as only ever displacing behind-the-curve doctors who are unwilling to broaden their knowledge and develop their skills. Finally, we conclude that people’s resistance to change significantly affects the efficient and effective implementation of artificial intelligence in healthcare.
{"title":"Bridging the Gap: Assessing the Integration of Artificial Intelligence in Healthcare for Improved Efficiency and Doctor Adaptability.","authors":"Mohammad Alrabie","doi":"10.21203/rs.3.rs-3592915/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3592915/v1","url":null,"abstract":"Abstract The premise behind implementing artificial intelligence in healthcare comes from the initiative that aims towards improving the healthcare standards, services, and accessibilities in a time and cost-efficient manner. The conceptual framework is based on the null hypothesis which states that there is no relationship between implementing artificial intelligence in healthcare and doctor’s redundancy. Having used the 2-tailed One-Sample T-Test to test that hypothesis on IBM SPSS, in order to successfully reject the hypothesis, and present an alternatively more accurate hypothesis that is more accurately representative. Additionally, DICE framework has also been presented in order to calculate the success/failure likelihoods of implementing artificial intelligence in healthcare. We conclude that artificial intelligence significantly impacts cost reduction in the long term, as well as only ever displacing behind-the-curve doctors who are unwilling to broaden their knowledge and develop their skills. Finally, we conclude that people’s resistance to change significantly affects the efficient and effective implementation of artificial intelligence in healthcare.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"2 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136229207","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3601108/v1
Andreas Linkermann, Alexia Belavgeni, Wulf Tonnus, Francesca Maremonti, Sider Penkov, Melodie Mallais, Christine Gaillet, Anne Brucker, Danny Schilling, Lisa Schlicker, Nina Himmerkus, Shubhangi Gavali, Marlena Schlecht, Karolin Flade, Jorunn Becker, Mirela Tmava, Anne Haag, Christian Hugo, Almut Schulze, Bernd Plietker, Jan Becker, Joel Weinberg, Svenja Lorenz, Bettina Proneth, Marcus Conrad, Raphaël Rodriguez, Stefan Bornstein, Tobias Dick, Derel Pratt, Maria Fedorova
Abstract Acute kidney tubular necrosis (ATN) mediates acute kidney injury (AKI) and nephron loss, the major risk factor for chronic kidney disease (CKD) progression and end-stage renal disease (ESRD) 1-3 . For decades, it has been known that female tissue is less sensitive to AKI 4,5 , but the underlying mechanisms have remained elusive. As a specific feature, ATN is characterized by dynamic cell death propagation along the tubular compartment, mediated by ferroptosis in male mice 6,7 . Herein we demonstrate that ferroptotic cell death propagation is abrogated in female kidney tubules. Ferroptosis sensitivity in females was decreased by estradiol and its derivatives, which function as radical-trapping antioxidants (RTAs). Female sex-specific tubular expression of ferroptosis suppressor protein 1 (FSP1, also AIFM2) functions to regenerate the estradiol derivatives from their oxidation products, thereby potentiating RTA capacity. In addition, females exhibited much higher levels of anti-ferroptotic hydropersulfides detected directly from the most sensitive tubular compartment. In contrast, male proximal tubules express alkylglycerone phosphate synthase (AGPS) and fatty acyl-CoA reductase 1 (FAR1), key enzymes required for the generation of ether lipids which sensitize to ferroptosis. In summary, we uncover three independent mechanisms that collectively explain higher ferroptosis sensitivity of male over female tubular tissue and may function as therapeutic targets.
{"title":"Sex-specific Expression of Estradiol Derivatives, Hydropersulfides and Ether Lipids Regulates Ferroptosis Sensitivity of Kidney Tubules","authors":"Andreas Linkermann, Alexia Belavgeni, Wulf Tonnus, Francesca Maremonti, Sider Penkov, Melodie Mallais, Christine Gaillet, Anne Brucker, Danny Schilling, Lisa Schlicker, Nina Himmerkus, Shubhangi Gavali, Marlena Schlecht, Karolin Flade, Jorunn Becker, Mirela Tmava, Anne Haag, Christian Hugo, Almut Schulze, Bernd Plietker, Jan Becker, Joel Weinberg, Svenja Lorenz, Bettina Proneth, Marcus Conrad, Raphaël Rodriguez, Stefan Bornstein, Tobias Dick, Derel Pratt, Maria Fedorova","doi":"10.21203/rs.3.rs-3601108/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3601108/v1","url":null,"abstract":"Abstract Acute kidney tubular necrosis (ATN) mediates acute kidney injury (AKI) and nephron loss, the major risk factor for chronic kidney disease (CKD) progression and end-stage renal disease (ESRD) 1-3 . For decades, it has been known that female tissue is less sensitive to AKI 4,5 , but the underlying mechanisms have remained elusive. As a specific feature, ATN is characterized by dynamic cell death propagation along the tubular compartment, mediated by ferroptosis in male mice 6,7 . Herein we demonstrate that ferroptotic cell death propagation is abrogated in female kidney tubules. Ferroptosis sensitivity in females was decreased by estradiol and its derivatives, which function as radical-trapping antioxidants (RTAs). Female sex-specific tubular expression of ferroptosis suppressor protein 1 (FSP1, also AIFM2) functions to regenerate the estradiol derivatives from their oxidation products, thereby potentiating RTA capacity. In addition, females exhibited much higher levels of anti-ferroptotic hydropersulfides detected directly from the most sensitive tubular compartment. In contrast, male proximal tubules express alkylglycerone phosphate synthase (AGPS) and fatty acyl-CoA reductase 1 (FAR1), key enzymes required for the generation of ether lipids which sensitize to ferroptosis. In summary, we uncover three independent mechanisms that collectively explain higher ferroptosis sensitivity of male over female tubular tissue and may function as therapeutic targets.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"2 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136229210","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3593960/v1
Tomasz Jason, Muly Neumann, Ammar Adam
Abstract Named entity recognition (NER) stands as a pivotal task in natural language processing (NLP). Recent advancements have considerably enhanced its effectiveness. However, a gap remains in these systems' ability to fully leverage the recursive dynamics of linguistic structures. This study introduces a novel approach, intertwining the recognition of entities with a deeper understanding of linguistic syntax and tree-like structures. Utilizing a Tree-LSTM that operates under the guidance of dependency trees, we capture the intricate syntactic relationships between words. This process is further refined through the dual application of relative and global attention mechanisms. The relative attention zone is on critical words in the context of each evaluated word, whereas global attention identifies keywords throughout the entire sentence. By projecting these attention-modulated features into a tagging space, our model employs a conditional random field classifier to determine entity labels. We discover that our model adeptly highlights verbs that reveal the types of entities, influenced by their syntactic roles within sentences. Our model sets a new benchmark for performance on two prominent datasets, substantiating our approach.
{"title":"Advancing Named Entity Recognition with Syntax-Aware Attention Mechanisms","authors":"Tomasz Jason, Muly Neumann, Ammar Adam","doi":"10.21203/rs.3.rs-3593960/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3593960/v1","url":null,"abstract":"Abstract Named entity recognition (NER) stands as a pivotal task in natural language processing (NLP). Recent advancements have considerably enhanced its effectiveness. However, a gap remains in these systems' ability to fully leverage the recursive dynamics of linguistic structures. This study introduces a novel approach, intertwining the recognition of entities with a deeper understanding of linguistic syntax and tree-like structures. Utilizing a Tree-LSTM that operates under the guidance of dependency trees, we capture the intricate syntactic relationships between words. This process is further refined through the dual application of relative and global attention mechanisms. The relative attention zone is on critical words in the context of each evaluated word, whereas global attention identifies keywords throughout the entire sentence. By projecting these attention-modulated features into a tagging space, our model employs a conditional random field classifier to determine entity labels. We discover that our model adeptly highlights verbs that reveal the types of entities, influenced by their syntactic roles within sentences. Our model sets a new benchmark for performance on two prominent datasets, substantiating our approach.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"7 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136229244","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}
Pub Date : 2023-11-15DOI: 10.21203/rs.3.rs-3605595/v1
Vahid Saeidi, Ali A. Afzalian, Davood Gharavian
Abstract Supervisor localization procedure has been employed to construct local controllers corresponding to component agents in discrete-event systems. The proposed method in [11] is based on state reduction of a monolithic supervisor with respect to each set of controllable events corresponding to each component agent. A supervisor is localizable if state cardinality in each local controller is less than the number of states in the reduced supervisor, constructed by the proposed method in [10]. A supervisor is reducible if state cardinality of the constructed generator by the supervisor reduction procedure is less than the number of states of the original supervisor. In this paper, we define exclusive control consistency (ECC) property for a pair of states and prove that this property is a sufficient condition to guarantee reducing the event cardinality in each local controller comparing to the reduced supervisor. It is shown that reducibility and localizability properties are stronger than having ECC states in the original supervisor. The implementation of local controllers on industrial systems is facilitated by state reduction, whereas communication traffic between each pair of local controllers is reduced by event reduction.
{"title":"Event Reduction in Localization of DES Supervisory Control","authors":"Vahid Saeidi, Ali A. Afzalian, Davood Gharavian","doi":"10.21203/rs.3.rs-3605595/v1","DOIUrl":"https://doi.org/10.21203/rs.3.rs-3605595/v1","url":null,"abstract":"Abstract Supervisor localization procedure has been employed to construct local controllers corresponding to component agents in discrete-event systems. The proposed method in [11] is based on state reduction of a monolithic supervisor with respect to each set of controllable events corresponding to each component agent. A supervisor is localizable if state cardinality in each local controller is less than the number of states in the reduced supervisor, constructed by the proposed method in [10]. A supervisor is reducible if state cardinality of the constructed generator by the supervisor reduction procedure is less than the number of states of the original supervisor. In this paper, we define exclusive control consistency (ECC) property for a pair of states and prove that this property is a sufficient condition to guarantee reducing the event cardinality in each local controller comparing to the reduced supervisor. It is shown that reducibility and localizability properties are stronger than having ECC states in the original supervisor. The implementation of local controllers on industrial systems is facilitated by state reduction, whereas communication traffic between each pair of local controllers is reduced by event reduction.","PeriodicalId":500086,"journal":{"name":"Research Square (Research Square)","volume":"10 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136227758","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
扫码关注我们
求助内容：
应助结果提醒方式：