Abstract:
PROBLEM TO BE SOLVED: To provide an electronic watermark system which makes erasing of a visible mark and embedding of an invisible mark inseparable in the case of erasing a visible mark and embedding an invisible mark. SOLUTION: In the case of erasing a visible mark and embedding an invisible mark (84), by not sequentially erasing the visible mark and embedding the invisible mark but performing the erasing of the visible mark and the embedding of the invisible mark at the same time, it makes difficult to obtain an original image data in which the visible mark or the invisible mark is not embedded even if a snap shot of a memory is taken during processing. Moreover, in the case of erasing the visible mark and embedding the invisible mark (64), the invisible mark is embedded in an area in which the visible mark was embedded. Therefore, it becomes difficult to presume the newly embedded invisible mark, even if the images before and after the erasing of the visible mark are compared with each other.
Abstract:
PROBLEM TO BE SOLVED: To suppress the degradation in picture quality or the like of media information subjected to padding processing by properly certifying who is a true owner and adaptively determining the manipulated variable for characteristic values such as picture element values. SOLUTION: In a data hiding method which pads media data with message data, a key having a prescribed value is taken as input of a specific function to obtain a secondary key. Based on this obtained secondary key, the padding position of message data is specified, and a function for padding to be used in this specified position out of plural functions for padding is specified. The padding processing of message data is performed in the specified position based on the specified function for padding.
Abstract:
PROBLEM TO BE SOLVED: To provide a technique to divide the regions of a block diagram including a block other than coded object by changing the disposition of the block other than coded object to optimize the operation speed after coding.SOLUTION: A block diagram is converted and abstracted into a task graph of DAG. A series-parallel tree (SPT) is obtained by analyzing the structure of the task graph. The SPT includes: an S-node from which a serial execution node branches; and a P-node from which parallel execution node branches. The SPT is converted into another SPT until no P-node exists prior to the block other than coded object. A corresponding block diagram is divided, and a code is generated for each region; and compiled and allotted to a different processor or core to execute a block following the P-node of the obtained SPT in parallel. The task graph of the DAG is deformed so that scattered blocks other than coded object are preferably merged.
Abstract:
PROBLEM TO BE SOLVED: To efficiently simulate a system having a plurality of different types of ECU by software. SOLUTION: Each ECU emulator is speculatively emulated. That is, when the ECU emulator or each physical device simulator is called as a logical process, any critical path is not created, and each logical process is executed in parallel as much as possible, and even when any input event is not delivered in each logical process, the input is predicted, and the processing is advanced. This speculative execution makes it possible to previously execute processing without waiting for the output of another logical process so that the parallelism of processing can be increased. When the actual input to be received with delay is not matched with the predicted and speculatively executed input, it is determined that the speculative execution fails, and the status is returned to the previous time, and the processing is re-executed based on the actual input. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide an object movement control system for updating position information on a virtual space of an object at high speed by appropriately distributing calculation loads, and to provide an object movement control method, a server and a computer program therefor. SOLUTION: Each of client control devices 2, 2, etc., acquires information related to the position in a virtual space of one object and information related to the movement thereof, and detects other objects present in a predetermined virtual area in which the one object is included when it is moved. The client control device calculates a distance between objects present in one virtual area, and transmits information on the objects to the server 1 only when the number of objects having distances below a predetermined threshold is larger than a predetermined number. The server 1 assigns a collision determination client 3 which executes collision determination processing to each combination of a pair of objects selected from a plurality of objects. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To effectively support communication of a user. SOLUTION: A system includes: a storage device in which each of at least one communication means used by each user is stored so as to be associated with scores indicating the level of skill that the user uses the communication means; a retrieval part for retrieving at least one communication means that is commonly used by the first user and the second user from the storage device; and a selection part for reading the scores of the first and second users about the retrieved communication means from the storage device, and for selecting the communication means to be used for the communication of the first and second users on the basis of the respective read scores. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To achieve job execution for dynamically and autonomously performing the assignment and change of resources so that the request of a job can be satisfied with respect to a job and a resource environment whose operating circumstances are not predictable in advance. SOLUTION: Jobs dividable into the arbitrary number of tasks are provided to one computer among a plurality of computers connected through a network, and the task of a job is processed for a predetermined time by one computer. The progress rate of the task processing in the prescribed period is calculated, and the completion time of the task processing by one computer is estimated based on the progress rate and the predetermined time. Whether or not the estimated completion time satisfies the request items of the job is determined. When the estimated completion period satisfies the request times, the task of the job is processed by one computer, and the result is generated. When the estimated completion time does not satisfy the request items, the tasks of the job are divided into the tasks to be remained in one computer and the tasks to be moved to the other computer for processing. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a system for improving the reliability and the availability of services in general for streaming distribution. SOLUTION: A stream data distribution method uses a distribution server for receiving stream data and a plurality of delivery servers for receiving each element of the stream data distributed from the distribution server and delivering each element to one or more receivers in the case of distributing the stream data to the one or more receivers connected by a network, the method comprises: a step where the distribution server selects some of transmissible delivery servers and transmits each element of the stream data received from a streaming source; a step where the delivery servers deliver the elements of the stream data received from the distribution server to the receivers; and a step where each receiver reconfigures the original stream data on the basis of the elements of the stream data received from the plurality of delivery servers. This system adopts this method. COPYRIGHT: (C)2006,JPO&NCIPI
Abstract:
PROBLEM TO BE SOLVED: To provide a method and a system for directly operating information in compressed digital audio data. SOLUTION: A system which embeds additional information in compressed audio data has (1) a means for restoring a MDCT(modified Discrete Cosine Transform) coefficient from the compressed audio data, (2) a means which finds frequency components of the audio data by using the restored MDCT coefficient, (3) a means for embedding the additional information in the found frequency components in a frequency space, and (5) a means for generating compressed audio data from the MDCT coefficient embedded in the additional information.
Abstract:
PROBLEM TO BE SOLVED: To detect reliably the processing to the audio data while burying so as not to detect a change of tone quality due to burying of additional information with human auditory sense by burying the additional information in a changeable range of a frequency that the audio data are buried. SOLUTION: A frequency conversion block 120 calculates a frequency component of an audio signal. An auditory sense psychology model calculation block 130 calculates an area hard to differentiate the change based on a characteristic of a human ear. An additional information burying mask generation block 170 generates a mask used when the additional information is buried. An additional information burying block 140 buries the inaudible additional information in the audio signal. That is, the block 140 adds a signal/time companding/ detecting synchronizing signal to the frequency converted audio signal in the mask direction in an inaudible range based on the calculated auditory sense model. A frequency inverse conversion block 190 inversely converts the frequency converted audio signal.