公开(公告)号：US20020120863A1

公开(公告)日：2002-08-29

申请号：US10080478

申请日：2002-02-22

Applicant: Hewlett-Packard Company

Inventor： Siani Lynne Pearson ,  Graeme John Proudler

IPC: G06F011/30

CPC classification number: G06Q20/00 ,  G06F2221/2101 ,  G06Q20/341 ,  G06Q20/383 ,  G06Q20/389 ,  G06Q20/403 ,  G06Q20/4093 ,  G07F7/1008

Abstract: A method of investigating misdemeanour within a data processing system is provided. An investigator is given an anonymous authenticated identity on a trusted computing device such that a trustworthy record of transactions can be created. The investigator can participate in the transaction.

Abstract translation: 提供了一种在数据处理系统内调查轻罪的方法。 调查员在受信任的计算设备上获得匿名身份验证身份，从而可以创建可靠的交易记录。 调查员可以参与交易。

公开(公告)号：US20020119427A1

公开(公告)日：2002-08-29

申请号：US10080477

申请日：2002-02-22

Applicant: Hewlett-Packard Company

Inventor： Richard Brown ,  Siani Lynne Pearson ,  Christopher I. Dalton

IPC: G09B009/00

CPC classification number: H04L63/105 ,  G06F21/552 ,  G06F21/57 ,  G06F21/6218 ,  G06F2221/2103 ,  G06F2221/2153 ,  H04L63/126

Abstract: A trusted computing environment 100, wherein each computing device 112 to 118 holds a policy specifying the degree to which it can trust the other devices in the environment 100. The policies are updated by an assessor 110 which receives reports from trusted components 120 in the computing devices 112 to 118 which identify the trustworthiness of the computing devices 112 to 118.

Abstract translation: 可信计算环境100，其中每个计算设备112至118保存指定其可以信任环境100中的其他设备的程度的策略。策略由评估者110更新，评估者110在计算机中从可信组件120接收报告 识别计算设备112至118的可信赖性的设备112至118。

公开(公告)号：US20020097729A1

公开(公告)日：2002-07-25

申请号：US10032882

申请日：2001-10-29

Applicant: Hewlett-Packard Company

Inventor： Sebastien Bouat

IPC: G06F015/16 ,  H04L012/28 ,  H04L012/56 ,  H04M007/00

CPC classification number: H04L65/1009 ,  H04L29/06 ,  H04L29/06027 ,  H04L65/403 ,  H04M7/006 ,  H04M7/126

Abstract: The invention concerns a method for processing messages incoming on a gatekeeper system of an Internet Protocol network, characterized in that the method includes a plurality of sub-processes each able to process a series of such messages and the method includes the step of dispatching the messages incoming on the gatekeeper system onto those different sub-processes, the dispatching step including identifying whether a message belongs to a same call as a previous message, and, in that case, sending this message to the same sub-process as said previous message.

Abstract translation: 本发明涉及一种用于处理在因特网协议网络的守门人系统上传入的消息的方法，其特征在于，该方法包括多个子过程，每个子过程能够处理一系列这样的消息，并且该方法包括发送消息的步骤 在关守系统上进入到这些不同的子进程，调度步骤包括识别消息是否属于与先前消息相同的呼叫，并且在这种情况下，将该消息发送到与所述先前消息相同的子进程。

公开(公告)号：US20020082836A1

公开(公告)日：2002-06-27

申请号：US10020325

申请日：2001-12-11

Applicant: HEWLETT-PACKARD COMPANY

Inventor： Robert Francis Squibbs

IPC: G10L021/00 ,  G10L011/00

CPC classification number: G06F3/011 ,  G10L15/26 ,  G10L2015/223 ,  G10L2015/228

Abstract: An announcement method and system is provided for a collection of devices located in proximity to each other. Upon a user generating an announcement prompt, such as a hand clap, the devices knowing their relative locations, and knowing or determining the position of the user, take respective turns to make sound announcements about themselves in an order that proceeds clockwise or anticlockwise with respect to the user. Preferably, the first-to-announce device is selected such that the angle subtended at the user between the first and last-to-announce devices is minimised. In this manner, the user can more easily locate each device as it announces. The output method can be applied to any form of human-discernible output.

Abstract translation: 提供了一种用于收集彼此靠近的装置的通知方法和系统。 在用户产生公告提示（例如手拍）时，知道其相对位置的设备以及知道或确定用户的位置，以相对于匝数的顺序或逆时针顺序进行关于自己的声音公告 给用户 优选地，选择第一通告设备，使得在第一和最后通告设备之间的用户对角的角度被最小化。 以这种方式，用户可以更容易地定位每个设备，因为它宣布。 输出方法可以应用于任何形式的人类可辨别输出。

公开(公告)号：US20020056077A1

公开(公告)日：2002-05-09

申请号：US09986882

申请日：2001-11-13

Applicant: Hewlett-Packard Company

Inventor： Robert C. Kunz ,  Peter J. Dahl

IPC: G06F009/44

CPC classification number: G06F8/441

Abstract: The present invention is a method and apparatus for compiler optimization that determines the maximum number of live computer registers, or pressure point. The present invention improves the productivity of a software developer by reducing compilation time of a computer program. More particularly, the overhead required during compilation to search information to determine the maximum number of live registers is reduced. The present invention records the relevant events related to the execution of a computer program, as opposed to a comprehensive history of the read instructions and write instructions. Also, the present invention maintains information about the maximum number of live registers for any partition related to the execution of a computer program. The present invention may bound the required system resources required to determine the maximum number of live registers to the number of registers associated with the number of partitions.

Abstract translation: 本发明是一种用于编译器优化的方法和装置，其确定最大数量的实时计算机寄存器或压力点。 本发明通过减少计算机程序的编译时间来提高软件开发人员的生产率。 更具体地，降低了编译期间所需的开销以搜索信息以确定最大数量的实时寄存器。 本发明记录与执行计算机程序相关的相关事件，而不是读取指令和写入指令的综合历史。 此外，本发明保持关于与计算机程序的执行有关的任何分区的最大数量的实时寄存器的信息。 本发明可以将确定最大数量的实时寄存器所需的系统资源限制为与分区数量相关联的寄存器数量。

公开(公告)号：US20020045455A1

公开(公告)日：2002-04-18

申请号：US09905774

申请日：2001-07-13

Applicant: Hewlett-Packard Company

Inventor： Michael P. Spratt

IPC: H04Q007/20

CPC classification number: H04W4/02 ,  G01S1/045 ,  G01S5/0009 ,  G01S5/0289 ,  H04L12/12 ,  H04W48/08 ,  H04W64/00 ,  H04W64/006 ,  H04W84/10 ,  H04W84/18

Abstract: A location discovery method uses location data items that originate at known locations (X,Y) and are passed to, and diffused between, entities (A,B) by short-range communication. Each location data item received by an entity (A,B) indicates a maximum distance of the entity from one of the known locations (X,Y). Each entity (A,B) prior to using a location data item for location determination or transferring it to another entity, is operative to increase the maximum distance indicated by the location data item to take account of movement of the mobile entity since receiving that item. A mobile entity (A) effects location determination by finding locations (40) simultaneously consistent with the maximum distances (31,36) it knows of and any applicable route constraints for how the location data items passed to the mobile entity. An example constraint is that vehicle mobile entities should follow roads (1,2,3). The maximum distance indicated by a location data item may also be increased to take account of transmission hops between entities and, indeed, in the case of static entities, it is these increases that build the maximum distance value.

Abstract translation: 位置发现方法使用始发于已知位置（X，Y）的位置数据项，并通过短距离通信传递给实体（A，B）并在其间扩散。 由实体（A，B）接收的每个位置数据项指示实体与已知位置之一（X，Y）的最大距离。 在使用用于位置确定的位置数据项目或将其转移到另一个实体之前的每个实体（A，B）可操作以增加由位置数据项目指示的最大距离以考虑移动实体从接收到该项目以来的移动 。 移动实体（A）通过查找与其知道的最大距离（31,36）同时一致的位置（40）和对位置数据项如何传递到移动实体的任何适用路线约束来影响位置确定。 一个示例性的约束是车辆移动实体应该遵循道路（1,2,3）。 也可以增加位置数据项所指示的最大距离，以考虑实体之间的传输跳数，实际上在静态实体的情况下，建立最大距离值是增加的。

公开(公告)号：US20020011970A1

公开(公告)日：2002-01-31

申请号：US09883725

申请日：2001-06-18

Applicant: Hewlett-Packard Company

Inventor： Bruno Richard

IPC: G09G003/00

CPC classification number: G06F9/451

Abstract: A process for displaying a composite object in a markup language page, which comprises at least two cells with a first cell containing an image and a second cell containing a textual information. The at least two cells are arranged in a table for the purpose of building a composite image wherein said textual information can be separately modified. Each cell is associated with different files in order to produce a composite image having different states in accordance with the position of the cursor relative to said object. A first statenullthe normal statenullcorresponds to a first file. A second state corresponds to a second file for a state where the cursor is moving over the object. At last a third file is used for a third state which corresponds to the selection of the object by the cursor.

Abstract translation: 一种用于在标记语言页面中显示复合对象的过程，其包括具有包含图像的第一单元和包含文本信息的第二单元的至少两个单元。 为了构建合成图像的目的，至少两个单元被布置在表中，其中所述文本信息可以被单独修改。 每个单元与不同的文件相关联，以便根据光标相对于所述对象的位置产生具有不同状态的合成图像。 第一个状态 - 正常状态 - 对应于第一个文件。 第二状态对应于光标在对象上移动的状态的第二文件。 最后，第三个文件用于与光标对象的选择相对应的第三状态。

公开(公告)号：US20020010879A1

公开(公告)日：2002-01-24

申请号：US09153389

申请日：1998-09-15

Applicant: Hewlett-Packard Company

Inventor： DING-KAI CHEN

IPC: G06F011/26

CPC classification number: G06F11/3676

Abstract: Apparatus and method are described for fast code coverage analysis. The present invention for fast code coverage analysis utilizes a technique that provides for capturing an event every first time that a block of code is visited. This allows for generating an event only once during numerous executions of a code block. The generation of only one event provides for an execution time close to the speed of the original source code.

Abstract translation: 描述了用于快速代码覆盖分析的装置和方法。 用于快速代码覆盖分析的本发明使用提供每第一次捕获代码块访问的事件的技术。 这允许在代码块的大量执行期间仅生成一次事件。 仅生成一个事件提供了接近原始源代码速度的执行时间。

公开(公告)号：US20020010623A1

公开(公告)日：2002-01-24

申请号：US09203247

申请日：1998-12-01

Applicant: Hewlett-Packard Company

Inventor： WILLIAM GIRARD MCCOLLOM ,  ROBERT KING ABLES ,  JACQUELINE ANN BRAY ,  CAROLYN SOBERALSKE COTTEN ,  MARTIN ROBERT FINK ,  SHANE DOUGLAS MEYER ,  SILVI KIISK STEIGERWALD

IPC: G06F017/60 ,  G06F015/16

CPC classification number: G06F3/0481 ,  G06Q30/0225 ,  G06Q30/0601

Abstract: A system and method publish, distribute and redeem coupons on a network system. The system and method utilize a merchant server and a commerce server. The merchant server provides the merchant the ability to transmit requests to create a coupon, and transmit coupon data regarding the coupon creation. The commerce server receives the requests to create a coupon, and receives the coupon creation data. The commerce server saves the coupon data to a coupon database, and provides access to the coupon to customers on the network. A merchant server further provides the merchant the ability to receive a request for purchasing an item, and a request for redeeming a coupon for that purchase from a consumer. The merchant server verifies the coupon is a valid coupon, and allows the coupon to be redeemed in the purchase of the item if the coupon is valid. The merchant server upon redemption of the coupon, updates a coupon database to record that the coupon has been redeemed by the customer.

Abstract translation: 系统和方法在网络系统上发布，分发和兑换优惠券。 该系统和方法利用商家服务器和商务服务器。 商家服务器向商家提供发送请求以创建优惠券的能力，并且传送关于优惠券创建的优惠券数据。 商务服务器接收创建优惠券的请求，并接收优惠券创建数据。 商务服务器将优惠券数据保存到优惠券数据库，并且向网络上的客户提供对优惠券的访问。 商家服务器进一步向商家提供接收购买物品的请求的能力，以及从消费者那里兑换该购买的优惠券的请求。 商家服务器验证优惠券是有效的优惠券，并且如果优惠券有效，则允许在购买商品时兑换优惠券。 商家服务器在兑换优惠券后，更新优惠券数据库以记录优惠券已被客户兑换。

公开(公告)号：US20020009971A1

公开(公告)日：2002-01-24

申请号：US09905775

申请日：2001-07-13

Applicant: Hewlett-Packard Company

Inventor： Michael P. Spratt

IPC: H04B005/00

CPC classification number: H04W40/18 ,  H04L45/00 ,  H04W40/20 ,  H04W40/22 ,  H04W88/04

Abstract: A message is carried towards a target receiver (T) at a known location by one or more mobile entities (L,Q) that receive and pass on the message by short-range communication. The message includes an indication of the location of the target receiver (T). Before a mobile entity (L,Q) is used to carry the message, a determination is made as to whether the direction of travel of the mobile entity concerned is generally towards either the target receiver (T) or an intermediate staging post suitable for progressing the message towards the target receiver.

Abstract translation: 在一个或多个通过短距离通信接收和传递消息的移动实体（L，Q）在已知位置向目标接收机（T）传送消息。 该消息包括目标接收机（T）的位置的指示。 在移动实体（L，Q）被用于携带消息之前，确定所涉及的移动实体的行进方向是否一般朝向目标接收机（T）或适于进行的中间分段 向目标接收者发送消息。