Abstract: A catalyst for gas-phase catalytic ammoxidation reaction, the catalyst containing a metal oxide and a silica carrier carrying the metal oxide, wherein the metal oxide contains molybdenum, and an interaction coefficient C between water vapor and the catalyst for gas-phase catalytic ammoxidation reaction, the interaction coefficient C being derived by subjecting the catalyst for gas-phase catalytic ammoxidation reaction to a water vapor adsorption measurement, is 1 or more and 30 or less.

Abstract: A hypothesis evaluation system evaluates a hypothesis for a work efficiently and appropriately, and is configured to store, for a work whose efficiency is desired to be improved, a hypothesis defined by using, as elements, one or more combinations of a feature amount representing the work and a condition imposed on the feature amount, and a target index of the efficiency, generate a plurality of measures in which a value of the feature amount is set around a threshold that determines a range of the feature amount so as to satisfy the condition, store an estimation value of the efficiency for each of the measures, the estimation value being acquired by executing the measure, compare the estimation value with the target index to determine whether or not the hypothesis is established for each of the measures, and set the threshold based on a result of the determination.

Abstract: The present invention provides a catalyst comprising molybdenum, bismuth, and iron, wherein a reduction rate is in a range of 0.20 to 5.00%.

Abstract: A shipping operation assisting system generates feature amount data representing a relationship between a feature amount of a shipping operation and a working hour on the basis of operation record data representing a record of a plurality of shipping operations each of which is constituted by one or more of picking operations. The system refers to the feature amount data and generates a prediction model for predicting a working hour of a shipping operation corresponding to the operation instruction from the feature amount of the operation instruction on the basis of the generated feature amount corresponding to a sample point and the working hour corresponding to the feature amount. The system generates a sample point based on a distance with respect to an insufficient area where sample points in a feature amount space are insufficient when the prediction model is generated.

Abstract: A DB server 2 stores work achievement table 210 indicating a disposition target related to a work, an actual disposition place where the disposition target is disposed, and actual work time taken for the work for each work and location information 220 indicating a plurality of disposition places where the disposition targets can be disposed. A control portion 330 acquires a mutual action search policy including a plurality of mutual action emergence patterns indicating a relation between the two disposition places influencing the work time taken for the work. A generating portion (an item combination extraction portion 350, a mutual action set search portion 360, and a disposition change optimization portion 370) generates a disposition plan indicating a plan of disposition place where the disposition target is disposed on the basis of the work achievement information, the location information, and the mutual action search policy.

Abstract: The catalyst for ammoxidation of the present invention contains a catalyst particle containing molybdenum, bismuth and iron, and has a ratio of hollow particles of 23% or less. Furthermore, a method for producing the catalyst for ammoxidation includes a step of preparing a catalyst precursor slurry containing molybdenum, bismuth and iron and having a solid concentration of 30% by mass or less, a step of spray-drying the catalyst precursor slurry at a drier inlet temperature of 120° C. to 240° C. to thereby obtain a dried particle and a step of calcining the dried particle at 500 to 750° C.

Abstract: An index tree search method, by a computer, for searching an index tree included in a database provided by the computer which includes processors executing a plurality of threads and a memory, the index tree search method comprising: a first step of allocating, by the computer, search ranges in the index tree to the plurality of threads; a second step of receiving, by the computer, a search key; a third step of selecting, by the computer, a thread corresponding to the received search key; and a fourth step of searching, by the computer, the index tree with the selected thread using the received search key.

Abstract: A computer for executing processing through use of a database, the computer comprising: a processor including a cache memory; and a non-volatile memory coupled to the processor, the non-volatile memory having the database constructed thereon. The computer comprises: a database management module configured to execute processing on the database; and a write processing module configured to write data stored in the cache memory into the database. The write processing module writes data that is operated in the transaction processing into the database among data stored in the cache memory, in a case of receiving a commit request for transaction processing that uses the database.

Abstract: A system for planning where to place merchandise items is configured to create a placement change plan of merchandise; create first virtual work instruction data reflecting a shipment frequency prediction of merchandise on work instruction data relevant to past shipment of merchandise and second virtual work instruction data with placement of merchandise reflecting a placement change plan of merchandise; calculate a predicted value of reduction in shipment working hours from the first and second virtual work instruction data; calculate placement change working hours to perform a placement change plan of merchandise; subtract the placement change working hours from the predicted value of reduction in shipment working hours, thus obtaining a difference; and adopt a placement change plan of merchandise if the difference fulfills a condition of being at or above a certain threshold which is positive or review the placement change plan of merchandise unless fulfilling the condition.

Abstract: A database management system generates a log each transaction during execution of a plurality of transactions and stores the generated logs in log storage areas. The database management system records sequence numbers of logs at least in the generated logs of transactions belonging to a set of transactions of which results are different depending on a transaction execution order.

Abstract: Provided is a log management method in which, with a computer system provided with a processor, a memory, and a storage device, the processor executes a prescribed process and stores in the storage device a log which includes a description of the process, said method comprising a first step of the processor generating the log which includes the description of the prescribed process, a second step of the processor writing the log to a log file of the storage device, and a third step of the processor determining the end of the log region which stores the log and writing same to the log file of the storage device.

Abstract: Provided is a log management method in which, with a computer system provided with a processor, a memory, and a storage device, the processor executes a prescribed process and stores in the storage device a log which includes a description of the process, said method comprising a first step of the processor generating the log which includes the description of the prescribed process, a second step of the processor writing the log to a log file of the storage device, and a third step of the processor determining the end of the log region which stores the log and writing same to the log file of the storage device.

Abstract: A computer for executing processing through use of a database, the computer comprising: a processor including a cache memory; and a non-volatile memory coupled to the processor, the non-volatile memory having the database constructed thereon. The computer comprises: a database management module configured to execute processing on the database; and a write processing module configured to write data stored in the cache memory into the database. The write processing module writes data that is operated in the transaction processing into the database among data stored in the cache memory, in a case of receiving a commit request for transaction processing that uses the database.

Abstract: An index tree search method, by a computer, for searching an index tree included in a database provided by the computer which includes processors executing a plurality of threads and a memory, the index tree search method comprising: a first step of allocating, by the computer, search ranges in the index tree to the plurality of threads; a second step of receiving, by the computer, a search key; a third step of selecting, by the computer, a thread corresponding to the received search key; and a fourth step of searching, by the computer, the index tree with the selected thread using the received search key.

Abstract: A database management system generates a log each transaction during execution of a plurality of transactions and stores the generated logs in log storage areas. The database management system records sequence numbers of logs at least in the generated logs of transactions belonging to a set of transactions of which results are different depending on a transaction execution order.

Abstract: There is provided a parallel computer system for performing barrier synchronization using a master node and a plurality of worker nodes based on the time to allow for an adaptive setting of the synchronization time. When a task process in a certain worker node has not been completed by a worker determination time, the particular worker node performs a communication to indicate that the process has not been completed, to a master node. When the communication has been received by a master determination time, the master node performs a communication to indicate that the process time is extended by a correction process time, in order to adjust and extend the synchronization time. In this way, it is possible to reduce the synchronization overhead associated with the execution of an application with a relatively large variation in the process time from a synchronization point to the next synchronization point.

Abstract: An I/O processing control apparatus integrates, from among a plurality of unprocessed I/O requests, two or more I/O requests, which are for the same type of I/O process and have two or more noncontiguous areas as I/O destinations, into one I/O request targeted at one continuous area comprising the above-mentioned two or more noncontiguous areas, and executes I/O processing in relation to the storage device on the basis of the integrated I/O request.

Abstract: There is provided a parallel computer system for performing barrier synchronization using a master node and a plurality of worker nodes based on the time to allow for an adaptive setting of the synchronization time. When a task process in a certain worker node has not been completed by a worker determination time, the particular worker node performs a communication to indicate that the process has not been completed, to a master node. When the communication has been received by a master determination time, the master node performs a communication to indicate that the process time is extended by a correction process time, in order to adjust and extend the synchronization time. In this way, it is possible to reduce the synchronization overhead associated with the execution of an application with a relatively large variation in the process time from a synchronization point to the next synchronization point.