161results about "Computing models" patented technology

A vehicle is controlled to travel on a road, the road having a geometric design defined by one or a combination of road alignment, profile, and cross section, and different traffic situations are defined by different values ​​of parameters of the road's geometric design, traffic on the road, and traffic rules for traffic flow on the road. The vehicle is controlled by transforming a mixed-integer non-convex constrained optimization problem for the current real-world traffic situation into a mixed-integer convex optimization problem for an approximate representation of the real-world traffic situation by relaxing configuration parameters of the real-world situation and restricting corresponding constraint parameters. Current control commands for controlling one or more actuators of the vehicle are generated by solving the transformed mixed-integer convex optimization problem for the approximate representation of the real-world traffic situation.

To efficiently solve a secondary programming problem having a k-hot constraint (k is a positive integer) to a binary variable.SOLUTION: According to one preferable aspect of the present invention, an optimization method uses an information processing device including a processor, a storage device, an input device, and an output device to solve a secondary programming problem with one or more independent k-hot constraints (k is a positive integer) imposed on a binary variable. In the optimization method, the information processing device adds a correction value to a nonlinear coefficient of the binary variable with the k-not constraints imposed thereon to perform continuous value relaxation of the binary variable, and the information processing device executes solution search while satisfying the k-hot constraints by performing state transition so as to make the sum of a pair of continuous value variables with the k-hot constraints imposed thereon constant.SELECTED DRAWING: Figure 9

To efficiently search a solution in a wide search space.SOLUTION: The processing unit 12 determines a plurality of upper solutions from a plurality of solutions of the combinatorial optimization problem stored in the storage unit 11 based on an evaluation function value of each of the plurality of solutions, determines, for each of the plurality of upper solutions, a selection probability such that an upper solution having an evaluation function value closer to a highest solution among the plurality of upper solutions has a higher probability of being selected, and selects a first solution from the plurality of upper solutions according to the selection probability. A second solution different from the first solution is selected from the plurality of solutions, a third solution is generated by a path recombination method using the selected first and second solutions, and the solution search of the combination optimization problem is executed with the third solution as an initial solution.SELECTED DRAWING: Figure 1

This optimal attribute search device is configured so as to comprise: an optimal value search unit (2) that, when each of a plurality of values for an attribute of a certain target is assigned as a variable, acquires a first capture function that outputs the difference between a treatment effect, which is the effect when a certain treatment is applied to the target, and a non-treatment effect, which is the effect when the treatment is not applied to the target, and retrieves, as a first optimal value, one value from among the plurality of values for the attribute, on the basis of the output of the first capture function; an observation value acquisition unit (3) that acquires, as a first observation value, an observation value of a treatment effect corresponding to the first optimal value retrieved by the optimal value search unit (2); and a function updating unit (4) that updates the first capture function using the first observation value acquired by the observation value acquisition unit (3). The optimal value search unit (2) searches for the first optimal value on the basis of the output of the first acquisition function that has been updated by the function updating unit (4), and outputs the retrieved first optimal value.

To efficiently calculate high-quality solutions. [Solution] The information processing device outputs a solution to a target optimization problem that minimizes or maximizes a target objective function. The information processing device includes a processing unit. The processing unit provides a solver device with an approximation problem that minimizes or maximizes an approximation function based on the target objective function, and performs a solution-finding process while repeatedly updating the intermediate state of the solution. The processing unit obtains from the solver device multiple intermediate solutions based on the intermediate state of the solution calculated during the execution of the solution-finding process for the approximation problem, and a final solution representing the solution calculated after the multiple intermediate solutions in the solution-finding process for the approximation problem. For each of the multiple intermediate solutions and the final solution, the processing unit calculates an evaluation value that represents the evaluation as a solution to the target optimization problem. The processing unit outputs one of the selected solutions selected from the multiple intermediate solutions and the final solution based on the evaluation value as the solution to the target optimization problem.

To reduce arithmetic loads by using an Ising model.SOLUTION: An arithmetic method according to the present invention has: a step of acquiring job information indicating a plurality of jobs as an arithmetic target; a step of setting a plurality of divided time zones including a plurality of time slots for each time series; and a step of acquiring, for each of the divided time zones, an arithmetic result obtained by assigning, using an Ising machine, the job indicated by the job information to a time slot included in the divided time zone. In the step of acquiring an arithmetic result, there is acquired an arithmetic result obtained by assigning a job to a time slot included in a divided time zone and a succeeding time slot on condition that a job which is not assigned to a time slot included in the divided time zone is assigned to the succeeding time slot which is a time slot immediately after the divided time zone.SELECTED DRAWING: Figure 8

The use of data held by each organization without disclosing the contents to others. [Solution] A method for use in a system including a plurality of user terminals each having a control unit and a memory unit for storing sensitive data including a plurality of records, a data processing device having a calculation unit in a secure area, a key management device for managing a system key, and a memory device for storing a machine learning model encrypted using the system key, the method comprising: aggregating data held by the plurality of user terminals in the secure area to create combined data; training a machine learning model using the combined data to create a model with higher predictive accuracy than when training is performed using only the user's own data; and, by using the machine learning model in the secure area to perform inference based on the combined data, predictions can be made with higher accuracy than when training is performed using only the user's own data.

This information processing device receives an input of a gain table indicating the extent to which a cooperation task consisting of a combination of actions is performed, such input received for each of the combination patterns of the actions that can be taken by each performer in the cooperation task. Thereafter, the information processing device excludes, from the input gain table, an action that has no possibility of improving the performance of the cooperation task (first exclusion step). Next, the information processing device excludes, from the gain table resulting from the execution of the first exclusion step, patterns in which there is only one combination of the actions that improves the performance of the cooperation task (second exclusion step). Subsequently, if there are patterns with similar combinations of the actions in the gain table resulting from the execution of the second exclusion step, the information processing device excludes one of the patterns among the patterns with similar combinations of the actions (third exclusion step). Consequently, the information processing device outputs the combinations of actions remaining in the gain table after the execution of the third exclusion step.

To calculate, with satisfactory accuracy and with less computing amount, an approximate Pareto solution group in a multi-purpose minimization problem.SOLUTION: A computing apparatus according to the present invention has a prediction unit, a selection unit, an update unit, a repeat control unit, and an output unit. The prediction unit executes prediction processing for predicting an increased amount of a Pareto hyper volume by using a wight pattern corresponding to each of a plurality of weight patterns. The selection unit executes selection processing for selecting a maximum weight pattern with a maximum increased amount. The update unit acquires, from a solver device, a plurality of solutions in a problem of minimizing a synthesized object function as a linear weighted sum of a plurality of object functions and a plurality of weight coefficient represented by the maximum weight patterns to add them to a candidate solution group, thereby carrying out update processing for updating the candidate solution group. The repeat control unit repeatedly controls a series of the prediction processing, the selection processing, and the update processing. The output unit outputs, as an approximate Pareto solution group, a group including a non-dominated solution of the candidate solution group.SELECTED DRAWING: Figure 6

A combinatorial optimization problem processing device 100 comprises: a 1 × 2 Mach-Zehnder optical modulator 10 for receiving and modulating a polarization clock pulse train; an optical interference circuit 20 for receiving the polarization clock pulse train modulated by the 1 × 2 Mach-Zehnder optical modulator 10 and generating a predetermined interaction in an Ising model at a period of N pulses of the polarization clock pulse train; a modulating signal generation unit 40 for generating the modulating signal of the 1 × 2 Mach-Zehnder optical modulator 10 by waveform-shaping an electric signal obtained by photoelectrically converting an optical signal output from the optical interference circuit 20 and outputting a monitor signal representing the solution of an optimization problem to the outside; and an initialization control unit 30 for creating a neutral state for interaction between elements to initialize the optical interference circuit 20, by controlling the optical interference circuit 20 to reduce attenuation of the polarization clock pulse train input to the optical interference circuit 20. The combination optimization problem of the N elements is processed in association with the Ising model.

This simulated Ising Hamiltonian generation device comprises: a simulated variable replacement unit which generates a simulated Ising Hamiltonian by replacing each variable of an Ising Hamiltonian with a simulated variable defined by a constant multiple of the sum of two or more distributed variables; and a simulated diagonal entry generation unit which generates simulated diagonal entries that are positive / negative reversal values of the total sum of second order products of the distributed variables included in each of the simulated variables.

This information processing device comprises: an acquisition unit that acquires one or a plurality of data points; a generation unit that references a plurality of data points including the data points acquired by the acquisition unit and generates, for each step, an internal polyhedron defined by the plurality of data points and an external polyhedron defined by the plurality of data points; and an identification unit that identifies, from a difference set between a set of weight vectors obtained by referencing the internal polyhedron in the current step and a set of weight vectors obtained by referencing the internal polyhedron in the previous step, a target weight vector by referencing a difference between an optimization result obtained by referencing a data point included in the internal polyhedron in the current step and an optimization result obtained by referencing a data point included in the external polyhedron in the current step.

To efficiently obtain a solution for a large-scale problem under complicated constraint conditions.SOLUTION: Generating solution candidates of an optimization problem under a condition excluding a part of constraints to be satisfied, selecting a solution candidate by solving a cost minimization problem under a constraint excluding a constraint between the solution candidates, generating a first tentative solution based on the solution candidate (preliminary optimization processing), and detecting a constraint violation for the first tentative solution; Generating, as a second tentative solution, a solution obtained by correcting the constraint violation by performing optimization calculation for minimizing the number of violation constraints under the constraint determined to be satisfied by the detection using a variable of a unit smaller than the variable used in the preliminary optimization processing (constraint violation correction processing), and using the second tentative solution as an input; A third tentative solution is generated by performing the cost minimization using only the constraints satisfied when the first tentative solution and the second tentative solution are generated as the constraints of the problem (main optimization processing), and information based on the third tentative solution is output.SELECTED DRAWING: Figure 1

To provide an information processor, an information processing method, and a program that can reduce a time required to solve a combinatorial optimization problem with a constraint condition.SOLUTION: An information processor of the present disclosure includes: a first calculation unit that calculates a flip energy change, which is an energy change when each spin flips while satisfying a constraint condition, using an objective function of a formulated model that represents energy in a combinatorial optimization problem with the constraint condition; a second calculation unit that calculates, on the basis of the flip energy change, a transition energy change, which is an energy change when transitioning to a next solution in a combinatorial optimization problem; and a third calculation unit that calculates, on the basis of the transition energy change, inverse temperature used when solving the optimization problem by pseudo-quantum annealing.SELECTED DRAWING: Figure 8

To improve a near optimum solution which can be searched for by setting a pseudo-initial solution in an Ising machine which cannot set any initial solution.SOLUTION: In order to solve the above problem, an energy function minimum value search apparatus according to the present invention has an initial solution acquiring unit, an interaction coefficient correcting unit, and a temporary solution management unit. The initial solution acquiring unit acquires a first temporary solution spin / binary variables necessary for calculation of a first energy function. The interaction coefficient correcting unit corrects an interaction coefficient of the first energy function to change it to a value which contributes to reproduction of the first temporary solution spin / binary variable, and thus generates a second energy function. The temporary solution managing unit searches for a minimum value of the second energy solution by Ising machine, and sets the spin / binary variables giving the minimum value as a second temporary solution spin / binary variable to evaluate a value of the first energy function by using the first temporary solution spin / binary variable and the second temporary solution spin / binary variable.SELECTED DRAWING: Figure 4

To realize efficient optimum solution search processing for optimization problem such as combinational optimization problem etc., by reducing a calculation amount.SOLUTION: Solutions generated in a previous stage of an optimum solution search are narrowed down. More specifically, an information processor 10 as an optimum solution search processor that executes an optimum solution search for solving an optimization problem has: an optimum solution search part 415a which generates solution candidates for the optimization problem; and an executable solution candidate search part 415b which executes the narrowing-down processing for the solution candidates corresponding to the solution candidates for the optimization problem and then specifies a solution for the optimization problem from among the narrowed-down solution candidates.SELECTED DRAWING: Figure 4

Compared to cases where weights are not included in the inverse analysis, we obtain an inverse analysis method that can derive parameters with higher accuracy. [Solution] The inverse analysis method by the inverse analysis device 10 is an inverse analysis method that performs inverse analysis using an objective function that obtains the sum of the differences between observed values ​​of predetermined types of physical quantities at multiple locations and calculated values ​​obtained by forward calculation using a mathematical model that approximates the actual field using predetermined parameters corresponding to the observed values, with weights applied to each of the multiple locations, and the parameters and weights are the targets of the inverse analysis.

This disclosure includes an information processing apparatus, an analysis method, and a computer-readable recording medium. It efficiently identifies spaces where mobile entities exhibit characteristic behaviors. The information processing apparatus analyzes the world in which the mobile entity moves. Semantic model information represents attribute information for each constituent element constituting the world. Spatial feature quantities representing spaces in the world are defined by item groups that include attribute information of at least multiple constituent elements existing in and around that space. A specific space is the space in the world where the mobile entity exhibits characteristic behaviors. Based on semantic model information related to a first world, the information processing apparatus extracts multiple constituent elements existing in and around a specific space in the first world and defines specific spatial feature quantities representing that specific space. Based on semantic model information related to a second world, the information processing apparatus extracts similar spaces from the second world that have spatial feature quantities similar to those of the specific spatial feature quantities related to the specific space in the first world.

It provides a control technique with a high degree of freedom for the available cost function. [Solution] The control device calculates the input sequence U that minimizes the cost function Φ(U). The cost function Φ(U) is a probability distribution Q corresponding to the initial state x0 and the input sequence U. U The probability distribution Q of the sum of the first cost S(V;x0), which is a function of the input sequence V, and the second cost T(U), which is a function of the input sequence U. U This is the expected value under the following conditions. The first cost S(V;x0) is the state sequence X(V;x0) corresponding to the input sequence V, and the states x0, x1, ..., x T State-dependent costs corresponding to each of the following: c(x0), c(x1), ..., c(x T-1 ),φ(x T It is defined by S(V;x0)=C(X(V;x0)) using a state sequence-dependent cost C(X) that cannot be decomposed into a sum of ).

To provide an information processing system capable of generating an Ising model by converting an explanatory variable or the like into an integer based on various parameters set by a user for a function in which a value range of the explanatory variable includes a non-integer.SOLUTION: The Ising model generation section includes an integer conversion target expression selection section that selects an integer conversion target expression corresponding to the function, an integer conversion parameter management section that manages variables and parameters necessary for integer conversion of the integer conversion target expression, and an integer conversion expression generation section that generates the Ising model corresponding to the function based on the parameters necessary for the integer conversion.SELECTED DRAWING: Figure 1

The present invention provides a formulation system including an update unit and a conversion unit. The update unit updates at least one of the upper and lower bounds of an inequality constraint included in an optimization problem, such that the range of the upper and lower bounds of the inequality constraint is reduced. The conversion unit uses an auxiliary variable having a domain that is determined by the updated upper and lower bounds of the inequality constraint to convert the updated inequality constraint to an equality constraint.

A data processing apparatus includes a storage unit and a processing unit. The processing unit stores, in the storage unit, a solution found based on an evaluation function including a penalty function representing a constraint on a plurality of state variables and a constraint coefficient by which the penalty function is multiplied. The processing unit adjusts the constraint coefficient, based on the satisfaction status of the constraint for each of the plurality of solutions stored in the storage unit. The processing unit starts a search for a new solution based on the evaluation function including the adjusted constraint coefficient.

This information processing device comprises: an acquisition unit that acquires one or more data points; a generation unit that refers to a plurality of data points including the data points acquired by the acquisition means, and generates an internal polyhedron defined by the plurality of data points and an external polyhedron defined by the plurality of data points; and a specification unit that, from a set of weight vectors obtained by referring to the internal polyhedron, specifies a target weight vector by referring to the difference between an optimization result obtained by referring to the data points included in the internal polyhedron and an optimization result obtained by referring to the data points included in the external polyhedron.

Provided are an information processing method, an information processing device, and a computer program for adjusting a target trajectory generation algorithm.　In this information processing method: a target trajectory generation process is performed in which a target trajectory generation algorithm is used to generate a target trajectory representing the target value of a variable controlled during operation of a substrate processing device; the target trajectory generation algorithm includes an adjustable parameter that is not changed during the target trajectory generation process; and a parameter adjustment process is performed in which an evaluation function for evaluating the result of the target trajectory generation process is used to adjust the adjustable parameter.

To provide a technique for efficiently selecting Ising machines.SOLUTION: An Ising machine selection device includes: a feature quantity vector calculation unit configured to calculate a feature quantity vector of a graph corresponding to an Ising Hamiltonian to be selected; a first selection unit configured to select an Ising Hamiltonian Hm_0 corresponding to a feature quantity vector with the minimum distance to the feature quantity vector using a relationship R2 between an Ising Hamiltonian Hm and a feature quantity vector Xm of the graph corresponding to the Ising Hamiltonian Hm; and a second selection unit configured to select an allowable calculation time Tk_0 that is closest to an allowable time for calculating the Ising Hamiltonian to be selected and select a predetermined number of Ising machines corresponding to a value Vm_0,n,k_0 in order from the smallest one using a relationship among the Ising Hamiltonian Hm, an Ising machine In, an allowable calculation time Tk, and a value Vm,n,k of the Ising Hamiltonian Hm at the time when the allowable calculation time Tk has elapsed since the Ising machine In started calculation.SELECTED DRAWING: Figure 4

This optimization device is configured to comprise: a variable transformation part (1) that acquires a first continuous variable, which is represented as either a real number value or an integer value, and transforms the first continuous variable into a candidate solution, which is a binary variable; a variable inverse transformation part (2) that inversely transforms the candidate solution into a second continuous variable; an evaluation value calculation part (3) that calculates an evaluation value of the second continuous variable; and a transformation rule update part (4) that updates, on the basis of the evaluation value, each of the rule of transformation into a candidate solution performed by the variable transformation part 1 and the rule of inverse transformation into a second continuous variable performed by the variable inverse transformation part 2.

To provide a safety evaluation device that evaluates safety of code encryption more strictly.SOLUTION: A safety evaluation device 1 comprises: an input part 11 for receiving an input of a parameter set of an SD problem, and an upper limit of a space calculation amount; an initial processing part 12 for creating an aggregate of valid parameter sets, with respect to a Revisited MMT method; a space calculation amount estimation part 13 for calculating a space calculation amount required for storing input data, and a list for constituting solution candidates; a time calculation amount estimation part 14 for summing up a calculation time required for executing Gaussian elimination, and a calculation time required for constituting and merging a list, and multiplying the sum by an expectation loop frequency based on a correct answer probability, to calculate a time calculation amount; a condition determination part 15 for determining whether or not a space calculation amount exceeds the upper limit; and an output part 16 for outputting the minimum time calculation amount together with a parameter set that minimizes the time calculation amount, out of the aggregate, by excluding an element of which the space calculation amount has been determined to exceed the upper limit.SELECTED DRAWING: Figure 1

When converting an analysis object to an evaluation function in a QUBO format and searching for a solution, this computation program causes a computer to execute a process for reflecting respective variations in at least one element of the evaluation function to generate a plurality of evaluation functions, synthesizing the plurality of evaluation functions to generate an objective function, and searching for the solution in the objective function.