Yingying Zhang, Wei Wu, Y. Dai, Xiaomin Yang, Binyu Yan, Wei Lu
In this paper, a sensing image super-resolution (SR) reconstruction method is proposed. Sparse dictionary dealing with remote sensing image SR problem is introduced in this work. The sparse dictionary is based on a sparsity model where the dictionary atoms have sparse representation over a basic dictionary. The sparse dictionary consists of two parts: basic dictionary and atom representation matrix. The sparse dictionary leads to compact representation and it is both adaptive and efficient. Furthermore, compared with conventional SR methods, two dictionary pairs, i.e. primitive sparse dictionary pair and residual sparse dictionary pair, are proposed. The primitive sparse dictionary pair is learned to reconstruct initial high-resolution (HR) remote sensing image from a single low-resolution (LR) input. However, the initial HR remote sensing image loses some details compare with the corresponding original HR image completely. Therefore, residual sparse dictionary pair is learned to reconstruct residual information. The proposed method is tested on remote sensing images, and the experimental results indicate that the proposed algorithm can provide substantial improvement in resolution of remote sensing images, and the results are superior in quality to the results produced by other methods.
{"title":"Remote Sensing Images Super-resolution Based on Sparse Dictionaries and Residual Dictionaries","authors":"Yingying Zhang, Wei Wu, Y. Dai, Xiaomin Yang, Binyu Yan, Wei Lu","doi":"10.1109/DASC.2013.82","DOIUrl":"https://doi.org/10.1109/DASC.2013.82","url":null,"abstract":"In this paper, a sensing image super-resolution (SR) reconstruction method is proposed. Sparse dictionary dealing with remote sensing image SR problem is introduced in this work. The sparse dictionary is based on a sparsity model where the dictionary atoms have sparse representation over a basic dictionary. The sparse dictionary consists of two parts: basic dictionary and atom representation matrix. The sparse dictionary leads to compact representation and it is both adaptive and efficient. Furthermore, compared with conventional SR methods, two dictionary pairs, i.e. primitive sparse dictionary pair and residual sparse dictionary pair, are proposed. The primitive sparse dictionary pair is learned to reconstruct initial high-resolution (HR) remote sensing image from a single low-resolution (LR) input. However, the initial HR remote sensing image loses some details compare with the corresponding original HR image completely. Therefore, residual sparse dictionary pair is learned to reconstruct residual information. The proposed method is tested on remote sensing images, and the experimental results indicate that the proposed algorithm can provide substantial improvement in resolution of remote sensing images, and the results are superior in quality to the results produced by other methods.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128286605","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}
As a representative of NO-SQL database, MongoDB is widely preferred for its automatic load-balancing to some extent, which including distributing read load to secondary node to reduce the load of primary one and auto-sharding to reduce the load onspecific node through automatically split data and migrate some ofthem to other nodes. However, on one hand, this process is storage-load -- Cbased, which can't meet the demand due to the facts that some particular data are accessed much more frequently than others and the 'heat' is not constant as time going on, thus the load on a node keeps changing even if with unchanged data. On the other hand, data migration will bring out too much cost to affect performance of system. In this paper, we will focus on the mechanism of automatic load balancing of MongoDB and proposean heat-based dynamic load balancing mechanism with much less cost.
{"title":"Research on Improvement of Dynamic Load Balancing in MongoDB","authors":"Xiaolin Wang, Hao-peng Chen, Zhenhua Wang","doi":"10.1109/DASC.2013.49","DOIUrl":"https://doi.org/10.1109/DASC.2013.49","url":null,"abstract":"As a representative of NO-SQL database, MongoDB is widely preferred for its automatic load-balancing to some extent, which including distributing read load to secondary node to reduce the load of primary one and auto-sharding to reduce the load onspecific node through automatically split data and migrate some ofthem to other nodes. However, on one hand, this process is storage-load -- Cbased, which can't meet the demand due to the facts that some particular data are accessed much more frequently than others and the 'heat' is not constant as time going on, thus the load on a node keeps changing even if with unchanged data. On the other hand, data migration will bring out too much cost to affect performance of system. In this paper, we will focus on the mechanism of automatic load balancing of MongoDB and proposean heat-based dynamic load balancing mechanism with much less cost.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127219852","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}
Ruoyuan Qu, Tong Li, Shengwei Xu, Fang Han, Li Zhang, Xinxia Cai, H. Dang
A wireless neural signal acquisition system is presented for freely-running test. It consists of low-noise, high input impedance analog processing, radio frequency (RF) transmitter and receiver. Firstly, the weak neural signal is amplified by a variable gain pre-amplifier and then digitalized by a Sigma-delta ADC. Secondly, the digital data is transmitted and received with couple of RF circuits based on IEEE STD802.15 standard and on-off keying (OOK) modulation. Fabricated in SMIC 0.18μm CMOS process, the IC prototype occupies 2.88mm2 and consumes 40mW. It works functionally, which can be a wide solution for wireless neural signal processor.
{"title":"Neural Signal Acquisition and Wireless Transmission System Design","authors":"Ruoyuan Qu, Tong Li, Shengwei Xu, Fang Han, Li Zhang, Xinxia Cai, H. Dang","doi":"10.1109/DASC.2013.81","DOIUrl":"https://doi.org/10.1109/DASC.2013.81","url":null,"abstract":"A wireless neural signal acquisition system is presented for freely-running test. It consists of low-noise, high input impedance analog processing, radio frequency (RF) transmitter and receiver. Firstly, the weak neural signal is amplified by a variable gain pre-amplifier and then digitalized by a Sigma-delta ADC. Secondly, the digital data is transmitted and received with couple of RF circuits based on IEEE STD802.15 standard and on-off keying (OOK) modulation. Fabricated in SMIC 0.18μm CMOS process, the IC prototype occupies 2.88mm2 and consumes 40mW. It works functionally, which can be a wide solution for wireless neural signal processor.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127356317","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 virtualized clusters, applications are deployed in virtual machines (VMs). Resource can be configured dynamically with the varying workloads. When workloads become low, applications can be consolidated on smaller number of nodes. Much more tasks can be processed in clusters. Virtualized clusters have better scalability than traditional clusters. In this paper, we present a server consolidation manager vMerger to improve the scalability of clusters. Linear programming is used for finding new mapping of VMs to smaller number of nodes. An optimized topological-sorting-based migration order generation method is designed to change VM distribution from current mapping to new mapping. The experimental results show that, vMerger effectively improves the scalability of clusters using server consolidation.
{"title":"vMerger: Server Consolidation in Virtualized Environment","authors":"L. Deng, Hai Jin, Song Wu","doi":"10.1109/DASC.2013.134","DOIUrl":"https://doi.org/10.1109/DASC.2013.134","url":null,"abstract":"In virtualized clusters, applications are deployed in virtual machines (VMs). Resource can be configured dynamically with the varying workloads. When workloads become low, applications can be consolidated on smaller number of nodes. Much more tasks can be processed in clusters. Virtualized clusters have better scalability than traditional clusters. In this paper, we present a server consolidation manager vMerger to improve the scalability of clusters. Linear programming is used for finding new mapping of VMs to smaller number of nodes. An optimized topological-sorting-based migration order generation method is designed to change VM distribution from current mapping to new mapping. The experimental results show that, vMerger effectively improves the scalability of clusters using server consolidation.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129084669","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}
When implementing SPMD programs on multi core platforms, whole function vectorization is an important optimization method. SPMD program has drawback that lots of instructions across multi threads are redundant which is sustained in vectorization. This paper proposes to alleviate this overhead by detecting scalar operations and extract them out in vectorization instructions. An algorithm is designed to deal with control flow and data flow synchronously in which convergent and invariance analysis is employed to statically identify convergent execution and invariant values or instructions. Our algorithm is effectively on implementing SPMD programs on multi core platforms. The experiments show our method could improve the execution efficiency by 13.3%.
{"title":"Convergence and Scalarization in Whole Function Vectorization","authors":"F. Yue, J. Pang, Jiuzhen Jin, Chao Dai","doi":"10.1109/DASC.2013.120","DOIUrl":"https://doi.org/10.1109/DASC.2013.120","url":null,"abstract":"When implementing SPMD programs on multi core platforms, whole function vectorization is an important optimization method. SPMD program has drawback that lots of instructions across multi threads are redundant which is sustained in vectorization. This paper proposes to alleviate this overhead by detecting scalar operations and extract them out in vectorization instructions. An algorithm is designed to deal with control flow and data flow synchronously in which convergent and invariance analysis is employed to statically identify convergent execution and invariant values or instructions. Our algorithm is effectively on implementing SPMD programs on multi core platforms. The experiments show our method could improve the execution efficiency by 13.3%.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132042587","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}
Green communication has been a hot research in wireless network in recent years. The key question is how to reduce energy consumption while maintaining the quality of service. According to the conception of trading bandwidth for energy, a resource scheduling strategy based on system load conditions for LTE downlink is proposed to reduce energy consumption by improving energy efficiency at the cost of spectral efficiency. The two proposed algorithms can greatly reduce transmit power while meeting the users' data rate are requirements, and ensure the realization of the fairness among users.
{"title":"An Energy-Efficient Scheduling Strategy in LTE System","authors":"Y. Miao, K. Wen","doi":"10.1109/DASC.2013.114","DOIUrl":"https://doi.org/10.1109/DASC.2013.114","url":null,"abstract":"Green communication has been a hot research in wireless network in recent years. The key question is how to reduce energy consumption while maintaining the quality of service. According to the conception of trading bandwidth for energy, a resource scheduling strategy based on system load conditions for LTE downlink is proposed to reduce energy consumption by improving energy efficiency at the cost of spectral efficiency. The two proposed algorithms can greatly reduce transmit power while meeting the users' data rate are requirements, and ensure the realization of the fairness among users.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126833033","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}
Looking at current IDS and SIEM systems, we observe heavy processing power dedicated solely to answering a simple question, What is the format of the log line that the IDS (or SIEM) system should process next? Due to the apparent difficulties of uniquely identifying a log line at run-time, most systems today do little or no normalisation of the events they receive. Indeed these systems often rely on popular search engine applications for processing and analysing the event information they receive, which results in slower and far less accurate event correlations. In this process, a large list of tokenisers is usually created in order to find an answer to the above posted question. The tokenisers are run against the log lines, until a match is found. The appropriate log line can then be passed on to the correct extraction module for further processing. This process is currently the standard procedure of most IDS and SIEM systems. To address this problem and to optimise and improve the said process, this paper describes a method for detecting the exact type and format of a read log line in the first place. The method presented performs in an efficient manner, while it is less resource hungry. The proposed detection system is described and implemented, its pros and cons are analysed and weighed against methods currently implemented by popular IDS and SIEM systems for solving this task.
{"title":"A New Approach to Building a Multi-tier Direct Access Knowledgebase for IDS/SIEM Systems","authors":"Amir Azodi, David Jaeger, Feng Cheng, C. Meinel","doi":"10.1109/DASC.2013.48","DOIUrl":"https://doi.org/10.1109/DASC.2013.48","url":null,"abstract":"Looking at current IDS and SIEM systems, we observe heavy processing power dedicated solely to answering a simple question, What is the format of the log line that the IDS (or SIEM) system should process next? Due to the apparent difficulties of uniquely identifying a log line at run-time, most systems today do little or no normalisation of the events they receive. Indeed these systems often rely on popular search engine applications for processing and analysing the event information they receive, which results in slower and far less accurate event correlations. In this process, a large list of tokenisers is usually created in order to find an answer to the above posted question. The tokenisers are run against the log lines, until a match is found. The appropriate log line can then be passed on to the correct extraction module for further processing. This process is currently the standard procedure of most IDS and SIEM systems. To address this problem and to optimise and improve the said process, this paper describes a method for detecting the exact type and format of a read log line in the first place. The method presented performs in an efficient manner, while it is less resource hungry. The proposed detection system is described and implemented, its pros and cons are analysed and weighed against methods currently implemented by popular IDS and SIEM systems for solving this task.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122987733","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}
Multimedia applications have been becoming a majority type of traffic over cognitive radio network (CRN). Considering the different delay requirements of heterogeneous multimedia applications, we classified the secondary users (SUs) into four priority classes. Due to delay-sensitive nature of real-time (RT) multimedia services, we give it high priority to access channels. Non-real-time (NRT) traffic is characterized as delay-insensitive. In this paper, we proposed a dynamic spectrum handoff scheme with finite-size buffer queues to store preempted SUs which aims at avoiding the dropping events even though slightly increase the blocking probability. The finite-size buffer queue can avoid too many RT traffics piling up. Through limiting the buffer size the NRT traffics can get a fair chance to use channels. Additionally, spectrum sensing and channel allocation are controlled by a central base station (CBS). Such centralized admission control mechanism can efficiently prevent multiple SUs from simultaneously requesting to access the same spectrum band, consequently, to protect the channel form SUs' collision. A preemptive resume priority (PRP) M/M/c/c+k Markov model is established to analysis the performance, including the blocking probability, the throughput of SUs and the average completion time of RT traffic. The results show that the proposed scheme can meet the various performance requirements of heterogeneous multi-media applications. Moreover, the buffer mechanism can improve the channel utilization considerably.
{"title":"Spectrum Handoff Scheme for Prioritized Multimedia Services in Cognitive Radio Network with Finite Buffer","authors":"Mao Li, Tigang Jiang, Liang Tong","doi":"10.1109/DASC.2013.98","DOIUrl":"https://doi.org/10.1109/DASC.2013.98","url":null,"abstract":"Multimedia applications have been becoming a majority type of traffic over cognitive radio network (CRN). Considering the different delay requirements of heterogeneous multimedia applications, we classified the secondary users (SUs) into four priority classes. Due to delay-sensitive nature of real-time (RT) multimedia services, we give it high priority to access channels. Non-real-time (NRT) traffic is characterized as delay-insensitive. In this paper, we proposed a dynamic spectrum handoff scheme with finite-size buffer queues to store preempted SUs which aims at avoiding the dropping events even though slightly increase the blocking probability. The finite-size buffer queue can avoid too many RT traffics piling up. Through limiting the buffer size the NRT traffics can get a fair chance to use channels. Additionally, spectrum sensing and channel allocation are controlled by a central base station (CBS). Such centralized admission control mechanism can efficiently prevent multiple SUs from simultaneously requesting to access the same spectrum band, consequently, to protect the channel form SUs' collision. A preemptive resume priority (PRP) M/M/c/c+k Markov model is established to analysis the performance, including the blocking probability, the throughput of SUs and the average completion time of RT traffic. The results show that the proposed scheme can meet the various performance requirements of heterogeneous multi-media applications. Moreover, the buffer mechanism can improve the channel utilization considerably.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124945210","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}
With the rapid development of science technology and explosively increasing of network's complication, complex network as an emerging research hotspot has attracted more and more scientists' attention. Meanwhile, search strategy as a main research method in complex network plays a more and more important role on study of complex network, and it has great practical significance and research value. So many classical search algorithms have been proposed according to network's specialty, such as breadth-first search (BFS), random walk (RW), and high degree seeking (HDS). Unfortunately, a flawless solution for all kinds of models in complex network has not been presented so far due to the above algorithms are only suitable for some special circumstances. For improving the search efficiency, this paper appears an improved strategy which has a hybrid merit combining both high efficiency and low consumption. This strategy augments a compressed process to save useful path's information, so we can use the stored data in the search process to effectively reduce search step and query flow. In the simulation, the proposed algorithm will be compared with HDS in the models of complex network which have diverse type or different size. The result of simulation was used to illustrate the efficient performance of this strategy and demonstrate that the proposed search algorithm can produce a better fruit than others.
{"title":"An Improved Search Algorithm Based on Path Compression for Complex Network","authors":"Ye Yuan, Wenyu Chen, Minyu Feng, Hong Qu","doi":"10.1109/DASC.2013.80","DOIUrl":"https://doi.org/10.1109/DASC.2013.80","url":null,"abstract":"With the rapid development of science technology and explosively increasing of network's complication, complex network as an emerging research hotspot has attracted more and more scientists' attention. Meanwhile, search strategy as a main research method in complex network plays a more and more important role on study of complex network, and it has great practical significance and research value. So many classical search algorithms have been proposed according to network's specialty, such as breadth-first search (BFS), random walk (RW), and high degree seeking (HDS). Unfortunately, a flawless solution for all kinds of models in complex network has not been presented so far due to the above algorithms are only suitable for some special circumstances. For improving the search efficiency, this paper appears an improved strategy which has a hybrid merit combining both high efficiency and low consumption. This strategy augments a compressed process to save useful path's information, so we can use the stored data in the search process to effectively reduce search step and query flow. In the simulation, the proposed algorithm will be compared with HDS in the models of complex network which have diverse type or different size. The result of simulation was used to illustrate the efficient performance of this strategy and demonstrate that the proposed search algorithm can produce a better fruit than others.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"26 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114033399","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}
Cyber-Physical Systems (CPSs) are interactive, intelligent and distributed-hybrid systems which have computing units embedded in physical environment and widely applied in the safety-critical field. Compared with the traditional embedded hybrid system, the problems of safety, reliability and uncertainty, caused by constant interaction between computing and physical process, are more prominent than ever before. An astronautic case has been taken for example in this paper. Correspondingly, the Discrete Hybrid Automata (DHA) modeling frame and Hybrid System Description Language (HYSDEL) are adopted to build and analyze its behavior model. Besides, combined with the hybrid toolbox, the trajectories of the continuous states and the reachability of system are simulated and analyzed. The usage of the approach to modeling and analysis of CPS has been applied in the scene of lunar rover autonomous walking, which lay a model foundation for the further safety verification.
{"title":"Discrete Hybrid Automata for Safe Cyber-physical System: An Astronautic Case Study","authors":"Qiang Wang, Gang Yang, Xingshe Zhou, Yalei Yang","doi":"10.1109/DASC.2013.51","DOIUrl":"https://doi.org/10.1109/DASC.2013.51","url":null,"abstract":"Cyber-Physical Systems (CPSs) are interactive, intelligent and distributed-hybrid systems which have computing units embedded in physical environment and widely applied in the safety-critical field. Compared with the traditional embedded hybrid system, the problems of safety, reliability and uncertainty, caused by constant interaction between computing and physical process, are more prominent than ever before. An astronautic case has been taken for example in this paper. Correspondingly, the Discrete Hybrid Automata (DHA) modeling frame and Hybrid System Description Language (HYSDEL) are adopted to build and analyze its behavior model. Besides, combined with the hybrid toolbox, the trajectories of the continuous states and the reachability of system are simulated and analyzed. The usage of the approach to modeling and analysis of CPS has been applied in the scene of lunar rover autonomous walking, which lay a model foundation for the further safety verification.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121280032","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
扫码关注我们
求助内容：
应助结果提醒方式：