Abstract: An optimization apparatus includes a compression unit, a storage unit, a decoding unit, and an annealing unit. The compression unit outputs compressed coefficient data in which a coefficient matrix including coupling coefficients, each of which indicates a coupling strength between bits of an Ising model obtained by converting a calculation target problem, is compressed on the basis of a symmetry property or a pattern property of the coefficient matrix. The storage unit holds the compressed coefficient data outputted by the compression unit. The decoding unit decodes the compressed coefficient data stored in the storage unit to obtain the coupling coefficients. The annealing unit performs a simulated annealing operation by using the coupling coefficients obtained by the decoding unit.

Abstract: An apparatus of searching for a solution to a problem represented by an energy function including state variables representing a state of an Ising model, the apparatus including: a memory configured to store a plurality of tabu lists indicating a state variable for which change of a value is suppressed among the state variables; and a processor coupled to the memory, the processor being configured to perform processing, the processing including: selecting one tabu list from a plurality of tabu lists, in accordance with a current state of the Ising model in searching for the solution; selecting a first state variable from the state variables based on an amount of change of a value of the energy function in a case where a value of each of the state variables is changed from the current state and the selected tabu list; and changing a value of the first state variable.

Abstract: A problem is inputted into an operation unit. A computation unit searches for a ground state of an Ising model. A management unit converts the problem inputted from the operation unit to the Ising model, inputs the Ising model produced by conversion and initial operating conditions into the computation unit, and has the computation unit search for the ground state using overall operating conditions produced by changing the initial operating conditions based on a result of the computation unit searching for the ground state using the initial operating conditions.

Abstract: A processor holds the second change value of the energy value which has been calculated by the processor and corresponds to each of a predetermined number of state transitions, in entries corresponding to the input identification information k. When the processor stochastically determines whether or not any of the state transitions is accepted, by a relative relation between the first change value and thermal excitation energy based on the temperature value, the first change value of the energy value calculated by the processor, and a random number value, the processor stochastically determines whether or not any of the state transitions is accepted, by adding the offset value y to the first change value. The offset value y is obtained by multiplying the second change value held by any entry selected from the entries based on the input identification information k, by coefficient information ?.

Abstract: An optimization device includes: search circuits, each configured to: hold values of state variables included in an evaluation function representing an energy value; calculate a change value of the energy value for each of state transitions which occurs in response to a change in one of the state variables; and determine stochastically whether to accept one of the state transitions according to a relative relationship between the change value of the energy value and thermal excitation energy, based on a set temperature value, the change value, and a random number value; and a controller configured to: acquire statistical information regarding a transition of a temperature value in each search circuit; determine a temperature value to be set in each search circuit based on the statistical information; set the temperature value for each search circuit; and exchange the temperature value or the values of the state variables between the search circuits.

Abstract: An information processing apparatus includes a memory and a processor. The processor configured to acquire, among a plurality of solutions, a first solution corresponding to a best value among values of a plurality of the energy functions corresponding to the plurality of solutions, each of the plurality of solutions being represented by a value of each of a plurality of state variables included in an energy function, generate a first state variable string based on the first solution, and search for a solution with the first state variable string as a start state.

Abstract: An optimization device includes M-stage arithmetic processing circuits connected in a ring shape, wherein each circuit determines whether to permit updating for each of first bits, a number of the first bits being obtained by dividing a number of second bits corresponding to all spins of an Ising model by M; selects one update candidate bit from among update permission bits; and updates a value of any one of the second bits based on identification information supplied from a last stage circuit to a top stage circuit, wherein each circuit other than the top stage circuit selects identification information of the one update candidate bit at a first probability obtained by dividing a number of the update permission bits by a sum of the number of the update permission bits and a number supplied from a previous stage circuit, and supplies the selected identification information to a subsequent stage circuit.

Abstract: A control apparatus is communicably connected to a plurality of processing apparatuses, including a processor configured to determine whether the sum of an execution time of a first process, an execution time of a second process, and a time taken for a first processing apparatus among the plurality of processing apparatuses to rewrite a logic for executing the first process to a logic for executing the second process is equal to or smaller than a unit time; determine whether a data traffic between the plurality of processing apparatuses is equal to or smaller than a threshold when the first processing apparatus executes the first and second processes, and cause the first processing apparatus to execute the first and second processes when it is determined that the sum is equal to or smaller than the unit time and the data traffic is equal to or smaller than the threshold.

Abstract: An apparatus includes a distribution generator configured to determine a combination of each of first regions in a first image and a corresponding one of second regions in a second image based on feature amounts of the first regions and feature amounts of the second regions, and generate first distribution information indicating distribution of the difference between a first position of a first region in the first image and a second position of a second region in the second image; a similarity generator configured to generate second distribution information indicating distribution of the difference between the first position and the second position, calculate a first similarity between the first image and the second image, and calculate a second similarity between the first image and the second image; and a processor configured to generate a comparison result by comparing the first image and the second image.

Abstract: A control method for an optimization system, the optimization method includes calculating, by an optimization apparatus, an initial temperature based on a maximum value of an energy increase acquired from a weight value indicating the presence of coupling between one neuron and a plurality of other neurons excluding the one neuron; executing, by an information processing apparatus, a search for a ground state and outputs a plurality of local solutions; and calculating, by an information processing apparatus, a corrected temperature based on a maximum rise value of rise values of energy values corresponding to a plurality of state variables changed by 1 bit between state variables corresponding to the local solutions with respect to the result of arrangement of energy in increasing order corresponding to the plurality of local solutions output from the optimization apparatus.

Abstract: An optimization device includes: search circuits, each configured to: hold values of state variables included in an evaluation function representing an energy value; calculate a change value of the energy value for each of state transitions which occurs in response to a change in one of the state variables; and determine stochastically whether to accept one of the state transitions according to a relative relationship between the change value of the energy value and thermal excitation energy, based on a set temperature value, the change value, and a random number value; and a controller configured to: acquire statistical information regarding a transition of a temperature value in each search circuit; determine a temperature value to be set in each search circuit based on the statistical information; set the temperature value for each search circuit; and exchange the temperature value or the values of the state variables between the search circuits.

Abstract: A processor holds the second change value of the energy value which has been calculated by the processor and corresponds to each of a predetermined number of state transitions, in entries corresponding to the input identification information k. When the processor stochastically determines whether or not any of the state transitions is accepted, by a relative relation between the first change value and thermal excitation energy based on the temperature value, the first change value of the energy value calculated by the processor, and a random number value, the processor stochastically determines whether or not any of the state transitions is accepted, by adding the offset value y to the first change value. The offset value y is obtained by multiplying the second change value held by any entry selected from the entries based on the input identification information k, by coefficient Information ?.

Abstract: An optimization device includes M-stage arithmetic processing circuits connected in a ring shape, wherein each circuit determines whether to permit updating for each of first bits, a number of the first bits being obtained by dividing a number of second bits corresponding to all spins of an Ising model by M; selects one update candidate bit from among update permission bits; and updates a value of any one of the second bits based on identification information supplied from a last stage circuit to a top stage circuit, wherein each circuit other than the top stage circuit selects identification information of the one update candidate bit at a first probability obtained by dividing a number of the update permission bits by a sum of the number of the update permission bits and a number supplied from a previous stage circuit, and supplies the selected identification information to a subsequent stage circuit.

Abstract: A storage unit holds context information including a minimum energy state, a current state, a minimum energy, a current energy, a temperature, and a bias about each of a plurality of trials. A control unit includes a counting unit counting update processing repeated in each trial and another counting unit counting trials performed. The control unit repeats update control about the update processing a certain number of times in each trial on the context information, based on spin information and an update target energy change. A calculation unit calculates energy change candidates based on a generated random number, a stored weight, the spin information, and the current state and temperature updated by the update control. A selection unit selects the update target energy change from the candidates calculated by the calculation unit based on a random number.

Abstract: An optimization apparatus includes a compression unit, a storage unit, a decoding unit, and an annealing unit. The compression unit outputs compressed coefficient data in which a coefficient matrix including coupling coefficients, each of which indicates a coupling strength between bits of an Ising model obtained by converting a calculation target problem, is compressed on the basis of a symmetry property or a pattern property of the coefficient matrix. The storage unit holds the compressed coefficient data outputted by the compression unit. The decoding unit decodes the compressed coefficient data stored in the storage unit to obtain the coupling coefficients. The annealing unit performs a simulated annealing operation by using the coupling coefficients obtained by the decoding unit.

Abstract: A problem is inputted into an operation unit. A computation unit searches for a ground state of an Ising model. A management unit converts the problem inputted from the operation unit to the Ising model, inputs the Ising model produced by conversion and initial operating conditions into the computation unit, and has the computation unit search for the ground state using overall operating conditions produced by changing the initial operating conditions based on a result of the computation unit searching for the ground state using the initial operating conditions.

Abstract: A storage unit holds context information including a minimum energy state, a current state, a minimum energy, a current energy, a temperature, and a bias about each of a plurality of trials. A control unit includes a counting unit counting update processing repeated in each trial and another counting unit counting trials performed. The control unit repeats update control about the update processing a certain number of times in each trial on the context information, based on spin information and an update target energy change. A calculation unit calculates energy change candidates based on a generated random number, a stored weight, the spin information, and the current state and temperature updated by the update control. A selection unit selects the update target energy change from the candidates calculated by the calculation unit based on a random number.

Abstract: An apparatus includes a distribution generator configured to determine a combination of each of first regions in a first image and a corresponding one of second regions in a second image based on feature amounts of the first regions and feature amounts of the second regions, and generate first distribution information indicating distribution of the difference between a first position of a first region in the first image and a second position of a second region in the second image; a similarity generator configured to generate second distribution information indicating distribution of the difference between the first position and the second position, calculate a first similarity between the first image and the second image, and calculate a second similarity between the first image and the second image; and a processor configured to generate a comparison result by comparing the first image and the second image.

Abstract: A video encoding apparatus determines whether to substitute all quantized coefficients in a target coefficient group by zero, on the assumption that the subsequent coefficient groups include one or more quantized coefficients that are not zero, the target coefficient group being sequentially selected from the lowest-frequency among coefficient groups included in a block serving as a unit in orthogonal transform, and determines, for each coefficient group sequentially from the lowest-frequency coefficient group, whether to update, to a first quantized-coefficient candidate that is not zero and corresponding to the highest frequency in the coefficient group on the assumption that all the quantized coefficients in the subsequent coefficient groups are zero, a second quantized-coefficient candidate, which is already obtained, based on comparison between the first candidate and the second candidate in terms of a comparison cost obtained by subtracting a coding error related to the subsequent coefficient groups fro

Abstract: A coding apparatus includes identifying circuitry that identifies based on a count of frames coded referring to a reference frame among a series of frames, a count of vectors specifying search positions on the reference frame of a given frame when detection is performed for a motion vector of a block of the given frame to be coded among the series of frames; and determining circuitry that determines based on the member count and a maximum read data volume that can be read in of the reference frame per unit time, for a single given frame of the series of frames, a first maximum read data volume for a single given frame when image data is read in of a search range that includes a search position specified on the reference frame by a motion vector of a block on a reduced image obtained by reducing the given frame.