公开(公告)号：US5768515A

公开(公告)日：1998-06-16

申请号：US677636

申请日：1996-07-08

Applicant: Philippe Choquier ,  Murali R. Krishnan

Inventor： Philippe Choquier ,  Murali R. Krishnan

IPC: H04L29/06 ,  G06F7/00

CPC classification number: H04L29/06 ,  H04L69/22 ,  Y10S707/99933

Abstract: A system for generating message headers where previously saved message headers are retrieved from memory when needed to satisfy a message header requirement. Message headers are comprised of segments where each message header segment has a different lifetime. In particular, a file-object response message header includes a header segment containing information linked to the requested file-object. This file-object linked header segment is retrieved when needed from a file-object header cache. A file-object response message header includes other segments such as one containing time-variant global information and time-invariant global information. Building header messages from multiple segments retrieved from their respective cache memories saves significant processing time as compared to generating a new message header each time a header is required by operation of a network server application.

Abstract translation: 一种用于生成消息标题的系统，其中当需要满足消息标题要求时，从存储器检索先前保存的消息头。 消息标头由每个消息标题段具有不同生命周期的段组成。 特别地，文件对象响应消息报头包括包含链接到所请求的文件对象的信息的报头段。 从文件对象头缓存需要时检索该文件对象链接头段。 文件对象响应消息报头包括其他段，诸如包含时变全局信息和时不变全局信息的段。 与每个通过网络服务器应用的操作需要报头时相比，生成来自它们各自的高速缓存存储器的多个段的报头消息节省了大量的处理时间。

公开(公告)号：US08214765B2

公开(公告)日：2012-07-03

申请号：US12142889

申请日：2008-06-20

Applicant: Morten Holm-Petersen ,  George G. Robertson ,  Christian Olaf Abeln ,  Thomas Michael Casey ,  Stella Yick Chan ,  Benjamin L. Chronister ,  Ian Michael Dunmore ,  Roland Fernandez ,  Danyel Fisher ,  David Francis Gainer ,  Alexandre Gorev ,  Ahmed Kamal ,  Matthew Jay Kotler ,  Murali R. Krishnan ,  Bongshin Lee ,  Greg Schechter ,  Curtis G. Wong

Inventor： Morten Holm-Petersen ,  George G. Robertson ,  Christian Olaf Abeln ,  Thomas Michael Casey ,  Stella Yick Chan ,  Benjamin L. Chronister ,  Ian Michael Dunmore ,  Roland Fernandez ,  Danyel Fisher ,  David Francis Gainer ,  Alexandre Gorev ,  Ahmed Kamal ,  Matthew Jay Kotler ,  Murali R. Krishnan ,  Bongshin Lee ,  Greg Schechter ,  Curtis G. Wong

IPC: G06F3/048

CPC classification number: G06F17/30554

Abstract: The claimed subject matter relates to an architecture that can construct a map for summarizing analyses with respect to data included in a database. In addition, the architecture can display the map in a special canvas area. Generally, the map is a hub-and-spoke-style map in which a hub is associated with an entity (e.g., a related set of records) included in a database. Likewise, the spokes are typically representative of operations (e.g., filter, join, transform) that act upon the hub/entity from which it extends. The map can aid with open-ended analysis on complex databases by recording and ordering competing hypotheses and can also further collaborative efforts with respect to analysis.

Abstract translation: 所要求保护的主题涉及可以构建用于总结关于数据库中包括的数据的分析的映射的架构。 此外，架构可以在特殊的画布区域中显示地图。 通常，地图是中心辐射式地图，其中集线器与包括在数据库中的实体（例如，相关记录集）相关联。 类似地，轮辐通常代表作用于其延伸的集线器/实体的操作（例如，过滤器，连接，变换）。 该地图可以通过记录和排序竞争假设来帮助对复杂数据库进行开放式分析，并且还可以进一步分析分析工作。

公开(公告)号：US20120143669A1

公开(公告)日：2012-06-07

申请号：US12958841

申请日：2010-12-02

Applicant: Anoop Anantha ,  Murali R. Krishnan ,  Miller Thomas Abel

Inventor： Anoop Anantha ,  Murali R. Krishnan ,  Miller Thomas Abel

IPC: G06Q30/00

CPC classification number: G06Q30/0226

Abstract: Loyalty offer modeling techniques are described. In one or more implementations, interaction with a loyalty service via a network is performed to model one or more loyalty offers for a use in conjunction with a merchant. Information is transmitted via the network for receipt by the loyalty service, at least a portion of the information describing consumer interaction with the merchant that pertains to the loyalty offer that is sufficient for use by the loyalty service to manage participation of the consumers with the one or more loyalty offers of the merchant.

Abstract translation: 描述忠诚度提供建模技术。 在一个或多个实现中，执行经由网络与忠诚度服务的交互，以对与商家结合使用的一个或多个忠诚度提供建模。 通过网络传送信息以供忠诚服务接收，描述消费者与商家的交互的信息的至少一部分与顾客忠诚度提供相关，该忠诚度提供足以由忠诚服务使用以管理消费者与一方的参与 或更多的忠诚度报价。

公开(公告)号：US20120084138A1

公开(公告)日：2012-04-05

申请号：US12898131

申请日：2010-10-05

Applicant: Anoop Anantha ,  Murali R. Krishnan

Inventor： Anoop Anantha ,  Murali R. Krishnan

IPC: G06Q30/00 ,  H04N7/025

CPC classification number: G06Q30/0241 ,  G06Q30/0242 ,  G06Q30/0273 ,  G06Q30/0277

Abstract: Advertisement management techniques are described. In one or more implementations, a plurality of identifiers are collected of advertisements communicated to respective ones of a plurality of mobile communication devices, each identifier exposed by a respective mobile communication device at a physical location of a merchant. A monetary amount is calculated to be provided to a service that was involved in providing the one or more advertisements to the mobile communication device.

Abstract translation: 广告管理技术被描述。 在一个或多个实现中，收集多个标识符，其广告传送到多个移动通信设备中的相应的一个，每个标识符由相应的移动通信设备在商家的物理位置处公开。 计算货币量被提供给涉及将一个或多个广告提供给移动通信设备的服务。

公开(公告)号：US20090327921A1

公开(公告)日：2009-12-31

申请号：US12163608

申请日：2008-06-27

Applicant: Morten Holm-Peterson ,  George G. Robertson ,  William G. Morein ,  Jason J. Weber ,  Danyel Aharon Fisher ,  Gur Kimchi ,  Benjamin Edward Rampson ,  Ahmed K. Kamal ,  Kipper Jewsbury ,  Benjamin L. Chronister ,  Roland L. Fernandez ,  Christian Olaf Abeln ,  B. Scott Ruble ,  Stella Yick Chan ,  Murali R. Krishnan ,  Brian L. Welcker ,  Bongshin Lee

Inventor： Morten Holm-Peterson ,  George G. Robertson ,  William G. Morein ,  Jason J. Weber ,  Danyel Aharon Fisher ,  Gur Kimchi ,  Benjamin Edward Rampson ,  Ahmed K. Kamal ,  Kipper Jewsbury ,  Benjamin L. Chronister ,  Roland L. Fernandez ,  Christian Olaf Abeln ,  B. Scott Ruble ,  Stella Yick Chan ,  Murali R. Krishnan ,  Brian L. Welcker ,  Bongshin Lee

IPC: G06F3/00

CPC classification number: G06F16/219

Abstract: Modifications to a collection of data are maintained in chronological order and selectively rendered as a function of time. The selective rendering can include an animated version of the modification, which can include a timeline of events. The modifications can be associated with related data that includes information as to who made the modification, when the modification was made, and so forth. The related data can also include a motivation behind the modification. Further, confidence information can be related to the modification to add further detail to the modifications and events surrounding the collection of data.

Abstract translation: 对数据集合的修改以时间顺序保持，并根据时间有选择地呈现。 选择性渲染可以包括修改的动画版本，其可以包括事件的时间线。 这些修改可以与相关数据相关联，该相关数据包括关于谁进行修改的信息，当进行修改时等等。 相关数据还可以包括修改背后的动机。 此外，置信度信息可以与修改相关联，以增加围绕数据收集的修改和事件的进一步细节。

公开(公告)号：US20090326921A1

公开(公告)日：2009-12-31

申请号：US12147890

申请日：2008-06-27

Applicant: George G. Robertson ,  Brian Scott Ruble ,  William G. Morein ,  Sean Michael Boon ,  Nathan Paul McCoy ,  Jakob Peter Nielsen ,  Michael Ehrenberg ,  Joshua Wyndham Lee ,  Jason Joseph Weber ,  Murali R. Krishnan ,  Stella Yick Chan

Inventor： George G. Robertson ,  Brian Scott Ruble ,  William G. Morein ,  Sean Michael Boon ,  Nathan Paul McCoy ,  Jakob Peter Nielsen ,  Michael Ehrenberg ,  Joshua Wyndham Lee ,  Jason Joseph Weber ,  Murali R. Krishnan ,  Stella Yick Chan

IPC: G10L15/18

CPC classification number: G06F11/3604 ,  G06F8/34 ,  G10L15/19

Abstract: A visualization development system is provided. The system includes a visualization tool to develop one or more visualizations and a grammar engine that operates with the visualization tool to automatically detect visualization problems during the development of the visualizations.

Abstract translation: 提供可视化开发系统。 该系统包括用于开发一个或多个可视化的可视化工具，以及使用可视化工具操作的语法引擎，以在可视化开发过程中自动检测可视化问题。

公开(公告)号：US20090259618A1

公开(公告)日：2009-10-15

申请号：US12103699

申请日：2008-04-15

Applicant: Hui Shi ,  Kenton Gidewall ,  Marcelo M. De Barros ,  Chan Chaiyochlarb ,  Murali R. Krishnan ,  Robert Irwin Voightmann ,  Christina Ruth Dhanaraj

Inventor： Hui Shi ,  Kenton Gidewall ,  Marcelo M. De Barros ,  Chan Chaiyochlarb ,  Murali R. Krishnan ,  Robert Irwin Voightmann ,  Christina Ruth Dhanaraj

IPC: G06F17/30

CPC classification number: G06F17/30339 ,  G06F17/3051

Abstract: A method and a processing device may be provided for creating a shadow database, having a size being approximately a desired percentage of a size of a relational database. Referential integrity of tables of the relational database may be preserved in the created shadow database. A representation of a connected graph may be created, based on a schema description of the relational database, and may be used to find driving tables and related tables of the relational database. Portions of driving tables of the relational database may be copied to corresponding tables of the shadow database and rows of tables of the relational database, related to the copied portions of the driving tables, may be copied to corresponding tables of the shadow database in a number of iterations until the size of the shadow database is approximately the desired percentage of the size of the relational database.

Abstract translation: 可以提供用于创建影子数据库的方法和处理装置，其具有大约是关系数据库的大小的所需百分比的大小。 可以在创建的影子数据库中保留关系数据库的表的引用完整性。 可以基于关系数据库的模式描述来创建连接图的表示，并且可以用于查找关系数据库的驱动表和相关表。 关系数据库的驱动表的一部分可以被复制到影子数据库的相应表中，并且可以将关系数据库的与驱动表的复制部分相关的表的行数拷贝到影子数据库的对应表中 的迭代，直到影子数据库的大小大约是关系数据库大小的所需百分比。

公开(公告)号：US07417992B2

公开(公告)日：2008-08-26

申请号：US11007539

申请日：2004-12-07

Applicant: Murali R. Krishnan

Inventor： Murali R. Krishnan

IPC: H04J12/28

CPC classification number: H04L69/163 ,  H04J3/1682 ,  H04L47/10 ,  H04L47/11 ,  H04L47/15 ,  H04L47/19 ,  H04L47/2425 ,  H04L47/26 ,  H04L47/29 ,  H04L47/32 ,  H04L47/70 ,  H04L47/745 ,  H04L47/822 ,  H04L47/825 ,  H04L67/322 ,  H04L67/42 ,  H04L69/16

Abstract: The adaptive bandwidth throttling system implements a graceful diminution of services to the clients by delaying a first class of services provided by a network server in response to the effective bandwidth utilized by this network server exceeding a first threshold. If the demand for the bandwidth by this network server exceeds a second threshold, the bandwidth throttling system escalates the throttling response and blocks the first class of services from execution and can also concurrently delay execution of a second class of services. The implementation of the throttling process can be varied, to include additional levels of response or finer gradations of the response, to include subsets of a class of services. In addition, the threshold levels of bandwidth used to trigger the throttling response can be selected as desired by the system administrator.

公开(公告)号：US07175072B2

公开(公告)日：2007-02-13

申请号：US11090322

申请日：2005-03-25

Applicant: Murali R. Krishnan ,  Neelamadhaba Mahapatro ,  Wei-Qiang Guo

Inventor： Murali R. Krishnan ,  Neelamadhaba Mahapatro ,  Wei-Qiang Guo

IPC: G06F17/00 ,  G06Q30/00

CPC classification number: G06Q20/023 ,  G06Q20/02 ,  G06Q20/04 ,  G06Q20/06 ,  G06Q20/40 ,  G06Q20/403 ,  G06Q30/0214 ,  G06Q30/0225 ,  G06Q30/0226 ,  G06Q30/0235 ,  G06Q30/0241

Abstract: A transaction handling system and associated method are described for handling transactions based on a plurality of rule sets that apply to point sets (where the point sets contain points that can be consumed for goods and services, or have some other end-use connotation). Namely, the rule sets can be associated with respective point lots to define the characteristics and behavior of the respective point lots. For example, one rule in an applied rule set can determine whether a consumer is permitted to make a purchase without having sufficient points in the consumer's point lot, thus incurring a negative balance in the point lot. Another rule (e.g., a sandbox rule) can determine whether the consumer is permitted to use points only within a limited identified environment, or whether the consumer can use the points in any environment. An override rule set can override a default rule set on an individual account basis or on an individual consumer basis. Upon a transaction that affects a point lot, the transaction handling system can log the transaction in a record that is associated with the point lot.

Abstract translation: 描述了一种交易处理系统和相关方法，用于基于适用于点集的多个规则集来处理事务（其中点集包含可以为商品和服务消费的点，或具有一些其他最终用途内涵）。 也就是说，规则集可以与相应的点批次相关联，以定义相应点批的特征和行为。 例如，应用规则集中的一个规则可以确定消费者是否被允许进行购买，而在消费者点数中没有足够的点，从而在点批中产生负余额。 另一规则（例如，沙盒规则）可以确定消费者是否仅允许在有限的标识环境内使用点，或消费者是否可以在任何环境中使用点。 覆盖规则集可以根据个人帐户或个人消费者覆盖默认规则集。 在影响点批次的事务之后，事务处理系统可以将事务记录在与点批次相关联的记录中。

公开(公告)号：US06578131B1

公开(公告)日：2003-06-10

申请号：US09300715

申请日：1999-04-27

Applicant: Per-Ake Larson ,  Murali R. Krishnan ,  George V. Reilly

Inventor： Per-Ake Larson ,  Murali R. Krishnan ,  George V. Reilly

IPC: G06F1206

CPC classification number: G06F9/526 ,  G06F17/30949

Abstract: A scaleable hash table for shared memory multi-processor (SMP) that supports very high rates of concurrent operations (e.g., insert, delete, and lookup), while simultaneously reducing cache misses. The SMP system has a memory subsystem and a processor subsystem interconnected via a bus structure. The hash table is stored in the memory subsystem to facilitate access to data items. The hash table is segmented into multiple buckets, with each bucket containing a reference to a linked list of bucket nodes that hold references to data items with keys that hash to a common value. Individual bucket nodes contain multiple signature-pointer pairs that reference corresponding data items. Each signature-pointer pair has a hash signature computed from a key of the data item and a pointer to the data item. The first bucket node in the linked list for each of the buckets is stored in the hash table. To enable multithread access, while serializing operation of the table, the SMP system utilizes two levels of locks: a table lock and multiple bucket locks. The table lock allows access by a single processing thread to the table while blocking access for other processing threads. The table lock is held just long enough for the thread to acquire the bucket lock of a particular bucket node. Once the table lock is released, another thread can access the hash table and any one of the other buckets.

Abstract translation: 用于共享存储器多处理器（SMP）的可扩展哈希表，其支持非常高的并发操作速率（例如，插入，删除和查找），同时减少高速缓存未命中。 SMP系统具有通过总线结构互连的存储器子系统和处理器子系统。 哈希表存储在存储器子系统中以便于访问数据项。 散列表被分段成多个桶，每个桶包含对桶节点的链接列表的引用，其存储对具有哈希到公共值的密钥的数据项的引用。 单个桶节点包含引用相应数据项的多个签名 - 指针对。 每个签名 - 指针对具有从数据项的键和指向数据项的指针计算的散列签名。 每个桶的链表中的第一个桶节点存储在哈希表中。 要启用多线程访问，在序列化表的操作期间，SMP系统使用两个级别的锁：表锁和多个桶锁。 表锁允许单个处理线程访问表，同时阻止其他处理线程的访问。 表锁只能持续足够长的时间才能使线程获取特定桶节点的桶锁。 一旦表锁被释放，另一个线程就可以访问哈希表和其他任何一个存储桶。