Abstract: A method for selecting an action, includes reading, into a memory, a Partially Observed Markov Decision Process (POMDP) model, the POMDP model having top-k action IDs for each belief state, the top-k action IDs maximizing expected long-term cumulative rewards in each time-step, and k being an integer of two or more, in the execution-time process of the POMDP model, detecting a situation where an action identified by the best action ID among the top-k action IDs for a current belief state is unable to be selected due to a constraint, and selecting and executing an action identified by the second best action ID among the top-k action IDs for the current belief state in response to a detection of the situation. The top-k action IDs may be top-k alpha vectors, each of the top-k alpha vectors having an associated action, or identifiers of top-k actions associated with alpha vectors.

Abstract: An extraction device for extracting a sub query to be converted to a program for processing stream data continuously inputted to a database, from a query including instructions, as sub queries, to be issued to a database management system. The extraction device includes: an input unit; an operation unit for calculating the memory increase amount in a case of processing the stream data and the processing time to be reduced for each sub query, and calculating the efficiency by using them; and an extraction unit for selecting at least one sub query whose efficiency is equal to or higher than the lower limit value, integrating the memory increase amount calculated for the selected sub query, and on condition that the integrated memory increase amount is equal to or smaller than the maximum memory increase amount, extracting the selected sub query as a conversion object.

Abstract: A computer-implemented method, system, and computer program product for generating a synonym list from an existing thesaurus includes preparing a first feature vector from a natural language query and preparing a second feature vector from a result of the natural language query, determining, using a processor, whether a combination of a first feature from the first feature vector and a second feature from the second feature vector is included as a synonym pair in the existing thesaurus, and generating the synonym list by adding the combination to the synonym list when the determination is positive. The result of the natural language query may be identified by a user browsing action or by a positive feedback from a user. The method further includes reading a log which includes a single set or plural sets of the natural language query and the result of the natural language query.

Abstract: A computer-implemented method, system, and computer program product for generating a synonym list from an existing thesaurus includes preparing a first feature vector from a natural language query and preparing a second feature vector from a result of the natural language query, determining, using a processor, whether a combination of a first feature from the first feature vector and a second feature from the second feature vector is included as a synonym pair in the existing thesaurus, and generating the synonym list by adding the combination to the synonym list when the determination is positive. The result of the natural language query may be identified by a user browsing action or by a positive feedback from a user. The method further includes reading a log which includes a single set or plural sets of the natural language query and the result of the natural language query.

Abstract: A computer-implemented method, system, and article of manufacture for processing a programming language, which is able to describe data conversion of data input by an iterator. The method includes: converting iterator code of the programming language to a generator code in an intermediate language that includes a generator as an operator; reading a consumer side code; and overwriting code by inline substitution between the consumer side code and the generator code.

Abstract: An extraction method for extracting a sub query to be converted to a program for processing stream data continuously inputted to a database, from a query including instructions, as sub queries, to be issued to a database management system. The extraction method includes receiving input of the query and a lower limit value of efficiency as processing time per unit memory increase amount. A calculating operation calculates a one memory increase amount and the efficiency using the memory increase amount and the processing time to be reduced. The method selects a sub query whose calculated efficiency is equal to or higher than the lower limit value and extracts the selected sub query as a conversion object on condition that the integrated memory increase amount is equal to or smaller than the maximum memory increase amount.

Abstract: An extraction device for extracting a sub query to be converted to a program for processing stream data continuously inputted to a database, from a query including instructions, as sub queries, to be issued to a database management system. The extraction device includes: an input unit; an operation unit for calculating the memory increase amount in a case of processing the stream data and the processing time to be reduced for each sub query, and calculating the efficiency by using them; and an extraction unit for selecting at least one sub query whose efficiency is equal to or higher than the lower limit value, integrating the memory increase amount calculated for the selected sub query, and on condition that the integrated memory increase amount is equal to or smaller than the maximum memory increase amount, extracting the selected sub query as a conversion object.

Abstract: A compiler includes a register allocator for allocating registers for instructions in a program to be compiled, and a code generator for generating object code based on the register allocation results performed by the register allocator. The register allocator allocates logical registers for instructions in the program to be compiled. The register allocation further allocates, to physical registers, the logical registers that are allocated to the instructions of the program, so that the physical registers that are live at a procedure call in the program to be compiled are allocated from the bottom of the register stack.

Abstract: A computer-implemented method, system, and article of manufacture for processing a programming language, which is able to describe data conversion of data input by an iterator. The method includes: converting iterator code of the programming language to a generator code in an intermediate language that includes a generator as an operator; reading a consumer side code; and overwriting code by inline substitution between the consumer side code and the generator code.

Abstract: In a multiprocessor computer system, a lock operation is maintained with a thread using non-atomic instructions. Identifiers are assigned to each thread. Flags in conjunction with the thread identifiers are used to determine the continuity of the lock with a thread. However, in the event continuity of the lock with the thread ceases, a compare-and-swap operation is executed to reset the lock with the same thread or another thread. Similarly, in the event there has been a collision between two or more threads requesting the lock, a compare-and-swap operation is executed to assign the lock to one of the requesting threads. Accordingly, prolonged ownership of a lock operation by a thread is encouraged to mitigate use of atomic operations in granting of the lock to a non-owning thread.

Abstract: An image drawing system, an image drawing server, an image drawing method, and a computer program product that provides a three-dimensional world to a client-terminal. The method includes: providing a viewpoint in the vicinity of an avatar and creating a three-dimensional object; performing a perspective projection of a static object to create a two-dimensional panoramic image; overlaying the two-dimensional panoramic image, information on a dynamic object, and an image of the avatar; and storing the two-dimensional panoramic image. The computer program product tangibly embodies instructions which when implemented causes a computer to execute the steps of the method. The system includes: a three-dimensional object creation unit; a panoramic image creation unit; a drawing unit for overlaying; and a panoramic image storage unit. The server includes: a reception unit; a three-dimensional object creation unit; a panoramic image creation unit; and a transmission unit.

Abstract: A compiler includes a register allocator for allocating registers for instructions in a program to be compiled, and a code generator for generating object code based on the register allocation results performed by the register allocator. The register allocator allocates logical registers for instructions in the program to be compiled. The register allocation further allocates, to physical registers, the logical registers that are allocated to the instructions of the program, so that the physical registers that are live at a procedure call in the program to be compiled are allocated from the bottom of the register stack.

Abstract: According to the present invention, a secret key cryptosystem and tamper-proof hardware are used to realize a pseudo-public key cryptosystem at a low cost. A trap-door one-way function is substantially realized with the use of tamper-proof hardware. Each user performs communication using equipment provided with hardware having the same capabilities described below. Such hardware retains association between an ID and a key. In response to a request from a user, the hardware issues and stores an ID, and it can perform decryption and generation of a MAC (message authentication code) with a key associated with the ID. A user publishes his ID. When performing encryption, a message sender encrypts a message using the published ID. A third person can perform decryption with the ID only by analyzing the mechanism in the hardware. However, the hardware has a capability of destroying itself when such an act is attempted.

Abstract: Assigns suitable registers to a plurality of variables. A compiler converts a source program into instructions for a processor having: a simultaneously used variable acquisition section which obtains, with respect to each of a plurality of variables used in the source program, some of the other variables used simultaneously with the variable; an allocation sequence generation section which generates a plurality of allocation sequences between the plurality of variables to allocate each variable to one of the plurality of registers different from those to which some of the other variables used simultaneously with the variable are allocated; an allocation priority acquisition section which obtains allocation priorities indicating to which one of the plurality of registers each variable is allocated with priority; and a register allocation section which allocates the variables to registers in accordance with an allocation sequence selected on the basis of the allocation priorities.

Abstract: A personal service support method for assisting an inquiry about a user operation in a virtual world, a computer program product, and a system for the same. The method includes: storing a dialog between a user and an agent; connecting the dialog in a list structure with another dialog in the list structure to produce a created dialog in a branch tree structure; and recording the created dialog in the branch tree structure. The computer program product tangibly embodies instructions which when implemented causes a computer to execute the steps of the method. The system includes: a dialog storage unit which stores a dialog between a user and an agent; and a dialog creating unit which connects the dialog in the list structure with another dialog in the list structure to create a dialog in a branch tree structure.

Abstract: A computer for a service provider receives from each member of two groups who is a user of a service via a mediating computer, a priority list in which member IDs of the other group is permuted in the priority order of a user and processing information that are encrypted so as not to be decrypted by the mediating computer. The ID of the priority list is encrypted with an encrypting key that is common to all members. The computer for a service provider performs matching, with ID in the priority list being left encrypted when the list is decrypted. The computer for a service provider decrypts the processing information, makes it in a state in which the matching result can be decrypted based on the processing information by only a person concerned, and sends it to each member via the mediating computer.

Abstract: A method of collecting data into a server from multiple client computers is provided as a first aspect of the invention. The method includes the steps of: reconstructing a collection network in a tree structure having the server acting as a highest node and the multiple client computers acting as child nodes every time the data is collected; the server broadcasting a parent-child declaration to nodes placed at the lower level; and each of the nodes transferring data to a node placed at the higher level.

Abstract: A computer for a service provider receives from each member of two groups who is a user of a service via a mediating computer, a priority list in which member IDs of the other group is permuted in the priority order of a user and processing information that are encrypted so as not to be decrypted by the mediating computer. The ID of the priority list is encrypted with an encrypting key that is common to all members. The computer for a service provider performs matching, with ID in the priority list being left encrypted when the list is decrypted. The computer for a service provider decrypts the processing information, makes it in a state in which the matching result can be decrypted based on the processing information by only a person concerned, and sends it to each member via the mediating computer.

Abstract: An exclusion controller which allows an information processing unit to acquire a contended resource to the exclusion of the other information processing units includes a plurality of non-prioritized information processing units mutually exclusively acquiring a non-prioritized exclusion right, which indicates a candidate for acquiring the contended resource, by a first process. The exclusion controller further includes a prioritized information processing unit acquiring the contended resource by a second process, which requires a shorter processing time than the first process, to the exclusion of the non-prioritized information processing unit having acquired the non-prioritized exclusion right.

Abstract: A system to controls access to a database, including: an acquiring section which acquires an access program including a plurality of database access instructions; a detecting section which detects a plurality of different tables in the database that are accessed by the plurality of access instructions; a join control section which executes a join instruction prior to the execution of the access instructions, the join instruction obtaining a result table from the database by combining the plurality of different tables detected; and a conversion control section which executes a conversion instruction prior to the execution of the plurality of access instructions, the conversion instruction extracting records from the result table for the access instructions and converting the records into the form of a structure accessible for the plurality of access instructions.