International Business Machines Corporation

Stephen E Fischer

Jeffrey Bowman Johnson

Ralph W Young

David Carroll Challener

James A Culp

Calvin Bruce Swart

Robert T Sayah

William Brian Cunningham

Automated comparison of Darwin Information Typing Architecture (DITA) documents for revision mark-up includes reading document data from first and second DITA documents into respective document object model trees of nodes, and identifying and collapsing emphasis subtree nodes in the trees into their parent nodes, the collapsing caching emphasis data from the identified subtree nodes. A traversal transforms the model trees into respective node lists and captures adjacent sibling emphasis subtree nodes as single text nodes. The node lists are merged into a merged node list that recognizes matches node pairs having primary sort key information and document structure metadata meeting a match threshold, with differences between matching tokens of the node pairs saved. A merged document object model built from the refined merged node list is transformed into a hypertext mark-up language document.

Automated document revision markup and change control

Automated comparison of Darwin Information Typing Architecture (DITA) documents for revision mark-up includes reading document data from first and second DITA documents into respective document object model trees of nodes, and identifying and collapsing emphasis subtree nodes in the trees into their parent nodes, the collapsing caching emphasis data from the identified subtree nodes. A preorder traversal transforms the model trees into respective pre-order node lists and captures adjacent sibling emphasis subtree nodes as single text nodes. The node lists are merged into a merged node list via a longest common subsequence process that recognizes matches node pairs having primary sort key information and document structure metadata meeting a match threshold, with differences between matching tokens of the node pairs saved. A merged document object model built from the refined merged node list is transformed into a hypertext mark-up language document.

A set of optical rule checker (ORC) markers are identified in a simulated lithographic pattern generated for a set of data preparation parameters and lithographic processing conditions. Each ORC marker identifies a feature in the simulated lithographic pattern that violates rules of the ORC. A centerline is defined in each ORC marker, and a minimum dimension region is generated around each centerline with a minimum width that complies with the rules of the ORC. A failure region is defined around each ORC marker by removing regions that overlap with the ORC marker from the minimum dimension region. The areas of all failure regions are added to define a figure of demerit, which characterizes the simulated lithographic pattern. The figure of demerit can be evaluated for multiple simulated lithographic patterns or iteratively decreased by modifying the set of data preparation parameters and lithographic processing conditions.

Method and system for comparing lithographic processing conditions and or data preparation processes

A dynamic directory and tetrahedralization method. The dynamic directory of degree of freedom data for elements in a non-conformal mixed-element mesh includes elements subdividable into tetrahedral, in which a respective degree of freedom value is stored for each element, wherein the degree of freedom value is current as element subdivision proceeds. The tetrahedralization method includes providing a non-conformal mixed element mesh comprising elements subdividable into tetrahedra, identifying respective degree of freedom values for the elements in the mesh, and performing element subdivision based on the degree of freedom values of elements in the mesh.

Tetrahedralization of non-conformal three-dimensional mixed element meshes

Undesirable Steiner points in tetrahedralized meshes may be minimized by tetrahedralization processes that order element subdivision based on degree of freedom data for elements in the mesh and/or treat element degree of freedom as non-static during element subdivision. Applying look-ahead, breadth-first-search subdivision, and other strategic subdivision techniques further minimizes the need for Steiner points.

A method for generating changes and updating existing files and code in a computer program, wherein the method comprises reading existing source code and existing object code in the computer program. Then, reading a plurality of associated files to the source code, and executing a utility program. The utility program updates the target source code and the object code associated with the target source code. Targets may be specified with either glob-type patterns using the standard shell wild cards, or regular expression patterns. The utility program also includes scripting language and can specify particular characters to search for in the target code and the associated code. A target code list is generated for the source code and the associated object code by using the utility program, and the target code and the associated code are updated by employing a search technique specified in the utility program.

Dependency specification using target patterns

A method and system for optimizing the execution of a collection of related modules by eliminating redundant modules from the collection. The collection of modules represent a set of related simulation experiments and are organized as generations of related module sequences having execution interdependencies. The method eliminates redundant modules in the collection by redefining execution interdependencies among the modules. Groups of equivalent modules are formed by comparing the modules within each generation to each other to determine which modules are equivalent. Modules having equivalent execution prerequisites and which will produce the same output given the same input are considered equivalent. In each group of equivalent modules, a single &ldquo;target&rdquo; module is selected to substitute for the others in the module execution sequences, and execution interdependencies are redefined to effect the substitution.

Method and system for optimizing execution of a collection of related module sequences by eliminating redundant modules

A computer readable storage medium for executing a simulation process representing a collection of semiconductor devices and tests for the devices. The simulation process constitutes a batch job of a plurality of execution modules representing nodes of a directed acyclic graph. Each of the nodes contains a directory identifying any parent modules which have to be executed prior to executing the module, and identifying any child execution modules which are to be executed subsequent to executing the module. The directory also includes a status file indicating the state of execution of the module containing the directory. A supervisory processor performs a job farming operation on each of the execution modules in a distributed processing system. The execution modules are processed in an order defined by the identity of any parent and child modules referenced in the directories. At the completion of execution of a module, the status file of the directory is changed to indicate that the module has been executed.

Method and apparatus for processing executable program modules having multiple dependencies

A television style channel (program) changer switch is electrically coupled to the central processing unit of a computer system. A user defined lookup table assigns switch positions to programs available for execution in the system. Program controlled means initiates execution of each program and switches between programs in accordance with the positioning of the switch by a system user.

Growing community of inventors

Wappingers Falls, NY, United States of America

Stephen E Fischer