检索结果-内蒙古大学图书馆

15th IEEE International Conference on Communication Technology (ICCT)

作者： Kawila, Kiattikun Danmanee, Tanapoom Rojviboonchai, Kultida Chulalongkorn Univ Fac Engn Dept Comp Engn Bangkok Thailand

ISBN: (纸本)9781479900749

Vehicular ad hoc network (VANET) is one type of wireless networks that uses moving vehicles as nodes in the network. In vehicular networks, it is challenging to transfer a query message for a requesting data efficiently when the destination node is out of transmission range from the requestor node. This is because many routing algorithms suffer from frequent path breaks when the vehicles are moving. In this paper, we focus on communication between vehicles to roadside unit stations by requesting data only one-hop communication from the requesting node and does not need to use any routing algorithms to create data transfer path. We present a novel query protocol for data access in VANET called COBRA-Q. The COBRA-Q can work on moving vehicles and achieves to transfer the request data within one-hop communication. The COBRA-Q uses bloom filter technique to keep and compress car traveling history records. We evaluate the performance of our proposed protocol by simulation in ns-3 with urban and highway scenario. The simulation results show that the COBRA-Q can effectively access data in terms of percentage of success rate and overhead of using query message.

关键词： query protocol Bloom filter Data access Vehicular ad hoc networks (VANET)

来源：评论

学校读者我要写书评

暂无评论

Performance of a Cooperative-Bloom Filter-Assisted query protocol for Data Access in Bangkok Scenario

Performance of a Cooperative-Bloom Filter-Assisted Query Pro...

引用

11th International Joint Conference on Computer Science and Software Engineering (JCSSE)

作者： Kawila, Kiattikun Rojviboonchai, Kultida Chulalongkorn Univ Fac Engn Dept Comp Engn Bangkok Thailand

ISBN: (纸本)9781479958221

Vehicular ad hoc network (VANET) is challenging to deliver a query message for a requesting data efficiently when the topology of network keeps changing frequently and has many partitions. Many routing algorithms suffer from path breaks. Our work focuses on communication between vehicles to roadside unit stations by requesting data only one-hop communication from the requesting node. Routing algorithms are not needed to create data transfer path. We present a cooperative-bloom filter-assisted query protocol for data access in VANET, COBRA-Q. The COBRA-Q utilizes the movement of vehicles to achieve transfer of the request data within one-hop communication. The COBRA-Q uses bloom filter technique to keep and compress car traveling history records. In this paper, we evaluate the performance of our proposed protocol by simulation in ns-3. The real vehicle density and the real urban area in Bangkok are used. The simulation results show that the COBRA-Q can effectively access data in terms of percentage of success rate and overhead of using query message.

关键词： query protocol bloom filter data access vehicular ad hoc networks (VANET)

来源：评论

学校读者我要写书评

暂无评论

Performance of a cooperative-bloom filter-assisted query protocol for data access in Bangkok scenario

Performance of a cooperative-bloom filter-assisted query pro...

引用

International Joint Conference on Computer Science and Software Engineering (JCSSE)

作者： Kiattikun Kawila Kultida Rojviboonchai Department of Computer Engineering Chulalongkorn University Bangkok Thailand

ISBN: (纸本)9781479958238

关键词： query protocol Bloom filter Data access Vehicular ad hoc networks (VANET) Access to Information information retrieval Bangkok Thailand vehicle filter technique Communication Research Routing algorithms protocols Simulation results

来源：评论

学校读者我要写书评

暂无评论

Cobra-Q:A Cooperative-Bloom Filter-Assisted query protocol for Data Access in VANET

Cobra-Q:A Cooperative-Bloom Filter-Assisted Query Protocol f...

引用

2013 15th IEEE International Conference on Communication Technology

作者： Kiattikun Kawila Tanapoom Danmanee Kultida Rojviboonchai Department of Computer Engineering Faculty of Engineering Chulalongkorn UniversityBangkokThailand

Vehicular ad hoc network(VANET) is one type of wireless networks that uses moving vehicles as nodes in the *** vehicular networks,it is challenging to transfer a query message for a requesting data efficiently when the destination node is out of transmission range from the requestor *** is because many routing algorithms suffer from frequent path breaks when the vehicles are *** this paper,we focus on communication between vehicles to roadside unit stations by requesting data only one-hop communication from the requesting node and does not need to use any routing algorithms to create data transfer *** present a novel query protocol for data access in VANET called *** COBRA-Q can work on moving vehicles and achieves to transfer the request data within one-hop *** COBRA-Q uses bloom filter technique to keep and compress car traveling history *** evaluate the performance of our proposed protocol by simulation in ns-3 with urban and highway *** simulation results show that the COBRA-Q can effectively access data in terms of percentage of success rate and overhead of using query message.

关键词： query protocol Bloom filter Data access Vehicular ad hoc networks(VANET)

来源：评论

学校读者我要写书评

暂无评论

Learning Convex Partitions and Computing Game-theoretic Equilibria from Best-response Queries

引用

ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION 2021年第1期9卷 1–36页

作者： Goldberg, Paul W. Marmolejo-Cossio, Francisco J. Univ Oxford Oxford England

Suppose that an m-simplex is partitioned into n convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it. The learning objective is to know, for any point in the simplex, a label that occurs within some distance. from that point. We present two algorithms for this task: Constant-Dimension Generalised Binary Search (CD-GBS), which for constant m uses poly(n, log(1/epsilon)) queries, and Constant-Region Generalised Binary Search (CR-GBS), which uses CD-GBS as a subroutine and for constant n uses poly(m, log(1/epsilon)) queries. We show via Kakutani's fixed-point theorem that these algorithms provide bounds on the best-response query complexity of computing approximate well-supported equilibria of bimatrix games in which one of the players has a constant number of pure strategies. We also partially extend our results to games with multiple players, establishing further query complexity bounds for computing approximate well-supported equilibria in this setting.

关键词： query protocol equilibrium computation revealed preferences

来源：评论

学校读者我要写书评

暂无评论

Learning Strong Substitutes Demand via Queries

引用

ACM TRANSACTIONS ON ECONOMICS AND COMPUTATION 2022年第2期10卷 1–22页

作者： Lock, Edwin Goldberg, Paul W. Marmolejo-Cossio, Francisco Univ Oxford Dept Comp Sci Parks Rd Oxford England Harvard Univ Sch Engn & Appl Sci 150 Western Ave Cambridge MA USA

This article addresses the computational challenges of learning strong substitutes demand when given access to a demand (or valuation) oracle. Strong substitutes demand generalises the well-studied gross substitutes demand to a multi-unit setting. Recent work by Baldwin and Klemperer shows that any such demand can be expressed in a natural way as a finite list of weighted bid vectors. A simplified version of this bidding language has been used by the Bank of England. Assuming access to a demand oracle, we provide an algorithm that computes the unique list of weighted bid vectors corresponding to a bidder's demand preferences. In the special case where their demand can be expressed using positive bids only, we have an efficient algorithm that learns this list in linear time. We also show super-polynomial lower bounds on the query complexity of computing the list of bids in the general case where bids may be positive and negative. Our algorithms constitute the first systematic approach for bidders to construct a bid list corresponding to non-trivial demand, allowing them to participate in "productmix" auctions.

关键词： Learning demand preference elicitation bidding language query protocol product-mix auction strong substitutes

来源：评论

学校读者我要写书评

暂无评论

Learning Convex Partitions and Computing Game-Theoretic Equilibria from Best Response Queries 14th

Learning Convex Partitions and Computing Game-Theoretic Equi...

引用

14th International Conference on Web and Internet Economics (WINE)

作者： Goldberg, Paul W. Marmolejo-Cossio, Francisco J. Univ Oxford Oxford England

ISBN: (纸本)9783030046125;9783030046118

Suppose that an m-simplex is partitioned into n convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it. The learning objective is to know, for any point in the simplex, a label that occurs within some distance e from that point. We present two algorithms for this task: Constant-Dimension Generalised Binary Search (CD-GBS), which for constant m uses poly(n, log (1/e)) queries, and Constant-Region Generalised Binary Search (CR-GBS), which uses CD-GBS as a subroutine and for constant n uses poly(m, log (1/e) queries. We show via Kakutani's fixed-point theorem that these algorithms provide bounds on the best-response query complexity of computing approximate well-supported equilibria of bimatrix games in which one of the players has a constant number of pure strategies.

关键词： query protocol Equilibrium computation Revealed preferences

来源：评论

学校读者我要写书评

暂无评论

Mit :: Lcs :: Tr :: Mit-Lcs-Tr-887

引用

2016年

[Auto Generated] 1 Introduction 1 1.1 Our contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Rafail Ostrovsky Charles Rackoffy Adam Smithz February 27, 2003 Abstract A consistent query protocol allows a database owner to publish a very short string c which commits her to a particular database D with special consistency property (i.e., given c, every allowable query has unique and well-de ned answer with respect to D.) Moreover, when a user makes a query, any s

关键词： algorithm consistency consistency proofs consistent consistent query data structure hash hash function hash values mit-lcs-tr-887 proof proofs protocol queries query query protocol query protocols range queries range trees server valid leaves

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：