公开(公告)号：US20110022815A1

公开(公告)日：2011-01-27

申请号：US12507419

申请日：2009-07-22

申请人： Yefim Shuf ,  Hong Min ,  Hubertus Franke ,  Ulrich Alfons Finkler

发明人： Yefim Shuf ,  Hong Min ,  Hubertus Franke ,  Ulrich Alfons Finkler

IPC分类号： G06F12/02

CPC分类号： G06F17/30315

摘要： Techniques for storage allocation of a data record are provided. The techniques include attempting to identify a first location for storing a data record, wherein the data record comprises one or more data record attributes, if the first location is identified, selecting the first location for storing the data record, and if the first location is not identified, identifying a second location for storing the data record using a cost penalty function and selecting the second location for storing the data record based on the cost penalty function.

摘要翻译： 提供了数据记录的存储分配技术。 这些技术包括尝试识别用于存储数据记录的第一位置，其中数据记录包括一个或多个数据记录属性，如果识别出第一位置，选择用于存储数据记录的第一位置，以及如果第一位置是 未识别，使用成本惩罚函数识别用于存储数据记录的第二位置，并且基于成本惩罚函数选择用于存储数据记录的第二位置。

公开(公告)号：US20100253556A1

公开(公告)日：2010-10-07

申请号：US12418896

申请日：2009-04-06

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M7/40

CPC分类号： H03M7/40

摘要： A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table.

摘要翻译： 一种从包括要压缩的数据的子集的数据样本构建动态霍夫曼表的快速近似的新颖且有用的方法。 计算样本中每个符号的入射频率，然后根据其入射频率将符号分配给预定义的分组。 然后，将这些分组转换成二进制子树，其中二进制子树的叶节点包括与二进制子树相关联的bin的符号。 然后通过嵌套组合二进制子树，从而创建粗粒度二叉树，其中所有叶被映射到指定数量的深度。 然后遍历粗粒二进制树，从而为每个符号产生规范代码，从而为动态霍夫曼表定义条目。

公开(公告)号：US07692561B2

公开(公告)日：2010-04-06

申请号：US12175214

申请日：2008-07-17

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M7/34

CPC分类号： H03M7/3086

摘要： A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.

摘要翻译： 用于对压缩数据分组的流进行解压缩的方法包括：确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中，以及当确定第一 数据位于远程存储器中，停止第一次解压缩复制操作，使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作，并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。

公开(公告)号：US20100042624A1

公开(公告)日：2010-02-18

申请号：US12193084

申请日：2008-08-18

申请人： Hong Min ,  Yefim Shuf ,  Hubertus Franke ,  Allan Benjamin Lebovitz ,  Christopher John Crone ,  Akiko Hoshikawa

发明人： Hong Min ,  Yefim Shuf ,  Hubertus Franke ,  Allan Benjamin Lebovitz ,  Christopher John Crone ,  Akiko Hoshikawa

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： G06F17/30598 ,  G06F7/36 ,  G06F17/30607

摘要： Techniques for sorting a sequence of one or more input objects are provided. The techniques include identifying a property that is exhibited by a sequence of one or more input objects, determining whether each input object from the sequence of one or more input objects exhibits the property, storing each of the one or more input objects into a buffer, wherein an input object is stored in a first buffer if it exhibits the property and an input object is stored in a second buffer if it does not exhibit the property, sorting each of the one or more input objects in each buffer, and merging the one or more input objects in each buffer into a sequence of one or more input objects.

摘要翻译： 提供了用于排序一个或多个输入对象的序列的技术。 这些技术包括识别由一个或多个输入对象的序列呈现的属性，确定来自一个或多个输入对象的序列的每个输入对象是否呈现属性，将一个或多个输入对象中的每一个存储到缓冲器中， 其中如果输入对象呈现所述属性并将输入对象存储在第二缓冲器中，如果不显示所述属性，则将输入对象存储在第一缓冲器中，对每个缓冲器中的所述一个或多个输入对象中的每一个进行排序， 或更多的输入对象在一个或多个输入对象的序列中。

公开(公告)号：US20100013678A1

公开(公告)日：2010-01-21

申请号：US12175214

申请日：2008-07-17

申请人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

发明人： Giora Biran ,  Hubertus Franke ,  Amit Golander ,  Hao Yu

IPC分类号： H03M5/00

CPC分类号： H03M7/3086

摘要： A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.

摘要翻译： 用于对压缩数据分组的流进行解压缩的方法包括：确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中，以及当确定第一 数据位于远程存储器中，停止第一次解压缩复制操作，使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作，并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。

公开(公告)号：US07315950B1

公开(公告)日：2008-01-01

申请号：US09468377

申请日：1999-12-20

申请人： Yurij Andrij Baransky ,  Hubertus Franke ,  Pratap Chandra Pattnaik ,  David R. Safford ,  Robert William Wisniewski

发明人： Yurij Andrij Baransky ,  Hubertus Franke ,  Pratap Chandra Pattnaik ,  David R. Safford ,  Robert William Wisniewski

IPC分类号： G06F21/00

CPC分类号： G06F21/10 ,  H04L9/0844 ,  H04L9/0863 ,  H04L9/0891 ,  H04L9/3242

摘要： A method for allowing a content provider to restrict access to data without having to trust a service provider. With this invention a content provider is able to restrict access to data to a specific client using a specific machine. A content provider generates a first key which is used to encrypt a second key where the second key will only be encrypted if the user has a one-time password. The encrypted second key is then stored on the client machine. When the user desires to access the data of the content provider, the second key is decrypted and used to access the data.

摘要翻译： 允许内容提供商限制对数据的访问而不必信任服务提供者的方法。 利用本发明，内容提供商能够使用特定机器限制对特定客户端的数据访问。 内容提供商生成用于加密第二密钥的第一密钥，其中如果用户具有一次性密码，则第二密钥将仅被加密。 然后将加密的第二个密钥存储在客户机上。 当用户期望访问内容提供商的数据时，第二密钥被解密并用于访问数据。

公开(公告)号：US20070016904A1

公开(公告)日：2007-01-18

申请号：US11182570

申请日：2005-07-15

申请人： Ingo Adlung ,  Hubertus Franke ,  Lisa Heller ,  William Holder ,  Damian Osisek ,  Randall Philley ,  Martin Schwidefsky ,  Gustav Sittmann ,  Jong Choi ,  Ray Mansell

发明人： Ingo Adlung ,  Hubertus Franke ,  Lisa Heller ,  William Holder ,  Damian Osisek ,  Randall Philley ,  Martin Schwidefsky ,  Gustav Sittmann ,  Jong Choi ,  Ray Mansell

IPC分类号： G06F9/455

CPC分类号： G06F3/0665 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/0673 ,  G06F9/45545 ,  G06F9/45558 ,  G06F9/5016 ,  G06F9/5077 ,  G06F2009/45583

摘要： Processing within a computing environment that supports pageable guests is facilitated. Processing is facilitated in many ways, including, but not limited to, associating guest and host state information with guest blocks of storage; maintaining the state information in control blocks in host memory; enabling the changing of states; and using the state information in management decisions. In one particular example, the guest state includes an indication of usefulness and importance of memory contents to the guest, and the host state reflects the ease of access to memory contents. The host and guest state information is used in managing memory of the host and/or guests.

摘要翻译： 促进支持可分页访客的计算环境中的处理。 通过许多方式促进处理，包括但不限于将访客和主机状态信息与访客存储块相关联; 维护主机内存中控制块中的状态信息; 使国家能够改变; 并在管理决策中使用状态信息。 在一个特定示例中，客户状态包括对访客的存储器内容的有用性和重要性的指示，并且主机状态反映了访问存储器内容的容易性。 主机和客户状态信息用于管理主机和/或客人的内存。

公开(公告)号：US06636533B1

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

申请号：US09556734

申请日：2000-04-21

申请人： Yurij Baransky ,  Hubertus Franke ,  Pratap Pattnaik

发明人： Yurij Baransky ,  Hubertus Franke ,  Pratap Pattnaik

IPC分类号： H04L708

CPC分类号： H04N21/8541 ,  H04N7/163 ,  H04N21/235 ,  H04N21/2365 ,  H04N21/26216 ,  H04N21/4331 ,  H04N21/4347 ,  H04N21/435 ,  H04N21/84 ,  H04N21/8547

摘要： The present invention is a process in which broadcasters can supplement existing multimedia streams such as video and audio with additional multimedia streams in a coordinated and integrated way, allowing users, after reception of the broadcast stream, to select which substream to use, without requiring an upstream channel to communicate this user preference back to the server or any additional bandwidth to broadcast these additional streams.

摘要翻译： 本发明是广播机构可以以协调和集成的方式补充现有多媒体流如视频和音频的附加多媒体流，允许用户在接收广播流之后选择要使用的子流，而不需要 上行信道将该用户偏好传送回服务器或任何附加带宽以广播这些附加流。

公开(公告)号：US06542513B1

公开(公告)日：2003-04-01

申请号：US09613072

申请日：2000-07-10

申请人： Hubertus Franke ,  Rama K. Govindaraju ,  Pratap C. Pattnaik ,  Mandayam T. Raghunath ,  Robert M. Straub

发明人： Hubertus Franke ,  Rama K. Govindaraju ,  Pratap C. Pattnaik ,  Mandayam T. Raghunath ,  Robert M. Straub

IPC分类号： H04L1254

CPC分类号： H04L47/10 ,  H04L47/30

摘要： A method, system, and associated program code and data structures are provided for a message processing system in which messages are transmitted from source nodes to destination nodes. An “eager” rendezvous transmission mode is disclosed in which early arrival buffering is provided at message destination nodes for a predetermined amount of data for each of a predetermined number of incoming messages. Relying on the presence of the early arrival buffering at a message destination node, a message source node can send a corresponding amount of message data to the destination node along with control information in an initial transmission. Any remaining message data is sent only upon receipt by the source node of an acknowledgement from the destination node indicating that the destination node is prepared to receive any remaining data. In an enhanced embodiment, the source node alternates between rendezvous transmission modes as a function of the amount of free space in the early arrival buffering at the destination node, as indicated by the number of outstanding initial transmissions for which acknowledgements have not yet been received. Different transmission modes for different destination nodes can be employed at a source node, depending on the amount of early arrival buffering currently available in each respective destination node.

摘要翻译： 提供了一种消息处理系统的方法，系统和相关联的程序代码和数据结构，其中消息从源节点传送到目的地节点。 公开了一种“急切的”会合传输模式，其中针对预定数量的进入消息中的每一个为预定量的数据在消息目的地节点处提供早到达缓冲。 依赖于在消息目的地节点处的早期到达缓冲的存在，消息源节点可以在初始传输中与控制信息一起向目的地节点发送相应量的消息数据。 任何剩余的消息数据仅在源节点收到来自目的地节点的确认时发送，指示目的地节点准备接收任何剩余数据。 在增强实施例中，源节点在集合传输模式之间交替，作为在目的地节点处的早到达缓冲中的可用空间量的函数，如尚未被接收到确认的未完成初始传输的数量所指示的。 根据当前在每个相应目的地节点中可用的早到达缓冲的数量，可以在源节点采用用于不同目的地节点的不同传输模式。

公开(公告)号：US09659317B2

公开(公告)日：2017-05-23

申请号：US13034180

申请日：2011-02-24

申请人： Jamin Naghmouchi ,  Hubertus Franke

发明人： Jamin Naghmouchi ,  Hubertus Franke

IPC分类号： G06Q30/06 ,  G06Q30/02

CPC分类号： G06Q30/0283 ,  G06Q30/0206 ,  G06Q30/0619 ,  G06Q30/0631

摘要： A method, system and computer program product for adjusting prices for goods and services offered using a computer network. In one embodiment, data relating to goods and services offered over the computer network by a number of entities using the computer network are stored in a database, communications are monitored, using the computer network, to identify an interest of a user, and this interest of the user and the data in the database are used to identify one of the entities to offer a specified product or service to the user. Information is obtained relating to a price for the specified product or service, and this information and the data in the database are used to determine an adjusted price for the specified product or service. In one embodiment, the information the user has about a price for the specified product or service is used to determine the adjusted price.