会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 32. 发明授权
    • Traversal path-based approach to understanding user-oriented hypertext
object usage
    • 基于路径路径的方法来理解面向用户的超文本对象使用
    • US5931912A
    • 1999-08-03
    • US708004
    • 1996-08-09
    • Kun-Lung WuPhilip Shi-Lung Yu
    • Kun-Lung WuPhilip Shi-Lung Yu
    • G06F17/30G06F17/00
    • G06F17/30902
    • A method and system to map client access patterns in a stateless hypertext server. For each hypertext object access, a plurality of information about the access may be collected, including the requestor address, the hyperlink source, and the hyperlink target. When available, a time stamp of the access and agent information may also be used. The hyperlink source and hyperlink target form a hyperlink access pair, representing a step in the user traversal path on the hypertext objects. These hyperlink access pairs are then mapped into hyperlink access groups. Each hyperlink group represents all the hypertext objects visited by a user along a traversal path. To map hyperlink access pairs into access groups, each access pair is added to an active session if the new access pair can expand the session into a connected traversal path. Once hyperlink groups are identified, user-oriented object usage statistics can be analyzed. When client and/or proxy caching occurs, hypertext objects are fetched locally instead of from the hypertext server. Thus, no requests are made to the server for the cached objects. As a result, it may be required to add valid backward traversal steps to an active session in order to form a valid connected traversal path. One could find any backward traversal path for the needed backward steps. To preserve memory space, a method is also disclosed which finds the shortest valid backward traversal path. Once the client access patterns have been mapped, a user-oriented statistical analysis can be performed.
    • 在无状态超文本服务器中映射客户端访问模式的方法和系统。 对于每个超文本对象访问,可以收集关于访问的多个信息,包括请求者地址,超链接源和超链接目标。 如果可用,也可以使用访问和代理信息的时间戳。 超链接源和超链接目标形成超链接访问对,表示超文本对象上的用户遍历路径中的步骤。 然后将这些超链接访问对映射到超链接访问组。 每个超链接组表示用户沿着遍历路径访问的所有超文本对象。 要将超链接访问对映射到访问组中,如果新的访问对可以将会话扩展到连接的遍历路径,则每个访问对都将添加到活动会话。 一旦识别出超链接组,就可以分析面向用户的对象使用统计信息。 当发生客户端和/或代理缓存时,超文本对象在本地取而不是超文本服务器。 因此,对于缓存的对象,不会向服务器发出任何请求。 因此,可能需要向活动会话添加有效的后向遍历步骤,以形成有效的连接的遍历路径。 人们可以找到所需的后退步骤的任何反向遍历路径。 为了保留存储器空间,还公开了一种找到最短有效后向遍历路径的方法。 一旦客户端访问模式被映射,就可以执行面向用户的统计分析。
    • 33. 发明授权
    • Apparatus and method for adaptive logical partitioning of workfile disks
for multiple concurrent mergesorts
    • 用于多个并发合并的工作文件磁盘的自适应逻辑分区的装置和方法
    • US5671405A
    • 1997-09-23
    • US504160
    • 1995-07-19
    • Kun-Lung WuPhilip Shi-Lung Yu
    • Kun-Lung WuPhilip Shi-Lung Yu
    • G06F7/36G06F7/06
    • G06F7/36Y10S707/99931Y10S707/99934Y10S707/99937
    • System and method for improving response time of concurrent mergesort operations in an information handling system, which includes one or more logical processors each operating under control of an image of an operating system program, a database storage system for storing data in a predetermined data structure, one or more workfile storage devices for storing workfiles during mergesort operations, means for sorting the data structure into one or more ordered runs, means for determining a logical partition size for the workfile storage devices, means for selecting a least loaded partition, means for writing the ordered runs in the selected partition in the workfile storage devices, and means for merging the ordered runs into a single sorted run.
    • 一种用于改善信息处理系统中并发并发操作的响应时间的系统和方法,该信息处理系统包括一个或多个在操作系统程序的映像控制下运行的逻辑处理器,用于以预定数据结构存储数据的数据库存储系统, 一个或多个工作文件存储装置,用于在合并对象操作期间存储工作文件,用于将数据结构分类为一个或多个有序运行的装置,用于确定工作文件存储装置的逻辑分区大小的装置,用于选择最少加载的分区的装置, 在工作文件存储设备中的所选分区中的有序运行,以及用于将有序运行合并到单个排序运行的装置。
    • 35. 发明授权
    • System and method for indexing weighted-sequences in large databases
    • 用于索引大数据库中加权序列的系统和方法
    • US09009176B2
    • 2015-04-14
    • US12198717
    • 2008-08-26
    • Wei FanChang-Shing PerngHaixun WangPhilip Shi-Lung Yu
    • Wei FanChang-Shing PerngHaixun WangPhilip Shi-Lung Yu
    • G06F7/00G06F17/30
    • G06F17/30327G06F17/30548Y10S707/99943
    • The present invention provides an index structure for managing weighted-sequences in large databases. A weighted-sequence is defined as a two-dimensional structure in which each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence because each event is associated with a timestamp. Querying a large sequence database by events' occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed herein enables the efficient retrieval from the database of all subsequences (contiguous and non-contiguous) that match a given query sequence both by events and by weights. The index structure also takes into consideration the nonuniform frequency distribution of events in the sequence data.
    • 本发明提供了一种用于在大数据库中管理加权序列的索引结构。 加权序列被定义为二维结构,其中序列中的每个元素与权重相关联。 例如,一系列网络事件是加权序列,因为每个事件都与时间戳相关联。 通过事件发生模式查询大序列数据库是了解事件之间的时间因果关系的第一步。 这里提出的索引结构使得能够通过事件和权重从数据库有效地检索与给定查询序列匹配的所有子序列(连续的和不连续的)。 索引结构还考虑了序列数据中事件的不均匀频率分布。
    • 36. 发明授权
    • System and method for distributed privacy preserving data mining
    • 分布式隐私保护数据挖掘的系统和方法
    • US08650213B2
    • 2014-02-11
    • US11752708
    • 2007-05-23
    • Charu C. AggarwalPhilip Shi-Lung Yu
    • Charu C. AggarwalPhilip Shi-Lung Yu
    • G06F7/00
    • G06F17/30539G06F21/6245G06F2216/03Y10S707/99931Y10S707/99932
    • Distributed privacy preserving data mining techniques are provided. A first entity of a plurality of entities in a distributed computing environment exchanges summary information with a second entity of the plurality of entities via a privacy-preserving data sharing protocol such that the privacy of the summary information is preserved, the summary information associated with an entity relating to data stored at the entity. The first entity may then mine data based on at least the summary information obtained from the second entity via the privacy-preserving data sharing protocol. The first entity may obtain, from the second entity via the privacy-preserving data sharing protocol, information relating to the number of transactions in which a particular itemset occurs and/or information relating to the number of transactions in which a particular rule is satisfied.
    • 提供分布式隐私保护数据挖掘技术。 分布式计算环境中的多个实体的第一实体通过隐私保护数据共享协议与多个实体的第二实体交换摘要信息,使得保留摘要信息的隐私,与 与实体存储的数据相关的实体。 然后,第一实体可以至少基于通过隐私保护数据共享协议从第二实体获得的摘要信息来挖掘数据。 第一实体可以通过隐私保护数据共享协议从第二实体获得与特定项目集出现的交易数量有关的信息和/或与其中满足特定规则的交易数量有关的信息。
    • 37. 发明授权
    • Range query methods and apparatus
    • 范围查询方法和装置
    • US08543579B2
    • 2013-09-24
    • US11155221
    • 2005-06-17
    • Shyh-Kwei ChenKun-Lung WuPhilip Shi-Lung Yu
    • Shyh-Kwei ChenKun-Lung WuPhilip Shi-Lung Yu
    • G06F17/30G06F7/00
    • G06F17/30516G06F17/30241G06F17/30312G06F17/30463
    • Range query techniques are disclosed for use in accordance with data stream processing systems. In one aspect of the invention, a technique is provided for indexing continual range queries for use in data stream processing. For example, a technique for use in processing a data stream comprises obtaining at least one range query to be associated with the data stream, and building a range query index based on the at least one range query using one or more virtual constructs such that the query index is adaptive to one or more changes in a distribution of range query sizes. The step/operation of building the range query index may further comprise building the range query index such that the range query index accommodates one or more changes in query positions outside a monitoring area of the at least one range query. In another aspect of the invention, a technique is provided for incrementally processing continual range queries against moving objects. For example, a technique for evaluating one and more continual range queries over one and more moving objects comprises maintaining a query index with one and more containment-encoded virtual constructs associated with the one and more continual range queries over the one and more moving objects, and incrementally evaluating the one or more continual range queries using the query index.
    • 公开了根据数据流处理系统使用的范围查询技术。 在本发明的一个方面,提供了一种用于索引用于数据流处理的连续范围查询的技术。 例如,用于处理数据流的技术包括获得要与数据流相关联的至少一个范围查询,以及使用一个或多个虚拟构造基于至少一个范围查询构建范围查询索引,使得 查询索引适应范围查询大小分布中的一个或多个变化。 构建范围查询索引的步骤/操作还可以包括构建范围查询索引,使得范围查询索引适应在至少一个范围查询的监视区域之外的查询位置中的一个或多个改变。 在本发明的另一方面,提供了一种用于逐渐处理对移动对象的连续范围查询的技术。 例如,用于通过一个或多个移动对象来评估一个或多个连续范围查询的技术包括:通过在一个或多个运动对象上与一个和多个连续范围查询相关联的一个和多个包含编码的虚拟构造来维护查询索引, 并使用查询索引来递增地评估一个或多个连续范围查询。
    • 39. 发明授权
    • Focused community discovery in network
    • 在网络中聚焦社区发现
    • US07844634B2
    • 2010-11-30
    • US11283383
    • 2005-11-18
    • Kirsten Weale HildrumPhilip Shi-Lung Yu
    • Kirsten Weale HildrumPhilip Shi-Lung Yu
    • G06F7/00G06F17/30
    • G06F17/30864G06Q10/10
    • Techniques for community discovery in a network are disclosed. For example, a technique for discovering a community around a given entity in an interaction graph, wherein nodes in the graph represent entities and edges connecting nodes in the graph represent interactions between connected nodes, comprises the following steps/operations. Nodes in the interaction graph are partitioned into different sets of nodes based on interaction information associated with each node to minimize a number of interaction pairs that need to be considered. An objective function is minimized by moving entities between the different sets such that the community is discovered once a measure associated with the objective function is minimized.
    • 公布了网络中社区发现的技术。 例如,用于在交互图中发现给定实体周围的社区的技术,其中图中的节点表示连接图中的节点的实体和边表示连接的节点之间的交互,包括以下步骤/操作。 基于与每个节点相关联的交互信息将交互图中的节点划分成不同的节点集合,以最小化需要考虑的多个交互对。 通过在不同组之间移动实体来最小化目标函数,使得一旦与目标函数相关联的度量被最小化,则发现社区。