Abstract: Executable files are managed. A determination is made as to whether in a second executable file there exists a function that is the same as a function called in a first executable file. A data package is generated on a portion other than the function in the first executable file and the second executable file, and the function is stored in relation to the data package. The data package includes a first address of the function in the first executable file and a second address of the function in the second executable file.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: Generating a scalable code division and workflow chart. Based on definition-and-use cases of variables in a code snippet to be represented by a graph, crossing references to the variables in the code are determined, where a crossing reference associated with a statement involves a definition of the variable before the statement and a use of the variable at or after the statement. The code snippet is divided, based on the crossing references.

Abstract: Executable files are managed. A determination is made as to whether in a second executable file there exists a function that is the same as a function called in a first executable file. A data package is generated on a portion other than the function in the first executable file and the second executable file, and the function is stored in relation to the data package. The data package includes a first address of the function in the first executable file and a second address of the function in the second executable file.

Abstract: Disclosed are a speech retrieval apparatus and a speech retrieval method for searching, in a speech database, for an audio file matching an input search term by using an acoustic model serialization code, a phonemic code, a sub-word unit, and a speech recognition result of speech. The speech retrieval apparatus comprises a first conversion device, a first division device, a first speech retrieval unit creation device, a second conversion device, a second division device, a second speech retrieval unit creation device, and a matching device. The speech retrieval method comprises a first conversion step, a first division step, a first speech retrieval unit creation step, a second conversion step, a second division step, a second speech retrieval unit creation step, and a matching step.

Abstract: Disclosed are a speech retrieval apparatus and a speech retrieval method for searching, in an audio file database, for one or more target audio files by using one or more input search terms. The speech retrieval apparatus comprises a related document obtaining unit configured to search, in a related document database where documents related to audio files in the audio file database are stored, for one or more related documents by using the search terms; a correspondence audio file obtaining unit configured to search, in the audio file database, for one or more correspondence audio files corresponding to the obtained related documents; and a speech-to-speech search unit configured to search, in the audio file database, for the target audio files by using the obtained correspondence audio files.

Abstract: Disclosed are a speech retrieval apparatus and a speech retrieval method for searching, in an audio file database, for one or more target audio files by using one or more input search terms. The speech retrieval apparatus comprises a related document obtaining unit configured to search, in a related document database where documents related to audio files in the audio file database are stored, for one or more related documents by using the search terms; a correspondence audio file obtaining unit configured to search, in the audio file database, for one or more correspondence audio files corresponding to the obtained related documents; and a speech-to-speech search unit configured to search, in the audio file database, for the target audio files by using the obtained correspondence audio files.

Abstract: Disclosed are a speech retrieval apparatus and a speech retrieval method for searching, in a speech database, for an audio file matching an input search term by using an acoustic model serialization code, a phonemic code, a sub-word unit, and a speech recognition result of speech. The speech retrieval apparatus comprises a first conversion device, a first division device, a first speech retrieval unit creation device, a second conversion device, a second division device, a second speech retrieval unit creation device, and a matching device. The speech retrieval method comprises a first conversion step, a first division step, a first speech retrieval unit creation step, a second conversion step, a second division step, a second speech retrieval unit creation step, and a matching step.