-
公开(公告)号：US07152224B1
公开(公告)日：2006-12-19
申请号：US09717587
申请日：2000-11-21
IPC分类号： G06F9/44
摘要： Systems, clients, servers, methods, and computer-readable media of varying scope are described that maintain versions of associations between project management objects such as source cod files, bug data, development issue data, and software specifications. One aspect of the system is that the project association data is stored in a relational database. A link set data structure provides a link to objects that are to be associated together. A link content data structure describes an individual project management object that is linked with other objects in the link set. As a software development project progresses through its life cycle, changes to the associations occur. The changes are captured and stored in the database. Previous versions of the associations are maintained in the project database, thereby allowing a user to query for the state of the project associations as they existed at any particular point in time.
摘要翻译： 描述了维护不同范围的系统，客户端，服务器，方法和计算机可读介质，其维护诸如源代码文件，错误数据，开发问题数据和软件规范之类的项目管理对象之间的关联的版本。 该系统的一个方面是项目关联数据存储在关系数据库中。 链接集数据结构提供了链接到要关联在一起的对象。 链接内容数据结构描述与链接集中的其他对象链接的单个项目管理对象。 随着软件开发项目的生命周期的进行，协会发生变化。 更改被捕获并存储在数据库中。 在项目数据库中维护先前版本的关联，从而允许用户查询在任何特定时间点存在的项目关联的状态。
-
公开(公告)号：US06691254B2
公开(公告)日：2004-02-10
申请号：US10216353
申请日：2002-08-12
申请人： Christopher G. Kaler , Martyn S. Lovell , Robert S. Wahbe , William J. Ferguson , Oliver J. Sharp
发明人： Christopher G. Kaler , Martyn S. Lovell , Robert S. Wahbe , William J. Ferguson , Oliver J. Sharp
IPC分类号： G06F1134
CPC分类号： G06F11/302 , G06F11/3072 , G06F11/3096 , G06F11/323 , G06F11/3466 , G06F11/348 , G06F11/3495 , G06F2201/86
摘要： A method and apparatus for analyzing the performance of a data processing system, particularly a distributed data processing system, provide a system user with tools for analyzing an application running thereon. Information about the flow and performance of the application can be specified, captured, and analyzed, without modifying it or degrading its performance or data security characteristics, even if it is distributed across multiple machines. The user interface permits the system user to filter the performance information, to set triggers which the performance analyzer is able to reduce and/or combine, to observe multiple time-synchronized displays of performance data either in real time or post mortem, and to play and re-play the operation of an automatically generated application model. The invention is implemented in part by providing suitable Application Program Interfaces (APIs) in the operating system of the data processing system.
-
公开(公告)号：US07945950B2
公开(公告)日：2011-05-17
申请号：US11925734
申请日：2007-10-26
IPC分类号： G06F7/04
CPC分类号： H04L63/08 , G06F21/31 , G06F2221/2103
摘要： A challenge mechanism in which a challenge is issued from one message processor to another. In generating the challenge, the message processor may select any one or more of a number of available interactive challenge types, where each type of challenge type might use different user-originated information. Upon receiving the challenge, the challengee message processor may identify the challenge type based on information provided in the challenge, and perform different actions depending on the challenge type. The challengee message processor then generates an appropriate challenge response, and issues that challenge response to the challenger message processor. The challenger message processor may then validate the challenge response.
摘要翻译： 挑战机制，其中挑战是从一个消息处理器发出到另一个。 在产生挑战时，消息处理器可以选择多个可用的交互式挑战类型中的任何一个或多个，其中每种类型的挑战类型可以使用不同的用户发起的信息。 在接收到挑战时，挑战者消息处理器可以基于挑战中提供的信息识别挑战类型，并根据挑战类型执行不同的动作。 挑战者消息处理器然后生成适当的挑战响应，并且向挑战者消息处理器发出挑战响应。 挑战者消息处理器然后可以验证挑战响应。
-
公开(公告)号：US07640299B2
公开(公告)日：2009-12-29
申请号：US11325691
申请日：2006-01-04
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1059 , H04L67/1063 , H04L67/1065 , H04L67/24 , H04L67/32
摘要： Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.
摘要翻译： 本发明的实现部分地涉及对等通信系统的优化。 例如，一个实现涉及在对等体之间动态地创建，高速缓存和管理通信信道的智能收发器的使用。 另一实现涉及使用可用于在各个对等体之间有效地注册和分发对等消息的中央跟踪对象。 在一个实现中，中心跟踪对象在组中的对等体之间共享。 另一个实现涉及将对等体组与命名空间相关联，并且用于将不同命名空间的另一个对等体组内的一个命名空间的对等体组包括在内。 本发明的这些和其它方面也可用于确保给定对等体消息的传送意图被保留，并确保在任何给定时间将最佳数量的消息传送给任何给定的对等体。
-
75.发明授权Challenge-based authentication without requiring knowledge of secret authentication data 失效基于挑战的认证，不需要知道秘密认证数据公开(公告)号：US07519815B2
公开(公告)日：2009-04-14
申请号：US10917786
申请日：2004-08-13
CPC分类号： H04L63/0853 , H04L9/3271 , H04L63/0428 , H04L2209/56
摘要： A challenge based authentication mechanism that does not require that the authenticating computing entities be aware of the secret data used for the initial authentication. An authenticator computing entity is to authenticate to the authenticatee computing entity. First, the authenticatee computing entity acquires a challenge from a supplemental authenticatee computing entity. The authenticatee computing entity provides the challenge to the authenticator computing entity, which has a supplemental authenticator computing entity solve the challenge. The authenticator computing entity sends the answer to the authenticatee computing entity, which uses the answer to authenticate the authenticator computing entity.
摘要翻译： 一种基于挑战的认证机制，不要求认证计算实体知道用于初始认证的秘密数据。 认证者计算实体将对认证计算实体进行认证。 首先，认证计算实体从补充认证计算实体获取挑战。 认证计算实体向认证者计算实体提供了挑战，认证者计算实体具有解决挑战的补充认证计算实体。 认证者计算实体将认证方计算实体发送给验证者计算实体，认证方计算实体使用该认证方认证认证者计算实体。
-
公开(公告)号：US07475097B2
公开(公告)日：2009-01-06
申请号：US10996719
申请日：2004-11-24
IPC分类号： G06F17/30
CPC分类号： G06F8/71 , Y10S707/99939 , Y10S707/99942 , Y10S707/99953 , Y10S707/99954
摘要： A configuration management system creates (602) each configuration by assigning a configuration identifier to each configuration. In addition, relational information is computed (706) that indicates the relationships between the configuration and any configurations upon which it is based. The system then tracks (604) changes to files of the configuration by storing information associating each new file version with the configuration identifier. The system also tracks (1210) changes to file properties. A configuration is then reconstructed (608) as of a desired date, by identifying (2104, 2106) the file versions and properties associated with that configuration as of the desired date. A determination is made (2110) whether a user that has requested the file versions has access privileges by first checking a security cache (2600) for the user privileges information. If the information is not on the cache, it is computed from a security table (2800) and stored on the cache. The system automatically compresses (3118) and reconstitutes (3006) file versions that are stored in the version store.
摘要翻译： 配置管理系统通过为每个配置分配配置标识符来创建（602）每个配置。 另外，计算关系信息（706），其指示配置和基于其的任何配置之间的关系。 然后，系统通过存储将每个新文件版本与配置标识符相关联的信息来跟踪（604）对配置文件的更改。 系统还跟踪（1210）文件属性的更改。 然后，通过根据期望日期识别（2104,2106）与该配置相关联的文件版本和属性，从而将所需日期重新构建（608）。 （2110）通过首先检查用户权限信息的安全缓存（2600），确定已请求文件版本的用户是否具有访问权限。 如果信息不在缓存上，则从安全表（2800）计算并存储在缓存中。 系统自动压缩存储在版本存储中的（3118）和重构（3006）文件版本。
-
77.发明授权Client-server communications system and method using a semi-connectionless protocol 有权客户端 - 服务器通信系统和使用半连接协议的方法公开(公告)号：US07406523B1
公开(公告)日：2008-07-29
申请号：US09717674
申请日：2000-11-21
IPC分类号： G06F15/16
CPC分类号： H04L67/14
摘要： A system and method for performing client-server transactions includes an application interface, located at a client, which manages connections between the client and a server. The application interface receives a request from an application program, opens a connection with the server, sends a message that includes the request over the connection, and holds the connection open for at least a timeout period. If the application interface receives another request destined for the server during the timeout period, it sends another message with the new request over the open connection. If the application interface receives one or more requests that are part of a transaction, the application interface assigns a transaction identifier to the transaction. The transaction identifier and a sequence indicator are included in each message with each request. At the server, a transaction manager receives the messages, sequences the requests based on the sequence indicators, and processes the requests in the indicated sequence. If the application interface receives a redirect request from the server in response to a message, the application interface sends the message to another server identified in the redirect request without involving the client application.
摘要翻译： 用于执行客户机 - 服务器事务的系统和方法包括位于客户机处的应用接口，其管理客户端与服务器之间的连接。 应用程序接口从应用程序接收请求，打开与服务器的连接，通过连接发送包含请求的消息，并将连接保持至少一个超时时间。 如果应用程序接口在超时期间收到发往服务器的其他请求，则通过打开的连接发送带有新请求的另一个消息。 如果应用程序接口接收到作为事务一部分的一个或多个请求，则应用程序接口为事务分配事务标识符。 交易标识符和序列指示符包含在每个消息中，每个请求。 在服务器处，事务管理器接收消息，根据顺序指示符对请求进行排序，并按指示的顺序处理请求。 如果应用程序接口响应于消息从服务器接收到重定向请求，则应用程序接口将消息发送到重定向请求中标识的另一个服务器，而不涉及客户端应用程序。
-
公开(公告)号：US20080083009A1
公开(公告)日：2008-04-03
申请号：US11537029
申请日：2006-09-29
IPC分类号： H04L9/00
CPC分类号： H04L63/20
摘要： Communicating and requesting specialized policy information. A message is sent by a client to a service which provides the services requested by the message or a specialized processor that evaluates messages. The message is evaluated for compliance with a policy particular to the message. If the message does not comply with a policy particular to the message, policy information is sent, where the policy information indicates the correct policy particular to the message. In one embodiment, if the message complies with a policy particular to the message, policy information is sent, where the policy information indicates that the message complies with a policy particular to the message.
摘要翻译： 沟通和请求专门的政策信息。 消息由客户端发送到提供消息请求的服务或评估消息的专用处理器的服务。 评估消息是否符合消息特有的策略。 如果消息不符合消息特有的策略，则发送策略信息，其中策略信息指示消息特有的正确策略。 在一个实施例中，如果消息符合消息特有的策略，则发送策略信息，其中策略信息指示消息符合消息的特定策略。
-
公开(公告)号：US20080082638A1
公开(公告)日：2008-04-03
申请号：US11537019
申请日：2006-09-29
IPC分类号： G06F15/177 , G06F15/173 , G06F15/16
CPC分类号： H04L63/0807
摘要： Providing reference tokens. A method includes receiving a request for a token. In response to the request for a token and in place of a token, one or more rich pointers are sent referencing one or more tokens. The rich pointers point to locations where one or more actual tokens can be retrieved. When only a single pointer is sent, the pointer is a reference other than an HTTP URL.
摘要翻译： 提供引用令牌。 一种方法包括接收对令牌的请求。 响应于令牌的请求并代替令牌，发送一个或多个富指针，引用一个或多个令牌。 丰富的指针指向可以检索一个或多个实际令牌的位置。 当只发送一个指针时，该指针是HTTP URL以外的引用。
-
公开(公告)号：US20080080529A1
公开(公告)日：2008-04-03
申请号：US11536955
申请日：2006-09-29
申请人： Christopher G. Kaler
发明人： Christopher G. Kaler
IPC分类号： H04L12/56
CPC分类号： H04L67/104 , H04L67/1002 , H04L67/1059 , H04L67/108
摘要： Multiple peer groups for performing computing, communication, and/or storage tasks. A method may be performed for example, in a computing environment including one or more agents networked together. The method includes providing data to the agents using two or more distinct peer groups. The peer groups include members from among the agents. The method further includes performing at each of the peer groups operations on the data. Each peer group is configured to perform a specific operation. The method also includes coordinating the operations at each of the peer groups such that a common computing, communication and/or storage task is accomplished by aggregating the operations at each of the peer groups.
-
-
-
-
-
-
-
-
-
搜索结果
104 条记录 (耗时 0.055 秒)