公开(公告)号：US20110291028A1

公开(公告)日：2011-12-01

申请号：US12788437

申请日：2010-05-27

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: A61N5/10

CPC classification number: A61N5/103 ,  A61N5/1031 ,  A61N2005/1087 ,  G06F19/00

Abstract: Radiation doses are optimized by providing a model of the set of beams and a target dose in normalized forms. A Gram matrix is determined from the model. The target dose is subsampled to determine initial intensity values for the set of beams. Then, the following steps are iterated until convergence. A very small positive value, 0

Abstract translation: 通过提供一组光束的模型和标准化形式的目标剂量来优化辐射剂量。 从模型中确定一个Gram矩阵。 对目标剂量进行二次采样，以确定该组光束的初始强度值。 然后，迭代以下步骤直到收敛。 每个强度值都加上非常小的正值0 <＆egr << << 1，以确保强度值大于零。 将每个强度值乘以Gram矩阵以确定产品，将其逐个分成归一化的目标剂量以确定相应的比率。 如果比率全部接近1，则在数值误差容差内，输出该组光束的强度值。 否则，强度值乘以下一次迭代之前的比率。

公开(公告)号：US08040810B2

公开(公告)日：2011-10-18

申请号：US12324673

申请日：2008-11-26

Applicant: Matthew Brand ,  Petar Maymounkov ,  Andreas F. Molisch

Inventor： Matthew Brand ,  Petar Maymounkov ,  Andreas F. Molisch

IPC: G01R31/08

CPC classification number: H04W40/02 ,  H04L45/121

Abstract: A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route.

Abstract translation: 一种方法确定了将来自源节点的分组经由中继节点传递到网络中的目的地节点的最佳路由。 通过边缘连接的节点图表示网络中的可能路由。 分组在最后期限之前到达目的地的概率被分配给每个边缘。 从可能的路由中选择最小延迟路由，并且确定使用最小延迟路由传递分组的到达时间。 到达时间与截止时间相比较，概率相应地缩放，直到最小延迟路由为最佳路由。

公开(公告)号：US20110159324A1

公开(公告)日：2011-06-30

申请号：US12938351

申请日：2010-11-02

Applicant: Daniel Huang ,  Matthew Brand

Inventor： Daniel Huang ,  Matthew Brand

IPC: H01M2/02 ,  H01M14/00 ,  H01M6/00

CPC classification number: H01M2/1022 ,  G01R31/3606 ,  G06F1/1626 ,  G06F1/1632 ,  H01M10/46 ,  H01M10/488 ,  H01M2220/30 ,  H02J7/0042 ,  H02J7/0044 ,  H02J7/0045 ,  H02J7/0047 ,  H02J7/0052 ,  H02J2007/005 ,  H02J2007/0062 ,  H04B1/3883 ,  H04B1/3888 ,  H04M1/0254 ,  H04M1/0262 ,  H04M1/0283 ,  Y10T29/49108

Abstract: A battery pack is provided for a mobile communication device, comprising a casing defining a cavity that conforms, at least partially, to the outer shape of the mobile communication device and one or more rechargeable power cells housed within the thickness of the casing. An internal interface engages a corresponding interface on the mobile communication device to provide power from the one or more rechargeable cells to the mobile communication device. An external interface is electrically coupled to the internal interface in order to transmit signals from the mobile communication device to an external device and may further serve to recharge the one or more rechargeable power cells. The battery pack may also serve as an extendible platform by providing additional integrated communication interfaces and/or processors that can be utilized by the mobile communication device to extend its communication and/or processing capabilities.

Abstract translation: 提供了一种用于移动通信设备的电池组，其包括限定至少部分地符合移动通信设备的外形以及容纳在壳体的厚度内的一个或多个可再充电电力单元的空腔的壳体。 内部接口与移动通信设备上的相应接口相连接，以从一个或多个可再充电单元向移动通信设备供电。 外部接口电耦合到内部接口以便将信号从移动通信设备传输到外部设备，并且还可以用于对一个或多个可再充电电力单元进行再充电。 电池组还可以通过提供可由移动通信设备利用以扩展其通信和/或处理能力的附加集成通信接口和/或处理器来用作可扩展平台。

公开(公告)号：US20100128703A1

公开(公告)日：2010-05-27

申请号：US12324673

申请日：2008-11-26

Applicant: Matthew Brand ,  Petar Maymounkov ,  Andreas F. Molisch

Inventor： Matthew Brand ,  Petar Maymounkov ,  Andreas F. Molisch

IPC: H04W40/02

CPC classification number: H04W40/02 ,  H04L45/121

Abstract: A method determines an optimal route to deliver a packet from a source node via relay nodes to a destination node in a network. A graph of nodes connected by edges represents possible routes in the network. A probability that the packet arrives at the destination before a deadline time is assigned to each edge. A minimal delay route is selected from the possible routes, and an arrival time for delivering the packet using the minimal delay route is determined. The arrival time is comparing to a deadline time, and the probabilities are scaled accordingly until the minimal delay route is an optimal route.

Abstract translation: 一种方法确定了将来自源节点的分组经由中继节点传递到网络中的目的地节点的最佳路由。 通过边缘连接的节点图表示网络中的可能路由。 分组在最后期限之前到达目的地的概率被分配给每个边缘。 从可能的路由中选择最小延迟路由，并且确定使用最小延迟路由传递分组的到达时间。 到达时间与截止时间相比较，概率相应地缩放，直到最小延迟路由为最佳路由。

公开(公告)号：US20070076001A1

公开(公告)日：2007-04-05

申请号：US11241187

申请日：2005-09-30

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G06T11/20

CPC classification number: G06K9/6232 ,  G06K9/6252

Abstract: A model of a class of objects is selected from a set of low-dimensional models of the class, wherein the models are graphs, each graph including a plurality of vertices representing objects in the class and edges connecting the vertices. First distances between a subset of high-dimensional samples of the objects in the class are measured. The first distances are combined with the set of low-dimensional models of the class to produce a subset of models constrained by the first distances and a particular model having vertices that are maximally dispersed is selected from the subset of models.

Abstract translation: 从类的一组低维模型中选择一类对象的模型，其中模型是图形，每个图形包括表示类中的对象的多个顶点和连接顶点的边。 测量类中对象的高维样本子集之间的第一距离。 将第一距离与该类的低维模型组合以产生由第一距离约束的模型的子集，并且从模型子集中选择具有最大分散的顶点的特定模型。

公开(公告)号：US20070076000A1

公开(公告)日：2007-04-05

申请号：US11241022

申请日：2005-09-30

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G06T11/20

CPC classification number: G06K9/6232

Abstract: A particular model of a class of objects is selected from a set of models of the class, wherein the class models are graphs, each graph including a plurality of vertices representing objects in the class and edges connecting the vertices. Subsets of vertices of a selected set of graphs representing the class of objects are grouped to produce a subgraph. A set of anchor vertices is selected from the subgraph. Subgraph parameterizations are determined for the set of anchor vertices of the subgraph and the subgraph parameterizations are combined with the set of class models to identify a particular class model.

Abstract translation: 从类的一组模型中选择一类对象的特定模型，其中类模型是图，每个图包括表示类中的对象的多个顶点和连接顶点的边。 将表示对象类的所选图形组的顶点的子集分组以产生子图。 从子图中选择一组锚顶点。 为子图的锚点顶点的集合确定子图参数，并且子图参数化与组模型组合以识别特定的类模型。

公开(公告)号：US20060190225A1

公开(公告)日：2006-08-24

申请号：US11062294

申请日：2005-02-18

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G06F17/10

CPC classification number: G06F16/9535

Abstract: A collaborative filtering method first converts a relational database to a graph of nodes connected by edges. The relational database includes consumer attributes, product attributes, and product ratings. Statistics of a Markov chain random walk on the graph are determined. Then, in response to a query state, states of the Markov chain are determined according to the statistics to make a recommendation.

Abstract translation: 协同过滤方法首先将关系数据库转换为通过边连接的节点图。 关系数据库包括消费者属性，产品属性和产品评级。 确定图上的马尔可夫链随机游走的统计。 然后，响应于查询状态，马尔可夫链的状态根据统计量确定以作出建议。

公开(公告)号：US20060045353A1

公开(公告)日：2006-03-02

申请号：US10932791

申请日：2004-09-02

Applicant: Matthew Brand

Inventor： Matthew Brand

IPC: G06K9/62 ,  G06K9/00

CPC classification number: G06K9/6232

Abstract: A method represents a class of objects. A set of samples for the objects in the class is acquired, there being one sample for each object, and each sample includes a plurality of data values representing characteristics of the object. The samples are grouped into subsets such that each subset intersects at least one other subset. For each subset, a low-dimensional parameterization is determined. Nullspaces of the low-dimensional parameterizations are averaged to obtain a matrix whose nullspace contains a low-dimensional representation of the class of objects.

Abstract translation: 一种方法代表一类对象。 获取类中对象的一组样本，每个对象有一个样本，每个样本包括表示对象特征的多个数据值。 样本被分组成子集，使得每个子集与至少一个其他子集相交。 对于每个子集，确定低维参数化。 对低维参数化的空间进行平均，以获得其空值包含对象类的低维表示的矩阵。