2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing最新文献_第2页

Remote Sensing Images Super-resolution Based on Sparse Dictionaries and Residual Dictionaries 基于稀疏字典和残差字典的遥感图像超分辨率

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.82

Yingying Zhang, Wei Wu, Y. Dai, Xiaomin Yang, Binyu Yan, Wei Lu

{"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}

引用次数: 14

Research on Improvement of Dynamic Load Balancing in MongoDB MongoDB动态负载均衡改进研究

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.49

Xiaolin Wang, Hao-peng Chen, Zhenhua Wang

引用次数: 20

Neural Signal Acquisition and Wireless Transmission System Design 神经信号采集与无线传输系统设计

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.81

Ruoyuan Qu, Tong Li, Shengwei Xu, Fang Han, Li Zhang, Xinxia Cai, H. Dang

引用次数: 0

vMerger: Server Consolidation in Virtualized Environment vMerger:虚拟化环境下的服务器整合

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.134

L. Deng, Hai Jin, Song Wu

引用次数: 3

Convergence and Scalarization in Whole Function Vectorization 全函数矢量化中的收敛与标量化

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.120

F. Yue, J. Pang, Jiuzhen Jin, Chao Dai

引用次数: 1

An Energy-Efficient Scheduling Strategy in LTE System LTE系统中的一种节能调度策略

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.114

Y. Miao, K. Wen

引用次数: 5

A New Approach to Building a Multi-tier Direct Access Knowledgebase for IDS/SIEM Systems IDS/SIEM系统多层直接存取知识库的新方法

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.48

Amir Azodi, David Jaeger, Feng Cheng, C. Meinel

{"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}

引用次数: 26

Spectrum Handoff Scheme for Prioritized Multimedia Services in Cognitive Radio Network with Finite Buffer 有限缓冲认知无线网络中优先级多媒体业务的频谱切换方案

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.98

Mao Li, Tigang Jiang, Liang Tong

{"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}

引用次数: 15

An Improved Search Algorithm Based on Path Compression for Complex Network 一种基于路径压缩的复杂网络改进搜索算法

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.80

Ye Yuan, Wenyu Chen, Minyu Feng, Hong Qu

{"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}

引用次数: 1

Discrete Hybrid Automata for Safe Cyber-physical System: An Astronautic Case Study 安全信息物理系统的离散混合自动机:一个航天案例研究

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI: 10.1109/DASC.2013.51

Qiang Wang, Gang Yang, Xingshe Zhou, Yalei Yang

引用次数: 1