Abstract: A method includes obtaining a plurality of clauses associated with a plurality of logical variables, each of the clauses consisting of a weight and a disjunction of one or more literals of the logical variables, detecting conditions associated with one or more inference rules, and simplifying the plurality of clauses on the basis of the detecting.

Abstract: Methods and apparatus are provided for estimating anomalous sensors. The apparatus includes a target data acquiring to acquire a plurality of sets of target data serving as an examination target, each set of target data being output by a plurality of sensors. The apparatus further includes a calculating section calculate, for each of a plurality of sensor groups such that each sensor group includes at least two sensors among the plurality of sensors, a degree of difference of a target data distribution of the plurality of sets of target data relative to a reference data distribution of output from the sensor group. The apparatus additionally includes an estimating section to estimate one or more sensors among the plurality of sensors to be a source of outlierness, based on a calculation result of the calculating section.

Abstract: A computer-implemented method for solving a MAX SAT instance in provided in which a MAX SAT instance is transformed into a MAX 3SAT instance. The MAX 3SAT instance is transformed into a MAX 2SAT instance which is solved for an optimum solution. A solution to the MAX SAT instance is recovered from the MAX 2SAT optimum solution.

Abstract: A method, apparatus and computer program product for solving a mixed integer programming problem. The apparatus includes a generating section configured to generate a relaxed mixed integer programming problem by relaxing each of only a part of integer variables of the mixed integer programming problem to a continuous variable, a solver configured to solve the relaxed mixed integer programming problem, and a determining section configured to determine, using a processor, a feasible solution of the mixed integer programming problem based on a solution of the relaxed mixed integer programming problem.

Abstract: A method includes hierarchically identifying occurrences of some of the words in the set of sentences; creating a first index for each of some of the words based on the upper hierarchy of occurrences identified for each word; receiving input of a queried word; hierarchically identifying occurrences of the queried word in the set of sentences; creating a second index based on the upper hierarchy of occurrences identified for the queried word; comparing the first index and the second index to calculate an estimated value for the number of occurrences of a word in the neighborhood of the queried word; and calculating the actual value of the number of occurrences of a word in the neighborhood of the queried word based on an upper hierarchy and lower hierarchy of the occurrences on condition that the estimated value is equal to or greater than a predetermined number.

Abstract: Methods and systems for resource segmentation include dividing a time horizon to be partitioned into time slots based on a minimum partition size; determining resource usage for multiple virtual machines in each of the plurality of time slots; determining a set of partitioning schemes that includes every possible partitioning of the time slots into a fixed number of partitions; for each partitioning scheme in the set of partitioning schemes, determining a cost using a processor based on a duration of each partition and a resource usage metric; and selecting a partitioning scheme that has a lowest cost.

Abstract: A method, apparatus and computer program product for solving a mixed integer programming problem. The apparatus includes a generating section configured to generate a relaxed mixed integer programming problem by relaxing each of only a part of integer variables of the mixed integer programming problem to a continuous variable, a solver configured to solve the relaxed mixed integer programming problem, and a determining section configured to determine, using a processor, a feasible solution of the mixed integer programming problem based on a solution of the relaxed mixed integer programming problem.

Abstract: A method includes hierarchically identifying occurrences of some of the words in the set of sentences; creating a first index for each of some of the words based on the upper hierarchy of occurrences identified for each word; receiving input of a queried word; hierarchically identifying occurrences of the queried word in the set of sentences; creating a second index based on the upper hierarchy of occurrences identified for the queried word; comparing the first index and the second index to calculate an estimated value for the number of occurrences of a word in the neighborhood of the queried word; and calculating the actual value of the number of occurrences of a word in the neighborhood of the queried word based on an upper hierarchy and lower hierarchy of the occurrences on condition that the estimated value is equal to or greater than a predetermined number.

Abstract: A method for searching transition routes from an initial state of a plurality of stackable items to a target state by a computer at predetermined conditions includes connecting between transitionable states at an edge by a single handling operation transitioning from the initial state to the target state, to generate a state space graph; evaluating a lower bound of handling operation cost from a certain state to the target state, based on both the stacking sequence of the plurality of items in the certain state and the stacking sequence of the plurality of items in the target state; and searching a route from the initial state to the target state where the handling operation cost is minimal on the state space graph using a heuristic search algorithm based on the lower bound.

Abstract: A method for searching transition routes from an initial state of a plurality of stackable items to a target state by a computer at predetermined conditions includes connecting between transitionable states at an edge by a single handling operation transitioning from the initial state to the target state, to generate a state space graph; evaluating a lower bound of handling operation cost from a certain state to the target state, based on both the stacking sequence of the plurality of items in the certain state and the stacking sequence of the plurality of items in the target state; and searching a route from the initial state to the target state where the handling operation cost is minimal on the state space graph using a heuristic search algorithm based on the lower bound.

Abstract: Methods and systems for searching a path for a vertex include iteratively removing from consideration points in a path, until a number of remaining points is below a path size threshold. The iterative removal includes determining, for each of two endpoints in a path, a lower bound for a shortest path distance from each respective endpoint to a target vertex and removing from consideration points closer to each respective endpoint than the respective lower bound to produce a shortened path. The shortened path is searched with a processor to determine whether the vertex is in the shortened path.

Abstract: A method includes hierarchically identifying occurrences of some of the words in the set of sentences; creating a first index for each of some of the words based on the upper hierarchy of occurrences identified for each word; receiving input of a queried word; hierarchically identifying occurrences of the queried word in the set of sentences; creating a second index based on the upper hierarchy of occurrences identified for the queried word; comparing the first index and the second index to calculate an estimated value for the number of occurrences of a word in the neighborhood of the queried word; and calculating the actual value of the number of occurrences of a word in the neighborhood of the queried word based on an upper hierarchy and lower hierarchy of the occurrences on condition that the estimated value is equal to or greater than a predetermined number.

Abstract: Embodiments are directed to a computer implemented method of analyzing a graph having a plurality of vertices and edges to identify a subgraph of the graph, wherein the subgraph includes an exact subset. The method includes applying, by a first processor, a heuristic analysis to the graph to determine an initial subset of the graph. The method further includes applying, by either the first processor or a second processor, an exact analysis to the initial subset to determine an exact subset of the initial subset.

Abstract: A method of meeting a power demand of a power consumption unit is disclosed. A forecasted power demand for a power demand scenario for the power consumption unit is determined and a probability of occurrence of the power demand scenario is determined. An objective function for operating at least one power supply device is created that includes the forecasted power demand of the power demand scenario and the determined probability of occurrence of the power demand scenario. A substantial minimum of the objective function is located to determine a schedule for operating the at least one power supply device to meet the forecasted power demand. The at least one power supply device may be operated according to the determined schedule to meet the power demand of the power consumption unit.

Abstract: Provided is a processing apparatus that processes a problem for minimizing the sum of weights respectively associated with clauses that each become false, of a plurality of clauses each based on at least one logical variable, the processing apparatus including: a calculation unit for calculating a boundary value of the sum of the weights in a case where it is assumed that a first logical variable and a second logical variable have a predetermined logical relation; and a replacement unit for replacing the first logical variable in each of the plurality of clauses with a logical expression formed by using the second logical variable, in a case where the boundary value satisfies a predetermined condition.

Abstract: A method of meeting a power demand of a power consumption unit is disclosed. A forecasted power demand for a power demand scenario for the power consumption unit is determined and a probability of occurrence of the power demand scenario is determined. An objective function for operating at least one power supply device is created that includes the forecasted power demand of the power demand scenario and the determined probability of occurrence of the power demand scenario. A substantial minimum of the objective function is located to determine a schedule for operating the at least one power supply device to meet the forecasted power demand. The at least one power supply device may be operated according to the determined schedule to meet the power demand of the power consumption unit.

Abstract: An apparatus and method for solving mathematical programming problems. The apparatus includes a first-time-point-solution generating unit generating at least one solution to a mathematical programming problem, a second-time-point-problem generating unit generating a plurality of mathematical programming problems to be on the basis of the solution to the mathematical programming problem to be solved at the first time point, a second-time-point optimum value calculating unit calculating an optimum value of each of a plurality of mathematical programming problems to be solved at the second time point, a relational expression estimating unit estimating a relational expression between the solution to the mathematical programming problem to be solved at the first time point and an optimum value of a mathematical programming problem to be solved at the second time point, and a correcting unit correcting the mathematical programming problem at the first time point based on the relational expression.

Abstract: A method for virtual machine (VM) consolidation includes providing a plurality of resource usage levels for a set of VMs to be consolidated including a first resource usage level and a last resource usage level. An optimization problem is formulated to minimize an objective function such that any of one or more VMs of a set of VMs to be allocated to a target server may be assigned to the first resource level and remaining VMs of the set may be assigned to the last resource level while not exceeding a resource capacity of the target server. The set of VMs are allocated to a number of servers is accordance with the formulating to consolidate the set of VMs.

Abstract: Methods and systems for resource segmentation include dividing a time horizon to be partitioned into time slots based on a minimum partition size; determining resource usage for multiple virtual machines in each of the plurality of time slots; determining a set of partitioning schemes that includes every possible partitioning of the time slots into a fixed number of partitions; for each partitioning scheme in the set of partitioning schemes, determining a cost using a processor based on a duration of each partition and a resource usage metric; and selecting a partitioning scheme that has a lowest cost.

Abstract: Methods and systems for resource segmentation include dividing a time horizon to be partitioned into time slots based on a minimum partition size; determining resource usage for multiple virtual machines in each of the plurality of time slots; determining a set of partitioning schemes that includes every possible partitioning of the time slots into a fixed number of partitions; for each partitioning scheme in the set of partitioning schemes, determining a cost using a processor based on a duration of each partition and a resource usage metric; and selecting a partitioning scheme that has a lowest cost.