Proceedings of the 17th International Conference on Distributed Computing and Networking最新文献_第3页

Conversational intelligence analysis 会话智能分析

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849568

Alice Toniolo, A. Preece, William M. Webberley, T. Norman, Paul Sullivan, Timothy Dropps

{"title":"Conversational intelligence analysis","authors":"Alice Toniolo, A. Preece, William M. Webberley, T. Norman, Paul Sullivan, Timothy Dropps","doi":"10.1145/2833312.2849568","DOIUrl":"https://doi.org/10.1145/2833312.2849568","url":null,"abstract":"Social networks foster the development of social sensing to gather data about situations in the environment. Making sense of this information is, however, a challenge because the process is not linear and additional sensed information may be needed to better understand a situation. In this paper we explore how two complementary technologies, Moira and CISpaces, operate in unison to support collaboration among human-agent teams to iteratively gather and analyse information to improve situational awareness. The integrated system is developed for supporting intelligence analysis in a coalition environment. Moira is a conversational interface for information gathering, querying and evidence aggregation that supports cooperative data-driven analytics via Controlled Natural Language. CISpaces supports collaborative sensemaking among analysts via argumentation-based evidential reasoning to guide the identification of plausible hypotheses, including reasoning about provenance to explore credibility. In concert, these components enable teams of analysts to collaborate in constructing structured hypotheses with machine-based systems and external collaborators.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125011507","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}

引用次数: 13

Finding occupancy in buses using crowdsourced data from smartphones 利用智能手机的众包数据查找公交车的占用情况

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833460

Megha Chaudhary, A. Bansal, D. Bansal, B. Raman, K. Ramakrishnan, N. Aggarwal

{"title":"Finding occupancy in buses using crowdsourced data from smartphones","authors":"Megha Chaudhary, A. Bansal, D. Bansal, B. Raman, K. Ramakrishnan, N. Aggarwal","doi":"10.1145/2833312.2833460","DOIUrl":"https://doi.org/10.1145/2833312.2833460","url":null,"abstract":"In the present scenario, developing countries like India are facing huge traffic congestion problems. Commuters have to wait long hours for arrival of buses, and when the bus arrives it is often found to be overcrowded, causing inconvenience in the commuters and discouraging them to use public transit system. The ITS(Intelligent Transport System) developed so far does provide arrival time of buses in real time but such systems are rare which provide the passenger occupancy in real time. Most of such installations use extortionate devices like passenger counting devices, cameras etc installed on the buses and at the bus stops. In this paper we propose a cost effective user participation based mode of collecting information about occupancy level of public transportation system using the potential of smartphones. Smartphones have inbuilt sensors like GPS which can be used to extract locational intelligence of the commuters. Hence, information gets crowdsourced from commuters and they themselves can provide information about occupancy level of a bus using their smartphones. The information so collected is stored in a historical database which is analyzed and processed to obtain occupancy level patterns for different routes on different days. The patterns observed are used to make predictions of occupancy level in a bus. Our results show that it is possible to achieve an accuracy to a level of 91.86 percent.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"875-877 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123651171","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

Stability and optimization of DNS-based request redirection in CDNs cdn中基于dns的请求重定向的稳定性与优化

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833455

W. Benchaita, S. Ghamri-Doudane, S. Tixeuil

引用次数: 7

Local checkability, no strings attached 本地可检查性，没有附加条件

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833315

Klaus-Tycho Förster, Thomas Luedi, J. Seidel, Roger Wattenhofer

{"title":"Local checkability, no strings attached","authors":"Klaus-Tycho Förster, Thomas Luedi, J. Seidel, Roger Wattenhofer","doi":"10.1145/2833312.2833315","DOIUrl":"https://doi.org/10.1145/2833312.2833315","url":null,"abstract":"In this work we study local checkability of network properties like s-t reachability, or whether the network is acyclic or contains a cycle. A structural property S of a graph G is locally checkable, if there is a prover-and-verifier pair (P, V) as follows. The prover P assigns a label to each node in graphs satisfying S. The verifier V is a constant time distributed algorithm that returns Yes at all nodes if G satisfies S and was labeled by P, and No for at least one node if G does not satisfy S, regardless of the node labels. The quality of (P, V) is measured in terms of the label size. We obtain (asymptotically) tight bounds for the bit complexity of the latter two problems for undirected as well as directed networks, where in the directed case we consider one-way and two-way communication, i.e., we distinguish whether communication is possible only in the edge direction or not. For the one-way case we obtain a new asymptotically tight lower bound for the bit complexity of s-t reachability. For the two-way case we devise an emulation technique that allows us to transfer a previously known s-t reachability upper bound without asymptotic loss in the bit complexity.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115348057","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

A study on Singapore haze 新加坡雾霾研究

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849569

B. Dai, Kasthuri Jayarajah, Ee-Peng Lim, Archan Misra, Shriguru Nayak

引用次数: 1

Incremental time series algorithms for IoT analytics: an example from autoregression 物联网分析的增量时间序列算法:一个来自自回归的例子

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849556

D. Mukherjee, Suman Datta

引用次数: 4

Collaborative cellular tail energy reduction: feasibility and fairness 协同元胞尾能量削减:可行性与公平性

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833451

G. D. Silva, B. Chen, M. Chan

引用次数: 5

Debunking the myth that tight packing is energy conserving 揭穿密实包装节约能源的神话

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833447

Swetha P. T. Srinivasan, U. Bellur, R. Badrinath

引用次数: 2

A cloud security framework for a data centric WSN application 用于以数据为中心的WSN应用程序的云安全框架

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2849559

Sayantani Saha, Rounak Das, Suman Datta, S. Neogy

引用次数: 17

Evacuating two robots from multiple unknown exits in a circle 从多个未知出口疏散两个机器人

Proceedings of the 17th International Conference on Distributed Computing and Networking Pub Date : 2016-01-04 DOI: 10.1145/2833312.2833318

J. Czyzowicz, S. Dobrev, Konstantinos Georgiou, E. Kranakis, Fraser MacQuarie

{"title":"Evacuating two robots from multiple unknown exits in a circle","authors":"J. Czyzowicz, S. Dobrev, Konstantinos Georgiou, E. Kranakis, Fraser MacQuarie","doi":"10.1145/2833312.2833318","DOIUrl":"https://doi.org/10.1145/2833312.2833318","url":null,"abstract":"Distributed on a unit circle are k exits. Two autonomous mobile robots are placed on the circle. Each robot has a maximum speed of 1 and the robots can communicate wirelessly. The robots have a map of the domain, including exits, but do not have knowledge of their own initial locations on the domain, rather they only know their relative distance. The goal of the evacuation problem is to give an algorithm for the robots which minimizes the time required for both robots to reach an exit, in the worst case. We consider two variations of the problem depending on whether the two robots have control over their initial distance. When the initial distance of the robots is part of the input (i.e. no control), we show that simple algorithms exist which achieve optimal worst case evacuation times for the cases where: the robots begin colocated with an arbitrary distribution of the exits; and when the exits are either colocated or evenly spaced, with arbitrary starting positions of the robots. We also give upper and lower bounds on the problem with arbitrary exit distribution and starting positions of the robots. For the problem where robots can choose their initial distance (with knowledge of, but not control over the distribution of exits), we propose a natural family of algorithms parameterized by the maximum distance between any two exits.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553510","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}

引用次数: 23