会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • System and method for implementing a learning model for predicting the geographic location of an internet protocol address
    • 用于实现用于预测因特网协议地址的地理位置的学习模型的系统和方法
    • US08788437B2
    • 2014-07-22
    • US13192686
    • 2011-07-28
    • Armand Erik Prieditis
    • Armand Erik Prieditis
    • G06F15/18
    • G06N99/005G06N5/04H04L61/2007H04L61/609H04W64/00
    • A system and method for implementing a learning model for predicting the geographic location of an Internet Protocol (IP) address are disclosed. A particular embodiment of the system and method includes receiving a model to predict a geographic coordinates position of an Internet Protocol (IP) address, the model including one or more parameters and one or more variables associated with coordinates of the IP address and corresponding information associated with the IP address; receiving training data including a plurality of pairs of coordinates of a target IP address and corresponding information associated with the target IP address; determining, by use of a processor, the one or more parameters based on the training data and the model; and returning a result including information indicative of the determined parameters.
    • 公开了一种用于实现用于预测因特网协议(IP)地址的地理位置的学习模型的系统和方法。 系统和方法的特定实施例包括接收模型以预测因特网协议(IP)地址的地理坐标位置,所述模型包括一个或多个参数以及与所述IP地址的坐标相关联的一个或多个变量以及相应的信息 与IP地址; 接收包括目标IP地址的多对坐标对应和与所述目标IP地址相关联的对应信息的训练数据; 通过使用处理器来确定基于训练数据和模型的一个或多个参数; 并返回包括指示所确定的参数的信息的结果。
    • 3. 发明申请
    • METHOD AND APPARATUS FOR FACILITATING FINDING A NEAREST NEIGHBOR IN A DATABASE
    • 促进在数据库中发现最近的邻居的方法和装置
    • US20130204861A1
    • 2013-08-08
    • US13365735
    • 2012-02-03
    • Armand Erik Prieditis
    • Armand Erik Prieditis
    • G06F17/30
    • G06F16/2246G06F16/29
    • A method and apparatus for facilitating finding a nearest neighbor in a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving information indicative of a query point and information indicative of a node in the database tree; determining, by use of a processor, a lower-bound estimate based on the node and the query point, wherein the lower-bound estimate corresponds to a distance from the query point to the node; determining, by use of the processor, a temporary result corresponding to a distance to a nearest neighbor based on at least one child node of the node, the query point, and the lower-bound estimate; pruning one or more of the plurality of nodes based on the lower-bound estimate and a pruning bound; and returning a result indicative of a nearest neighbor of the query point.
    • 一种便于查找数据库中最近邻居的方法和装置。 示例性实施例包括:访问具有多个节点的数据库树; 接收指示查询点的信息和指示数据库树中的节点的信息; 通过使用处理器来确定基于所述节点和所述查询点的下限估计,其中所述下限估计对应于从所述查询点到所述节点的距离; 通过使用所述处理器,基于所述节点的所述至少一个子节点,所述查询点和所述下限估计来确定对应于与最近邻居的距离的临时结果; 基于下限估计和修剪边界修剪多个节点中的一个或多个节点; 并返回指示查询点的最近邻的结果。
    • 4. 发明申请
    • SYSTEM AND METHOD FOR IMPLEMENTING A LEARNING MODEL FOR PREDICTING THE GEOGRAPHIC LOCATION OF AN INTERNET PROTOCOL ADDRESS
    • 实施互联网协议地址地理位置学习模式的系统和方法
    • US20130031033A1
    • 2013-01-31
    • US13192686
    • 2011-07-28
    • Armand Erik Prieditis
    • Armand Erik Prieditis
    • G06F15/18
    • G06N99/005G06N5/04H04L61/2007H04L61/609H04W64/00
    • A system and method for implementing a learning model for predicting the geographic location of an Internet Protocol (IP) address are disclosed. A particular embodiment of the system and method includes receiving a model to predict a geographic coordinates position of an Internet Protocol (IP) address, the model including one or more parameters and one or more variables associated with coordinates of the IP address and corresponding information associated with the IP address; receiving training data including a plurality of pairs of coordinates of a target IP address and corresponding information associated with the target IP address; determining, by use of a processor, the one or more parameters based on the training data and the model; and returning a result including information indicative of the determined parameters.
    • 公开了一种用于实现用于预测因特网协议(IP)地址的地理位置的学习模型的系统和方法。 该系统和方法的特定实施例包括接收模型以预测因特网协议(IP)地址的地理坐标位置,所述模型包括一个或多个参数以及与所述IP地址的坐标相关联的一个或多个变量以及相应的信息 与IP地址; 接收包括目标IP地址的多对坐标对应和与所述目标IP地址相关联的对应信息的训练数据; 通过使用处理器来确定基于训练数据和模型的一个或多个参数; 并返回包括指示所确定的参数的信息的结果。
    • 5. 发明授权
    • Method and system for evaluating and selecting traceroutes to be used in determining the geographic location of a network block
    • 用于评估和选择要用于确定网络块的地理位置的跟踪路由的方法和系统
    • US08055792B2
    • 2011-11-08
    • US11948771
    • 2007-11-30
    • Adam WinklerTobias SpeckbacherGary Conner
    • Adam WinklerTobias SpeckbacherGary Conner
    • G06F15/173H04L12/66
    • H04L67/18H04L41/12H04L63/10H04L63/107H04L2463/101H04W4/02H04W4/029H04W4/04
    • A method and system for evaluating and selecting traceroutes to be used in determining the geographic location of a network block. A particular embodiment of the system includes a set of traceroute feature vector extractors, each traceroute feature vector extractor being associated with at least one of a plurality of traceroutes, each traceroute feature vector extractor being configured to generate a traceroute feature vector for at least one of the plurality of traceroutes; a set of traceroute classifiers each coupled to at least one of the traceroute feature vector extractors, each traceroute classifier being associated with at least one of the plurality of traceroutes, each traceroute classifier being configured to generate at least one traceroute classification and/or regression based on at least one of the traceroute feature vectors; and a traceroute geolocation determining engine.
    • 一种用于评估和选择要用于确定网络块的地理位置的跟踪路由的方法和系统。 系统的特定实施例包括一组跟踪路由特征向量提取器,每个跟踪路由特征向量提取器与多个跟踪路由中的至少一个相关联,每个跟踪路由特征向量提取器被配置为生成用于以下各项中的至少一个的跟踪路由特征向量: 多个traceroutes; 一组跟踪路由分类器,每个跟踪路由分类器耦合到至少一个跟踪路由特征向量提取器,每个跟踪路由分类器与多个跟踪路由中的至少一个相关联,每个跟踪路由分类器被配置为生成至少一个跟踪路由分类和/或回归 在至少一个跟踪路由特征向量中; 和一个跟踪路由地理位置确定引擎。
    • 7. 发明申请
    • METHOD AND APPARATUS FOR IMPLEMENTING A LEARNING MODEL FOR FACILITATING ANSWERING A QUERY ON A DATABASE
    • 实现一个学习模型的方法和装置,用于在数据库上进行查询
    • US20130185335A1
    • 2013-07-18
    • US13349987
    • 2012-01-13
    • Armand Erik Prieditis
    • Armand Erik Prieditis
    • G06F17/30
    • G06F17/30536
    • A method and apparatus for implementing a learning model for facilitating answering a query on a database. Example embodiments include processing logic to: receive access to a database having a plurality of rows; determine for each row in the plurality of rows which of a plurality of child nodes to associate with a row based on the row and current parameters, where the current parameters correspond to parameters of a probability distribution for the plurality of child nodes; determine new parameters for the plurality of child nodes based on associated rows of the plurality of rows; determine whether or not to return a result which indicates the new parameters based on the current parameters, the new parameters, and the plurality of rows; and return a result which indicates the new parameters.
    • 一种用于实现学习模型以便于回答关于数据库的查询的方法和装置。 示例性实施例包括处理逻辑以:接收对具有多行的数据库的访问; 基于行和当前参数,确定多行子节点中的哪一个与行相关联的行中的每一行,其中当前参数对应于多个子节点的概率分布的参数; 基于所述多个行中的相关联的行来确定所述多个子节点的新参数; 基于当前参数,新参数和多行来确定是否返回指示新参数的结果; 并返回指示新参数的结果。
    • 9. 发明申请
    • METHOD AND APPARATUS FOR FACILITATING ANSWERING A QUERY ON A DATABASE
    • 促进数据库中查询的方法和设备
    • US20130124502A1
    • 2013-05-16
    • US13297531
    • 2011-11-16
    • Armand Erik Prieditis
    • Armand Erik Prieditis
    • G06F17/30
    • G06F17/30424
    • A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.
    • 一种便于应答数据库查询的方法和装置。 示例性实施例包括:访问具有多个节点的数据库树; 接收一组输入变量值,非空集合的输出变量,以及指示数据库树中节点的信息; 基于节点和输入变量值的集合确定遍历成本; 基于所述节点和所述输入变量值集合确定下限,其中所述下限对应于基于所述多个节点中的一个或多个以及所述一组输入变量值的上限​​概率估计; 基于遍历成本,下限和修剪边界修剪多个节点中的一个或多个节点; 并且基于输入变量值集合,节点,遍历成本和下限返回包括输出变量值的非空集合的结果。