专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07756021B2 Method for finding minimal cost paths under uncertainty 有权
标题翻译：在不确定性下找到最小成本路径的方法
公开(公告)号：US07756021B2
公开(公告)日：2010-07-13
申请号：US11493198
申请日：2006-07-26
申请人： Evdokia V. Nikolova , Matthew E. Brand
发明人： Evdokia V. Nikolova , Matthew E. Brand
IPC分类号： H04J1/16 , H04J3/14
CPC分类号： H04L45/12 , H04L45/121
摘要： A computer implemented method finds a path having a minimal expected cost through a network of nodes connected by arcs, in which the path is from a source node to a destination node, and in which a traversal time for traversing each arc is a random variable. An expected cost of traversing each possible path from the source node to the destination node is determined as an average value of a nonlinear cost function applied to each possible total travel time for traversing the path. The expected cost is weighted according to a probability of each possible total travel time. For each node in the network and for each possible time to start, a particular path from the source node to the node having a minimal expected cost and an optimal time to start on that path is determined.
摘要翻译：计算机实现的方法通过由弧连接的节点网络找到具有最小预期成本的路径，其中路径从源节点到目的地节点，并且其中遍历每个弧的遍历时间是随机变量。将从源节点到目的地节点的每个可能路径的预期成本确定为应用于遍历路径的每个可能的总行进时间的非线性成本函数的平均值。预期成本根据每个可能的总旅行时间的概率加权。对于网络中的每个节点以及每个可能的时间开始，确定从源节点到具有最小预期成本的节点和在该路径上开始的最佳时间的特定路径。

2. 发明授权

US07573866B2 Method for finding optimal paths using a stochastic network model 有权
标题翻译：使用随机网络模型寻找最优路径的方法
公开(公告)号：US07573866B2
公开(公告)日：2009-08-11
申请号：US11512849
申请日：2006-08-30
申请人： Evdokia V. Nikolova , Matthew E. Brand , Michael Mitzenmacher
发明人： Evdokia V. Nikolova , Matthew E. Brand , Michael Mitzenmacher
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/121 , H04L45/122 , H04L45/14
摘要： A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.
摘要翻译：一种方法找到从源到目标的最佳路径。从源到目的地的可能路径表示为通过边连接的节点的随机图。每个边缘在边缘成本上具有独立的概率分布。定义到达目的地的约束。该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。

3. 发明申请

US20090175171A1 METHOD FOR FINDING OPTIMAL PATHS USING A STOCHASTIC NETWORK MODEL 有权
标题翻译：使用STOCHASTIC网络模型寻找最佳方法的方法
公开(公告)号：US20090175171A1
公开(公告)日：2009-07-09
申请号：US11512849
申请日：2006-08-30
申请人： Evdokia V. Nikolova , Matthew E. Brand , Michael Mitzenmacher
发明人： Evdokia V. Nikolova , Matthew E. Brand , Michael Mitzenmacher
IPC分类号： H04J3/14
CPC分类号： H04L45/12 , H04L45/121 , H04L45/122 , H04L45/14
摘要： A method finds an optimal path from a source to a destination. The possible paths from the source to the destination are represented as a stochastic graph of nodes connected by edges. Each edge has an independent probability distribution over a cost of the edge. A constraint for reaching the destination is defined. The graph is reduced to a relatively small set of deterministic minimum cost problems, which can be solved to determine an optimal path that maximizes a probability of reaching the destination within the constraint.
摘要翻译：一种方法找到从源到目标的最佳路径。从源到目的地的可能路径被表示为通过边连接的节点的随机图。每个边缘在边缘成本上具有独立的概率分布。定义到达目的地的约束。该图被减少到相对小的一组确定性最小成本问题，其可以被解决以确定最大化在约束内到达目的地的概率的最优路径。

4. 发明申请

US20080025222A1 Method for finding minimal cost paths under uncertainty 有权
标题翻译：在不确定性下找到最小成本路径的方法
公开(公告)号：US20080025222A1
公开(公告)日：2008-01-31
申请号：US11493198
申请日：2006-07-26
申请人： Evdokia V. Nikolova , Matthew E. Brand
发明人： Evdokia V. Nikolova , Matthew E. Brand
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04L45/12 , H04L45/121
摘要： A computer implemented method finds a path having a minimal expected cost through a network of nodes connected by arcs, in which the path is from a source node to a destination node, and in which a traversal time for traversing each arc is a random variable. An expected cost of traversing each possible path from the source node to the destination node is determined as an average value of a nonlinear cost function applied to each possible total travel time for traversing the path. The expected cost is weighted according to a probability of each possible total travel time. For each node in the network and for each possible time to start, a particular path from the source node to the node having a minimal expected cost and an optimal time to start on that path is determined.
摘要翻译：计算机实现的方法通过由弧连接的节点网络找到具有最小预期成本的路径，其中路径从源节点到目的地节点，并且其中遍历每个弧的遍历时间是随机变量。将从源节点到目的地节点的每个可能路径的预期成本确定为应用于遍历路径的每个可能的总行进时间的非线性成本函数的平均值。预期成本根据每个可能的总旅行时间的概率加权。对于网络中的每个节点以及每个可能的时间开始，确定从源节点到具有最小预期成本的节点和在该路径上开始的最佳时间的特定路径。

5. 发明授权

US08155048B2 Resource allocation for rateless transmissions 有权
标题翻译：无源传输的资源分配
公开(公告)号：US08155048B2
公开(公告)日：2012-04-10
申请号：US12413504
申请日：2009-03-27
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： H04B7/14
CPC分类号： H04B7/2606 , H04W40/08 , Y02D70/22 , Y02D70/324 , Y02D70/449
摘要： A method transmits a message of a source entropy from a source node, via a set of relay nodes, to a destination node, the set of relay nodes includes a node and a next node connected by a wireless link, wherein the next node is guaranteed to receive accumulated nats from one or more previous transmissions of the message, in which a transmission of the message from the node to the next node includes determining the accumulated nats guaranteed to be received by the next node; calculating minimal nats of the message to be transmitted from the node to the next node, such that a sum of the minimal nats and the accumulated nats is not less than the source entropy; and transmitting the message having the minimal nats from the node to the next node.
摘要翻译：一种方法是将来自源节点的源熵的消息经由一组中继节点发送到目的节点，该中继节点包括一个节点和一个由无线链路连接的下一个节点，其中下一个节点被保证从所述消息的一个或多个先前传输接收累积的nats，其中从所述节点到所述下一个节点的所述消息的传输包括确定保证由所述下一个节点接收的累积的nats; 计算要从节点发送到下一个节点的消息的最小值，使得最小燕麦和累积的猫的总和不小于源熵; 以及将具有最小nats的消息从所述节点发送到所述下一个节点。

6. 发明授权

US07359550B2 Incremental singular value decomposition of incomplete data 有权
标题翻译：不完全数据的增量奇异值分解
公开(公告)号：US07359550B2
公开(公告)日：2008-04-15
申请号：US10124902
申请日：2002-04-18
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： G06K9/00
CPC分类号： G06K9/6247 , G06F17/16 , G10L25/48
摘要： A method models data values acquired by measuring a natural phenomena. Samples are acquired of the natural phenomena, each sample is arranged as a vector c of the data values. Some of the data values may be missing. The vectors c are decomposed into five matrices, respectively, a subspace Upxr, singular values srxl, an encoding Vqxr, a subspace rotation U′rxr, an encoding transform V′rxr, where p indicates the number of discrete data values in each sample, q is a number of samples, and r is a rank of a decomposition of the data values. The five matrices can then be multiplied according to UU′diag(s)V′TVT to obtain a best linear approximation of the natural phenomena for any value of r less than both p and q, where T is a matrix transpose operator.
摘要翻译：一种通过测量自然现象获得的数据值的方法。样本是自然现象的获取，每个样本被排列成数据值的向量c。某些数据值可能会丢失。向量c分别被分解为五个矩阵，子空间U pxr，奇异值s x，x x，x n，子空间旋转其中p表示每个样本中的离散数据值的数量，q是样本数，r是秩的数据值的分解。然后，可以根据UU'diag（s）V'T V T来乘以五个矩阵以获得对于r的任何值的自然现象的最佳线性近似比较p和q，其中^{T 是矩阵转置运算符。}

7. 发明授权

US08311285B2 Method and system for localizing in urban environments from omni-direction skyline images 有权
标题翻译：从全方位地平线图像在城市环境中定位的方法和系统
公开(公告)号：US08311285B2
公开(公告)日：2012-11-13
申请号：US12824296
申请日：2010-06-28
申请人： Srikumar Ramalingam , Matthew E. Brand
发明人： Srikumar Ramalingam , Matthew E. Brand
IPC分类号： G06K9/00
CPC分类号： G01C21/3602 , G06F17/30256 , G06K9/00704 , G06T7/75 , G06T2207/30244 , H04N7/18
摘要： A location and orientation in an environment is determined by acquiring a set of one or more real omni-directional images of an unknown skyline in the environment from an unknown location and an unknown orientation in the environment by an omni-directional camera. A set of virtual omni-directional images is synthesized from a 3D model of the environment, wherein each virtual omni-directional image is associated with a known skyline, a known location and a known orientation. Each real omni-directional image is compared with the set of virtual omni-directional images to determine a best matching virtual omni-directional image with the associated known location and known orientation that correspond to the unknown location and orientation.
摘要翻译：环境中的位置和取向是通过全方位摄像机从环境中的未知位置和未知取向在环境中获取未知天际线的一个或多个真实全向图像的集合来确定的。从环境的3D模型合成一组虚拟全方位图像，其中每个虚拟全方位图像与已知的天际线，已知位置和已知方向相关联。将每个真正的全方位图像与虚拟全向图像的集合进行比较，以确定与相关联的已知位置和已知方向对应于未知位置和方向的最佳匹配虚拟全向图像。

8. 发明申请

US20100246473A1 Resource Allocation for Rateless Transmissions 有权
标题翻译：无源传输的资源分配
公开(公告)号：US20100246473A1
公开(公告)日：2010-09-30
申请号：US12413504
申请日：2009-03-27
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： H04W72/04 , H04B7/14
CPC分类号： H04B7/2606 , H04W40/08 , Y02D70/22 , Y02D70/324 , Y02D70/449
摘要： Embodiments of the invention describe a method for transmitting a message of a source entropy from a source node, via a set of relay nodes, to a destination node, the set of relay nodes includes a node and a next node connected by a wireless link, wherein the next node is guaranteed to receive accumulated nats from one or more previous transmissions of the message, in which a transmission of the message from the node to the next node includes determining the accumulated nats guaranteed to be received by the next node; calculating minimal nats of the message to be transmitted from the node to the next node, such that a sum of the minimal nats and the accumulated nats is not less than the source entropy; and transmitting the message having the minimal nats from the node to the next node.
摘要翻译：本发明的实施例描述了一种用于将来自源节点的源熵的消息经由一组中继节点发送到目的地节点的方法，所述中继节点组包括通过无线链路连接的节点和下一个节点，其中，所述下一个节点被保证从所述消息的一个或多个先前传输接收累积的nats，其中，所述消息从所述节点到所述下一个节点的传输包括确定保证由所述下一个节点接收的累积的nats; 计算要从节点发送到下一个节点的消息的最小值，使得最小燕麦和累积的猫的总和不小于源熵; 以及将具有最小nats的消息从所述节点发送到所述下一个节点。

9. 发明授权

US07743890B2 Method and system for determining instantaneous peak power consumption in elevator banks 有权
标题翻译：确定电梯库瞬时峰值功耗的方法和系统
公开(公告)号：US07743890B2
公开(公告)日：2010-06-29
申请号：US11761683
申请日：2007-06-12
申请人： Daniel N. Nikovski , Matthew E. Brand
发明人： Daniel N. Nikovski , Matthew E. Brand
IPC分类号： B66B1/18
CPC分类号： B66B1/2458 , B66B2201/102 , B66B2201/211 , B66B2201/212 , B66B2201/216 , B66B2201/222 , Y02B50/122
摘要： A method and system determine peak power consumption over time by a bank of elevator for servicing a set of passenger hall calls and delivery requests, and selecting elevator schedules that keep peak power consumption below a predetermined threshold. For each car in response to receiving a hall call, a set of all possible paths to service all hall calls assigned to the car are determined, in which each path includes a set of all possible segments. A peak power consumption for each possible segment is also determined. The peak power consumptions for the set of all possible segments for each time instant are added to determine a total peak power consumption for each time instant, and a particular path is selected as a schedule to operate the bank of elevator cars, if the total peak power consumption for any instant in time while operating according to the selected schedule is below a predetermined threshold.
摘要翻译：一种方法和系统确定由电梯组提供的用于服务一组乘客大厅呼叫和递送请求的时间的峰值功率消耗，以及选择使峰值功率消耗低于预定阈值的电梯时间表。对于每个轿厢响应于接收到一个门厅呼叫，确定一组所有可能的路径来服务分配给轿厢的所有门厅呼叫，其中每个路径包括一组所有可能的段。每个可能的段的峰值功率消耗也被确定。添加每个时刻的所有可能段的集合的峰值功率消耗以确定每个时刻的总峰值功耗，并且选择特定路径作为操作电梯轿厢组的调度，如果总峰值根据所选择的时间表操作时的任何时刻的功率消耗低于预定阈值。

10. 发明授权

US07475027B2 On-line recommender system 有权
标题翻译：在线推荐系统
公开(公告)号：US07475027B2
公开(公告)日：2009-01-06
申请号：US10361165
申请日：2003-02-06
申请人： Matthew E. Brand
发明人： Matthew E. Brand
IPC分类号： G06Q30/00 , G06F17/30 , G06F15/16 , G06F7/00 , G07G1/00
CPC分类号： G06Q30/0201 , G06Q30/02 , G06Q30/0253 , G06Q30/0631 , Y10S707/99937
摘要： A method and system recommends items such as products and services to consumers. Rating on items are received from consumers as a sequential stream of data. A thin singular value decomposition is updated, one rating at the time, while receiving the ratings. A prediction of a recommendations of particular items for a particular consumer is based on the updated singular value decomposition while receiving the ratings and updating the singular value decomposition. The ratings are discarded after the updating so that a size, structure, and content of an underlying preference matrix is unknown.
摘要翻译：方法和系统向消费者推荐产品和服务等项目。从消费者那里收到的项目评级作为一个顺序的数据流。更新一个薄的奇异值分解，当时收到一个评级。针对特定消费者的特定项目的推荐的预测基于更新的奇异值分解，同时接收评级并更新奇异值分解。评级在更新后被丢弃，使得底层偏好矩阵的大小，结构和内容是未知的。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式