MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940361

Qingsong Yao, Jianfeng Ma, Cong Sun, Xinghua Li, Jinku Li

引用次数: 4

Analyzing GUI running fluency for Android apps 分析Android应用的GUI运行流畅性

MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940356

Tian Huang, Zhenyu Zhang, Xueling Zhu

{"title":"Analyzing GUI running fluency for Android apps","authors":"Tian Huang, Zhenyu Zhang, Xueling Zhu","doi":"10.1145/2940353.2940356","DOIUrl":"https://doi.org/10.1145/2940353.2940356","url":null,"abstract":"Android as a free open platform has become increasingly popular and been widespread adopted in mobile, tablet, and other devices. However, a great number of issues, such as inadequate quality and the fragmentation phenomenon, have emerged, enhancing the difficulty of developing. Among them, the running fluency of Android apps directly affects user experience directly. As a result, it is of great significance to detect and analyze it.\u0000 The frame rate and 16-ms-per-frame benchmark are the most popular metrics to evaluate and measure the smooth performance of Android application GUIs and to test the quality of apps by developers. However, very few studies have analyzed the performance and consider the adequate usage of frame rate before extensively applying it. Further, current tools provided by Google or third-party cannot obtain the frame rate and rendering time for the system with multiple applications.\u0000 In this work, we focus on the performance issue, revisit and analyze various factors that Android apps do not run smoothly, along with Android graphic system. After that, we present ARFluency --- a tool to measure and automatically analyze the system and applications without modifying the source code of the Android apps. We also conduct an experiment to validate our tool using realistic Android apps. Experimental results show that although even the apps running fluently do have problematic frames. However, the metrics of frame rate cannot accurately reflect the performance of Android applications.","PeriodicalId":429119,"journal":{"name":"MSCC '16","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354209","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

Data reconstruction with spatial and temporal correlation in wireless sensor networks 基于时空相关的无线传感器网络数据重构

MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940360

Yayun Zhang, Hongju Cheng, Dongyin Chen

{"title":"Data reconstruction with spatial and temporal correlation in wireless sensor networks","authors":"Yayun Zhang, Hongju Cheng, Dongyin Chen","doi":"10.1145/2940353.2940360","DOIUrl":"https://doi.org/10.1145/2940353.2940360","url":null,"abstract":"Data loss is a common phenomenon in the practical wireless sensor networks due to several observations, such as the node or link failure, the expensive cost of re-transmission, and so on. How to reconstruct the lost data is one important issue for many applications which concern heavily on the data gathering issues. Most of the current data reconstruction solutions are based on the spatial correlation and they adopt interpolation methods to approximate the data reconstruction process, which leads to bad performance especially in case that the number of data loss increases in the network. In this paper, we consider the spatial and temporal correlation simultaneously, and propose a novel data reconstruction algorithm to improve the data error ratio in the wireless sensor networks. The proposed algorithm can utilize the spatial correlation by using the curved face reconstruction, and it is also helpful to improve the accuracy of data reconstruction by exploring the temporal correlation among the sensory data. Extensive experiments demonstrate that the proposed data reconstruction algorithm can significantly reduce the fitting data error ratio compared with related works especially in case that data loss is serious in the network.","PeriodicalId":429119,"journal":{"name":"MSCC '16","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124930759","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}

引用次数: 7

Performance analysis of spatial-temporal spectrum sensing for cognitive vehicular network 认知车辆网络时空频谱感知性能分析

MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940354

Xia Liu, Zhimin Zeng, Caili Guo, Siting Zhu

引用次数: 8

Mobile crowdsensing incentives under participation uncertainty 参与不确定性下的移动众感激励

MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940357

Panagiota Micholia, M. Karaliopoulos, I. Koutsopoulos

{"title":"Mobile crowdsensing incentives under participation uncertainty","authors":"Panagiota Micholia, M. Karaliopoulos, I. Koutsopoulos","doi":"10.1145/2940353.2940357","DOIUrl":"https://doi.org/10.1145/2940353.2940357","url":null,"abstract":"Mobile crowdsensing applications rely on crowds of contributors who are willing to carry out certain tasks of interest. This willingness varies widely across users and tasks and (monetary) incentives are often engaged to strengthen it or make up for its total absence. These incentives need to carefully account for the highly non-homogeneous response of users to external motivation.\u0000 We propose a framework that explicitly accounts for the implicit uncertainty about the eventual participation and contributions of users. In the framework, the impact of incentives on the user choice to contribute or not is modeled probabilistically. First, we formulate a convex optimization problem for incentive allocation with the goal of achieving maximum expected quality while taking into account task budget limitations and constraints related to the physical locations of users and tasks. We then propose an iterative algorithm to alleviate the complexity of the original problem with two basic steps: an allocation step that applies incentive allocation to a set of available contributors; and a refinement step that revokes portions of the allocated incentives. We study the performance characteristics of our algorithm by comparing it to a default solver for convex optimization problems.","PeriodicalId":429119,"journal":{"name":"MSCC '16","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116024053","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}

引用次数: 12

Optimized ciphertext retrieval for cloud computing based on dynamic clustering 基于动态聚类的云计算密文检索优化

MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940359

Lan Yao, Jialiang Gu, Yanfang Gao

{"title":"Optimized ciphertext retrieval for cloud computing based on dynamic clustering","authors":"Lan Yao, Jialiang Gu, Yanfang Gao","doi":"10.1145/2940353.2940359","DOIUrl":"https://doi.org/10.1145/2940353.2940359","url":null,"abstract":"With the extensive application of cloud storage, the amount of data stored in the server rapidly increases. At the same time, user documentation typically contains privacy-sensitive information that needs to be encrypted before uploaded to the cloud server. Facing such a large number of ciphertext data, the existing search technologies in retrieve of large amounts of data efficiency of the ciphertext data are fulfilling. To solve this problem, this paper makes improvement based on similarity search tree ciphertext retrieval method (MRSE-SS). In the big data environment, this paper proposes dynamic range clustering algorithm DIK-MEDOIDS. This method divides gap between the maximum and minimum document vectors into k slots. The size of the slots is hypersphere diameter, and the document vector which is closest to the middle value of the range is set as the hypersphere center. The size of each documentation slot depends on number of documents. Different with MRSS-SS algorithm, the proposed algorithm can search the qualified documents in the searching stage among hypersphere, to expand the cover of both documents and searching sets for returned data more in line with the user search need. With the increase of the documents, slots are dynamically determined. At the search stage, the search vector is represented as a hypersphere. Cloud server makes the determination through the position of search vector hypersphere and similarity search tree nodes. Along with the number of documents increasing, initialized time increases linearly, while the search stage is same with algorithms MRSE-SS which is shown in formula. When the document vector DC exponential grows, the time complexity is O (l).","PeriodicalId":429119,"journal":{"name":"MSCC '16","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125488850","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

Architecture and performance of the industrial wired/wireless hybrid networks with multi-token 多令牌工业有线/无线混合网络的体系结构和性能

MSCC '16 Pub Date : 2016-07-05 DOI: 10.1145/2940353.2940355

Weiyan Hou, Yang Song, Haikuan Wang, A. Hunger

引用次数: 1

MSCC '16最新文献