-
公开(公告)号：US07779268B2
公开(公告)日：2010-08-17
申请号：US11564638
申请日：2006-11-29
CPC分类号： G06K9/00885 , G06K9/00073 , H04L9/3231 , H04L9/3236
摘要： Biometric parameters acquired from human forces, voices, fingerprints, and irises are used for user authentication and access control. Because the biometric parameters are continuous and vary from one reading to the next, syndrome codes are applied to determine biometric syndrome vectors. The biometric syndrome vectors can be stored securely while tolerating an inherent variability of biometric data. The stored biometric syndrome vector is decoded during user authentication using biometric parameters acquired at that time. The syndrome codes can also be used to encrypt and decrypt data.
摘要翻译： 从人力，语音，指纹和鸢尾获得的生物特征参数用于用户认证和访问控制。 因为生物特征参数是连续的，并且从一个读数变化到下一个读数，所以应用校正子码来确定生物特征综合征矢量。 可以安全地存储生物特征综合征矢量，同时容忍生物特征数据的固有变异性。 存储的生物统计量子载体在用户认证期间使用当时获取的生物特征参数进行解码。 校正码也可用于加密和解密数据。
-
公开(公告)号：US07620818B2
公开(公告)日：2009-11-17
申请号：US11218261
申请日：2005-09-01
CPC分类号： H04L9/0894 , G07C9/00158 , H04L9/0866 , H04L9/3231
摘要： First biometric parameters are acquired from a user. Input data are encrypted according to the biometric parameters to produce ciphertext. The biometric parameters are encoded using a syndrome encoder to produce a syndrome code. The ciphertext and the syndrome code are associated with each other and stored in a computer readable media so that only the same user can subsequently decrypt the cipher text.
摘要翻译： 从用户获取第一生物特征参数。 根据生物特征参数对输入数据进行加密以产生密文。 使用校正子编码器对生物特征参数进行编码以产生校正子码。 密文和纠错码相互关联并存储在计算机可读介质中，使得只有相同的用户可随后解密密文。
-
公开(公告)号：US06771197B1
公开(公告)日：2004-08-03
申请号：US10672919
申请日：2003-09-26
IPC分类号： H03M700
CPC分类号： H03M13/1111 , H03M13/1108 , H03M13/1191 , H03M13/63 , H03M13/6577
摘要： A method quantizes an input signal of N samples into a string of k symbols drawn from a q-ary alphabet. A complementary method reproduces a minimally distorted version of the input signal from the quantized string, given some distortion measure. First, an [N,k]q linear error-correcting code that has a sparse generator factor graph representation is selected. A fixed mapping from q-ary symbols to samples is selected. A soft-input decoder and an encoder for the SGFG codes is selected. A cost function is determined from the input signal and a distortion measure, using the fixed mapping. The decoder determines an information block corresponding to a code word of the SGFG code with a low cost for the input signal. The input signal can be reproduced using the encoder for the SGFG code, in combination with the fixed mapping.
摘要翻译： 一种方法将N个样本的输入信号量化为从q字母字母绘制的k个符号的串。 给定一些失真测量，补充方法从量化串中再现输入信号的最小失真版本。 首先，选择具有稀疏发生器因子图表示的[N，k] q线性纠错码。 选择从q元符号到样本的固定映射。 选择软输入解码器和用于SGFG码的编码器。 使用固定映射从输入信号和失真度量确定成本函数。 解码器以对于输入信号的低成本来确定与SGFG码的码字相对应的信息块。 输入信号可以使用SGFG码的编码器与固定映射相结合。
-
公开(公告)号：US08495379B2
公开(公告)日：2013-07-23
申请号：US12357801
申请日：2009-01-22
申请人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
发明人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
IPC分类号： G06F21/00
CPC分类号： H04L9/3247 , H04L9/0836 , H04L9/0894 , H04L9/3226 , H04L9/3236 , H04L2209/34
摘要： A method and system manage a hierarchy of passwords for users accessing a hierarchy of access control devices. First, a codeword is acquired and a syndrome of the codeword is determined. Next, the codeword is randomly modified with a probability p to produce a modified codeword. The modified codeword is selected and assigned to a user as a password, if the modified codeword is recoverable.
摘要翻译： 一种方法和系统管理访问访问控制设备的层次结构的用户的密码层级。 首先，获取码字并确定码字的校正子。 接下来，以概率p随机修改码字以产生修改后的码字。 如果修改的码字是可恢复的，则修改的码字被选择并分配给用户作为密码。
-
公开(公告)号：US20100185870A1
公开(公告)日：2010-07-22
申请号：US12357801
申请日：2009-01-22
申请人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
发明人： Shantanu Rane , Yige Wang , Jonathan S. Yedidia , Anthony Vetro
IPC分类号： H04L9/32
CPC分类号： H04L9/3247 , H04L9/0836 , H04L9/0894 , H04L9/3226 , H04L9/3236 , H04L2209/34
摘要： A method and system manage a hierarchy of passwords for users accessing a hierarchy of access control devices. First, a codeword is acquired and a syndrome of the codeword is determined. Next, the codeword is randomly modified with a probability p to produce a modified codeword. The modified codeword is selected and assigned to a user as a password, if the modified codeword is recoverable.
摘要翻译： 一种方法和系统管理访问访问控制设备的层次结构的用户的密码层级。 首先，获取码字并确定码字的校正子。 接下来，以概率p随机修改码字以产生修改后的码字。 如果修改的码字是可恢复的，则修改的码字被选择并分配给用户作为密码。
-
6.发明申请Method for constructing large-girth quasi-cyclic low-density parity-check codes 有权构建大环准循环低密度奇偶校验码的方法公开(公告)号：US20100058139A1
公开(公告)日：2010-03-04
申请号：US12199512
申请日：2008-08-27
申请人： Yige Wang , Jonathan S. Yedidia , Stark C. Draper
发明人： Yige Wang , Jonathan S. Yedidia , Stark C. Draper
CPC分类号： H03M13/116 , H03M13/033
摘要： A method constructs a code, wherein the code is a large-girth quasi-cyclic low-density parity-check code. A base matrix is selected for the code. A cost matrix corresponding to the base matrix is determined. A single element in the base is changed repeatedly maximize a reduction in cost. A parity check matrix is constructing for the code from the base matrix when the cost is zero, and an information block is encoded as a code word using the parity check matrix in an encoder.
摘要翻译： 一种方法构建代码，其中代码是大环准循环低密度奇偶校验码。 为代码选择基本矩阵。 确定与基本矩阵相对应的成本矩阵。 基地中的单个元素反复更改最大化成本降低。 当成本为零时，从基本矩阵构建奇偶校验矩阵，并且使用编码器中的奇偶校验矩阵将信息块编码为码字。
-
公开(公告)号：US06910000B1
公开(公告)日：2005-06-21
申请号：US09586282
申请日：2000-06-02
CPC分类号： G06F17/10
摘要： A method determines approximate probabilities of states of a system represented by a model. The model includes nodes connected by links. Each node represents possible states of a corresponding part of the system, and each link represents statistical dependencies between possible states of related nodes. The nodes are grouped into arbitrary sized clusters such that every node is included in at least one cluster and each link is completely contained in at least one cluster. Messages, based on the arbitrary sized cluster, are defined. Each message has associated sets of source nodes and destination nodes, and a value and a rule depending on other messages and on selected links connecting the source nodes and destination nodes. The value of each message is updated until a termination condition is reached. When the termination condition is reached, approximate probabilities of the states of the system are determined from the values of the messages.
摘要翻译： 一种方法确定由模型表示的系统的状态的近似概率。 该模型包括通过链接连接的节点。 每个节点表示系统的对应部分的可能状态，并且每个链路表示相关节点的可能状态之间的统计依赖性。 节点被分组成任意大小的集群，使得每个节点被包括在至少一个集群中，并且每个链路完全包含在至少一个集群中。 定义了基于任意大小的集群的消息。 每个消息具有关联的源节点和目的节点集合，以及取决于其他消息的值和规则，以及连接源节点和目的节点的选定链路。 每个消息的值被更新，直到达到终止条件。 当达到终止条件时，根据消息的值确定系统的状态的近似概率。
-
8.发明申请公开(公告)号：US20110041029A1
公开(公告)日：2011-02-17
申请号：US12541810
申请日：2009-08-14
申请人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
发明人： Jonathan S. Yedidia , Yige Wang , Stark C. Draper
CPC分类号： G06F7/5057 , G06F7/5443 , H03M13/1111 , H03M13/658 , H04B10/6165 , H04L9/3218 , H04L2209/46 , H04L2209/50
摘要： A code to be decoded by message-passing is represented by a factor graph. The factor graph includes variable nodes indexed by i and constraint nodes indexed by a connected by edges for transferring messages mi→a outgoing from the variable nodes to the constraint nodes and messages ma→i incoming from the constraint nodes to the variable nodes. The messages mi→a are initialized based on beliefs bi of a received codeword. The messages ma→i are generated by overshooting the messages mi→a at the constraint nodes. The beliefs bi are updated at the variable nodes using the messages ma→i. The codeword is outputted if found, otherwise, the messages mi→a are updated using a correction for the overshooting.
-
公开(公告)号：US20080270330A1
公开(公告)日：2008-10-30
申请号：US11739144
申请日：2007-04-24
申请人： Jonathan S. Yedidia
发明人： Jonathan S. Yedidia
IPC分类号： G06N3/12
摘要： A network performs an input-output function. The network includes a set of cells. Each cell has an identical structure, and neighboring cells are connected to each other to form a network. Each cell further includes a set of logic units configured to perform an input-output function, and in which the logic units output factor signals, inter-cellular signals and developmental output signals, the factor signals being input signals for the set of logic units in the same cell, the inter-cellular signals being input signals for the set of logic units in the neighboring cells, and the developmental output signals initiating development events, and in which developmental input signals to the logic units are set after the development events for the set of logic units in the same cell, and in which a structure of the set of logic units in each cell is identical.
摘要翻译： 网络执行输入输出功能。 网络包括一组单元。 每个小区具有相同的结构，并且相邻小区彼此连接以形成网络。 每个单元还包括一组逻辑单元，其被配置为执行输入 - 输出功能，并且其中逻辑单元输出因子信号，蜂窝间信号和显影输出信号，因子信号是用于该组逻辑单元的输入信号 相同的小区，蜂窝间信号是相邻小区中的逻辑单元集合的输入信号，以及启动开发事件的发展输出信号，并且其中在逻辑单元的发展输入信号被设置在用于 在同一单元中的一组逻辑单元，并且其中每个单元中的该组逻辑单元的结构相同。
-
10.发明申请Cooperative Routing in Wireless Networks using Mutual-Information Accumulation 审中-公开使用相互信息积累的无线网络中的协作路由公开(公告)号：US20080144562A1
公开(公告)日：2008-06-19
申请号：US12039843
申请日：2008-02-29
CPC分类号： H04B7/2606 , H04B7/026 , H04B7/15592 , H04L1/06 , H04L1/0618 , H04L2001/0092 , H04W52/46
摘要： A route is selected in a wireless cooperative relay network of nodes. A decoding order is initialized. A set of resources is minimized subject to constraints. The resources are allocated to the nodes in the decoding order. The decoding order is changed iteratively to further minimize the allocated resources, until a minimum is reached. A code word is transmitted when the allocated resources are at the minimum, which can either be determined globally or locally at each node. The method can operate in a centralized or distributed manner.
摘要翻译： 在节点的无线协作中继网络中选择路由。 解码顺序被初始化。 一系列资源在受限制的情况下被最小化。 资源按解码顺序分配给节点。 迭代地改变解码顺序，以进一步最小化分配的资源，直到达到最小值。 当分配的资源为最小时，发送码字，这可以在每个节点全局或局部地确定。 该方法可以集中或分布式运行。
-
-
-
-
-
-
-
-
-
搜索结果
30 条记录 (耗时 0.023 秒)
