会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Efficient data conversion of list of strings
    • 字符串列表的高效数据转换
    • US6147628A
    • 2000-11-14
    • US236180
    • 1999-01-25
    • Mark DycheAndrew Hickson
    • Mark DycheAndrew Hickson
    • G06F17/22H03M7/00
    • G06F17/2217G06F17/2264
    • A method of converting a plurality of strings stored in an input buffer to a plurality of evenly spaced strings in an output buffer involves first passing over the input buffer and, for each string, placing the string in the output buffer at a next available address. If the string length is longer than a maximum string length, the maximum string length is set to the string length and the string is set as the last incorrectly placed string in the output buffer. The next available address in the output buffer is incremented by the maximum string length plus the product of any positive difference between the current string length and previous maximum string length and the number of strings already placed in the output buffer. A second pass over said output buffer from the last incorrectly placed string in a direction opposite the first passing step moves each string within the output buffer to an address being a multiple of the maximum string length from the start of the output buffer.
    • 将存储在输入缓冲器中的多个字符串转换为输出缓冲器中的多个均匀间隔的字符串的方法包括首先通过输入缓冲器,并且对于每个字符串,将字符串放置在输出缓冲器中的下一个可用地址。 如果字符串长度大于最大字符串长度,则将最大字符串长度设置为字符串长度,并将字符串设置为输出缓冲区中最后一个不正确放置的字符串。 输出缓冲区中的下一个可用地址将以最大字符串长度加上当前字符串长度与上一个最大字符串长度之间的任何正差值与已经放置在输出缓冲区中的字符串数之间的乘积产生。 从最后一个不正确放置的字符串以与第一个传递步骤相反的方向的第二次传递,将输出缓冲区内的每个字符串移动到从输出缓冲区开始起的最大字符串长度的倍数的地址。
    • 4. 发明申请
    • Deleting expired items in a queue data structure
    • 删除队列数据结构中过期的项目
    • US20060106960A1
    • 2006-05-18
    • US11281987
    • 2005-11-17
    • Andrew HicksonDavid McCann
    • Andrew HicksonDavid McCann
    • G06F5/00
    • G06F7/785G06F5/06
    • A method for deleting expired items in a queue data structure, the queue data structure comprising a sequential list of ordered data items including a queue head at one end of the sequential list and a queue tail at another end of the sequential list, wherein each data item includes an expiry time, the method comprising: generating a maximum interval value corresponding to a maximum time interval between an expiry time of a first item in the queue and an expiry time of a second item in the queue, wherein the second item is nearer the queue head than the first item; sequentially scanning the list of ordered items from the queue head; responsive to a determination that a scanned item is expired, deleting the scanned item; responsive to a determination that a scanned item will not expire for a time interval greater than the maximum interval value, terminating scanning of the list of ordered items.
    • 一种用于删除队列数据结构中的过期项目的方法,所述队列数据结构包括有序数据项的顺序列表,所述有序数据项包括所述顺序列表的一端的队列头和所述顺序列表的另一端的队列尾,其中每个数据 项目包括到期时间,该方法包括:产生对应于队列中第一项目到期时间与队列中第二项目到期时间之间的最大时间间隔的最大间隔值,其中第二项目更接近 队列头比第一项; 从队列头顺序扫描有序项目列表; 响应于确定扫描的项目已过期,删除所扫描的项目; 响应于确定扫描的项目将不会超过大于最大间隔值的时间间隔,终止对有序项目列表的扫描。
    • 6. 发明申请
    • System and method for messaging
    • 消息的系统和方法
    • US20060140362A1
    • 2006-06-29
    • US11297550
    • 2005-12-08
    • Andrew HicksonBrian HomewoodTristram Reilly
    • Andrew HicksonBrian HomewoodTristram Reilly
    • H04M1/64
    • G06F9/546
    • A system and method for messaging in which, when a connection to a queue manager (220) is established, the queue manager allocates a Connection Identifier from the same name space (300) as Message Identifiers and returns this information (400) to the user. The user can then use this Connection Identifier as a Correlation Identifier, safe in the knowledge that it will not clash with any system generated Message Identifier or Correlation Identifier. A secondary benefit to this allocation scheme is that if a shared reply queue suffers from a build-up of messages then the Correlation Identifier in those messages can be used to identify the application expected to receive those messages.
    • 一种用于消息传递的系统和方法,其中当建立与队列管理器(220)的连接时,所述队列管理器从与消息标识符相同的名称空间(300)分配连接标识符,并将该信息(400)返回给用户 。 然后,用户可以使用此连接标识符作为相关标识符,安全的是它不会与任何系统生成的消息标识符或相关标识符冲突。 这种分配方案的次要好处是,如果共享应答队列受到消息的建立的影响,那么这些消息中的相关标识符可用于标识预期接收到这些消息的应用程序。
    • 10. 发明申请
    • Method and system of committing operations of a synchronized transaction
    • 提交同步事务操作的方法和系统
    • US20060123070A1
    • 2006-06-08
    • US11295974
    • 2005-12-07
    • Andrew Hickson
    • Andrew Hickson
    • G06F17/30
    • G06F9/466
    • A method and system for combined commit transaction request and subsequent operation request for committing the operations of a synchronized transaction by one or more applications (301, 4001, 501) on a resource manager (302, 402, 502). The method comprises: receiving a combined request (310, 410, 510) for an operation and a request to commit any outstanding synchronized transaction; committing the outstanding transaction (311, 414, 512); and processing (313, 413, 517) the requested operation outside the outstanding transaction. For example, in an asynchronous messaging process, the combined request specifies an option in a get operation request to commit any outstanding units of work prior to carrying out the get operation.
    • 一种用于组合提交事务请求和随后的操作请求的方法和系统,用于通过资源管理器(302,402,502)上的一个或多个应用(301,4001,501)提交同步事务的操作。 该方法包括:接收用于操作的组合请求(310,410,510)以及提交任何未完成的同步事务的请求; 承诺未偿还交易(311,414,512); 以及处理(313,413,517)未完成交易之外的所请求的操作。 例如,在异步消息传递过程中,组合请求在获取操作请求中指定在执行获取操作之前提交任何未完成的工作单元的选项。