Abstract:
The present invention provides a technique for preventing an illegal use of contents by users when an expiration date is established for the use of the contents. Contents or contents execution programs have information indicative of an expiration date or time. The expiration date information is embedded into, for example, external files, contents or contents execution programs. The expiration date information could be a start of use time, an end of use time, and a last time of use, which are used as authentication data to conduct authentication when making use of the contents (e.g., when executing the contents execution program). The technique for authentication is that two requirements should be satisfied when using the contents, including (1) that the current date acquired from the system timer is between the start of use time and the end of use time (expiration date); and (2) the current time is after the last time of use (last date of access).
Abstract:
The present invention provides for deterring and/or preventing an illegal use of contents by users when an expiration date is established for the use of the contents. Contents or contents execution programs have information indicative of an expiration date. In an example, expiration date information is embedded into external files, contents or contents execution programs. The expiration date information could be a start, end or last date of use, which is used as authentication data to conduct authentication when making use of the contents. An example embodiment has two requirements satisfied when using the contents in order to execute the execution program, including (1) the current date acquired from the system timer is between the start date of use and the end date of use (expiration date); and (2) the current date is posterior to the last date of use (last date of access).
Abstract:
The present invention provides for deterring and/or preventing an illegal use of contents by users when an expiration date is established for the use of the contents. Contents or contents execution programs have information indicative of an expiration date. In an example, expiration date information is embedded into external files, contents or contents execution programs. The expiration date information could be a start, end or last date of use, which is used as authentication data to conduct authentication when making use of the contents. An example embodiment has two requirements satisfied when using the contents in order to execute the execution program, including (1) the current date acquired from the system timer is between the start date of use and the end date of use (expiration date); and (2) the current date is posterior to the last date of use (last date of access).
Abstract:
The present invention provides for deterring and/or preventing an illegal use of contents by users when an expiration date is established for the use of the contents. Contents or contents execution programs have information indicative of an expiration date. In an example, expiration date information is embedded into external files, contents or contents execution programs. The expiration date information could be a start, end or last date of use, which is used as authentication data to conduct authentication when making use of the contents. An example embodiment has two requirements satisfied when using the contents in order to execute the execution program, including (1) the current date acquired from the system timer is between the start date of use and the end date of use (expiration date); and (2) the current date is posterior to the last date of use (last date of access).
Abstract:
The present invention provides for deterring and/or preventing an illegal use of contents by users when an expiration date is established for the use of the contents. Contents or contents execution programs have information indicative of an expiration date. In an example, expiration date information is embedded into external files, contents or contents execution programs. The expiration date information could be a start, end or last date of use, which is used as authentication data to conduct authentication when making use of the contents. An example embodiment has two requirements satisfied when using the contents in order to execute the execution program, including (1) the current date acquired from the system timer is between the start date of use and the end date of use (expiration date); and (2) the current date is posterior to the last date of use (last date of access).
Abstract:
PROBLEM TO BE SOLVED: To retrieve fixed length data such as MAC addresses to be stored in a data table in large bulk at high speed. SOLUTION: This fixed data retrieval device is provided with a hash operation means 11 for calculating and outputting a hash value of inputted fixed length data, a data table memory 14 consisting of N (N is an integer ≥2) memory banks and for storing the data table in which many pieces of fixed length data are held, a pointer table memory 13 for storing a memory pointer table in which memory addresses of storing destinations of each piece of fixed length data are held by using the hash value as an index and a comparison means 15 for simultaneously comparing a plurality of pieces of fixed length data stored in the same memory address of the N memory banks with one piece of fixed length data inputted in the hash operation means and for outputting a comparison result. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PURPOSE: To attain an automatic fill processing by counting the outlines of the plus and minus directions of a Y axis along an X axial direction, and assigning a closed block area in which a difference between the total number of the Y axial plus directions and that of the Y axial minus directions is turned 0 to an area not to be filled, and assigning an area in which that is not turned 0 to an area to be filled. CONSTITUTION: A CPU 10 checks the size relation of the Y axial coordinate values of two adjacent end point positions on a work memory 14, and decides the traveling direction of a segment connecting the two end point positions. When the segment moving from a first point to a second point is traveling to a Y axial minus direction, the relation that the Y axial coordinate value of the first point is more than the Y axial coordinate value of the second point is obtained, and when the segment is orthogonally crossing the Y axis, the two Y axial coordinate values are made equal. In this method, the traveling direction of the segment connecting each end point is analyzed, and data are divided into two kinds of data. That is, after graphic bit data and Y directional bit data are prepared, a fill picture is prepared on the exclusive area of the work memory 14.
Abstract:
PROBLEM TO BE SOLVED: To provide a communication controller in which total processing time is shortened by decreasing the number of hierarchies and the number of nodes for the number of prefixes for mask in a tree structure pertaining to search information being used for determining next forwarding destination route of a received packet from the destination address thereof, and to provide a communication control method, a communication control program and a data structure for communication control. SOLUTION: Search information is made to correspond with a tree structure. Each prefix for mask is made to correspond with at least one entry where each entry includes information of mask length of the corresponding prefix for mask and a sort key and is assigned to any one node in the tree structure according to the sorting order. Each node is linked to a different node in a lower hierarchy by a branch based on the entry thereof. An extracting means 26 extracts the destination address of a received packet, and a searching means 27 searches an entry having information of a prefix most matching the extracted address at an objective node 28 indicated by a search control means 29. After ending search of each node, a routing means 30 determines the forwarding destination route of the received packet based on the longest one of the most matching prefixes at all current search object nodes. COPYRIGHT: (C)2005,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To much more efficiently achieve data registration in a data table and data retrieval from the data table. SOLUTION: Data registration in a data table (3) in which the first item data are registered with the corresponding second item data and data retrieval from the data table is executed by using a first pointer table (1) in which a pointer to a portion of registered data in the data table is registered at a storage position shown by a hash value obtained by applying a first hash function (6) to the first item data of the registered data and a second pointer table (2) in which the pointer is registered at a storage position shown by a hash value obtained by applying a second hash function (22) to the first item data of the registered data. COPYRIGHT: (C)2004,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To reduce wasteful cycles in switching of buses. SOLUTION: When output of data is switched from a memory 20 to a memory controller 10, the memory controller 10 fetches write data outputted from the memory 20 and outputs the fetched write data to a data bus 30. Next, the memory controller 10 outputs its own write data to the data bus 30, after outputting the fetched read data to the data bus 30. COPYRIGHT: (C)2003,JPO