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

1. 发明申请

US20130262456A1 ELECTRONIC DEVICE AND METHOD FOR SEARCHING RELATED TERMS 审中-公开
标题翻译：电子设备和搜索相关条款的方法
公开(公告)号：US20130262456A1
公开(公告)日：2013-10-03
申请号：US13906380
申请日：2013-05-31
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , GEN-CHI LU
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , GEN-CHI LU
IPC分类号： G06F17/30
CPC分类号： G06F16/24578 , G06F16/3338
摘要： A method for searching related terms first calculates a direct relationship between every two of a plurality of query terms to obtain a direct related matrix, and calculates a related score between every two of the query terms to obtain a related score matrix. The method further calculates an indirect relationship between every two of the query terms according to the direct relationship and the related score, and determines indirect terms of each query term according to the indirect relationship between every two of the query terms.
摘要翻译：搜索相关术语的方法首先计算多个查询项中的每两个之间的直接关系以获得直接相关矩阵，并且计算每两个查询项之间的相关分数以获得相关分数矩阵。该方法还根据直接关系和相关分数进一步计算每两个查询项之间的间接关系，并根据每两个查询项间的间接关系确定每个查询项的间接条件。

2. 发明申请

US20120197878A1 ELECTRONIC DEVICE AND METHOD FOR SEARCHING RELATED TERMS 失效
标题翻译：电子设备和搜索相关条款的方法
公开(公告)号：US20120197878A1
公开(公告)日：2012-08-02
申请号：US13217272
申请日：2011-08-25
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , GEN-CHI LU
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , GEN-CHI LU
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30672
摘要： A method for searching related terms first calculates a direct relationship between every two of a plurality of query terms to obtain a direct related matrix, and calculates a related score between every two of the query terms to obtain a related score matrix. The method further calculates an indirect relationship between every two of the query terms according to the direct relationship and the related score, and determines indirect terms of each query term according to the indirect relationship between every two of the query terms.
摘要翻译：搜索相关术语的方法首先计算多个查询项中的每两个之间的直接关系以获得直接相关矩阵，并且计算每两个查询项之间的相关分数以获得相关分数矩阵。该方法还根据直接关系和相关分数进一步计算每两个查询项之间的间接关系，并根据每两个查询项间的间接关系确定每个查询项的间接条件。

3. 发明申请

US20120166434A1 CONTROL COMPUTER AND FILE SEARCH METHOD USING THE SAME 失效
标题翻译：使用该控制计算机和文件搜索方法
公开(公告)号：US20120166434A1
公开(公告)日：2012-06-28
申请号：US13186480
申请日：2011-07-20
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , GEN-CHI LU
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , GEN-CHI LU
IPC分类号： G06F17/30
CPC分类号： G06F17/30672
摘要： A method for performing file search using a control computer receives an initial query expression from a client computer, divides the initial query expression into one or more keywords, determines related terms corresponding to each keyword, merges the keywords and the related terms to obtain an updated query expression, and generates search results according to the updated query expression. The method further calculates relevance scores among a plurality of documents in the search results and the updated query expression, ranks the documents in the search results according to the relevance scores, and displays the documents in the search results with the ranked order.
摘要翻译：使用控制计算机执行文件搜索的方法从客户端计算机接收初始查询表达式，将初始查询表达式划分为一个或多个关键字，确定与每个关键字相对应的相关术语，合并关键字和相关术语以获得更新的查询表达式，并根据更新的查询表达式生成搜索结果。该方法进一步计算搜索结果中的多个文档和更新的查询表达式中的相关性分数，根据相关性分数对搜索结果中的文档进行排序，并且以排序顺序将搜索结果中的文档显示。

4. 发明申请

US20120319875A1 METHOD FOR STORING NODE INFORMATION OF HUFFMAN TREE AND CORRESPONDING DECODING METHOD 审中-公开
标题翻译：用于存储霍尔姆森林的节点信息的方法和相应的解码方法
公开(公告)号：US20120319875A1
公开(公告)日：2012-12-20
申请号：US13596131
申请日：2012-08-28
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
IPC分类号： H03M7/40
CPC分类号： H03M7/40
摘要： A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.
摘要翻译：一种用于存储霍夫曼树的节点信息的方法。该方法使用宽度优先搜索（BFS）算法在霍夫曼树中创建每个节点的索引。该方法根据每个节点的索引序列从根节点开始读取霍夫曼树的每个节点，并将每个节点的节点信息存储到霍夫曼树的阵列中。

5. 发明申请

US20120060014A1 ELECTRONIC DEVICE AND METHOD FOR PROTECTING ELECTRONIC KEYS USING THE SAME 审中-公开
标题翻译：用于保护电子针的电子设备和方法
公开(公告)号：US20120060014A1
公开(公告)日：2012-03-08
申请号：US13082408
申请日：2011-04-08
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
IPC分类号： G06F12/08
CPC分类号： G06F21/10 , G06F21/602 , G06F21/6227
摘要： A method for protecting electronic keys sets a plurality of hash functions, divides an electronic key into a plurality of key segments, creates a data storage structure for each of the key segments, and calculates a hash address for each of the key segments of the electronic key using each of the hash functions. The method further obtains a plurality of hash addresses of the plurality of key segments corresponding to the plurality of hash functions, stores information of the data storage structure of each key segment in a hash table according to the hash address of the key segment corresponding to one of the hash functions.
摘要翻译：一种用于保护电子密钥的方法，设置多个散列函数，将电子密钥划分成多个密钥段，为每个密钥段创建数据存储结构，并计算电子密钥的每个密钥段的散列地址键使用每个哈希函数。该方法进一步获得与多个散列函数对应的多个密钥段的多个哈希地址，根据与一个哈希表相对应的密钥段的哈希地址将每个密钥段的数据存储结构的信息存储在哈希表中的哈希函数。

6. 发明申请

US20110097694A1 INTERPERSONAL RELATIONSHIPS ANALYSIS SYSTEM AND METHOD 失效
标题翻译：人际关系分析系统与方法
公开(公告)号：US20110097694A1
公开(公告)日：2011-04-28
申请号：US12650815
申请日：2009-12-31
申请人： CHIEN-FA YEH , CHUNG-I LEE , CHIU-HUA LU
发明人： CHIEN-FA YEH , CHUNG-I LEE , CHIU-HUA LU
IPC分类号： G09B9/00
CPC分类号： G06Q30/02 , G06F17/30247
摘要： An interpersonal relationships analysis method and system obtains an album comprising a plurality of photos, and recognize faces in each of the plurality of photos. The method and system further selects one of the recognized faces, matches the selected face with portraits stored in a person management database, so as to obtain basic information of a person with the selected face from the person management database. The method and system then analyzes an interpersonal relationship of the person with the selected face according to the album, and shows the interpersonal relationship of the person with the selected face.
摘要翻译：人际关系分析方法和系统获得包括多张照片的相册，并识别多张照片中的每一张照片中的面部。所述方法和系统进一步选择所识别的面孔之一，将所选择的脸部与存储在个人管理数据库中的肖像进行匹配，从而从人物管理数据库获得具有所选脸部的人的基本信息。该方法和系统然后根据专辑分析人与所选面部的人际关系，并且显示该人与所选面部的人际关系。

7. 发明申请

US20100310163A1 SYSTEM AND METHOD FOR FILTERING NOISE IN AN IMAGE 失效
标题翻译：用于在图像中过滤噪声的系统和方法
公开(公告)号：US20100310163A1
公开(公告)日：2010-12-09
申请号：US12582826
申请日：2009-10-21
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI
IPC分类号： G06K9/40 , G06K9/00
CPC分类号： G06T5/002 , G06T5/50 , G06T2207/10016 , G06T2207/10024 , G06T2207/20012
摘要： A method for filtering noise in an image filters noise pixels in a discrepant block between a current image and a background image firstly, and further filter each small block whose area is less than a preset value from the discrepant block. The method further calculates a total area of each big block whose area is greater than or equal to the preset value from the discrepant block, and adds the current image to a background list of the current image if the total area is less than another preset value.
摘要翻译：首先对当前图像和背景图像之间的差异块中的噪声像素中的噪声像素进行滤波的滤波方法，并且进一步从不同块中滤出面积小于预设值的每个小块。该方法进一步计算区域大于或等于来自差异块的预设值的每个大块的总面积，并且如果总面积小于另一预设值，则将当前图像添加到当前图像的背景列表中。

8. 发明申请

US20090044019A1 SYSTEM AND METHOD FOR DIGITALLY SIGNING ELECTRONIC DOCUMENTS 有权
标题翻译：用于数字电子文件的系统和方法
公开(公告)号：US20090044019A1
公开(公告)日：2009-02-12
申请号：US11940327
申请日：2007-11-15
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , XIAO-DI FAN , GUO-LING OU-YANG
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , XIAO-DI FAN , GUO-LING OU-YANG
IPC分类号： H04L9/14
CPC分类号： H04L9/3249 , H04L9/3239 , H04L2209/80
摘要： A system for digitally signing electronic documents is disclosed. The system includes a mobile device, an application server and a database, the mobile device includes a requesting module and a digest encrypting module, the application server includes an obtaining module, a digest generating module and a merging module. The requesting module is configured for sending a request for a digital signature of an electronic document to the application server; the obtaining module is configured for obtaining the electronic document from the database; the digest generating module is configured for generating a digest of the electronic document, and sending the digest to the mobile device; the digest encrypting module is configured for encrypting the digest, generating an encrypted value, and sending the encrypted value to the application server; the merging module is configured for merging the encrypted value and the electronic document. A related computer-based method is also disclosed.
摘要翻译：公开了一种用于数字签名电子文件的系统。该系统包括移动设备，应用服务器和数据库，移动设备包括请求模块和摘要加密模块，应用服务器包括获取模块，摘要生成模块和合并模块。请求模块被配置为向应用服务器发送电子文档的数字签名请求; 所述获取模块被配置为从所述数据库获取所述电子文档; 所述摘要生成模块被配置为生成所述电子文档的摘要，并将所述摘要发送到所述移动设备; 所述摘要加密模块被配置为加密所述摘要，生成加密值，并将所述加密值发送到所述应用服务器; 合并模块被配置用于合并加密值和电子文档。还公开了相关的基于计算机的方法。

9. 发明申请

US20130024860A1 CONTROL COMPUTER AND METHOD FOR MANAGING POWER USING THE SAME 失效
标题翻译：控制计算机及其使用方法
公开(公告)号：US20130024860A1
公开(公告)日：2013-01-24
申请号：US13447288
申请日：2012-04-16
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , TSUNG-HSIN YEN , CHIEN-CHIH LIN
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , TSUNG-HSIN YEN , CHIEN-CHIH LIN
IPC分类号： G06F9/455 , G06F1/26
CPC分类号： G06F1/3206 , G06F1/3234
摘要： In a method for managing power of host computers using a control computer, the method generates a power management command, groups virtual machines installed in the host computers at a first time if the power management command is a first type, to obtain a first group of the virtual machines. The method further relocates the virtual machines in the host computers based on the first group of the virtual machines, and closes idle host computers. Closed host computers are powered on if the power management command is the second type, all the virtual machines at a second time are grouped, to obtain a second group of the virtual machines. The virtual machines are relocated into each host computer based on the second group of the virtual machines.
摘要翻译：在一种用于管理使用控制计算机的主计算机的电力的方法中，该方法生成电源管理命令，如果电源管理命令是第一类型，则在第一时间对安装在主计算机中的虚拟机进行分组，以获得第一组虚拟机。该方法还基于第一组虚拟机重新定位主计算机中的虚拟机，并关闭空闲的主机计算机。如果电源管理命令是第二种类型，则所有虚拟机都被分组，以便获得第二组虚拟机，则打开主机计算机。基于第二组虚拟机将虚拟机重新定位到每台主机中。

10. 发明申请

US20110285558A1 METHOD FOR STORING NODE INFORMATION OF HUFFMAN TREE AND CORRESPONDING DECODING METHOD 失效
标题翻译：用于存储霍尔姆森林的节点信息的方法和相应的解码方法
公开(公告)号：US20110285558A1
公开(公告)日：2011-11-24
申请号：US12881134
申请日：2010-09-13
申请人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
发明人： CHUNG-I LEE , CHIEN-FA YEH , CHIU-HUA LU , CHENG-FENG TSAI , SHAN-CHUAN JENG , YU-FENG CHIEN , TSUNG-HSIN YEN
IPC分类号： H03M7/40
CPC分类号： H03M7/40
摘要： A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.
摘要翻译：一种用于存储霍夫曼树的节点信息的方法。该方法使用宽度优先搜索（BFS）算法在霍夫曼树中创建每个节点的索引。该方法根据每个节点的索引序列从根节点开始读取霍夫曼树的每个节点，并将每个节点的节点信息存储到霍夫曼树的阵列中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式