公开(公告)号：US08737309B2

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

申请号：US13553590

申请日：2012-07-19

Applicant: Emilio Calvanese Strinati ,  Rohit Gupta

Inventor： Emilio Calvanese Strinati ,  Rohit Gupta

IPC: H04W4/00

CPC classification number: H04W52/34 ,  H04L1/0003 ,  H04L1/0009 ,  H04L1/1812 ,  H04L1/1845 ,  H04L1/1867 ,  H04W52/20 ,  H04W52/48

Abstract: The invention relates to a data packet transmission process in a communication system comprising at least one terminal (UE) communicating with a base station (BS), the process comprising at least one transmission (S4) of the data packet with a given power, from the terminal to the base station based on a HARQ scheme to obtain a residual packet error rate PERres after a number of transmissions Trn, the process being characterized in that it comprises a step (S) for the joint selection of the following parameters: the number of transmissions Trn; the target packet error rate PERtg(i) of each transmission i, where i=1, . . . , Trn, to arrive at the residual packet error rate PERres; and the modulation and coding scheme m corresponding to each target packet error rate PERtg(i) so as to minimize the data packet transmission power.

Abstract translation: 本发明涉及包括与基站（BS）通信的至少一个终端（UE）的通信系统中的数据分组传输过程，该过程包括具有给定功率的数据分组的至少一个传输（S4），来自 基于HARQ方案的基站的终端，以获得在多个传输Trn之后的残差分组错误率PERres，该过程的特征在于它包括用于联合选择以下参数的步骤（S）：数目 的变速箱Trn; 每个传输i的目标分组错误率PERtg（i），其中i = 1，...。 。 。 ，Trn，以得到剩余分组错误率PERres; 以及对应于每个目标分组错误率PERtg（i）的调制和编码方案m，以使数据分组传输功率最小化。

公开(公告)号：US20140098750A2

公开(公告)日：2014-04-10

申请号：US13762599

申请日：2013-02-08

Applicant: Antonio De Domenico ,  Rohit Gupta ,  Emilio Calvanese Strinati

Inventor： Antonio De Domenico ,  Rohit Gupta ,  Emilio Calvanese Strinati

IPC: H04W28/02

CPC classification number: H04W28/0268 ,  H04L47/2458 ,  H04W52/0206 ,  H04W72/1242 ,  H04W84/045 ,  Y02D70/00 ,  Y02D70/1242 ,  Y02D70/1262

Abstract: The invention concerns a method for managing a network of a plurality of small cell base stations arranged in a macro-cell and linked to a base station of the macro-cell, each small cell base station being adapted to cover a small cell of the macro-cell and to be linked via radio to at least one mobile terminal present in the small cell.

Abstract translation: 本发明涉及一种用于管理布置在宏小区中并链接到宏小区的基站的多个小小区基站的网络的方法，每个小小区基站适于覆盖该小区的小小区 并且通过无线电链接到存在于小小区中的至少一个移动终端。

公开(公告)号：US08261310B2

公开(公告)日：2012-09-04

申请号：US10420703

申请日：2003-04-23

Applicant: Jimmy Rohit Gupta

Inventor： Jimmy Rohit Gupta

IPC: H04N7/173 ,  H04N17/00

CPC classification number: H04N21/4345 ,  H04N17/004 ,  H04N21/434

Abstract: A method, system and computer program for providing a cross table analysis display in a digital broadcast environment, are discussed. The method includes providing at least two metadata tables of a broadcast stream, performing a cross table analysis on the metadata tables to determine consistency between the metadata tables, and displaying the result of the cross table analysis of the metadata tables using a graphical user interface.

Abstract translation: 讨论了用于在数字广播环境中提供交叉表分析显示的方法，系统和计算机程序。 该方法包括提供广播流的至少两个元数据表，对元数据表执行交叉表分析以确定元数据表之间的一致性，并使用图形用户界面显示元数据表的交叉表分析的结果。

公开(公告)号：US08144613B2

公开(公告)日：2012-03-27

申请号：US12467919

申请日：2009-05-18

Applicant: Sumit Roy ,  Rohit Gupta

Inventor： Sumit Roy ,  Rohit Gupta

IPC: H04L12/26

CPC classification number: H04W28/18 ,  H04L47/14 ,  H04W24/10 ,  H04W48/16 ,  H04W74/0808 ,  H04W84/12

Abstract: Examples of achieving quality of service in a wireless local area network via meeting communication channel performance criteria to include a minimum signal-to-noise plus interference ratio and a proportional fairness limit are disclosed.

Abstract translation: 公开了通过满足通信信道性能标准在无线局域网中实现服务质量以包括最小信噪比加干扰比和比例公平限制的示例。

公开(公告)号：US20110141122A1

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

申请号：US12894001

申请日：2010-09-29

Applicant: Ziyad S. Hakura ,  Rohit Gupta ,  Michael C. Shebanow ,  Emmett M. Kilgariff

Inventor： Ziyad S. Hakura ,  Rohit Gupta ,  Michael C. Shebanow ,  Emmett M. Kilgariff

IPC: G06F15/80

CPC classification number: G06T1/00

Abstract: A technique for performing stream output operations in a parallel processing system is disclosed. A stream synchronization unit is provided that enables the parallel processing unit to track batches of vertices being processed in a graphics processing pipeline. A plurality of stream output units is also provided, where each stream output unit writes vertex attribute data to one or more stream output buffers for a portion of the batches of vertices. A messaging protocol is implemented between the stream synchronization unit and the plurality of stream output units that ensures that each of the stream output units writes vertex attribute data for the particular batch of vertices distributed to that particular stream output unit in the same order in the stream output buffers as the order in which the batch of vertices was received from a device driver by the parallel processing unit.

Abstract translation: 公开了一种用于在并行处理系统中执行流输出操作的技术。 提供流同步单元，其使并行处理单元能够跟踪在图形处理流水线中正在处理的顶点的批次。 还提供了多个流输出单元，其中每个流输出单元将顶点属性数据写入一批或多个顶点的一部分的流输出缓冲器。 在流同步单元和多个流输出单元之间实现消息传递协议，确保每个流输出单元以流中相同的顺序写入分配给该特定流输出单元的特定批次的顶点的顶点属性数据 输出缓冲器作为由并行处理单元从设备驱动器接收到顶点批次的顺序。

公开(公告)号：US07680930B2

公开(公告)日：2010-03-16

申请号：US12138419

申请日：2008-06-13

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John L Miller ,  Graham A Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John L Miller ,  Graham A Wheeler

IPC: G06F11/30 ,  G06F15/173

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

公开(公告)号：US20090157810A1

公开(公告)日：2009-06-18

申请号：US11956481

申请日：2007-12-14

Applicant: Ashutosh Tripathi ,  Jonathan Shriver-Blake ,  Amit Kripalani ,  Dharmanand Singh ,  Rohit Gupta ,  Shirish Koti

Inventor： Ashutosh Tripathi ,  Jonathan Shriver-Blake ,  Amit Kripalani ,  Dharmanand Singh ,  Rohit Gupta ,  Shirish Koti

IPC: G06F15/16

CPC classification number: G06F17/30011

Abstract: Technologies are described herein for relevance-based expiration of data. An initial expiration time for the data is computed based upon an expiration duration associated with the data. The expiration time for the data is periodically re-computed in order to extend the expiration time. A relevance value for the meeting data is computed and the expiration time is set as a function of the computed relevance value. The relevance value may be computed as a product of a user-settable relevance value for the meeting data and a dynamic relevance point for the meeting data. When the computed expiration time for meeting data has been reached, the meeting data is expired, such as through the deletion of the meeting data.

Abstract translation: 本文描述了基于相关性的数据到期的技术。 基于与数据相关联的到期持续时间来计算数据的初始到期时间。 定期重新计算数据的到期时间，以延长到期时间。 计算会议数据的相关性值，并将过期时间设置为所计算的相关性值的函数。 可以将相关性值计算为会议数据的用户可设置相关性值和会议数据的动态相关性点的乘积。 当达到计算的会议数据的到期时间时，会议数据已过期，例如通过删除会议数据。

公开(公告)号：US07418479B2

公开(公告)日：2008-08-26

申请号：US11376397

申请日：2006-03-15

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC: G06F15/173

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

Abstract translation: 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。

公开(公告)号：US07397922B2

公开(公告)日：2008-07-08

申请号：US10608768

申请日：2003-06-27

Applicant: Alexandru Gavrilescu ,  Graham A. Wheeler ,  Grigori M. Somin ,  John L. Miller ,  Rohit Gupta

Inventor： Alexandru Gavrilescu ,  Graham A. Wheeler ,  Grigori M. Somin ,  John L. Miller ,  Rohit Gupta

IPC: H04K1/00

CPC classification number: H04L63/0823 ,  G06F21/604 ,  G06F21/6218 ,  G06F2221/2117 ,  H04L9/0833 ,  H04L9/3265

Abstract: A system and method for providing security to a graph of interconnected nodes includes a grouping multiplexing layer configured to monitor calls to the system, a graphing dynamic link layer configured to transmit and receive data to and from the graph, and a group security manager coupled to the grouping multiplexing layer and coupled to the graphing dynamic link layer; the group security manager is configured to perform security-related acts via interacting with a group database to propagate security-related information to members of a group within the graph. The group security manager is configured to provide role-based authorization on publication of one or more records and provide membership control for admission to a graph of interconnected nodes. The group security manager provides membership control by providing credentials to potential members of the graph to enable a connection and by providing a governed system for renewal and revocation of members.

Abstract translation: 用于向互连节点的图形提供安全性的系统和方法包括被配置为监视对系统的呼叫的分组多路复用层，被配置为向和从图形发送和接收数据的图形动态链路层，以及耦合到 分组复用层并耦合到图形动态链路层; 组安全管理器被配置为通过与组数据库交互来执行与安全相关的动作，以将安全性信息传播到图中的组的成员。 组安全管理器被配置为在一个或多个记录的发布上提供基于角色的授权，并提供用于允许互连节点的图形的成员资格控制。 集团安全经理通过为图表的潜在成员提供凭据来提供成员资格控制，以实现连接，并通过提供受管理的系统来更新和撤销成员。

公开(公告)号：US07251694B2

公开(公告)日：2007-07-31

申请号：US11375748

申请日：2006-03-15

Applicant: Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

Inventor： Rohit Gupta ,  Alexandru Gavrilescu ,  John L. Miller ,  Graham A. Wheeler

IPC: G06F15/16

CPC classification number: H04L67/104 ,  H04L29/12009 ,  H04L29/12047 ,  H04L61/15 ,  H04L63/0823 ,  H04L63/126 ,  H04L63/1458 ,  Y10S707/99939

Abstract: A security infrastructure and methods are presented that inhibit the ability of a malicious node from disrupting the normal operations of a peer-to-peer network. The methods of the invention allow both secure and insecure identities to be used by nodes by making them self-verifying. When necessary or opportunistic, ID ownership is validated by piggybacking the validation on existing messages. The probability of connecting initially to a malicious node is reduced by randomly selecting to which node to connect. Further, information from malicious nodes is identified and can be disregarded by maintaining information about prior communications that will require a future response. Denial of service attacks are inhibited by allowing the node to disregard requests when its resource utilization exceeds a predetermined limit. The ability for a malicious node to remove a valid node is reduced by requiring that revocation certificates be signed by the node to be removed.

Abstract translation: 提出了一种防止恶意节点中断对等网络的正常操作的能力的安全基础设施和方法。 本发明的方法允许节点通过使其自我验证来使用安全和不安全的身份。 在必要或机会主义的情况下，通过捎带现有消息的验证来验证身份所有权。 通过随机选择连接到哪个节点来减少初始连接到恶意节点的概率。 此外，来自恶意节点的信息被识别，并且可以通过维护关于将要响应的先前通信的信息而被忽略。 通过允许节点在其资源利用超过预定限制时忽略请求，禁止拒绝服务攻击。 恶意节点删除有效节点的能力通过要求撤销证书由要删除的节点进行签名来减少。