{"title":"Low-Cost Routing for Manycast communication","authors":"Xuegong Tan","doi":"10.1109/DASC.2013.133","DOIUrl":"https://doi.org/10.1109/DASC.2013.133","url":null,"abstract":"Manycast is a group communication paradigm in which one client communicates simultaneously with some thresholdnumber of servers from the pre-specified group members. In this paper, we revisit the basic problem of many manycast issues:how to find the spanning tree such that the cost is as small as possible? For this NP-complete problem, we present an efficient and simple heuristics algorithm, based-frequency manycast routing (BFM). In BFM, node's frequency is used as the keyparameter to choose manycast destination nodes. The performance of our algorithm is analyzed through extensive simulation and compared with several other heuristics algorithms. For a manycast request, the simulation result shows BFM builds many cast trees with the least cost than other algorithms.","PeriodicalId":216413,"journal":{"name":"Symposium on Dependable Autonomic and Secure Computing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115531659","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}
Wei-jin Du, Zhong Liu, B. Xiu, Wei Ming Zhang, Qing Cheng
{"title":"Command and Control Network Modeling and Efficiency Measure Based on Capability Weighted-Node","authors":"Wei-jin Du, Zhong Liu, B. Xiu, Wei Ming Zhang, Qing Cheng","doi":"10.1109/DASC.2011.176","DOIUrl":"https://doi.org/10.1109/DASC.2011.176","url":null,"abstract":"Command and control (C2) organization and its existing research are introduced, and C2 organization efficiency measure is discussed. The C2 network model is built, and the capability of C2 network is analyzed by the method of weighted-node. The average cooperating efficiency is proposed to measure C2 network's cooperating efficiency, and validate measurement's validity by comparing with network efficiency. The optimal C2 network's topology property is analyzed by modulating some parameters. The property has a direction for designing the actual C2 network.","PeriodicalId":216413,"journal":{"name":"Symposium on Dependable Autonomic and Secure Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115912508","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}
{"title":"Research on the Control Method of Inverted Pendulum Based on Kalman Filter","authors":"Wanli Zhang, Guoxin Li, Lirong Wang","doi":"10.1109/DASC.2014.100","DOIUrl":"https://doi.org/10.1109/DASC.2014.100","url":null,"abstract":"Inverted pendulum is a nonlinear, multivariable and instability system. In the past, without considering the effects of measurement noise and output noise of the sensor in the processing of inverted pendulum control, the strong random jitter occur, and the control accuracy and stable of the inverted pendulum is reduced. Because the Kalman filter can estimate the signal is corrupted by the noise, the filtered system will have fine robustness and dynamic performance. Inverted pendulum in the straight line car is given as example, and the application of Kalman filter in the inverted pendulum control system is described in the paper.","PeriodicalId":216413,"journal":{"name":"Symposium on Dependable Autonomic and Secure Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117019449","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}
Jun Xia, Li Luo, Zhengbin Pang, Jun Zhang, Junsheng Chang
{"title":"A Low Overhead Last-Write-Touch Prediction Scheme","authors":"Jun Xia, Li Luo, Zhengbin Pang, Jun Zhang, Junsheng Chang","doi":"10.1109/DASC.2014.40","DOIUrl":"https://doi.org/10.1109/DASC.2014.40","url":null,"abstract":"Last-write-touch prediction can reduce cache-to-cache transfer latency by converting 3-hop misses into 2-hop misses in directory-based shared-memory multiprocessors. By predicting a last-write-touch and self-downgrading a cache block in advance, a processor can get the data from the memory directly and the coherence overhead is significantly reduced. In this paper, we propose a new low overhead last-write-touch prediction scheme that exploits the inherent write burst characteristics of programs. The scheme uses write burst numbers to compute history traces and generate signatures. Compared with the existing instruction-based prediction technique, much storage overhead can be reduced. The experimental results show that our last-write-touch prediction scheme can achieve almost the same prediction accuracy as the instruction-based prediction scheme with the storage overheads of the history table reduced by 69% and the storage overheads of the signature table reduced by 36%.","PeriodicalId":216413,"journal":{"name":"Symposium on Dependable Autonomic and Secure Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130949496","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}
{"title":"FPGA Implementation of Two SAR Autofocus Algorithms","authors":"Haiyang Cao, Daiyin Zhu, Jindong Zhang","doi":"10.1109/DASC.2013.53","DOIUrl":"https://doi.org/10.1109/DASC.2013.53","url":null,"abstract":"SAR (Synthetic Aperture Radar) imaging processing is of high computations and its imaging algorithms are often complicated. How to implement SAR imaging efficiently and in real time is a deserving research. Autofocusing is an essential chain of SAR processing and is also computation-consuming. We know that FPGA (Field Programmable Gate Array) has many advantages such as being of large scale, high-performance and reconfigurable and so on. So we would like to utilize FPGA to implement SAR autofocus algorithms in real time. In this paper, implementations of two popular autofocus algorithms of SAR imaging, namely, PGA (Phase Gradient Autofocus) and PAST (Projection Approximation Subspace Tracking) are discussed in detail based on KintexTM-7 FPGA of Xilinx Corporation. State machines and hardware mappings of each are designed respectively with pipelined processing and floating IP core which ensures all the necessary computations of floating numbers efficiently. Our experimental results show that it takes both algorithms about 0.5 seconds to completely process a defocused SAR image of 2k*2k 64-bit samples with system clock 200MHz, which authenticates the valid and credible real-time implementations. This work lays the foundation of the FPGA combination of autofocus algorithms with basic imaging algorithms to construct a complete real-time SAR processing system in the future.","PeriodicalId":216413,"journal":{"name":"Symposium on Dependable Autonomic and Secure Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364087","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}