{"title":"Textile and Apparel Supply Chain with Distributed Ledger Technology (DLT)","authors":"Oisze Lam, Zhibin Lei","doi":"10.1109/MDM.2019.000-4","DOIUrl":"https://doi.org/10.1109/MDM.2019.000-4","url":null,"abstract":"In order to help track and disclose environmental performance across the textile and apparel supply chain, DLT is proposed as an ideal tool for information storage and communication in a highly transparent network. Every participant in the network can get access to the information for supply chain process, and eventually build a high level of trust on suppliers' environmental governance. This paper aims to bring out the potential of DLT technology on the textile and apparel supply chain. We discuss how to utilize the unique characteristics of DLT for achieving low carbon emissions during textile and apparel manufacturing through better supply chain transparency. In details, an overview of DLT technology is provided in this paper by showing the design, business implications and opportunities in the textile and apparel supply chain. In addition, a case study is illustrated on DLT technology in the textile and apparel supply chain transparency for World Wide Fund for Nature (WWF)'s Low Carbon Manufacturing Programme (LCMP).","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132164143","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":"ORSUP: Optimal Route Search with Users' Preferences","authors":"Qun Jiang, Wei-Yi Teng, Yubao Liu","doi":"10.1109/MDM.2019.00-33","DOIUrl":"https://doi.org/10.1109/MDM.2019.00-33","url":null,"abstract":"Route planning has received great attention from researchers with the dramatic development of mobile localization technology and the emerging location based services. It is a trend to consider users' preferences and the budget limit for the shortest path problem. The optimal route search with user's preferences focuses on finding an optimal route from a source to a target with the given keywords and the budget constraint, such that the route can maximally satisfy the user's needs on weighted preferences. We solve the NP-hard problem by proposing an A* based route search algorithm with some effective pruning strategies and present ORSUP, a website for visual query and route display. We describe the details and functions of the system interface and demonstrate the efficiency of proposed algorithm and effectiveness on solving the route search problem via a common scenario.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128730915","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":"Sponsors and Supporter","authors":"","doi":"10.1109/mdm.2019.00-86","DOIUrl":"https://doi.org/10.1109/mdm.2019.00-86","url":null,"abstract":"","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128575475","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":"IDR: Positive Influence Maximization and Negative Influence Minimization Under Competitive Linear Threshold Model","authors":"Chiang Lee, Cheng-En Sung, Hao-Shang Ma, Jen-Wei Huang","doi":"10.1109/MDM.2019.00013","DOIUrl":"https://doi.org/10.1109/MDM.2019.00013","url":null,"abstract":"In influence maximization problem, we would like to find an initial subset of nodes in a given graph, which maximizes the final number of affected nodes through \"word of mouth\" propagation. Measuring the influence spread of set of seed nodes and gradually selecting the node with largest marginal increase is one of the main approaches of existing algorithms. In this paper, we try to solve this problem from a different strategy — in an improvement perspective. A more complex condition is depicted as both positive and negative opinions are propagating in the social network. The objective function considers the maximization of the positive influence and minimizes the negative opinion spreading simultaneously. We propose IDR (Influence Distribution Redirection) algorithm to define initial seed nodes of influence diffusion based on redirecting the influence distribution of nodes to maximize the objective function. The influence distribution of nodes shows the potential influence trend of nodes during the influence diffusion process. The key strategy is reducing the positive influence nearby the steady nodes and increasing in the vacillate region. From the experimental results, IDR outperforms the compared method on the objective function. In addition, IDR also improves the performance of increasing the number of positive active nodes and decreasing the number of negative activated nodes respectively.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116705355","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":"Central Station Based Demand Prediction in a Bike Sharing System","authors":"Jianbin Huang, Xiangyu Wang, Heli Sun","doi":"10.1109/MDM.2019.00-38","DOIUrl":"https://doi.org/10.1109/MDM.2019.00-38","url":null,"abstract":"Predicting the bike demand can help rebalance the bikes and improve the service quality of a bike sharing system. A lot of work focuses on predicting the bike demand for all the stations. It is not necessary because the travel cost of rebalance operations increases sharply as the number of stations increases. In this paper, we take more attention to those stations with higher bike demand, which are called \"central stations\" in the following narrative. We propose a framework to predict the hourly bike demand based on the central stations we define. Firstly, we propose a novel clustering algorithm to assign different types of stations into each cluster. Secondly, we propose a hierarchical prediction model to predict the hourly bike demand for every cluster and each central station progressively. The experimental results on the NYC Citi Bike system show the advantages of our approach to these problems.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115734164","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":"Title Page i","authors":"","doi":"10.1109/mdm.2019.00001","DOIUrl":"https://doi.org/10.1109/mdm.2019.00001","url":null,"abstract":"","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123654968","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":"Message from the ALIAS’19 Workshop Chairs","authors":"","doi":"10.1109/mdm.2019.00-92","DOIUrl":"https://doi.org/10.1109/mdm.2019.00-92","url":null,"abstract":"","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122668912","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":"Fine-Grained Dynamic Population Mapping Method Based on Large-Scale Sparse Mobile Phone Data","authors":"Mingxiao Li, Hengcai Zhang, Jie Chen","doi":"10.1109/MDM.2019.00008","DOIUrl":"https://doi.org/10.1109/MDM.2019.00008","url":null,"abstract":"The dynamic nature of urban population distribution plays a key role in urban planning, emergency management and public travel information services. Currently, the widespread use of mobile phone data provides the opportunity to support fine-scale population studies. However, the data sparsity problem of mobile phone data has been a huge handicap. To overcome this, we proposed a comprehensive approach to achieve fine-grained dynamic population distribution and high-resolution population map based on large-scale sparse mobile phone data. First, we developed an anchor-point-based trajectory reconstruction method to improve the spatiotemporal granularity of mobile phone trajectories. Then, a rapid and efficient automation population mapping method was proposed with the support of reconstructed high spatiotemporal resolution of human movements. Finally, we analyze spatiotemporal characteristics of population distribution and spatial-temporal interaction of human movement. Using a real mobile phone dataset in the city of Shanghai as a case study, we evaluated the performance of our method. Results indicated that our method improved the precision and reliability of population distribution estimation and could be utilized for quantitatively analyzing the spatiotemporal characteristics of population distribution and migration. We argue that this study is useful for understanding the highly dynamic human movement states and supporting advanced urban applications.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116430906","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}
Yongjian Zhao, Stephen New, Kanchana Thilakarathna, Xiaodong Zhang, Qi Han
{"title":"Fine Grained Group Gesture Detection Using Smartwatches","authors":"Yongjian Zhao, Stephen New, Kanchana Thilakarathna, Xiaodong Zhang, Qi Han","doi":"10.1109/MDM.2019.00113","DOIUrl":"https://doi.org/10.1109/MDM.2019.00113","url":null,"abstract":"People may perform synchronized activities in a group setting. It is helpful to provide notifications to users and also the group leader whether people are in sync. This work aims to provide this support via analyzing motion data collected from wearable devices. We collected experimental data from smart watches worn by people, applied signal processing algorithms in both time and frequency domains for identification of the fine-grained group gesture status. We further developed a prototype system consisting of a smart watch, a smartphone, and a server. Our simulation results and actual system implementation demonstrate the feasibility of our approaches.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128666656","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":"Message from the Advanced Seminar Co-Chairs","authors":"M. A. Cheema, Haibo Hu","doi":"10.1109/mdm.2019.00-97","DOIUrl":"https://doi.org/10.1109/mdm.2019.00-97","url":null,"abstract":"","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134156702","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}