- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Graph Realization in IoT: Theory, Practice andNew TrendsYongcai Wang Renmin University of ChinaBeijing Ganweizhizhu Co. LtdOutline1、Introduction2、Related Theory3、Practice4、New TrendsInternet of Things (IOT) Will Cover Our Life SpaceSensors and Actuators collect information, analyze real-time contexts, and provide smart services. Things are connected by invisible links. What is the internal structure of this complex network?IOT can be modeled by a GraphPeople or entity, as NodesLinksmeasure relationships: distance, similarity, friendship etc. Realize the Graph helps to reveal the internal structure of IOTAn Example: Localization in IOTWhat is the real-time geometric structure of the network?Locations of entities can be inferred by distance links among entities.Realize the Graph helps to reveal the internal structure of IOTAnother Example: Data Inference in IOTHaving only limited number of monitoring stations. We want to know exact PM2.5, AQI data of more spots.The data can be inferenced by similarity (distance) links among the spots and the monitoring stations. Realize the Graph helps to reveal the internal structure of IOTAnother Example: Network Visualization in Smart CityTo visualize all entities onto the city map. Locations of people and entities can be inferred by the links among the non-GPS entities, and entities with GPS. Graph Realization ProblemDefinition 1: Graph Realization“Given a graph G=(V, E) of |V|=n vertexes and |E|= medges, along with a real number ??,$ associated with each edge (i, j), graph realization is to find vertex coordinatesP={p1, p2,…, pn}∈ ? , such that the Euclidian distance between any two vertexes i, j equals to the number ??,$ .”To find the vertex coordinates in d-dimensional space by partially measured distances or similarities among some pairs of vertexes. Graph Realization ProblemRealized DNA StructureGiven this distance matrix of DNAs Hardness of Graph RealizationGiven G = (V, E, ω ) and integer k, the problem: Does Ghave a
文档评论(0)