会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Preview mode
    • 预览模式
    • US07257603B2
    • 2007-08-14
    • US10435712
    • 2003-05-08
    • Derek MurmanEdward H. WaytJeffrey BissetJing WuKim CameronMax L. BensonJie Liu
    • Derek MurmanEdward H. WaytJeffrey BissetJing WuKim CameronMax L. BensonJie Liu
    • G06F17/30
    • G06Q10/06Y10S707/99942Y10S707/99943Y10S707/99945Y10S707/99948Y10S707/99952
    • Various exemplary metadirectories, systems and/or methods include or allow for executing a software module on an execution engine, emitting semantic information based on the executing, and analyzing the executing using the semantic information. An exemplary execution engine includes an input for receiving software modules, an output for emitting semantic information, and an output for outputting generated output information. Upon execution, an exemplary software module may cause processing of information in a metadirectory and emitting of semantic information pertaining to the processing. Various exemplary metadirectories, systems and/or methods emit and/or store semantic information in a self-defining language, an extensible language, and/or a markup language. Other exemplary metadirectories, systems, and/or methods are also disclosed.
    • 各种示例性的元数据,系统和/或方法包括或允许在执行引擎上执行软件模块,基于执行发送语义信息,并且使用语义信息来分析执行。 示例性执行引擎包括用于接收软件模块的输入,用于发出语义信息的输出,以及用于输出生成的输出信息的输出。 在执行时,示例性软件模块可以引起对元目录中的信息的处理并发出与该处理有关的语义信息。 各种示例性的元目录,系统和/或方法以自定义语言,可扩展语言和/或标记语言发出和/或存储语义信息。 还公开了其它示例性的元目录,系统和/或方法。
    • 4. 发明授权
    • Time based expiration of data objects in a store and forward replication
enterprise
    • 存储和转发复制企业中数据对象的时间到期
    • US5794253A
    • 1998-08-11
    • US679053
    • 1996-07-12
    • Scott NorinMax L. Benson
    • Scott NorinMax L. Benson
    • G06F11/14G06F17/30
    • G06F17/30578Y10S707/99952Y10S707/99954
    • Systems and methods of time based data expiration in a replication environment are presented. The systems and methods of the present invention allow different age limits to be set on each individual server in a network. A network can therefore be configured with some servers having no age limit and other servers having a wide range of differing age limits. Systems and methods for handling mixed data sets that include some data objects which are allowed to expire and some data objects which do not expire are also presented. In all cases, the time based data expiration systems and methods are designed to insure proper operation of the replication process and any associated data recovery process. Specifically, expired data will not be recovered via any data recovery mechanism and servers will not attempt to recover missing data from a server that has expired that data.
    • 介绍了复制环境中基于时间的数据到期的系统和方法。 本发明的系统和方法允许在网络中的每个单独的服务器上设置不同的年龄限制。 因此,网络可以配置有一些没有年龄限制的服务器,而其他具有不同年龄限制的服务器。 还介绍了处理混合数据集的系统和方法,其中包括允许过期的一些数据对象和一些不到期的数据对象。 在所有情况下,基于时间的数据到期系统和方法旨在确保复制过程和任何相关数据恢复过程的正确操作。 具体来说,过期的数据将不会通过任何数据恢复机制恢复,并且服务器将不会尝试从已过期该数据的服务器恢复丢失的数据。
    • 6. 发明授权
    • Associating and using information in a metadirectory
    • 在元目录中关联和使用信息
    • US07636720B2
    • 2009-12-22
    • US10435720
    • 2003-05-08
    • Max L. Benson
    • Max L. Benson
    • G06F17/00
    • G06F17/30581Y10S707/99952
    • Various exemplary metadirectories, systems and/or methods include delta information, error information and/or state information to facilitate metadirectory administration and/or operation. An exemplary metadirectory relies on a hologram and a plurality of deltas to represent information related to an object of a directory. Such an exemplary metadirectory may represent the object in association with one or more processing states based on the hologram and one or more of the plurality of deltas. Various other exemplary metadirectories, systems and/or methods are also disclosed.
    • 各种示例性的元目录,系统和/或方法包括增量信息,错误信息和/或状态信息以便于元目录管理和/或操作。 示例性元目录依赖于全息图和多个三角形来表示与目录的对象相关的信息。 这样的示例性元目录可以基于全息图和多个三角形中的一个或多个与一个或多个处理状态相关联地表示对象。 还公开了各种其它示例性的元组件,系统和/或方法。
    • 8. 发明授权
    • Compressing sets of integers
    • 压缩整数集
    • US5940833A
    • 1999-08-17
    • US678966
    • 1996-07-12
    • Max L. Benson
    • Max L. Benson
    • H03M7/30G06F17/30
    • H03M7/30Y10S707/99942
    • In one aspect, the disclosed technique detects common leading byte patterns in the integers so that these patterns need only be stored once in the encoded byte stream. Those integers that share a common leading byte pattern are stored in truncated form, without their common leading bytes. These truncated integers may themselves be further examined to determine if any of them share additional common leading bytes beyond those already detected. Thus, the technique lends itself naturally to description using the language of trees. Integers with a common leading byte pattern are stored as child nodes, their parent being the node containing the common byte pattern. Child nodes consist only of those bytes remaining after the initial byte pattern has been extracted; the greater the number of children, the greater are the efficiency gains. All the children of a given tree or subtree are similarly examined for common leading byte patterns, ignoring those bytes that are already accounted for in their ancestor nodes. In a second aspect, the disclosed technique makes use of "clustering", a second type of locality that is not reached by the interval concept. A cluster is a sequence of singleton integers that are very close together but do not form a contiguous interval. The technique recognizes that such a cluster can be compactly stored as a bitmap, in which each active bit ("1-bit") represents a member of the cluster. The choice of bitmap size (e.g., 1 byte, 2 bytes, etc.) can be calibrated to suit the clustering characteristics of the input data set.
    • 在一个方面,所公开的技术检测整数中的公共前导字节模式,使得这些模式仅需要在编码字节流中存储一次。 那些共享一个前导字节模式的整数是以截断的形式存储的,没有它们的共同的前导字节。 这些截断的整数本身可以被进一步检查以确定它们中的任何一个是否共享超出那些已经检测到的额外的公共前导字节。 因此,该技术自然地适用于使用树语言的描述。 具有公共前导字节模式的整数存储为子节点,它们的父节点是包含公共字节模式的节点。 子节点仅包括在提取初始字节模式之后剩余的字节; 儿童人数越多,效率越高。 类似地,给定树或子树的所有子节点检查常用的前导字节模式,忽略在其祖先节点中已经占用的那些字节。 在第二方面,所公开的技术利用“聚类”,这是间隔概念未达到的第二类型的位置。 集群是非常接近但不形成连续间隔的单例整数序列。 该技术可以将这样的集群紧凑地存储为位图,其中每个活动位(“1位”)表示集群的成员。 可以校准位图大小(例如,1字节,2字节等)的选择以适应输入数据集的聚类特性。