Abstract: An information processing device (10) is an information processing device in which is implemented a session table, and includes a storage unit (12) that stores a session table, in which is recorded session information having session content and holding time point of the session, a locking unit (133) that locks at least a region of the session table that is an object of processing, during processing on the session information, a searching unit (134) that scans session information of the session table after locking, and searches for session information that is an object of processing, and a deleting unit (135) that, in a case where the session information of which the holding time point has expired is discovered at the time of scanning by the searching unit (134), the session information of which the holding time point has expired is deleted from the session table.
March 25, 2019
Date of Patent:
July 12, 2022
NIPPON TELEGRAPH AND TELEPHONE CORPORATION
Abstract: A method applied to a mining machine for limiting computing power includes utilizing a dictionary library and a timestamp to control Nonce combination that can be tried per unit time. If all strings in the dictionary library have been tried, as long as a time difference between time of generating most recent timestamp and the current time is less than a preset threshold, the mining machine must wait in sleep state and cannot resume mining until the time difference exceeds the preset threshold. The present disclosure can avoid a situation that the calculation power of the mining machine is too strong and causes a monopoly of the calculation power.
Abstract: A first node receives an original data packet sent from a terminal device. The first node inserts a forwarding identifier into original data packet and forwards the modified data packet to the other node. The other node forwards the data packet according to the forwarding identifier.
April 21, 2015
Date of Patent:
May 28, 2019
Hewlett Packard Enterprise Development LP
Abstract: The present invention discloses a method and device for operating telephone directories applied in a mobile terminal using a smart SIM card. The method comprising: after the mobile terminal is powered on, reading telephone directories in the mobile terminal and in the smart SIM card and constructing the first and second tables respectively; and when the mobile terminal detects that the first and second tables have been constructed, accomplishing a subscriber's operation on telephone directories in the first table and/or the second table, and after the first table is modified, using the modified first table to update the telephone directory in the mobile terminal, and after the second table is modified, using the modified second table to update the telephone directory in the smart SIM card. The device comprises a mobile terminal and a smart SIM card, wherein the mobile terminal comprises a processor, a storage, and a memory.
Abstract: A large OLAP cube includes data and dimensions not required for a particular query, or for a collection of queries. A response to a query is generated by using the large OLAP cube rather than using an OLAP cube tailored to the query, and rather than querying the relational database directly. The large OLAP cube may be created after identifying a set of frequently sought data and/or filters used in queries to the relational database. Data may be staged by creating a smaller OLAP cube with data extracted from the large OLAP cube. The cubes may then be queried, browsed, and used to prepare reports or generate flat files.
Abstract: Methods and apparatus are disclosed for generating a result based on a lookup result from a lookup operation using an associative memory and processing based on a discriminator portion of a lookup word. A first lookup operation is performed to generate a lookup result. In one implementation, a second lookup operation is performed based on a discriminator or the lookup result depending on the result of an evaluation, such as whether there was a hit or the lookup result matches a predetermined value. In one implementation, a second lookup operation is performed based on the discriminator, and either the result of the first or second lookup operation is used for subsequent processing. One implementation performs a lookup operation based on a lookup word to generate a lookup result, which is used to retrieve a base address and a bitmap from a memory.
Abstract: A system and method in accordance with the present invention provides a composite chart of interpersonal relationships of members within an organization. A user can utilize the composite chart to identify persons of interest or the effective organization based on any context or multiple contexts both internally and externally to the organization.
August 15, 2007
February 19, 2009
International Business Machines Corporation
Vijay BOMMIREDDIPALLI, Samuel Hoi Ki WONG, Rakesh Ranjan, Rupesh Kartha
Abstract: A data storage method and a data storage structure are provided. In one aspect, a method of storing data includes setting a first data node in a first storage area; setting a second data node in a second storage area; wherein said second data node is an element of a plurality of elements forming a first flat table of at least one flat table in the second storage area; and said step of setting a first data node includes storing in the first data node a two-tuple linker which comprises a first identifier indicating said first flat table and a second identifier indicating the row of said element in the first flat table. In another aspect a corresponding data storage structure is further provided. According to the present invention, it is able to achieve easily data chaining via a two-tuple linker in a special-purpose processor that does not support a pointer of memory address, thereby reducing requirements on space needed for data storage and enhancing efficiency of chaining each data segment.
June 13, 2008
November 13, 2008
INTERNATIONAL BUSINESS MACHINES CORPORATION
Bhavesh Dhanji Budhabhatti, Yonghua Lin, Chien D. Vu, Yan Q. Wang