公开(公告)号：US20120315992A1

公开(公告)日：2012-12-13

申请号：US13157332

申请日：2011-06-10

申请人： Elad Gerson ,  Eyal Ofek ,  Limor Lahiani ,  Brian Beckman ,  Ido Omer

发明人： Elad Gerson ,  Eyal Ofek ,  Limor Lahiani ,  Brian Beckman ,  Ido Omer

IPC分类号： A63F9/24

CPC分类号： G06F17/30241 ,  A63F13/12 ,  A63F2300/204 ,  A63F2300/5573 ,  A63F2300/6676 ,  A63F2300/695 ,  A63F2300/8076 ,  H04W4/02

摘要： Architecture that motivates and utilizes users as the means for capturing geographical data of a desired location. The architecture incentivizes users (e.g., large numbers of mobile-phone and mobile-computer users) to provide the data in the form of geolocation information trails and images captured by user devices. Thus, users take multiple pictures, for example, and can validate existing coverage of specific points of interest based on variable needs of the requestor. One motivational technique is by using augmented reality (AR) games, which include shooting targets associated with the point of interest (e.g., a street). Thus, the game can be designed for the data accumulation, which includes visual data. Additionally, the architecture can determine the areas or points of interest for validation and/or additional coverage by comparing live video data to an image database to decide of the need for update.

摘要翻译： 鼓励和利用用户作为捕获所需位置的地理数据的手段的架构。 该架构激励用户（例如，大量的移动电话和移动计算机用户）以用户设备捕获的地理定位信息路径和图像的形式提供数据。 因此，用户可以采取多个图片，例如，可以根据请求者的变量需求来验证特定兴趣点的现有覆盖。 一种动机技术是通过使用增强现实（AR）游戏，其包括与兴趣点相关联的拍摄目标（例如，街道）。 因此，游戏可以被设计用于包括视觉数据的数据累积。 此外，该架构可以通过将实时视频数据与图像数据库进行比较来确定用于验证和/或附加覆盖的区域或兴趣点，以决定是否需要更新。

公开(公告)号：US08550909B2

公开(公告)日：2013-10-08

申请号：US13157332

申请日：2011-06-10

申请人： Elad Gerson ,  Eyal Ofek ,  Limor Lahiani ,  Brian Beckman ,  Ido Omer

发明人： Elad Gerson ,  Eyal Ofek ,  Limor Lahiani ,  Brian Beckman ,  Ido Omer

IPC分类号： A63F9/24

CPC分类号： G06F17/30241 ,  A63F13/12 ,  A63F2300/204 ,  A63F2300/5573 ,  A63F2300/6676 ,  A63F2300/695 ,  A63F2300/8076 ,  H04W4/02

摘要： Architecture that motivates and utilizes users as the means for capturing geographical data of a desired location. The architecture incentivizes users (e.g., large numbers of mobile-phone and mobile-computer users) to provide the data in the form of geolocation information trails and images captured by user devices. Thus, users take multiple pictures, for example, and can validate existing coverage of specific points of interest based on variable needs of the requestor. One motivational technique is by using augmented reality (AR) games, which include shooting targets associated with the point of interest (e.g., a street). Thus, the game can be designed for the data accumulation, which includes visual data. Additionally, the architecture can determine the areas or points of interest for validation and/or additional coverage by comparing live video data to an image database to decide of the need for update.

摘要翻译： 鼓励和利用用户作为捕获所需位置的地理数据的手段的架构。 该架构激励用户（例如，大量的移动电话和移动计算机用户）以用户设备捕获的地理定位信息路径和图像的形式提供数据。 因此，用户可以采取多个图片，例如，可以根据请求者的变量需求来验证特定兴趣点的现有覆盖。 一种动机技术是通过使用增强现实（AR）游戏，其包括与兴趣点相关联的拍摄目标（例如，街道）。 因此，游戏可以被设计用于包括视觉数据的数据累积。 此外，该架构可以通过将实时视频数据与图像数据库进行比较来确定用于验证和/或附加覆盖的区域或兴趣点，以决定是否需要更新。

公开(公告)号：US20130173653A1

公开(公告)日：2013-07-04

申请号：US13341883

申请日：2011-12-30

申请人： Brian Beckman ,  Eyal Ofek ,  Gur Kimchi ,  Elad Gerson ,  Richard A. Clawson

发明人： Brian Beckman ,  Eyal Ofek ,  Gur Kimchi ,  Elad Gerson ,  Richard A. Clawson

IPC分类号： G06F17/30

CPC分类号： G06Q10/04 ,  G06Q10/063 ,  G06Q10/109

摘要： A sequence of events may be planned by drawing on knowledge of existing sequences of events, and combining those events in accordance with a set of constraints. In one example, the sequences of events are events in a social agenda, such as dinner, drinks, movie, etc. Actual social agendas that users have carried out are monitored (with the users' permission), and these events are stored in a database. A sequence of events may be referred to as an existing path. Using the database, a system can respond to a query such as “plan an evening in Seattle,” or “plan an evening in that includes a movie” by querying the database to determine what sequences have already happened, and either retrieving an existing sequence or synthesizing a new one from existing sequences.

摘要翻译： 可以通过利用现有事件序列的知识来计划事件序列，并且根据一组约束来组合这些事件。 在一个例子中，事件序列是社会议程中的事件，例如晚餐，饮料，电影等。用户执行的实际社会议程被监视（经用户许可），并且这些事件被存储在 数据库。 事件序列可以被称为现有路径。 使用数据库，系统可以通过查询数据库来确定已经发生了哪些序列，并且检索现有的序列来响应查询，例如“在西雅图计划一个晚上”或“计划包含电影的晚上” 或从现有序列合成新的。

公开(公告)号：US20130103715A1

公开(公告)日：2013-04-25

申请号：US13279245

申请日：2011-10-21

申请人： Brian Beckman ,  Elad Gerson ,  Gur Kimchi ,  Avi Bar-Zeev ,  Selvi Chenai ,  Henricus Johannes Maria Meijer

发明人： Brian Beckman ,  Elad Gerson ,  Gur Kimchi ,  Avi Bar-Zeev ,  Selvi Chenai ,  Henricus Johannes Maria Meijer

IPC分类号： G06F17/30

CPC分类号： H04L67/02 ,  G06F9/4488 ,  G06F9/547 ,  G06F17/30498 ,  G06F17/30513 ,  H04L67/42

摘要： Embodiments enable the evaluation of injected queries within a monad. One or more operators with closures are received from a first process. The operators with closures represent one or more functions to be applied by a second process. The second process evaluates the received operators with closures to apply the functions within the monad. During evaluation, the second process converts the closures to simply typed closures. Further, the second process binds the converted closures within the monad to restrict execution of the functions. In some embodiments, the queries (e.g., sequences of one or more operators with closures) are composed using a set of query operators from the language integrated query (LINQ) framework encoded in uniform resource locators (URLs) in the representational state transfer (REST) style.

公开(公告)号：US09075672B2

公开(公告)日：2015-07-07

申请号：US13279245

申请日：2011-10-21

申请人： Brian Beckman ,  Elad Gerson ,  Gur Kimchi ,  Avi Bar-Zeev ,  Selvi Chenai ,  Henricus Johannes Maria Meijer

发明人： Brian Beckman ,  Elad Gerson ,  Gur Kimchi ,  Avi Bar-Zeev ,  Selvi Chenai ,  Henricus Johannes Maria Meijer

IPC分类号： G06F17/30 ,  G06F9/54 ,  G06F9/44

CPC分类号： H04L67/02 ,  G06F9/4488 ,  G06F9/547 ,  G06F17/30498 ,  G06F17/30513 ,  H04L67/42

摘要： Embodiments enable the evaluation of injected queries within a monad. One or more operators with closures are received from a first process. The operators with closures represent one or more functions to be applied by a second process. The second process evaluates the received operators with closures to apply the functions within the monad. During evaluation, the second process converts the closures to simply typed closures. Further, the second process binds the converted closures within the monad to restrict execution of the functions. In some embodiments, the queries (e.g., sequences of one or more operators with closures) are composed using a set of query operators from the language integrated query (LINQ) framework encoded in uniform resource locators (URLs) in the representational state transfer (REST) style.

摘要翻译： 实施例能够评估在monad内注入的查询。 从第一个进程接收到一个或多个具有关闭的运算符。 具有关闭的操作符代表要由第二进程应用的一个或多个功能。 第二个过程使用关闭来评估接收到的运算符，以便在monad中应用这些函数。 在评估期间，第二个过程将闭包转换为简单类型的闭包。 此外，第二过程绑定monad中的转换闭包以限制函数的执行。 在一些实施例中，使用来自在表示状态转移（REST）中的统一资源定位符（URL）中编码的语言集成查询（LINQ）框架的一组查询运算符来组合查询（例如，具有闭包的一个或多个运算符的序列） ）风格。

公开(公告)号：US08463289B2

公开(公告)日：2013-06-11

申请号：US13163396

申请日：2011-06-17

申请人： Gil Shklarski ,  Brian Beckman ,  Eyal Ofek ,  Kenn Daniel Cartier ,  Shai Herzog ,  Gur Kimchi ,  Bernard Lawrence Johnston

发明人： Gil Shklarski ,  Brian Beckman ,  Eyal Ofek ,  Kenn Daniel Cartier ,  Shai Herzog ,  Gur Kimchi ,  Bernard Lawrence Johnston

IPC分类号： H04W24/00

CPC分类号： H04W12/02 ,  H04W64/00 ,  H04W88/08

摘要： Positional information is provided while minimizing the possibility that personally identifiable information can be derived therefrom. Positional information is received in the form of trails that can be aggregated. Individual cells of a grid reflect a quantity of aggregated trails through those cells, an average intensity and direction of movement through those cells, or a more detailed distribution thereof. Alternatively, individual trails are aggregated to an aggregated trail in the form of a line. Further obfuscation of personally identifiable information occurs by resampling aggregated positional information, by introducing false positional information, or by falsely modifying existing positional information, in a manner that does not impact the overall aggregations, and by pruning, or deleting, positional information, especially around sensitive locations, such as a user's home, place of business, or other location that users typically would seek to keep private. Provision of positional information is delayed until a sufficient amount is received.

摘要翻译： 提供位置信息，同时最小化可以从其导出个人身份信息的可能性。 以可聚合的路径的形式收到位置信息。 网格的单个细胞反映了通过这些细胞的聚集迹线的数量，通过这些细胞的平均强度和移动方向，或其更详细的分布。 或者，单个路径将以行的形式聚合到聚合路径。 对个人识别信息的进一步模糊发生是通过重新采样聚合的位置信息，引入错误的位置信息，或以不影响总体聚集的方式错误地修改现有的位置信息，以及通过修剪或删除位置信息，特别是在 敏感位置，例如用户的家庭，营业地点或用户通常将寻求保密的其他位置。 提供位置信息被延迟直到接收到足够的量。

公开(公告)号：US20130212138A1

公开(公告)日：2013-08-15

申请号：US13371800

申请日：2012-02-13

申请人： Eyal Ofek ,  Brian Beckman

发明人： Eyal Ofek ,  Brian Beckman

IPC分类号： G06F17/10

CPC分类号： G06F17/17 ,  G06T11/203 ,  G06T2210/36

摘要： Among other things, one or more techniques and/or systems are provided for creating a hierarchical multi-resolution representation of a curve. That is, a first-level curve (e.g., a relatively lower resolution of the curve) may be represented as a set of points within a first-level curve representation. A non-first-level curve (e.g., a second-level curve associated with a relatively higher resolution of the curve) may be represented as a set of offsets from the first-level curve (e.g., distances along offsets vectors starting from the first-level curve to the second-level curve), which is more efficient than storing complete data sets for different resolutions of the curve. In this way, various resolutions of the curve may be efficiently represented within the hierarchical multi-resolution representation. The various resolutions (e.g., levels) of the curve may also be acted upon or manipulated independently of one another.

摘要翻译： 除其他之外，提供一个或多个技术和/或系统用于创建曲线的分层多分辨率表示。 也就是说，第一级曲线（例如，曲线的相对较低的分辨率）可以被表示为第一级曲线表示内的一组点。 可以将非第一级曲线（例如，与曲线的相对较高的分辨率相关联的第二级曲线）表示为来自第一级曲线的偏移的集合（例如，从第一级起始的偏移矢量的距离 - 级曲线到二级曲线），这比存储曲线不同分辨率的完整数据集更有效。 以这种方式，可以在分层多分辨率表示中有效地表示曲线的各种分辨率。 曲线的各种分辨率（例如，水平）也可以彼此独立地作用或操纵。

公开(公告)号：US20130006517A1

公开(公告)日：2013-01-03

申请号：US13171393

申请日：2011-06-28

申请人： Eyal Ofek ,  Jeffrey Couckuyt ,  Gur Kimchi ,  Brian Beckman

发明人： Eyal Ofek ,  Jeffrey Couckuyt ,  Gur Kimchi ,  Brian Beckman

IPC分类号： G01C21/00

CPC分类号： G01C21/3446 ,  G01C21/3484 ,  G01C21/3492

摘要： Providing directions from point A to point B may be treated as an information retrieval problem. In one example, actual routes that are traveled by people are received, and are stored in a database. When a person requests directions from point A to point B, a system searches the database to determine whether a route from A to B exists. If the route does exist, then the route may be provided as directions in response to the request. If no such route exists, then the system looks in the database for routes that have some amount of overlap with each other, and attempts to construct a route from A to B by joining known routes that overlap with each other. Rules may govern the degree of overlap that routes are to have before they can be joined.

摘要翻译： 提供从点A到点B的指示可以被视为信息检索问题。 在一个示例中，接收到由人行进的实际路由，并存储在数据库中。 当一个人请求从点A到点B的指示时，系统搜索数据库以确定是否存在从A到B的路由。 如果路由确实存在，则可以根据请求将路由提供为方向。 如果不存在这样的路由，则系统在数据库中查找具有一定数量的重叠的路由，并尝试通过加入彼此重叠的已知路由来构建从A到B的路由。 规则可以管理路由在加入之前拥有的重叠程度。

公开(公告)号：US20120322458A1

公开(公告)日：2012-12-20

申请号：US13163396

申请日：2011-06-17

申请人： Gil Shklarski ,  Brian Beckman ,  Eyal Ofek ,  Kenn Daniel Cartier ,  Shai Herzog ,  Gur Kimchi ,  Bernard Lawrence Johnston

发明人： Gil Shklarski ,  Brian Beckman ,  Eyal Ofek ,  Kenn Daniel Cartier ,  Shai Herzog ,  Gur Kimchi ,  Bernard Lawrence Johnston

IPC分类号： H04W24/00

CPC分类号： H04W12/02 ,  H04W64/00 ,  H04W88/08

摘要： Positional information is provided while minimizing the possibility that personally identifiable information can be derived therefrom. Positional information is received in the form of trails that can be aggregated. Individual cells of a grid reflect a quantity of aggregated trails through those cells, an average intensity and direction of movement through those cells, or a more detailed distribution thereof. Alternatively, individual trails are aggregated to an aggregated trail in the form of a line. Further obfuscation of personally identifiable information occurs by resampling aggregated positional information, by introducing false positional information, or by falsely modifying existing positional information, in a manner that does not impact the overall aggregations, and by pruning, or deleting, positional information, especially around sensitive locations, such as a user's home, place of business, or other location that users typically would seek to keep private. Provision of positional information is delayed until a sufficient amount is received.

摘要翻译： 提供位置信息，同时最小化可以从其导出个人身份信息的可能性。 以可聚合的路径的形式收到位置信息。 网格的单个细胞反映了通过这些细胞的聚集迹线的数量，通过这些细胞的平均强度和移动方向，或其更详细的分布。 或者，单个路径将以行的形式聚合到聚合路径。 对个人识别信息的进一步模糊发生是通过重新采样聚合的位置信息，引入错误的位置信息，或以不影响总体聚集的方式错误地修改现有的位置信息，以及通过修剪或删除位置信息，特别是在 敏感位置，例如用户的家庭，营业地点或用户通常将寻求保密的其他位置。 提供位置信息被延迟直到接收到足够的量。

公开(公告)号：US08954266B2

公开(公告)日：2015-02-10

申请号：US13171393

申请日：2011-06-28

申请人： Eyal Ofek ,  Jeffrey Couckuyt ,  Gur Kimchi ,  Brian Beckman

发明人： Eyal Ofek ,  Jeffrey Couckuyt ,  Gur Kimchi ,  Brian Beckman

IPC分类号： G01C21/00 ,  G01C21/34

CPC分类号： G01C21/3446 ,  G01C21/3484 ,  G01C21/3492

摘要： Providing directions from point A to point B may be treated as an information retrieval problem. In one example, actual routes that are traveled by people are received, and are stored in a database. When a person requests directions from point A to point B, a system searches the database to determine whether a route from A to B exists. If the route does exist, then the route may be provided as directions in response to the request. If no such route exists, then the system looks in the database for routes that have some amount of overlap with each other, and attempts to construct a route from A to B by joining known routes that overlap with each other. Rules may govern the degree of overlap that routes are to have before they can be joined.

摘要翻译： 提供从点A到点B的指示可以被视为信息检索问题。 在一个示例中，接收到由人行进的实际路由，并将其存储在数据库中。 当一个人请求从点A到点B的指示时，系统搜索数据库以确定是否存在从A到B的路由。 如果路由确实存在，则可以根据请求将路由提供为方向。 如果不存在这样的路由，则系统在数据库中查找具有一定数量的重叠的路由，并尝试通过加入彼此重叠的已知路由来构建从A到B的路由。 规则可以管理路由在加入之前拥有的重叠程度。