Research in Adaptive and Convergent Systems最新文献_第5页

An experimental analysis of DAG scheduling methods in hard real-time multiprocessor systems 硬实时多处理器系统中DAG调度方法的实验分析

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664236

Manar Qamhieh, Serge Midonnet

引用次数: 2

An optimized support vector machine classifier to extract abnormal features from breast microwave tomography data 一种优化的支持向量机分类器提取乳腺微波断层扫描数据中的异常特征

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664230

S. Aminikhanghahi, Sung Y. Shin, Wei Wang, Seong‐Ho Son, S. Jeon

引用次数: 3

Evaluating the performance impact of RTR-BIRD in origin validation 评估RTR-BIRD在原产地验证中的性能影响

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664202

Kyoungha Kim, Ik-hyeon Jang, Yanggon Kim

{"title":"Evaluating the performance impact of RTR-BIRD in origin validation","authors":"Kyoungha Kim, Ik-hyeon Jang, Yanggon Kim","doi":"10.1145/2663761.2664202","DOIUrl":"https://doi.org/10.1145/2663761.2664202","url":null,"abstract":"RTR-BIRD we previously developed is the only software router that is not only capable of the resource public key infrastructure (RPKI) but able to access the route origin authorizations (ROAs) in the practical validated cache. Although RTR-BIRD practically validates origins as opposed to QuaggaSRx implemented by the national institute of standards and technology (NIST), the routing performance of RTR-BIRD in processing a BGP update message was 4900 times worse than the routing performance of BIRD; BIRD took 0.4 millisecond whereas RTR-BIRD took 1.96 seconds per BGP update message. The difference in performance could be neglected if RTR-BIRD deals with only few routing updates in a highly discrete period. The decrease in performance, however, can be considerable if thousands of routing updates are concurrently received by a RTR-BIRD router---for instance, at router-startup or at router-reboot. Moreover, the performance degradation possibly disconnects BGP-peering sessions or imprecisely validates origins. In order to investigate the degradation in performance of RTR-BIRD, we broke up RTRPKI into components depending on its functionalities because the main difference between RTR-BIRD and BIRD is RTRPKI, which figuratively validates origins. From the separation of RTRPKI, we developed few more variations of RTRPKI by differentiating them in components to validate origins. Our simulation results in comparing RTRPKI with those variations revealed that the most problematic component of RTRPKI was the delay to synchronize RTRPKI to its associated cache server, so we detached the synchronization from the origin validation cycle (OVC) of RTR-BIRD. Consequently, our simulation results on the updated RTR-BIRD showed that the updated version validates origins approximately 4475 times faster than the original RTR-BIRD. Furthermore, the new version showed 100 percent accuracy in validating origins by eliminating at most two percent inconsistency of the validation results presented by the original RTR-BIRD router.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116307251","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

Post ranking in a blogosphere 在博客圈中发布排名

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664204

Won-Seok Hwang, Sang-Wook Kim

引用次数: 0

On cascading failures and countermeasures based on energy storage in the smart grid 基于储能的智能电网级联故障及对策研究

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2663770

Xing Chen, Wei Yu, D. Griffith, N. Golmie, Guobin Xu

引用次数: 6

Adapting byte addressable memory storage to user-level file system services 使字节可寻址内存存储适应用户级文件系统服务

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2666035

S. Oikawa

{"title":"Adapting byte addressable memory storage to user-level file system services","authors":"S. Oikawa","doi":"10.1145/2663761.2666035","DOIUrl":"https://doi.org/10.1145/2663761.2666035","url":null,"abstract":"Widely available distributed file systems for big data processing are implemented as user-level services since the existing file systems, which are implemented in the operating system kernel, cannot satisfy their requirements. They usually employ file systems in the kernel to persistently save their data in their local systems; thus, the kernel is always interposed for their access the storage devices. Now, next generation non-volatile memory technologies are emerging as byte addressable memory devices that can be used as high performance storage, for which the interposition of the kernel is the source of overhead. This paper proposes the adaption of memory storage to user-level file system services and the convergence of such services and memory storage. User-level file system services are connected to memory storage through the library implementation of a file system, and a library file system can directly interact with memory storage through the memory interface by mapping memory storage onto a user process address space. We implemented a library file system on Linux. The experiment results show that the the implemented library file system outperforms the existing file system in the kernel and performs 1.9x and 6.5x faster for reading and writing, respectively, for typical cases.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114558214","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

An online multi-object tracking by detection approach based on particle filtering framework 基于粒子滤波框架的在线多目标跟踪检测方法

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664216

Zhenhai Wang, Kicheon Hong

{"title":"An online multi-object tracking by detection approach based on particle filtering framework","authors":"Zhenhai Wang, Kicheon Hong","doi":"10.1145/2663761.2664216","DOIUrl":"https://doi.org/10.1145/2663761.2664216","url":null,"abstract":"In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex scenes using a monocular, potentially moving, uncalibrated camera. We propose a novel approach for multi-object tracking by detection in a particle filtering framework. First, in order to improve detection performance, moving objects are automatically extracted using boosting factor and labeling method. Then, multiple objects are tracked in particle filtering framework by adaptively selecting block template according to human model and adaptively updating template using current detection. Finally, we resolve the data association using Hungarian assignment algorithm and compute the observation likelihood function of each particle filter using the associated detection. We present a new method to deal with the variety of the number of objects at random times. The resulting algorithm robustly tracks a variable number of dynamically moving objects in complex scenes with occlusions. The approach relies only on information from the past and is suitable for online application, and does not require any camera or ground plane calibration. We evaluate the performance on a variety of datasets and show that it improves upon state-of-the-art methods.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121850318","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}

引用次数: 0

Unsupervised detection of obfuscated diverse attacks in recommender systems 推荐系统中混淆攻击的无监督检测

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664232

S. S. Hashmi, Sang-Wook Kim

引用次数: 0

DroidDolphin: a dynamic Android malware detection framework using big data and machine learning DroidDolphin:使用大数据和机器学习的动态Android恶意软件检测框架

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2664223

Wen-Chieh Wu, Shih-Hao Hung

引用次数: 158

Meta-routing over heterogeneous networks in M2M systems M2M系统中异构网络的元路由

Research in Adaptive and Convergent Systems Pub Date : 2014-10-05 DOI: 10.1145/2663761.2666033

C. Shih, Guan-Fan Wu

{"title":"Meta-routing over heterogeneous networks in M2M systems","authors":"C. Shih, Guan-Fan Wu","doi":"10.1145/2663761.2666033","DOIUrl":"https://doi.org/10.1145/2663761.2666033","url":null,"abstract":"Machine-to-machine (M2M) allows autonomous computation systems to communicate with each other and to collaborately accomplish the works without human intervention. Each node in M2M network may have different communication interface such as Zigbee, Z-wave and Wi-Fi. We design a routing framework that can enable M2M to transmit data across heterogeneous network interfaces via selecting a routing path under given transmission policy. The framework can work in the dynamic network environment, such as including a new node or losting an existin node, the framework will reconstruct the route automatically without developer/administrator instruction at run-time. A new node broadcasts a route exploration message to the network when it joins to the network. Every node updates the routing table to the new node according to the exploration message. Then the new node will send request message to the neighbors to receive the reply messages from them. After collecting the reply messages, the new node can then build the routing table itself. When a node detects a connection failure, it can recover the routing table from nearby neighbors. The experiment results show that we show that the meta-route framework determine throughput policy with high throughput and high energy consumption, and energy policy with low throughput and low energy consumption.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129680026","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}

引用次数: 3