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

1. 发明授权

US07480817B2 Method for replicating data based on probability of concurrent failure 失效
标题翻译：基于并发故障概率复制数据的方法
公开(公告)号：US07480817B2
公开(公告)日：2009-01-20
申请号：US11395018
申请日：2006-03-31
申请人： Jinliang Fan , Zhen Liu , Dimitrios Pendarakis
发明人： Jinliang Fan , Zhen Liu , Dimitrios Pendarakis
IPC分类号： G06F11/00
CPC分类号： H04L67/1095 , G06F11/202 , G06F11/2053 , H04L67/18 , H04L69/40 , H04W4/02
摘要： A method is provided for replicating data. All nodes coupled to a source node via a network are surveyed to determine candidate replication nodes, and coordinates for each candidate replication node are acquired. The coordinates are used to determine a geographic location of and a communication cost for each candidate replication node. Each geographic location is rated based on probability of a concurrent failure of the source node and the candidate replication node, and a branch-and-bound algorithm is used to assign values to sets of candidate replication nodes based on the communication costs and the ratings. One set of candidate replication nodes is selected based on the assigned values. The data is replicated on the nodes of the selected set of candidate replication nodes, and all nodes coupled to the source node via the network are at least periodically monitored to determine availability of new nodes.
摘要翻译：提供了一种用于复制数据的方法。调查经由网络耦合到源节点的所有节点以确定候选复制节点，并且获取每个候选复制节点的坐标。坐标用于确定每个候选复制节点的地理位置和通信成本。基于源节点和候选复制节点的并发故障的概率对每个地理位置进行评估，并且使用分支和边界算法根据通信成本和等级将值分配给候选复制节点的集合。基于分配的值来选择一组候选复制节点。数据被复制在所选择的候选复制节点集合的节点上，并且经由网络耦合到源节点的所有节点至少被周期性地监视以确定新节点的可用性。

2. 发明申请

US20070234102A1 Data replica selector 失效
标题翻译：数据副本选择器
公开(公告)号：US20070234102A1
公开(公告)日：2007-10-04
申请号：US11395018
申请日：2006-03-31
申请人： Jinliang Fan , Zhen Liu , Dimitrios Pendarakis
发明人： Jinliang Fan , Zhen Liu , Dimitrios Pendarakis
IPC分类号： G06F11/00
CPC分类号： H04L67/1095 , G06F11/202 , G06F11/2053 , H04L67/18 , H04L69/40 , H04W4/02
摘要： There is provided a method and system for replicating data at another location. The system includes a source node that contains data in a data storage area. The source node is coupled to a network of potential replication nodes. The processor determines at least two eligible nodes in the network of nodes and determines the communication cost associated with a each of the eligible nodes. The processor also determines a probability of a concurrent failure of the source node and each of eligible nodes, and selects at least one of the eligible nodes for replication of the data located on the source node. The selection is based on an the determined communication costs and probability of concurrent failure.
摘要翻译：提供了在另一个位置复制数据的方法和系统。该系统包括在数据存储区域中包含数据的源节点。源节点耦合到潜在复制节点的网络。处理器确定节点网络中的至少两个合格节点，并确定与每个合格节点相关联的通信成本。处理器还确定源节点和每个合格节点的并发故障的概率，并且选择至少一个合格节点用于复制位于源节点上的数据。该选择基于所确定的通信成本和并发故障的概率。

3. 发明授权

US07650529B2 Data replica selector 有权
标题翻译：数据副本选择器
公开(公告)号：US07650529B2
公开(公告)日：2010-01-19
申请号：US12145540
申请日：2008-06-25
申请人： Jinliang Fan , Zhen Liu , Dimitrios Pendarakis
发明人： Jinliang Fan , Zhen Liu , Dimitrios Pendarakis
IPC分类号： G06F11/00
CPC分类号： H04L67/1095 , G06F11/202 , G06F11/2053 , H04L67/18 , H04L69/40 , H04W4/02
摘要： There is provided a method and system for replicating data at another location. The system includes a source node that contains data in a data storage area. The source node is coupled to a network of potential replication nodes. The processor determines at least two eligible nodes in the network of nodes and determines the communication cost associated with a each of the eligible nodes. The processor also determines a probability of a concurrent failure of the source node and each of eligible nodes, and selects at least one of the eligible nodes for replication of the data located on the source node. The selection is based on the determined communication costs and probability of concurrent failure.
摘要翻译：提供了在另一个位置复制数据的方法和系统。该系统包括在数据存储区域中包含数据的源节点。源节点耦合到潜在复制节点的网络。处理器确定节点网络中的至少两个合格节点，并确定与每个合格节点相关联的通信成本。处理器还确定源节点和每个合格节点的并发故障的概率，并且选择至少一个合格节点用于复制位于源节点上的数据。选择是基于确定的通信成本和并发故障的概率。

4. 发明授权

US07778183B2 Data replica selector 有权
标题翻译：数据副本选择器
公开(公告)号：US07778183B2
公开(公告)日：2010-08-17
申请号：US11676631
申请日：2007-02-20
申请人： Jinliang Fan , Nagui Halim , Zhen Liu , Dimitrios Pendarakis
发明人： Jinliang Fan , Nagui Halim , Zhen Liu , Dimitrios Pendarakis
IPC分类号： G08C15/00
CPC分类号： H04Q3/0079
摘要： A method is provided for selecting a replication node from eligible nodes in a network. A multidimensional model is constructed that defines a multidimensional space and includes the eligible nodes, with each of the dimensions of the multidimensional model being a system characteristic. A data availability value is determined for each of the eligible nodes, and a cost of deploying is determined for each of at least two availability strategies to the eligible nodes. At least one of the eligible nodes is selected for replication of data that is stored on a source node in the network. The selecting step includes selecting the eligible node whose: data availability value is determined to be highest among the eligible nodes whose cost of deploying does not exceed a specified maximum, or cost of deploying is determined to be lowest among the eligible nodes whose data availability value does not exceed a specified minimum.
摘要翻译：提供了一种从网络中的合格节点中选择复制节点的方法。构建了一个多维模型，它定义了一个多维空间，并且包括合格的节点，多维模型的每个维度都是一个系统特征。确定每个合格节点的数据可用性值，并且针对合格节点的至少两个可用性策略中的每一个确定部署成本。选择至少一个合格节点用于复制存储在网络中的源节点上的数据。所述选择步骤包括选择其数据可用性值被确定为在其部署成本不超过指定的最大值的合格节点中的数据可用性值最高的合格节点，或者在其数据可用性值的合格节点之间确定部署成本最低不超过规定的最小值。

5. 发明申请

US20080198752A1 DATA REPLICA SELECTOR 有权
标题翻译：数据复制选择器
公开(公告)号：US20080198752A1
公开(公告)日：2008-08-21
申请号：US11676631
申请日：2007-02-20
申请人： Jinliang Fan , Nagui Halim , Zhen Liu , Dimitrios Pendarakis
发明人： Jinliang Fan , Nagui Halim , Zhen Liu , Dimitrios Pendarakis
IPC分类号： G08C15/00
CPC分类号： H04Q3/0079
摘要： A method is provided for selecting a replication node from eligible nodes in a network. A multidimensional model is constructed that defines a multidimensional space and includes the eligible nodes, with each of the dimensions of the multidimensional model being a system characteristic. A data availability value is determined for each of the eligible nodes, and a cost of deploying is determined for each of at least two availability strategies to the eligible nodes. At least one of the eligible nodes is selected for replication of data that is stored on a source node in the network. The selecting step includes selecting the eligible node whose: data availability value is determined to be highest among the eligible nodes whose cost of deploying does not exceed a specified maximum, or cost of deploying is determined to be lowest among the eligible nodes whose data availability value does not exceed a specified minimum.
摘要翻译：提供了一种从网络中的合格节点中选择复制节点的方法。构建了一个多维模型，它定义了一个多维空间，并且包括合格的节点，多维模型的每个维度都是一个系统特征。确定每个合格节点的数据可用性值，并且针对合格节点的至少两个可用性策略中的每一个确定部署成本。选择至少一个合格节点用于复制存储在网络中的源节点上的数据。所述选择步骤包括选择其数据可用性值被确定为在其部署成本不超过指定的最大值的合格节点中的数据可用性值最高的合格节点，或者在其数据可用性值的合格节点之间确定部署成本最低不超过规定的最小值。

6. 发明授权

US08041710B2 Automatic diagnosis of search relevance failures 有权
标题翻译：自动诊断搜索相关性故障
公开(公告)号：US08041710B2
公开(公告)日：2011-10-18
申请号：US12270201
申请日：2008-11-13
申请人： Li-wei He , Wenzhao Tan , Jinliang Fan , Yi-Min Wang , Xiaoxin Yin
发明人： Li-wei He , Wenzhao Tan , Jinliang Fan , Yi-Min Wang , Xiaoxin Yin
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： Search relevance failures are diagnosed automatically. Users presented with unsatisfactory search results can report their dissatisfaction through various mechanisms. Dissatisfaction reports can trigger automatic investigation into the root cause of such dissatisfaction. Based on the identified root cause, a search engine can be modified to resolve the issue creating dissatisfaction thereby improving search engine quality.
摘要翻译：搜索相关性故障自动诊断。用户不满意的搜索结果可以通过各种机制报告他们的不满。不满意的报告可能引发自动调查，造成这种不满的根本原因。基于确定的根本原因，可以修改搜索引擎来解决创建不满意的问题，从而提高搜索引擎的质量。

7. 发明授权

US08356086B2 Distributed non-negative matrix factorization 有权
标题翻译：分布式非负矩阵分解
公开(公告)号：US08356086B2
公开(公告)日：2013-01-15
申请号：US12750772
申请日：2010-03-31
申请人： Chao Liu , Hung-chih Yang , Jinliang Fan , Li-wei He , Yi-Min Wang
发明人： Chao Liu , Hung-chih Yang , Jinliang Fan , Li-wei He , Yi-Min Wang
IPC分类号： G06F15/16 , G06F15/173 , G06F17/30
CPC分类号： G06F17/16
摘要： Architecture that scales up the non-negative matrix factorization (NMF) technique to a distributed NMF (denoted DNMF) to handle large matrices, for example, on a web scale that can include millions and billions of data points. To analyze web-scale data, DNMF is applied through parallelism on distributed computer clusters, for example, with thousands of machines. In order to maximize the parallelism and data locality, matrices are partitioned in the short dimension. The probabilistic DNMF can employ not only Gaussian and Poisson NMF techniques, but also exponential NMF for modeling web dyadic data (e.g., dwell time of a user on browsed web pages).
摘要翻译：将非负矩阵分解（NMF）技术扩展到分布式NMF（表示为DNMF）以处理大型矩阵的架构，例如，可以包括数百万和数十亿个数据点的网络规模。为了分析网络规模数据，DNMF通过并行性应用于分布式计算机集群，例如数千台机器。为了最大化并行度和数据局部性，矩阵在短维中被划分。概率DNMF不仅可以采用高斯和泊松NMF技术，还可以采用指数NMF来建模网络二进制数据（例如，用户在浏览的网页上的停留时间）。

8. 发明申请

US20100121841A1 AUTOMATIC DIAGNOSIS OF SEARCH RELEVANCE FAILURES 有权
标题翻译：搜索相关失败的自动诊断
公开(公告)号：US20100121841A1
公开(公告)日：2010-05-13
申请号：US12270201
申请日：2008-11-13
申请人： Li-wei He , Wenzhao Tan , Jinliang Fan , Yi-Min Wang , Xiaoxin Yin
发明人： Li-wei He , Wenzhao Tan , Jinliang Fan , Yi-Min Wang , Xiaoxin Yin
IPC分类号： G06F7/10 , G06F17/30 , G06N5/02
CPC分类号： G06F17/30867
摘要： Search relevance failures are diagnosed automatically. Users presented with unsatisfactory search results can report their dissatisfaction through various mechanisms. Dissatisfaction reports can trigger automatic investigation into the root cause of such dissatisfaction. Based on the identified root cause, a search engine can be modified to resolve the issue creating dissatisfaction thereby improving search engine quality.
摘要翻译：搜索相关性故障自动诊断。用户不满意的搜索结果可以通过各种机制报告他们的不满。不满意的报告可能引发自动调查，造成这种不满的根本原因。基于确定的根本原因，可以修改搜索引擎来解决创建不满意的问题，从而提高搜索引擎的质量。

9. 发明申请

US20110246573A1 DISTRIBUTED NON-NEGATIVE MATRIX FACTORIZATION 有权
标题翻译：分布式非负矩阵法
公开(公告)号：US20110246573A1
公开(公告)日：2011-10-06
申请号：US12750772
申请日：2010-03-31
申请人： Chao Liu , Hung-Chih Yang , Jinliang Fan , Li-Wei He , Yi-Min Wang
发明人： Chao Liu , Hung-Chih Yang , Jinliang Fan , Li-Wei He , Yi-Min Wang
IPC分类号： G06F15/16
CPC分类号： G06F17/16
摘要： Architecture that scales up the non-negative matrix factorization (NMF) technique to a distributed NMF (denoted DNMF) to handle large matrices, for example, on a web scale that can include millions and billions of data points. To analyze web-scale data, DNMF is applied through parallelism on distributed computer clusters, for example, with thousands of machines. In order to maximize the parallelism and data locality, matrices are partitioned in the short dimension. The probabilistic DNMF can employ not only Gaussian and Poisson NMF techniques, but also exponential NMF for modeling web dyadic data (e.g., dwell time of a user on browsed web pages).
摘要翻译：将非负矩阵分解（NMF）技术扩展到分布式NMF（表示为DNMF）以处理大型矩阵的架构，例如，可以包括数百万和数十亿个数据点的网络规模。为了分析网络规模数据，DNMF通过并行性应用于分布式计算机集群，例如数千台机器。为了最大化并行度和数据局部性，矩阵在短维中被划分。概率DNMF不仅可以采用高斯和泊松NMF技术，还可以采用指数NMF来建模网络二进制数据（例如，用户在浏览的网页上的停留时间）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式