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

1. 发明授权

US08040810B2 Method for routing packets in wireless ad-hoc networks with probabilistic delay guarantees 有权
标题翻译：在具有概率延迟保证的无线自组织网络中路由数据包的方法
公开(公告)号：US08040810B2
公开(公告)日：2011-10-18
申请号：US12324673
申请日：2008-11-26
申请人： Matthew Brand , Petar Maymounkov , Andreas F. Molisch
发明人： Matthew Brand , Petar Maymounkov , Andreas F. Molisch
IPC分类号： G01R31/08
CPC分类号： H04W40/02 , H04L45/121
摘要： 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.
摘要翻译：一种方法确定了将来自源节点的分组经由中继节点传递到网络中的目的地节点的最佳路由。通过边缘连接的节点图表示网络中的可能路由。分组在最后期限之前到达目的地的概率被分配给每个边缘。从可能的路由中选择最小延迟路由，并且确定使用最小延迟路由传递分组的到达时间。到达时间与截止时间相比较，概率相应地缩放，直到最小延迟路由为最佳路由。

2. 发明申请

US20100128703A1 Method for Routing Packets in Wireless Ad-Hoc Networks with Probabilistic Delay Guarantees 有权
标题翻译：用于具有概率延迟保证的无线Ad Hoc网络中路由分组的方法
公开(公告)号：US20100128703A1
公开(公告)日：2010-05-27
申请号：US12324673
申请日：2008-11-26
申请人： Matthew Brand , Petar Maymounkov , Andreas F. Molisch
发明人： Matthew Brand , Petar Maymounkov , Andreas F. Molisch
IPC分类号： H04W40/02
CPC分类号： H04W40/02 , H04L45/121
摘要： 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.
摘要翻译：一种方法确定了将来自源节点的分组经由中继节点传递到网络中的目的地节点的最佳路由。通过边缘连接的节点图表示网络中的可能路由。分组在最后期限之前到达目的地的概率被分配给每个边缘。从可能的路由中选择最小延迟路由，并且确定使用最小延迟路由传递分组的到达时间。到达时间与截止时间相比较，概率相应地缩放，直到最小延迟路由为最佳路由。

3. 发明申请

US20100124219A1 Method for Routing Packets in Ad-Hoc Networks with Partial Channel State Information 有权
标题翻译：在具有部分信道状态信息的Ad-Hoc网络中路由分组的方法
公开(公告)号：US20100124219A1
公开(公告)日：2010-05-20
申请号：US12271200
申请日：2008-11-14
申请人： Matthew Brand , Andreas F. Molisch
发明人： Matthew Brand , Andreas F. Molisch
IPC分类号： H04L12/56
CPC分类号： H04W40/08 , Y02D70/22 , Y02D70/324
摘要： A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain γ is measured for each link x. Resource trade-off curves y=ƒ(x) are constructed for each link x from the channel power gains γ, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c≧ƒ(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.
摘要翻译：方法将来自源节点的分组经由中继节点路由到目的地节点。节点通过无线链路x连接。对于每个链路x测量信道功率增益γ。对于来自信道功率增益γ的每个链路x构造资源权衡曲线y =ƒ（x），其中y表示一组资源。双曲上界h / x + c适合于每个资源曲线，使得h / x +c≥f（x），其中h是比例因子，c是偏移。根据双曲线上界选择具有最佳资源分配的路由。然后，使用该路由从源节点向目的地节点发送分组。

4. 发明授权

US07822029B2 Method for routing packets in ad-hoc networks with partial channel state information 有权
标题翻译：在具有部分信道状态信息的自组织网络中路由分组的方法
公开(公告)号：US07822029B2
公开(公告)日：2010-10-26
申请号：US12271200
申请日：2008-11-14
申请人： Matthew Brand , Andreas F. Molisch
发明人： Matthew Brand , Andreas F. Molisch
IPC分类号： H04L12/56
CPC分类号： H04W40/08 , Y02D70/22 , Y02D70/324
摘要： A method routs a packet from a source node, via relay nodes, to a destination node. The nodes are connected by wireless links x. A channel power gain γ is measured for each link x. Resource trade-off curves y=f(x) are constructed for each link x from the channel power gains γ, wherein y represents a set of resources. A hyperbolic upper bound h/x+c is fitted to each resource curve, such that h/x+c≧f(x), wherein h is a scale factor, and c is an offset. A route with an optimal resource allocation is selected according to the hyperbolic upper bounds. Then, the packet is transmitted from the source node to the destination node using the route.
摘要翻译：方法将来自源节点的分组经由中继节点路由到目的地节点。节点通过无线链路x连接。对于每个链路x测量信道功率增益γ。对于来自信道功率增益γ的每个链路x构造资源权衡曲线y = f（x），其中y表示一组资源。双曲线上限h / x + c适合于每个资源曲线，使得h / x +c≥f（x），其中h是比例因子，c是偏移。根据双曲线上限选择具有最佳资源分配的路由。然后，使用该路由从源节点向目的地节点发送分组。

5. 外观设计

USD718289S1 Multi-piece case 有权
标题翻译：多件套
公开(公告)号：USD718289S1
公开(公告)日：2014-11-25
申请号：US29406346
申请日：2011-11-11
申请人： Matthew Brand
设计人： Matthew Brand

6. 发明申请

US20120267201A1 Method for Scheduling Cars in Elevator Systems to Minimizes Round-Trip Times 有权
标题翻译：在电梯系统中调度汽车的方法，以减少往返时间
公开(公告)号：US20120267201A1
公开(公告)日：2012-10-25
申请号：US13091394
申请日：2011-04-21
申请人： Matthew Brand
发明人： Matthew Brand
IPC分类号： B66B1/20
CPC分类号： B66B1/2458 , B66B2201/213 , B66B2201/215 , B66B2201/222
摘要： A set of cars in an elevator system are scheduled by assigning passengers to the cars such that a current schedule for each car does not exceed a predetermined maximum number of stops per round trip, and the car is filled as near as possible to a maximum capacity at a predetermined bottleneck.
摘要翻译：通过将乘客分配给汽车来安排电梯系统中的一组汽车，使得每个汽车的当前时间表不超过每次往返的预定最大停止次数，并且轿厢被尽可能地填充到最大容量处于预定的瓶颈。

7. 发明申请

US20100183242A1 Method for Editing Images and Videos 有权
标题翻译：编辑图像和视频的方法
公开(公告)号：US20100183242A1
公开(公告)日：2010-07-22
申请号：US12356398
申请日：2009-01-20
申请人： Matthew Brand
发明人： Matthew Brand
IPC分类号： G06K9/36
CPC分类号： G06T3/0093 , G11B27/034 , G11B27/036
摘要： A method edits editing an input image to produce an output image by first partitioning pixels of the input image into sets of adjacent pixels. Then, for each set, a trellis of nodes connected by directed links is defined. Each node corresponds to one of the pixels in the set of pixels, and an action and location of the pixel in the output image. Costs are assigned to the nodes and the links. A least cost path through the trellis is determined, and pixels corresponding to the nodes on the least cost path are edited according to the action and location to form the output image.
摘要翻译：一种方法通过首先将输入图像的像素划分为相邻像素的集合来编辑输入图像以产生输出图像。然后，对于每个集合，定义通过定向链路连接的节点的网格。每个节点对应于像素集合中的像素之一以及输出图像中像素的动作和位置。成本分配给节点和链接。确定通过网格的最小成本路径，并且根据动作和位置编辑对应于最小成本路径上的节点的像素以形成输出图像。

8. 发明申请

US20070221455A1 System and method for scheduling elevator cars using branch-and-bound 有权
标题翻译：使用分支机构调度电梯轿厢的系统和方法
公开(公告)号：US20070221455A1
公开(公告)日：2007-09-27
申请号：US11389942
申请日：2006-03-27
申请人： Daniel Nikovski , Matthew Brand , Dietmar Ebner
发明人： Daniel Nikovski , Matthew Brand , Dietmar Ebner
IPC分类号： B66B1/20
CPC分类号： B66B1/18
摘要： A method schedules cars of an elevator system. Each possible assignment of a set of hall calls to a set of cars is represented by a solution vector maintained as a node in a search tree. Each solution vector is evaluated using an ESA-DP process according to an immediate policy to determine initially a best solution. A branch-and-bound process is applied to each solution vector using the initial best solution and the search tree to determine a globally optimal solution for scheduling the cars according to a reassignment policy.
摘要翻译：一种方法安排电梯系统的汽车。通过在搜索树中作为节点维护的解向量来表示对一组轿厢的一组门厅呼叫的每个可能的分配。每个解矢量根据立即的策略使用ESA-DP过程进行评估，以便最初确定最佳解决方案。使用初始最佳解决方案和搜索树将分支绑定过程应用于每个解向量，以根据重新分配策略来确定用于安排车辆的全局最优解。

9. 发明授权

US09248525B2 Method and system for cutting features from sheet materials with a laser cutter according to a pattern 有权
标题翻译：根据图案用激光切割机从板材切割特征的方法和系统
公开(公告)号：US09248525B2
公开(公告)日：2016-02-02
申请号：US13535271
申请日：2012-06-27
申请人： Tyler W Garaas , Matthew Brand , Cibulka Josef
发明人： Tyler W Garaas , Matthew Brand , Cibulka Josef
IPC分类号： B23K26/38 , G05B15/02 , G05B19/4061
CPC分类号： B23K26/38 , G05B15/02 , G05B19/4061 , G05B2219/36199 , G05B2219/49157
摘要： Locations in a pattern of a part are evaluated to determine if the locations are interior or exterior to a feature of the pattern. The pattern is used to cut the feature from a material by a laser cutting machine. A location in the feature is rendered into an array stored in a memory so that a value stored at an address in the array corresponding to coordinates of the location is either odd or even as determined by a counting process of the rendering. Then, the location is identified as being interior if the value is odd, and as being exterior if the value is even. The rendering can use modified forms of either rasterization or ray casting.
摘要翻译：评估部件图案中的位置以确定位置是否是图案特征的内部或外部。该图案用于通过激光切割机从材料切割特征。特征中的位置被渲染成存储在存储器中的阵列，使得存储在对应于该位置的坐标的阵列中的地址的值是奇数或偶数，如通过渲染的计数处理所确定的。然后，如果值是奇数，则将该位置识别为内部，并且如果该值是均匀的，则将其定义为外部。渲染可以使用光栅化或光线投射的修改形式。

10. 发明授权

US09046888B2 Method and system for detouring around features cut from sheet materials with a laser cutter according to a pattern 有权
标题翻译：根据图案用激光切割机从片材切割特征的方法和系统
公开(公告)号：US09046888B2
公开(公告)日：2015-06-02
申请号：US13535277
申请日：2012-06-27
申请人： Tyler W Garaas , Matthew Brand
发明人： Tyler W Garaas , Matthew Brand
IPC分类号： G05B19/4061
CPC分类号： G05B19/4061 , G05B2219/36199 , G05B2219/49157
摘要： A path of a cutter head of a laser cutting machine is modified to cut features according to a pattern from a material. A no-travel zone that the laser cutter avoids while performing lateral movements between cuts is specified. Locations of the path that cross the no-travel zones are also specified. The path is then modified such that all locations that violate the no-travel zone are removed so that the laser cutter detours around the no-travel zone when performing the lateral movements.
摘要翻译：修改激光切割机的刀头的路径，以根据材料的图案切割特征。指定激光切割机在切割之间执行横向移动时避免的无旅行区域。还指定了越过禁止行驶区域的路径的位置。然后修改路径，使得违反无旅行区的所有位置被移除，使得当执行横向移动时，激光切割机在无旅行区周围绕行。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式