公开(公告)号：US20160371728A1

公开(公告)日：2016-12-22

申请号：US14743645

申请日：2015-06-18

Applicant: International Business Machines Corporation

Inventor： RAGHU K. GANTI ,  Norbert Herman ,  Shubhadip Ray ,  Mudhakar Srivatsa

IPC: G06Q30/02 ,  G06F3/0346

CPC classification number: G06Q30/0254 ,  G06F1/1694 ,  G06F3/0346 ,  G06F3/04842 ,  G06Q30/0261 ,  G06Q30/0267

Abstract: For targeted presentation of information on a mobile device, a presence of the device is detected at a given time at in a zone. A pause is detected in a movement of the device in the zone. A hangout pattern of the device is predicted. The hangout pattern includes an expected pause duration of the pause. Using the hangout pattern and the detected pause, a time is computed to present a content on the device. The content presented at the time is expected to have a higher than a threshold probability of receiving an input at the device. The content is selected according to the probability of receiving the input. The content is transmitted to the device such that the content is available for presenting at the device at the computed time.

Abstract translation: 为了在移动设备上定向呈现信息，在区域中的给定时间检测设备的存在。 在该区域中的设备的移动中检测到暂停。 预测该设备的环聊模式。 环聊模式包括暂停的预期暂停持续时间。 使用环聊模式和检测到的暂停，计算一个时间来呈现设备上的内容。 此时呈现的内容预期具有高于接收设备输入的阈值概率。 根据接收输入的概率选择内容。 将内容发送到设备，使得内容可用于在计算的时间在设备处呈现。

公开(公告)号：US20190011272A1

公开(公告)日：2019-01-10

申请号：US16116423

申请日：2018-08-29

Applicant: International Business Machines Corporation

Inventor： Xiao Yan Chen ,  RAGHU K. GANTI ,  Sheng Huang ,  Kai Liu ,  Ramya Raghavendra ,  MUDHAKAR SRIVATSA

IPC: G01C21/34 ,  G01C21/32 ,  G06F17/30

Abstract: A method, computer system, and computer readable product for trajectory data compression are disclosed. In embodiments, the method comprises generating spatial data for one or more moving objects; projecting the data onto a network comprised of a plurality of trajectories, the network constraining movement of the one or more moving objects; and storing the projected data in a data store. In embodiments of the invention, the method further comprises translating updates and queries to the spatial data, using specified data of the network, into links to the data store, and using the links to update and query the data store. In embodiments of the invention, the specified data of the network are stored in a network store. In embodiments of the invention, each of the trajectories includes one or more sub-trajectories, and the projecting the spatial data onto a network includes projecting the spatial data onto the sub-trajectories.

公开(公告)号：US20160171027A1

公开(公告)日：2016-06-16

申请号：US14230676

申请日：2014-03-31

Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor： DAKSHI AGRAWAL ,  RAGHU K. GANTI ,  MUDHAKAR SRIVATSA ,  PETROS ZERFOS

IPC: G06F17/30

CPC classification number: G06F16/90344 ,  G06F16/29 ,  G06F16/9014

Abstract: A system and method are provided for discovering k-nearest-neighbors to a given point within a certain distance d. The method includes constructing an index of geometries using geohashes of geometries as an indexing key to obtain an indexed set of geometries, and calculating a geohash representation of the given point with a resolution equal to a magnitude value of d. The method includes searching for a closest-prefix geometry from the indexed set using the geohash representation of the given point, and identifying geometries from the indexed set having a same prefix as the closest-prefix geometry. The method further includes calculating distances between the given point and the geometries identified from the indexed set having the same prefix as the closest-prefix geometry, and determining k geometries with respective shortest distances less than d from the geometries identified from the indexed set having the same prefix as the closest-prefix geometry.

Abstract translation: 提供了一种发现在一定距离内给定点的k个最近邻居的系统和方法。 该方法包括使用几何形状的几何形状作为索引键来构造几何的索引，以获得索引的几何集合，以及以等于d的幅度值的分辨率来计算给定点的geohash表示。 该方法包括使用给定点的地理位置表示来搜索来自索引集合的最近前缀几何，以及从具有与最近前缀几何相同的前缀的索引集合中识别几何。 该方法还包括计算给定点与从具有与最近前缀几何相同的前缀的索引集合识别的几何之间的距离，以及从具有相同前缀几何的索引组确定的几何形状中确定具有小于d的相应最短距离的k个几何 与最近前缀几何相同的前缀。