-
公开(公告)号：US08558917B2
公开(公告)日：2013-10-15
申请号：US12096305
申请日：2006-11-24
申请人： Kenneth Wood , Stephen Hodges , Lyndsay Williams , Mitch Goldberg , Carsten Rother , Antonio Criminisi , James Srinivasan
发明人： Kenneth Wood , Stephen Hodges , Lyndsay Williams , Mitch Goldberg , Carsten Rother , Antonio Criminisi , James Srinivasan
CPC分类号： H04N1/33353 , H04N1/00204 , H04N1/00307 , H04N1/32 , H04N2101/00 , H04N2201/0049 , H04N2201/0055
摘要： A method of transferring images from a first device to a second device and computer program code for performing this method is described. A connection characteristic for a connection between the first & second devices is determined and at least one image is selected from a plurality of images on the first device for transfer dependent upon both the connection characteristic and image selection criteria. The selected image(s) are then transferred over the connection from the first device to the second device.
摘要翻译： 描述了将图像从第一设备传送到第二设备的方法以及用于执行该方法的计算机程序代码。 确定第一和第二设备之间的连接的连接特性，并且取决于连接特性和图像选择标准两者，从用于传送的第一设备上的多个图像中选择至少一个图像。 所选择的图像然后通过连接从第一设备传输到第二设备。
-
公开(公告)号：US08548986B2
公开(公告)日：2013-10-01
申请号：US12727235
申请日：2010-03-19
IPC分类号： G06F17/30
CPC分类号： G06F17/30492
摘要： Architecture that provides for greater interoperability between column stores and row stores by leveraging the advantages both have to offer. The architecture operates automatically (e.g., dynamically) to move between row oriented processing mode and batch processing mode, and the combination thereof, when it is more beneficial to run in one mode relative to the other mode, or both modes. The auto-switching of data processing between batch and row oriented mode occurs during the execution of a single query. The architecture can automatically modify an operator in the query tree and/or remove an operator if desired at runtime for more efficient processing. This approach also accounts for memory constraints for either of row or column processing.
摘要翻译： 架构通过利用两者必须提供的优点，提供列存储和行存储之间的更大的互操作性。 当相对于其他模式或两种模式运行在一种模式中更有利时，架构在行面向处理模式和批处理模式之间自动运行（例如，动态地）移动，以及其组合。 批处理和行向模式之间的数据处理自动切换在执行单个查询期间发生。 架构可以在运行时自动修改查询树中的运算符和/或删除运算符，以便更有效的处理。 这种方法也解决了行或列处理中的任何一个的内存限制。
-
公开(公告)号：US08499222B2
公开(公告)日：2013-07-30
申请号：US12967903
申请日：2010-12-14
IPC分类号： H03M13/00
CPC分类号： G06F9/5066
摘要： Supporting distributed key-based processes is described. In an embodiment, servers at a data center provide a key-based process for carrying out computationally expensive tasks and are connected using point to point connections in a geometric topology such as a torus. In an example, aggregation trees are built on top of the geometric topology of the data center, each aggregation tree being a sequence of servers in the data center that forms a tree structure. In an embodiment packets of data are sent from the leaves of the trees to the root and at each server along the tree the packets are aggregated using a combiner function of the key-based process. In an embodiment, if a server fails, the trees are dynamically recomputed and a recovery phase is triggered to resend any packets lost at the failed server. In some embodiments, packets are scheduled by inspecting the content of the packets.
摘要翻译： 描述支持基于分布式密钥的进程。 在一个实施例中，数据中心的服务器提供用于执行计算上昂贵的任务的基于密钥的过程，并且使用诸如环面的几何拓扑中的点对点连接。 在一个示例中，聚合树建立在数据中心的几何拓扑之上，每个聚合树是数据中心中形成树结构的一系列服务器。 在一个实施例中，使用基于密钥的过程的组合器功能，将数据包从树的树叶发送到根，并且沿树的每个服务器将数据包聚合。 在一个实施例中，如果服务器发生故障，则动态地重新计算树并且触发恢复阶段以重新发送在故障服务器处丢失的任何分组。 在一些实施例中，通过检查分组的内容来调度分组。
-
公开(公告)号：US08498481B2
公开(公告)日：2013-07-30
申请号：US12776082
申请日：2010-05-07
申请人： Andrew Blake , Varun Gulshan , Carsten Rother , Antonio Criminisi
发明人： Andrew Blake , Varun Gulshan , Carsten Rother , Antonio Criminisi
IPC分类号： G06K9/34
CPC分类号： G06T7/11 , G06T7/194 , G06T2207/20101 , G06T2207/20168
摘要： Image segmentation using star-convexity constraints is described. In an example, user input specifies positions of one or more star centers in a foreground to be segmented from a background of an image. In embodiments, an energy function is used to express the problem of segmenting the image and that energy function incorporates a star-convexity constraint which limits the number of possible solutions. For example, the star-convexity constraint may be that, for any point p inside the foreground, all points on a shortest path (which may be geodesic or Euclidean) between the nearest star center and p also lie inside the foreground. In some examples continuous star centers such as lines are used. In embodiments a user may iteratively edit the star centers by adding brush strokes to the image in order to progressively change the star-convexity constraints and obtain an accurate segmentation.
摘要翻译： 描述了使用星形凸度约束的图像分割。 在一个示例中，用户输入指定要从图像的背景分割的前景中的一个或多个星形中心的位置。 在实施例中，能量函数用于表示分割图像的问题，并且能量函数包含限制可能解决方案数量的星形 - 凸度约束。 例如，星凸约束可以是，对于前景中的任何点p，最近的星中心和p之间的最短路径上的所有点（可以是测地线或欧几里德）也位于前景内。 在一些示例中，使用诸如线的连续星形中心。 在实施例中，用户可以通过向图像中添加画笔笔触来迭代地编辑星形中心，以逐渐改变星形凸度约束并获得准确的分割。
-
公开(公告)号：US08478762B2
公开(公告)日：2013-07-02
申请号：US12434329
申请日：2009-05-01
申请人： Milan Vojnović , Dinkar Vasudevan
发明人： Milan Vojnović , Dinkar Vasudevan
IPC分类号： G06F7/38
CPC分类号： G06F17/3053
摘要： Ranking systems are described. In an embodiment a large scale data center has peta bytes of items and a query engine is provided to find the top k most frequently occurring items. In embodiments, samples are taken from the data center at least until a specified number of samplings is met, or until a stopping rule is met. In examples, the samples form a sample sketch which is used to find the top k most frequently occurring items without the need to examine every item in the data center. In other examples, the number of samplings or stopping rule is varied to provide ranks or frequencies. In other embodiments the ranking system operates on items having values to find separators which divide the items into bins such that the proportion of the items in each bin is different. For example, a data set may be apportioned to different types of processor.
摘要翻译： 对系统进行了描述。 在一个实施例中，大规模数据中心具有peta字节的项目，并且提供查询引擎以找到最上面k个最常出现的项目。 在实施例中，至少直到满足指定数量的采样，或直到满足停止规则，才从数据中心取样本。 在示例中，样本形成一个样本草图，用于查找最常k个最常出现的项目，而不需要检查数据中心中的每个项目。 在其他示例中，采样或停止规则的数量被改变以提供等级或频率。 在其他实施例中，排名系统对具有值的物品进行操作以找到将物品分成箱子的分隔件，使得每个箱中的物品的比例不同。 例如，数据集可以分配给不同类型的处理器。
-
公开(公告)号：US08417650B2
公开(公告)日：2013-04-09
申请号：US12694485
申请日：2010-01-27
IPC分类号： G06F15/18
CPC分类号： G06Q30/02 , G06N7/005 , G06Q10/00 , G06Q30/0202
摘要： Event prediction in dynamic environments is described. In an embodiment a prediction engine may use the learnt information to predict events in order to control a system such as for internet advertising, email filtering, fraud detection or other applications. In an example one or more variables exists for pre-specified features describing or associated with events and each variable is considered to have an associated weight and time stamp. For example, belief about each weight is represented using a probability distribution and a dynamics process is used to modify the probability distribution in a manner dependent on the time stamp for that weight. For example, the uncertainty about the associated variable's influence on prediction of future events is increased. Examples of different schedules for applying the dynamics process are given.
摘要翻译： 描述动态环境中的事件预测。 在一个实施例中，预测引擎可以使用所学习的信息来预测事件，以便控制诸如互联网广告，电子邮件过滤，欺诈检测或其他应用的系统。 在一个示例中，存在用于描述或与事件相关联的预先指定的特征的一个或多个变量，并且每个变量被认为具有相关联的权重和时间戳。 例如，使用概率分布来表示关于每个权重的信念，并且使用动态过程以取决于该权重的时间戳的方式来修改概率分布。 例如，相关变量对未来事件预测的影响的不确定性增加。 给出了应用动态过程的不同时间表的示例。
-
公开(公告)号：US08412984B2
公开(公告)日：2013-04-02
申请号：US12944740
申请日：2010-11-12
申请人： Paul Maybee , Daniel Moth , Anitha Panapakkam
发明人： Paul Maybee , Daniel Moth , Anitha Panapakkam
IPC分类号： G06F11/00
CPC分类号： G06F11/362 , G06F11/0715 , G06F11/0757
摘要： A technology is described for debugging in a cluster processing network. A scheduler can dispatch a process that is part of the cluster job for execution. Further, a compute node can be used to execute the process dispatched by the scheduler to the compute node. A debugger can be activated in response to an unhandled suspension event in the process on the compute node. In addition, the debugger can send notification messages regarding the unhandled suspension event. A job monitor can receive a notification from the debugger that an unhandled suspension event has occurred. The notification can be displayed to a user via the job monitor.
摘要翻译： 描述了一种用于在集群处理网络中进行调试的技术。 调度程序可以调度作为集群作业一部分的进程来执行。 此外，可以使用计算节点来执行由调度器发送到计算节点的过程。 响应于计算节点上的进程中的未处理的暂停事件，可以激活调试器。 此外，调试器可以发送关于未处理的暂停事件的通知消息。 作业监视器可以从调试器接收到发生未处理的暂停事件的通知。 该通知可以通过作业监视器显示给用户。
-
公开(公告)号：US08411948B2
公开(公告)日：2013-04-02
申请号：US12718232
申请日：2010-03-05
摘要： A method of up-sampling binary images for segmentation is described. In an embodiment, digital images are down-sampled before segmentation. The resulting initial binary segmentation, which has a lower resolution than the original image, is then up-sampled and smoothed to generate an interim non-binary solution which has a higher resolution than the initial binary segmentation. The final binary segmentation for the image is then computed from the interim non-binary solution based on a threshold. This method does not use the original image data in inferring the final binary segmentation solution from the initial binary segmentation. In an embodiment, the method may be applied to all images and in another embodiment, the method may be used for images which comprise a large number of pixels in total or in single dimension and smaller images may not be down-sampled before segmentation.
摘要翻译： 描述了用于分割的二进制图像的上采样方法。 在一个实施例中，在分割之前对数字图像进行下采样。 然后，所得到的具有比原始图像更低分辨率的初始二进制分割被上采样和平滑以产生具有比初始二进制分割更高分辨率的临时非二进制解。 然后基于阈值从临时非二进制解决方案计算图像的最终二进制分割。 该方法不使用原始图像数据从最初的二进制分割推断最终的二进制分割解决方案。 在一个实施例中，该方法可以应用于所有图像，并且在另一个实施例中，该方法可以用于总共或单维度中包含大量像素的图像，并且在分割之前可能不会对较小的图像进行下采样。
-
公开(公告)号：US08402450B2
公开(公告)日：2013-03-19
申请号：US12947989
申请日：2010-11-17
申请人： Paul F. Ringseth , Yosseff Levanoni , Weirong Zhu
发明人： Paul F. Ringseth , Yosseff Levanoni , Weirong Zhu
CPC分类号： G06F8/45
摘要： A high level programming language provides a map transformation that takes a data parallel algorithm and a set of one or more input indexable types as arguments. The map transformation applies the data parallel algorithm to the set of input indexable types to generate an output indexable type, and returns the output indexable type. The map transformation may be used to fuse one or more data parallel algorithms with another data parallel algorithm.
摘要翻译： 高级编程语言提供了将数据并行算法和一组一个或多个输入可索引类型作为参数的映射变换。 映射变换将数据并行算法应用于输入可索引类型的集合，以生成输出可索引类型，并返回输出可索引类型。 地图变换可以用于将一个或多个数据并行算法与另一数据并行算法融合。
-
公开(公告)号：US08402087B2
公开(公告)日：2013-03-19
申请号：US13307103
申请日：2011-11-30
IPC分类号： G06F15/173 , H04J3/26
CPC分类号： H04L67/104 , G06F17/30174 , H04L63/123 , H04L67/06 , H04L67/1068 , H04L67/1095
摘要： Content discovery and content transfer between mobile communications nodes is often required, for example, to synchronize maps, traffic hot spot information and the like for vehicle mounted satellite navigation devices, pedestrian hand-held personal digital assistants and other mobile communications nodes. In an embodiment, content discovery processes using a tree-based data structure for transferring data between two mobile communication nodes is described.
摘要翻译： 通常需要移动通信节点之间的内容发现和内容传送，例如，为车载卫星导航设备，行人手持个人数字助理和其他移动通信节点同步地图，交通热点信息等。 在一个实施例中，描述使用基于树的数据结构在两个移动通信节点之间传送数据的内容发现过程。
-
-
-
-
-
-
-
-
-
搜索结果
143 条记录 (耗时 0.023 秒)
