会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Data storage technique
    • 数据存储技术
    • US08065348B1
    • 2011-11-22
    • US12380268
    • 2009-02-25
    • Adam Louis BuchsbaumKiem-Phong Vo
    • Adam Louis BuchsbaumKiem-Phong Vo
    • G06F17/30
    • G06F17/30076G06F3/0643G06F9/542G06F2209/542
    • A preload library partitions certain files into segments and transforms the data of the files on a segment by segment basis, each independently of the other. The transformed segments are then stored as part of a transformed file, with each segment corresponding to a bag containing a chunk (of transformed data) and a gap which permits the chunks to grow when data of the segment is modified during a write operation. The bags are followed by a chunk map which contains metadata defining the compressed version of each segment. The preload library intercepts system calls from applications to the OC specifying access to specific segments of a transformed file. The preload library identifies the chunks corresponding to the specified segments, retrieves and reverses the transform on those chunks and passes the data to the application requesting it. For a system call to write data to certain segments, the data is modified and re-transformed by the library before being written back to disk. A preload library provides improved random access into transformed (e.g. compressed, encrypted, etc.) files.
    • 预加载库将某些文件分割成段,并逐段转换文件的数据,每个文件分别独立于另一个。 变换的段然后被存储为变换文件的一部分,每个段对应于包含块(变换数据)的行李,以及允许块在写入操作期间数据被修改时允许块增长的间隙。 行李后面是一个块图,其中包含定义每个段的压缩版本的元数据。 预加载库拦截从应用程序到OC的系统调用,指定访问转换文件的特定段。 预加载库标识对应于指定段的块,检索并反转这些块上的变换,并将数据传递给请求它的应用程序。 对于将数据写入某些段的系统调用,数据在被写回磁盘之前被库修改和重新转换。 预加载库提供改进的随机访问到变换(例如压缩,加密等)文件。
    • 12. 发明申请
    • Compressing massive relational data
    • 压缩大量关系数据
    • US20110153623A1
    • 2011-06-23
    • US12655014
    • 2009-12-22
    • Kiem-Phong Vo
    • Kiem-Phong Vo
    • G06F17/30
    • G06F17/30595
    • A relational dependency transform is introduced as a way to exploit information redundancy in conditioning data in a relational database for better compressibility. An optimum relational dependency transform of the relational database is first computed. Fields of the relational database are then sorted topologically based on a weighted, directed graph having nodes representing predictor and predictee fields. For each predictee field in the topological order, a transformed field is then computed via the relationship between predictor and predictee in the optimum relational dependency transform.
    • 引入关系依赖变换作为在关系数据库中调节数据中的信息冗余的方法,以获得更好的可压缩性。 首先计算关系数据库的最优关系依赖变换。 关系数据库的领域然后基于具有表示预测变量和预定义字段的节点的加权有向图进行拓扑分类。 对于按照拓扑顺序排列的每个谓词字段,通过最优关系依赖变换中的预测因子和预测符之间的关系计算变换字段。
    • 14. 发明授权
    • Apparatus and methods for sharing idle workstations
    • 用于共享空闲工作站的装置和方法
    • US5978829A
    • 1999-11-02
    • US740908
    • 1996-11-05
    • Pi-Yu ChungGlenn Stephen FowlerYennun HuangKiem-Phong VoYi-Min Wang
    • Pi-Yu ChungGlenn Stephen FowlerYennun HuangKiem-Phong VoYi-Min Wang
    • G06F9/46G06F9/50G06F11/34G06F15/16G06F15/177G06F9/00
    • G06F9/5072G06F9/5088G06F11/3495
    • The present invention relates to systems for sharing idle workstation computers that are connected together through a network and shared file system. More particularly, a user of a local host workstation may submit jobs for execution on remote workstations. The systems of the present invention select a remote host that is idle in accordance with a decentralized scheduling scheme and then continuously monitor the activity of the remote host on which the job is executing. If the system detects certain activity on the remote host by one of the remote host's primary users, the execution of the job is immediately suspended to prevent inconvenience to the primary users. The system also suspends job execution if the remote host's load average gets too high. Either way, the suspended job is migrated by selecting another idle remote workstation to resume execution of the suspended job (from the point in time at which the last checkpoint occurred).
    • 本发明涉及用于共享通过网络和共享文件系统连接在一起的空闲工作站计算机的系统。 更具体地,本地主机工作站的用户可以提交作业以在远程工作站上执行。 本发明的系统根据分散调度方案选择空闲的远程主机,然后连续地监视作业正在执行的远程主机的活动。 如果系统由远程主机的主用户之一检测到远程主机上的某些活动,则该作业的执行将立即暂停,以避免对主要用户造成不便。 如果远程主机的负载平均值太高,系统也会挂起作业执行。 无论哪种方式,通过选择另一个空闲的远程工作站来恢复挂起的作业,以恢复执行挂起的作业(从最后一个检查点发生的时间起)。
    • 15. 发明授权
    • Technique for drawing directed graphs
    • 绘制有向图的技术
    • US4953106A
    • 1990-08-28
    • US355731
    • 1989-05-23
    • Emden R. GansnerStephen C. NorthKiem-Phong Vo
    • Emden R. GansnerStephen C. NorthKiem-Phong Vo
    • G06T11/20
    • G06T11/206
    • The present invention relates to a computer-implemented technique for drawing directed graphs providing reduced crossings and improved picture quality. An edge list description provided by a user is processed to produce a ranking of all nodes that minimizes the weighted sum of all edges, an edge cost being the product of its weight and length. Nodes within a ranking are then positioned to reduce edge crossings using a heuristic based on node positions in adjacent ranks. Such heuristic uses a generalized median as a weighting function plus node transposition to avoid senseless edge crossings before proceeding to a next rank. Nodes are then positioned to minimize the weighted sum of horizontal distances among connected nodes. Spline control points are then computed for interconnected nodes, and a code sequence for a drawing is generated.
    • 本发明涉及一种计算机实现的技术,用于绘制提供减少的交叉和改善的画面质量的有向图。 处理由用户提供的边缘列表描述以产生使所有边缘的加权和最小化的所有节点的等级,边缘成本是其权重和长度的乘积。 然后定位排名中的节点,以使用基于相邻队列中的节点位置的启发式来减少边缘交叉。 这种启发式使用广义中值作为加权函数加上节点转置,以避免在进入下一个等级之前无意义的边缘交叉。 然后定位节点以使连接的节点之间的水平距离的加权和最小化。 然后为互连节点计算样条控制点,并生成绘图的代码序列。
    • 18. 发明授权
    • Checkpoint and restoration systems for execution control
    • 检查点和恢复系统进行执行控制
    • US6044475A
    • 2000-03-28
    • US981297
    • 1998-03-03
    • Pi-Yu ChungYennun HuangChandra KintalaKiem-Phong VoYi-Min Wang
    • Pi-Yu ChungYennun HuangChandra KintalaKiem-Phong VoYi-Min Wang
    • G06F11/14
    • G06F11/1438
    • A checkpoint and restoration system is disclosed to provide checkpoint and restoration techniques for user application processes which save the process state, including the volatile state and desired portions of the persistent state, during normal execution, and thereafter restore the saved state. A lazy checkpoint technique is disclosed which delays the taking of the persistent state checkpoint until an inconsistency between the checkpointed volatile state and a portion of the persistent state is about to occur. The disclosed checkpoint and restoration system allows a user or a user application process to specify selected portions of the persistent state to be excluded from a checkpoint. A selected portion of the pre-restoring process state, such as a return value argument, may be protected before restoring the user application process to a checkpointed state, so that the pre-restoration values of the protected state are retained following restoration of the checkpoint. The retained return value allows one or more segments of restoration code to be executed following a restoration and a normal execution mode to be distinguished from a restoration mode.
    • PCT No.PCT / US95 / 07660 Sec。 371日期1998年3月3日 102(e)1998年3月3日PCT提交1995年6月16日PCT公布。 出版物WO97 / 00477 日期1997年1月3日公开了一种检查点和恢复系统,用于为正常执行期间保存处理状态(包括易失性状态和持久状态的期望部分)的用户应用进程提供检查点和恢复技术,然后恢复保存状态 。 公开了一种延迟的检查点技术,其延迟持续状态检查点的获取,直到检查点的易失性状态和持续状态的一部分之间的不一致将要发生。 所公开的检查点和恢复系统允许用户或用户应用进程指定要从检查点排除的持久状态的所选部分。 在将用户应用进程恢复到检查点状态之前,可以保护预恢复过程状态的所选部分(诸如返回值参数),使得在恢复检查点之后保留保护状态的恢复前值 。 保留的返回值允许在恢复之后执行恢复代码的一个或多个段,并且将正常执行模式与恢复模式区分开。
    • 19. 发明授权
    • Passwordless secure and efficient remote data update
    • 无密码安全高效的远程数据更新
    • US5956402A
    • 1999-09-21
    • US812641
    • 1997-03-07
    • Kiem-Phong Vo
    • Kiem-Phong Vo
    • H04L9/08H04L9/00
    • H04L9/0838H04L9/0891
    • Secure communication is effected when computers A and B that are interconnected by an insecure medium employ a dataset that is known to both and that is otherwise used within one or other of the computers for other than effecting secure communication as the shared secret from which an encryption key is derived. A dataset that needs to be securely communicated from computer A to computer B is encrypted with an encryption key derived from the shared secret. Computer B derives its own key and decrypts the received communication. In an enhanced version of this method, information is included in the transmission which assures computer B that no alterations occurred during transmission. When the dataset that needs to be securely communicated by computer A to computer B is an updated version of a dataset that already is present in computer B, a further enhancement suggests that computer A transmit only the difference between original dataset and the updated dataset. A benefit accrues when the dataset that is updated is also the dataset that is used as the shared secret, because the shared secret is changed with each update. In a still further modification, the shared secret is altered arbitrarily with each transmission in a manner that is unrelated to any specific function for which the shared secret dataset may be employed.
    • 当由不安全介质互连的计算机A和B使用已知的数据集并且另外在一个或另一个计算机内使用的数据集作为安全通信以外的安全通信时,实现安全通信,作为加密 关键是派生。 需要从计算机A到计算机B安全地传递的数据集使用从共享密钥导出的加密密钥进行加密。 计算机B派生自己的密钥并对接收到的通信进行解密。 在该方法的增强版本中,信息被包括在传输中,其确保计算机B在传输期间不发生改变。 当需要由计算机A安全地传送到计算机B的数据集是已经存在于计算机B中的数据集的更新版本时,进一步的增强表明计算机A仅传送原始数据集与更新的数据集之间的差异。 当更新的数据集也是用作共享密钥的数据集时,由于每次更新都会更改共享密钥,所以会产生一个好处。 在进一步的修改中,共享秘密以与可以使用共享秘密数据集的任何特定功能无关的方式随每个传输任意改变。