Abstract: According to one embodiment, a communication system includes a base station based on a communication standard and an allocation information generation device from the base station. The allocation information generation device comprises first and second generators. The first and the second generators output first and second allocation information until a first time elapses after an allocation request is received. The allocation information generation device transmits, to the base station, one of the first and the second allocation information which satisfies a constraint defined by the communication standard.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: According to one embodiment, a calculation device includes a processing device configured to perform a processing procedure. The processing procedure includes a first update of a first vector, a second update of a second vector, and a third update of a third vector. The first update includes updating the first vector using the second vector and the third vector. The second update includes updating the second vector using the first vector. The processing device is configured to output at least one of the first vector obtained after repeating the processing procedure or a function of the first vector obtained after the repeating the processing procedure.

Abstract: According to one embodiment, a calculation device includes a processing device configured to perform a processing procedure. The processing procedure includes a first update of a first vector, a second update of a second vector, and a third update of a third vector. The first update includes updating the first vector using the second vector and the third vector. The second update includes updating the second vector using the first vector. The processing device is configured to output an output of at least one of the first vector obtained after repeating the processing procedure or a function of the first vector obtained after the repeating the processing procedure.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: According to an embodiment, a calculation device includes a memory and one or more processors coupled to the memory. The one or more processors are configured to: repeat a processing procedure including a first variable update and a second variable update; and display an image on a display device. The one or more processors are further configured to: while repeating the processing procedure, output values of the updated first variables xi and second variables yi, and when repetition of the processing procedure is finished, output a sign of the last updated first variable xi; and display on the display device a monitoring image representing a temporal change in at least some of the first variables xi and the second variables yi, based on the output values of the first variables xi and the second variables yi.

Abstract: An information processing device includes a storage unit and a processing circuit. The storage unit is configured to store a first variable and a second variable. The processing circuit is configured to update the first variable based on the second variable, which corresponds to the first variable, weight the first variable with a first coefficient and add the weighted first variable to the corresponding second variable, calculate a problem term using the plurality of first variables, add the problem term to the second variable, calculate a first correction term including a product of a constraint term and a second coefficient, add the first correction term to the second variable, and increase absolute values of the first coefficient and the second coefficient depending on the number of updates. The constraint term is based on a constraint condition and has the first variable as an argument.

Abstract: According to one embodiment, a processor calculates values of variables in each step of a repetitive calculation using values of the variables calculated in a previous step, and determines whether a difference between the values of the variables calculated in each step and a particular value is larger than a first value. The processor corrects a value of the variables calculated in the previous step to be close to the particular value and calculates a value of the variables in the current step using a corrected value of the variables if the difference is larger than the first value.

Abstract: According to one embodiment, an information processing device includes a first storage and a first processing circuit. The first storage is configured to store constraint data which includes a constraint of a combinatorial optimization problem expressed in a formal language. The first processing circuit is configured to generate logical expression data from the constraint data and generate a penalty term data including a penalty term having a binary variable parameter by converting the logical expression data.

Abstract: According to one embodiment, an information processing device includes a first processing circuit and a second processing circuit. The first processing circuit is configured to update a third vector based on basic equations. Each of the basic equations is a partial derivative of an objective function with respect to either of the variables in the objective function. The second processing circuit is configured to update the element of the first vector and update the element of the second vector. The element of the first vector smaller than a first value is set to the first value. The element of the first vector greater than a second value is set to the second value.

Abstract: A search device updates positions and momentums of a plurality of virtual particles, for each unit time from an initial time to an end time. The search device, for each unit time, calculates, for each of the particles, a position at a target time of a corresponding particle, calculates, for each of a plurality of nodes, a first accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to outgoing two or more directed edges, calculates, for each of the nodes, a second accumulative value by cumulatively adding positions at the target time of two or more particles corresponding to incoming two or more directed edges, and calculates, for each of the particles, a momentum at the target time of a corresponding particle based on the first accumulative value and the second accumulative value.

Abstract: According to one embodiment, a processor calculates values of variables in each step of a repetitive calculation using values of the variables calculated in a previous step, and determines whether a difference between the values of the variables calculated in each step and a particular value is larger than a first value. The processor corrects a value of the variables calculated in the previous step to be close to the particular value and calculates a value of the variables in the current step using a corrected value of the variables if the difference is larger than the first value.

Abstract: An automatic digital-circuit design apparatus receives a control target model written in a design description language, generates a control target model represented by a finite state machine model, stores the generated control target model, receives a control specification model written in a design description language, generates a control specification model represented by a finite state machine model, stores the generated control specification model, generates a control apparatus synthesis model by composing the generated control target model and the generated control specification model, computes controllable simulation relation, stores the computed controllable simulation relation, determines whether the control apparatus synthesis model is a model capable of providing the control, generates a permissible operation model, stores the generated permissible operation model, determines a control rule, generates a control apparatus model represented by a finite state machine, and converts the control apparatus

Abstract: An automatic digital-circuit design apparatus receives a control target model written in a design description language, generates a control target model represented by a finite state machine model, stores the generated control target model, receives a control specification model written in a design description language, generates a control specification model represented by a finite state machine model, stores the generated control specification model, generates a control apparatus synthesis model by composing the generated control target model and the generated control specification model, computes controllable simulation relation, stores the computed controllable simulation relation, determines whether the control apparatus synthesis model is a model capable of providing the control, generates a permissible operation model, stores the generated permissible operation model, determines a control rule, generates a control apparatus model represented by a finite state machine, and converts the control apparatus