The analysis and design of aerospace cyber physical systems call for the proper dimensioning of mechanical, electronic and embedded control subsystems from different views. Usually, the physical world part and the cyber part are modeled independently of each others. This modeling approach does not exploit many potential advantages of an integrated specification, analysis and design process, which are lost in the separate points of view of different engineering domains. In fact, the physical properties and the dynamical behavior of physical world parts play a central role in aerospace cyber physical systems development process. Thus, significant improvements to overall system performances can be obtained by early integrating the physical world and the cyber part development. It is clear that an appropriate specification and modeling approach cannot be fitted into the limitations of one formalism at time, particularly in the early stages of the design process. Hence, it is necessary to take a combination of different methodologies in a multi-formalism approach from different views. In this paper, we propose a view oriented approach to integrated different models, at different level of details to specify and model aerospace cyber physical systems as a whole. The effectiveness of the approach is illustrated by means of one practical case study: specifying and modeling the lunar rover system. In this paper, we specify and model the lunar rover with integrating Modelica and AADL, the physical world is modeled by Modelica, the cyber part is modeled by AADL.
{"title":"View Oriented Approach to Specify and Model Aerospace Cyber-physical Systems","authors":"Lichen Zhang","doi":"10.1109/DASC.2013.78","DOIUrl":"https://doi.org/10.1109/DASC.2013.78","url":null,"abstract":"The analysis and design of aerospace cyber physical systems call for the proper dimensioning of mechanical, electronic and embedded control subsystems from different views. Usually, the physical world part and the cyber part are modeled independently of each others. This modeling approach does not exploit many potential advantages of an integrated specification, analysis and design process, which are lost in the separate points of view of different engineering domains. In fact, the physical properties and the dynamical behavior of physical world parts play a central role in aerospace cyber physical systems development process. Thus, significant improvements to overall system performances can be obtained by early integrating the physical world and the cyber part development. It is clear that an appropriate specification and modeling approach cannot be fitted into the limitations of one formalism at time, particularly in the early stages of the design process. Hence, it is necessary to take a combination of different methodologies in a multi-formalism approach from different views. In this paper, we propose a view oriented approach to integrated different models, at different level of details to specify and model aerospace cyber physical systems as a whole. The effectiveness of the approach is illustrated by means of one practical case study: specifying and modeling the lunar rover system. In this paper, we specify and model the lunar rover with integrating Modelica and AADL, the physical world is modeled by Modelica, the cyber part is modeled by AADL.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"326 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":"123094306","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}
Two notions of subtyping and bounded polymorphism have been proposed to increase the expressiveness of session types. In this paper, we propose a new bounded polymorphic type system in which we incorporate the two notions and add delegation to the typing rules. As a result, this system not only can support more flexible specification protocols but also can express high-order communications, i.e. channel passing which can change the structure radically. At last, the soundness of this type system is proved by demonstrating Subject Reduction Theorem and Type Safety.
{"title":"A Bounded Polymorphic Session Type System with Delegation","authors":"Tiantian Song, Farong Zhong","doi":"10.1109/DASC.2013.117","DOIUrl":"https://doi.org/10.1109/DASC.2013.117","url":null,"abstract":"Two notions of subtyping and bounded polymorphism have been proposed to increase the expressiveness of session types. In this paper, we propose a new bounded polymorphic type system in which we incorporate the two notions and add delegation to the typing rules. As a result, this system not only can support more flexible specification protocols but also can express high-order communications, i.e. channel passing which can change the structure radically. At last, the soundness of this type system is proved by demonstrating Subject Reduction Theorem and Type Safety.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"26 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":"123430273","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}
Data-intensive applications, such as those in bioinformatics and social network analysis, differ from traditional scientific applications in that they often involve data-driven and irregular computation/communication patterns, making them ill-suited for traditional data movement approaches. Active Messages (AM) is an alternative programming model that allows dynamically moving computation closer to data, rather than moving the data to the local process. In our previous work, we proposed an MPI-interoperable AM framework that allows existing MPI applications to incrementally take advantage of AM capabilities. While that work presented a baseline implementation of how AMs semantically interact with the rest of the MPI infrastructure, it had several performance shortcomings. In this paper, we analyze these performance shortcomings and propose three optimization strategies: one implicitly derived by the MPI implementation and two explicitly hinted to by the application user. In addition to the detailed description of these optimization strategies, the paper presents a thorough performance evaluation on a 4096-core cluster that demonstrates considerable performance advantages from these strategies.
{"title":"Optimization Strategies for MPI-Interoperable Active Messages","authors":"Xin Zhao, P. Balaji, W. Gropp, R. Thakur","doi":"10.1109/DASC.2013.116","DOIUrl":"https://doi.org/10.1109/DASC.2013.116","url":null,"abstract":"Data-intensive applications, such as those in bioinformatics and social network analysis, differ from traditional scientific applications in that they often involve data-driven and irregular computation/communication patterns, making them ill-suited for traditional data movement approaches. Active Messages (AM) is an alternative programming model that allows dynamically moving computation closer to data, rather than moving the data to the local process. In our previous work, we proposed an MPI-interoperable AM framework that allows existing MPI applications to incrementally take advantage of AM capabilities. While that work presented a baseline implementation of how AMs semantically interact with the rest of the MPI infrastructure, it had several performance shortcomings. In this paper, we analyze these performance shortcomings and propose three optimization strategies: one implicitly derived by the MPI implementation and two explicitly hinted to by the application user. In addition to the detailed description of these optimization strategies, the paper presents a thorough performance evaluation on a 4096-core cluster that demonstrates considerable performance advantages from these strategies.","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":"128940004","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}
Yongkai Zhou, Pengze Guo, Yan Zhu, Zhi Xue, Jianhua Li, Yi Yuan
One of the features of the Software Defined Network (SDN) is to integrate network service into the network layer to better support the application and alleviate the burden of client-server end. Multicast as an efficient communication method, it can be exploited to provide more meaningful network services to applications which involve one-to-many and many-to-many communication. Traditional multicast implementation mainly emphasizes on low network overhead and its function is kept as simple as possible. This makes multicast vulnerable to misuse. However, when network service is integrated into multicast based on the architecture of SDN, the robustness and security of multicast can be enhanced. This paper proposed a detailed implementation of secure network services to enhance the whole process of the multicast communication. Furthermore, the pricing policy is also discussed for different kinds of multicast application scenarios.
{"title":"Integrated Network Service to Enhance Multicast Communication","authors":"Yongkai Zhou, Pengze Guo, Yan Zhu, Zhi Xue, Jianhua Li, Yi Yuan","doi":"10.1109/DASC.2013.46","DOIUrl":"https://doi.org/10.1109/DASC.2013.46","url":null,"abstract":"One of the features of the Software Defined Network (SDN) is to integrate network service into the network layer to better support the application and alleviate the burden of client-server end. Multicast as an efficient communication method, it can be exploited to provide more meaningful network services to applications which involve one-to-many and many-to-many communication. Traditional multicast implementation mainly emphasizes on low network overhead and its function is kept as simple as possible. This makes multicast vulnerable to misuse. However, when network service is integrated into multicast based on the architecture of SDN, the robustness and security of multicast can be enhanced. This paper proposed a detailed implementation of secure network services to enhance the whole process of the multicast communication. Furthermore, the pricing policy is also discussed for different kinds of multicast application scenarios.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"54 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":"124875098","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}
The orderly power utilization management has become an important way to realize the reasonable distribution of the existing power resources. Currently, the formulation of orderly power utilization scheme mainly depends on the experiences of power experts. When the process has multifarious information and computation burdens, it is hard to formulate the orderly power utilization schemes timely and efficiently only depending on the experts. Hence, this paper proposes an automatic generation method of optimization scheme for orderly power utilization. The method involves the establishment of evaluation index system, calculation models and evaluation function, and searching for optimization scheme through the genetic algorithm. At last the simulation and experimental verification are performed. The results show that the proposed method can provide a powerful reference to the final scheme of orderly power utilization, thus achieving the goal of optimizing the allocation of resources and the maximization of social benefits.
{"title":"Automatic Generation Method of Optimization Scheme for Orderly Power Utilization Based on Genetic Algorithm","authors":"J. Huang, Qing-Lin Zuo, Fu-Lin Mu","doi":"10.1109/DASC.2013.40","DOIUrl":"https://doi.org/10.1109/DASC.2013.40","url":null,"abstract":"The orderly power utilization management has become an important way to realize the reasonable distribution of the existing power resources. Currently, the formulation of orderly power utilization scheme mainly depends on the experiences of power experts. When the process has multifarious information and computation burdens, it is hard to formulate the orderly power utilization schemes timely and efficiently only depending on the experts. Hence, this paper proposes an automatic generation method of optimization scheme for orderly power utilization. The method involves the establishment of evaluation index system, calculation models and evaluation function, and searching for optimization scheme through the genetic algorithm. At last the simulation and experimental verification are performed. The results show that the proposed method can provide a powerful reference to the final scheme of orderly power utilization, thus achieving the goal of optimizing the allocation of resources and the maximization of social benefits.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"62 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":"121548992","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}
Yanhong Zhang, Lingyu Xu, Jie Yu, Fei Zhong, Yang Liu
Network resources are fully rich, but the source of information is uneven. Huge amount of information, complex diversity of the network information and vastly different perspectives has brought great distress for people to identify information [1]. Due to the complexity of objective things, uncertainty and ambiguity of human thinking and other factors, the actual decision-making information is often difficult to quantify. General choice is to express the decision-making information in the form of qualitative language, but this multi-language form depends on human mind. What's more, different decision-makers will be based on their existing personal experience or cognition degree on the same issue to make good and bad, individualized decision-making, thereby it increases the uncertainty in decision making and labor costs in decision-making process. In this paper, considering the entirety of information on the whole and the drawback of the information on the local, we combine the human knowledge with machine algorithm. The method proposed in this paper is based on the similarity degree of the research object's attributes and categories, which uses the ideas of information fusion [2], make good use of a variety of information together and in view of multidimensional multi-granularity information to confirm each other to find a more effective method to distinguish the similarity measure of information object.
{"title":"The Research of Building Multidimensional Multi-granularity Automatic Uncertain Knowledge System Based on Attributes Similarity","authors":"Yanhong Zhang, Lingyu Xu, Jie Yu, Fei Zhong, Yang Liu","doi":"10.1109/DASC.2013.107","DOIUrl":"https://doi.org/10.1109/DASC.2013.107","url":null,"abstract":"Network resources are fully rich, but the source of information is uneven. Huge amount of information, complex diversity of the network information and vastly different perspectives has brought great distress for people to identify information [1]. Due to the complexity of objective things, uncertainty and ambiguity of human thinking and other factors, the actual decision-making information is often difficult to quantify. General choice is to express the decision-making information in the form of qualitative language, but this multi-language form depends on human mind. What's more, different decision-makers will be based on their existing personal experience or cognition degree on the same issue to make good and bad, individualized decision-making, thereby it increases the uncertainty in decision making and labor costs in decision-making process. In this paper, considering the entirety of information on the whole and the drawback of the information on the local, we combine the human knowledge with machine algorithm. The method proposed in this paper is based on the similarity degree of the research object's attributes and categories, which uses the ideas of information fusion [2], make good use of a variety of information together and in view of multidimensional multi-granularity information to confirm each other to find a more effective method to distinguish the similarity measure of information object.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"44 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":"126805737","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}
The dynamical properties of a class of discrete-time background network with uniform firing rate are investigated. The conditions for stability are derived. To guaranteed the boundness of all trajectories of the discrete-time background network, several invariant sets are obtained. It's then proved that any trajectories of the network starting from each of the invariant sets will converge. In addition to the stability and convergence analysis, bifurcation and chaos are also discussed. It's shown that the network can engender bifurcation and chaos with the increase of background input. The Lyapunov exponents are finally computed to confirm the existence of chaos. Since the background networks originate from the study of the activities of brain and chaotic activities are ubiquitous in the human brain, the chaos analysis of the background networks is significant.
{"title":"Convergence and Chaos of a Class of Discrete-Time Background Neural Networks with Uniform Firing Rate","authors":"Min Wan, Lin Zuo, Yan Li, Jinrong Hu, Qian Luo","doi":"10.1109/DASC.2013.89","DOIUrl":"https://doi.org/10.1109/DASC.2013.89","url":null,"abstract":"The dynamical properties of a class of discrete-time background network with uniform firing rate are investigated. The conditions for stability are derived. To guaranteed the boundness of all trajectories of the discrete-time background network, several invariant sets are obtained. It's then proved that any trajectories of the network starting from each of the invariant sets will converge. In addition to the stability and convergence analysis, bifurcation and chaos are also discussed. It's shown that the network can engender bifurcation and chaos with the increase of background input. The Lyapunov exponents are finally computed to confirm the existence of chaos. Since the background networks originate from the study of the activities of brain and chaotic activities are ubiquitous in the human brain, the chaos analysis of the background networks is significant.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"32 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":"126098140","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}
Variable length coding (VLC) is widely used in the entropy codec part of various video codec standards. Its parallelism is difficult to be developed due to its inherent bit-serial characteristic. As it becomes the system bottleneck of real-time video decoding, this paper presents a bitstream co-processor which greatly accelerates the codec of VLC by designing corresponding bitstream instructions. With SuperV DSP as the research prototype, the area cost of the bitstream co-processor only increases by 1.71% while the performance of the application of entropy decoding is improved about 73% on average.
{"title":"Design of Bitstream Co-processor for Multimedia Applications","authors":"Yingke Gao, Huan Ying, Zhiyuan Xue, Tiejun Zhang, Donghui Wang, C. Hou","doi":"10.1109/DASC.2013.66","DOIUrl":"https://doi.org/10.1109/DASC.2013.66","url":null,"abstract":"Variable length coding (VLC) is widely used in the entropy codec part of various video codec standards. Its parallelism is difficult to be developed due to its inherent bit-serial characteristic. As it becomes the system bottleneck of real-time video decoding, this paper presents a bitstream co-processor which greatly accelerates the codec of VLC by designing corresponding bitstream instructions. With SuperV DSP as the research prototype, the area cost of the bitstream co-processor only increases by 1.71% while the performance of the application of entropy decoding is improved about 73% on average.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"35 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":"128506065","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}
Wenge Rong, Baolin Peng, Y. Ouyang, C. Li, Z. Xiong
Sentiment analysis is one of the most important challenges to understand opinions online. In this research, inspired by the idea that the structural information among words, phrases and sentences is playing important role in identifying the overall statement's polarity, a novel sentiment analysis model is proposed based on recurrent neural network. The key point of the proposed approach, in order to utilise recurrent character, is to take the partial document as input and then the next parts to predict the sentiment label distribution rather than the next word. The proposed method learns words representation simultaneously the sentiment distribution. Experimental studies have been conducted on commonly used datasets and the results have shown its promising potential.
{"title":"Semi-supervised Dual Recurrent Neural Network for Sentiment Analysis","authors":"Wenge Rong, Baolin Peng, Y. Ouyang, C. Li, Z. Xiong","doi":"10.1109/DASC.2013.103","DOIUrl":"https://doi.org/10.1109/DASC.2013.103","url":null,"abstract":"Sentiment analysis is one of the most important challenges to understand opinions online. In this research, inspired by the idea that the structural information among words, phrases and sentences is playing important role in identifying the overall statement's polarity, a novel sentiment analysis model is proposed based on recurrent neural network. The key point of the proposed approach, in order to utilise recurrent character, is to take the partial document as input and then the next parts to predict the sentiment label distribution rather than the next word. The proposed method learns words representation simultaneously the sentiment distribution. Experimental studies have been conducted on commonly used datasets and the results have shown its promising potential.","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":"130614728","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}
Interference alignment (IA) has been proved in theory that it can be achievable in a partially connected multi-cell MIMO interfering broadcast channels (IBC) network of arbitrary size, while the signaling dimension of each transmit and receive antennas pair between base station (BS) and user remains bound. For this applicable significance, based on the L-interfering MIMO IBC model, two iterative IA algorithms are presented to solve the alignment problem for this type of network in this paper. Then the feasibility conditions and the impact of channel knowledge imperfection for the proposed algorithms are analyzed. Simulations show that, with a finite antenna number per transmitter and receiver pair, the proposed algorithms can achieve the optimal degrees of freedom (DoF) and can be applied to a partially connected multi-cell MIMO IBC network with arbitrary number of cells and users per cell. Meanwhile, the proposed algorithms are sensitive to imperfect channel knowledge, especially in high SNR region.
理论上证明，在任意大小的部分连接多小区MIMO干扰广播信道(IBC)网络中，在基站与用户之间的每个发射和接收天线对的信令维数不变的情况下，干扰对准(IA)是可以实现的。鉴于这一适用意义，本文基于l - interference MIMO IBC模型，提出了两种迭代IA算法来解决这类网络的对准问题。然后分析了算法的可行性条件和信道知识不完全性对算法的影响。仿真结果表明，在发射器和接收器对天线数量有限的情况下，所提出的算法可以实现最优自由度(DoF)，并且可以应用于具有任意小区数量和用户数量的部分连接多小区MIMO IBC网络。同时，该算法对信道知识不完全敏感，特别是在高信噪比区域。
{"title":"Partially Connected Multi-cell Interference Broadcast Channels Based Iterative Interference Alignment with Imperfect Channel Knowledge","authors":"Y. Wang, Zhong-pei Zhang","doi":"10.1109/DASC.2013.144","DOIUrl":"https://doi.org/10.1109/DASC.2013.144","url":null,"abstract":"Interference alignment (IA) has been proved in theory that it can be achievable in a partially connected multi-cell MIMO interfering broadcast channels (IBC) network of arbitrary size, while the signaling dimension of each transmit and receive antennas pair between base station (BS) and user remains bound. For this applicable significance, based on the L-interfering MIMO IBC model, two iterative IA algorithms are presented to solve the alignment problem for this type of network in this paper. Then the feasibility conditions and the impact of channel knowledge imperfection for the proposed algorithms are analyzed. Simulations show that, with a finite antenna number per transmitter and receiver pair, the proposed algorithms can achieve the optimal degrees of freedom (DoF) and can be applied to a partially connected multi-cell MIMO IBC network with arbitrary number of cells and users per cell. Meanwhile, the proposed algorithms are sensitive to imperfect channel knowledge, especially in high SNR region.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"42 1-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":"131518071","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
扫码关注我们
求助内容：
应助结果提醒方式：