Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Determining a cache hit ratio of a caching device analytically and precisely.

Abstract: Using a counter of the Web server 10, a leave probability p1, average value m and variance s2 of think time, and hit ratio r are calculated for a session data cache 12 involving a predetermined Web application. For a first reading of a group of reading plural session data proximate temporally, p1a, ma and s2a, and average value a of the number of data reading sessions in each group are defined. A computational expression setting means 21 sets a computational expression f(a)=a including p1, m, s2, r, p1a, ma and s2a, the computational expression for a fix point computing method having a variable a. A true value searching means 22 searches an almost true value of a by the fix point computing method based on the computational expression f(a)=a. An estimation means 23 estimates ra based on a searched value of a.

Abstract: Determining a cache hit ratio of a caching device analytically and precisely.

Abstract: Using a counter of the Web server 10, a leave probability p1, average value m and variance s2 of think time, and hit ratio r are calculated for a session data cache 12 involving a predetermined Web application. For a first reading of a group of reading plural session data proximate temporally, p1a, ma and s2a, and average value a of the number of data reading sessions in each group are defined. A computational expression setting means 21 sets a computational expression f(a)=a including p1, m, s2, r, p1a, ma and s2a, the computational expression for a fix point computing method having a variable a. A true value searching means 22 searches an almost true value of a by the fix point computing method based on the computational expression f(a)=a. An estimation means 23 estimates ra based on a searched value of a.

Abstract: A method of quickly displaying a truly intended graphical object among graphical objects hidden in complex in the screen by a simple mouse operation. A group of graphical objects which are a set of a plurality of graphical objects is displayed on a display screen. Each graphical object is managed by a hierarchical structure and displayed in the display screen based on graphical definition data. When an operator selects one graphical object from a group of graphical objects, an operation tablet is generated. When the operator moves a pointer to the right on the operation tablet, graphical objects positioned fore side are changed to non-display one after another and a graphical object hiding behind them is revealed. By moving the pointer downwardly after the operator clicks the left button of a mouse, graphical objects of the same hierarchy as the focused graphical object are changed to non-display in unison so that a desired graphical object can be efficiently searched for selection.

Abstract: A method and apparatus for transforming a topological wire route to a physical wire route is described where the topological wire is a connected route having only a topological position determined with respect to terminals or obstacles. A topological wire is first selected and then obstacles which sight the selected wire are identified. A fan with a radius that is a predetermined number times a minimum space is then set to the identified obstacle as a forbidden region. A minimum space must be left between the selected wire and the identified obstacle. Finally, a shortest route is detected so that it does not pass through the forbidden region, and the route of the physical wire on the board is determined with the shortest route.

Abstract: A plane is segmented into a plurality of regions whose vertexes are points which include the terminals, and a route search graph is generated. The route search graph expresses a connection relationship between the plurality of regions. A line connecting two objects in a shortest distance is recorded as a critical cut together with a width of wires that can go through the critical cut, the two objects including the terminals. A corresponding relationship relative to the critical cut and, when necessary, position information relative to the critical cut are recorded in edges of one of the plurality of regions related to the critical cut and in a necessary terminal.

Abstract: A method and a system precisely selects a three-dimensional object hidden inside complex objects. A retrieval object is disposed in the proximity of a pointer to retrieve a three-dimensional object, all three-dimensional objects included within or touching the retrieval object are retrieved, a sub-window is displayed, an area in the sub-window is divided into a plurality of regions corresponding to the number of retrieved three-dimensional objects and, in response to the pointer being positioned within one of said plurality of regions within said sub-window, a corresponding three-dimensional object within a main window is displayed distinctively over other three-dimensional objects within said main window. After a desired object is selected, the selection is finalized by a click operation of the pointer, etc.

Abstract: A plane is segmented into a plurality of regions whose vertexes are points which include the terminals, and a route search graph is generated. The route search graph expresses a connection relationship between the plurality of regions. A line connecting two objects in a shortest distance is recorded as a critical cut together with a width of wires that can go through the critical cut, the two objects including the terminals. A corresponding relationship relative to the critical cut and, when necessary, position information relative to the critical cut are recorded in edges of one of the plurality of regions related to the critical cut and in a necessary terminal.

Abstract: An edit object is selected by displaying a plurality of edit objects such as figures or characters closely arranged or overlapped on a display screen. A pointer is used to specify a desired position on the main screen, and determine with a candidate selecting device whether or not a plurality of edit objects exists at a specified pointer position or in a predetermined region based on the specified position. If a plurality of edit objects exists, the edit objects existing at the position or in the predetermined region are selected as selective candidates. A subscreen is displayed on the display screen by a subscreen display device. The subscreen has a plurality of information regions which correspond to respective selective candidates. The pointer is moved on the subscreen, thus changing the display of the edit object on the main screen which corresponds to the information region indicated at the pointer position on the subscreen by highlighting or changing to a specific color.