International Business Machines Corporation

Toshiyuki Hama

Takayuki Yoshizumi

Hiroaki Etoh

Hiroki Yanagisawa

Hiroyuki Okano

Yohsuke Kinoe

Jayant R Kalagnanam

Chandrasekhara K Reddy

Hsiang Han Hsu

Kazuo Iwano

Stuart A Siegel

Akihiro Kishimoto

Andrew J Davenport

Ryo Hirade

Djallel Bouneffouf

Shinji Misono

Minako Matsuda

A computer implemented method of modifying molecular structures constrained by a budget is provided. The computer implemented method includes receiving from a user a subset of molecules, where each molecule is represented as a generation path, and receiving from the user an allotted budget for modifying a selection of molecules from the subset of molecules. The computer implemented method further includes testing a first molecule, and reducing the allotted budget based on the resources expended to test the first molecule. The computer implemented method further includes testing a second molecule, and reducing the allotted budget based on the resources expended to test the second molecule. The computer implemented method further includes determining a remaining amount of the allotted budget, and testing additional molecules from the subset of molecules until the allotted budget is exhausted. The computer implemented method further includes presenting the tested molecules to the user.

Optimization of multiple molecules

Feature vector feasibility is estimated by generating a target structure vector that represents numbers of a plurality of partial structures, from a feature vector of a molecule candidate, determining whether a molecule structure of the molecule candidate is feasible by using at least the target structure vector.

Feature vector feasibility estimation

Methods and systems for scheduling include implementing a schedule based on a path in a search tree having an optimal associated priority score. Each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple mutually compatible sets of orders. Each path through the search tree represents a sequence of orders and has an associated priority score.

Continuous caster scheduling with template driven search

Molecular structure generation with substructure representations is provided. The computer-implemented method, comprises: selecting, by a device operatively coupled to a processor, a vertex in an existing graph of a molecular structure; replacing, by the device, the selected vertex with a sub-structure representation of a molecule, the sub-structure representation including two or more vertices; connecting, by the device, a new vertex to the sub-structure representation in the existing graph to generate a new graph; labeling, by the device, each of a plurality of vertices of the new graph by a canonical labeling method; and determining, by the device, whether a vertex that has a minimum label is the new vertex.

Molecular structure generation with substructure representations

Methods and systems for scheduling include forming a search tree. Each node in the search tree represents a scheduling unit formed from a priority queue that includes orders from multiple, mutually compatible sets of orders and wherein each path through the search tree represents a sequence of orders and has an associated priority score. The search tree is searched for a path having an optimal associated priority score. A schedule is implemented based on the path having the optimal associated priority score.

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.

Stack handling operation method, system, and computer program

System, method and computer program product for combined scheduling of two different slab sequences by a rational technique. A two-dimensional grid graph having a direct slab sequence as a first dimension and an inventory slab sequence as a second dimension is prepared by processing of a computer as a data structure represented on a memory or a hard disk drive of the computer. A processing program of the computer generates two child nodes corresponding to a direct slab and an inventory slab, in each node of the two-dimensional graph according to a predetermined algorithm. By defining an appropriate weighting function, the processing program of the computer weights edges between nodes in the two-dimensional grid graph. After forming the weighted graph on a storage device of the computer such as the memory or the hard disk drive, the processing program of the computer calculates a path from a start point to an end point as a shortest path search problem.

Process scheduling system, method, and program

A method and system for optimizing modules of a steel manufacturing process includes a plurality of manufacturing modules for a manufacturing process. Each of the modules have a plurality of steps. The plurality of modules include at least an upstream module, a casting module, and a downstream module. Each of the plurality of modules have parameters, and include at least one variable event. The variable event is adjustable for optimization of the manufacturing process while the parameters are being maintained for each of the plurality of modules. A communication system is used for exchanging information between the modules while the manufacturing process is occurring to adjust the at least one variable event for optimizing the manufacturing process.

Algorithmic framework for the integrated optimization of hot strip mill and upstream molten metal operations for a large-scale steel manufacturing plant

A system, method, and computer program for editing a production schedule. The system includes: a storage unit storing master data; a receiving unit receiving the master data; a duplicating unit generating editing data; an editing operation unit generating preliminarily-edited data based on an editing command; an identification unit identifying an item edited in the preliminarily-edited data with respect to the master data; a determination unit determining whether the inputted editing command is valid or invalid, wherein tag information is appended to an item being the same as the edited item; and an updating unit generating the preliminarily-edited data in which the editing command determined to be valid is reflected and to which the tag information is appended and updating the master data by using the generated preliminarily-edited data. A method and computer program are also provided.

System, method, and program for editing production schedule

A system for determining a processing sequence of steel plates includes a constraint storage unit for storing positional constraints that define ranges of positions into which each type of steel plate is to be inserted when the steel plates are arranged in the processing sequence; a selecting unit for preferentially selecting, as a position into which a new steel plate is to be inserted in an array of steel plates already arranged in the processing sequence, a position having a larger expectation value of the number of steel plates that can be further inserted into the array of steel plates after the insertion of the new steel plate while satisfying the positional constraints; and an inserting unit for inserting the new steel plate into the selected position and for outputting data indicating the array of steel plates after the insertion.

Technique for determining processing sequence of steel plates

A method and system for determining an array sequence of processing operations to maximize the efficiency of steel plate processing. Between two processing operations, a first sequence constraint based on a first attribute of each processing operation and a second sequence constraint based on a second attribute of each processing operation are defined. A system selects, as a cluster, at least one of processing operations having a common attribute value of the first attribute, and arranged in a sequence satisfying the second sequence constraint. The system regards the first sequence constraint as a sequence constraint between a plurality of clusters, and arranges the plurality of clusters in a sequence maximizing the efficiency of processing.

System for determining array sequence of a plurality of processing operations

System for determining array sequence of plurality of processing operations

Determining a cache hit ratio of a caching device analytically and precisely. There is provided a cache hit ratio estimating apparatus for estimating the cache hit ratio of a caching device, caching access target data accessed by a requesting device, including: an access request arrival frequency obtaining section for obtaining an average arrival frequency measured for access requests for each of the access target data; an access request arrival probability density function generating section for generating an access request arrival probability density function which is a probability density function of arrival time intervals of access requests for each of the access target data on the basis of the average arrival frequency of access requests for the access target data; and a cache hit ratio estimation function generating section for generating an estimation function for the cache hit ratio for each of the access target data on the basis of the access request arrival probability density function for the plurality of the access target data.

Cache hit ratio estimating apparatus, cache hit ratio estimating method, program, and recording medium

Using a counter of the Web server, a leave probability p, average value m and variance sof think time, and hit ratio r are calculated for a session data cacheinvolving a predetermined Web application. For a first reading of a group of reading plural session data proximate temporally, p, ma and s, and average value a of the number of data reading sessions in each group are defined. A computational expression setting meanssets a computational expression f(a)=a including p, m, s, r, p, ma and s, the computational expression for a fix point computing method having a variable a. A true value searching meanssearches an almost true value of a by the fix point computing method based on the computational expression f(a)=a. An estimation meansestimates ra based on a searched value of a.

Growing community of inventors

Tokyo, Japan

Toshiyuki Hama