Abstract: A method of designing patterns has preparing a mask pattern used in a lithography process for transferring a circuit pattern intersecting with a step pattern on a substrate which has the step pattern designed thereon, and applying correction patterns to the mask pattern in accordance with correction rules considering a shape of the step pattern, the correction patterns being applied at intersections of edges of the circuit pattern and the step pattern and in the vicinity of the intersections.

Abstract: Document production. The present invention arose from a need to deliver a document to a computing device as a server and to allow the server to produce the document without requiring user interaction. In various embodiments a document to be produced is received. A production application responsible for producing the document is initated. Calls from the production application to document production functions are caused to be redirected to proxy document production functions. The production is then instructed to produce the document.

Abstract: A method and system for generating an optimized suite of test cases includes deriving a set of use case constraints and generating a test suite based upon the set of use case constraints.

Abstract: A method and system for visualizing process flows for business and manufacturing processes are described that includes a first view of the process as a tree showing the process elements and their interconnections, and a second view of the process in the form of a zoomable interface that displays selected nodes at magnifications that are continuously variable at the user's option. A selected node in the tree view opens the same node in the zoomable node view. When a second node is selected in the tree view, the zoomable node view zooms from the first selected node to the second selected node through each node intermediate between the first and second selected nodes. This enables a process analyst to view the content of selected process nodes in the context of nodes with which the selected nodes are associated and thus to have a thorough understanding of the process.

Abstract: The invention provides a Software Development Program having a compiled programming language, Compiler for that language, and a built-in text Editor. The programming language has a block structure and simple syntax. The Software Development Program is distributed free to developers, but programs created with the Software Development Program must be licensed. In addition to machine-readable Object Code, Executable Files created with the Compiler include the embedded Source Code (including independent function libraries that help form an Executable Shell) from which they were created. Separate Source Code and Object Code files are not required. The Compiler edits the Executable Files directly, thereby eliminating the need for source code control.

Abstract: A digital object delivery/management system includes a library of stored digital objects and a shared database containing web server access codes and a mapping indicating which users are authorized to access which stored digital objects. The shared database is coupled to a file transfer protocol (FTP) server and a web server. The FTP server is additionally coupled to the library. The web server presents at least one web page providing instructions for users seeking access to digital objects contained in the library, authenticates users according to the web server access codes, generates temporary FTP access codes for use by authenticated users in accessing authorized objects at the FTP server, and redirects authenticated users to the FTP server. The FTP server authenticates users according to the temporary FTP access codes, and, upon successful authentication, makes digital objects contained in the library available to requesting users pursuant to the mapping.

Abstract: Mapping information that describes the mapping of referenced projects to their container project is included in the container project, using a “module mapping” file. A module mapping file is a simple meta-data file, for use at development time only, which stores data that maps relative URIs to IDE project names. The module mapping file contains entries for the location of nested archives, relative to the virtual archive defined by the container project, mapped to the uniquely named referenced project within the IDE. The paths of the archive files are computed “on the fly” just before the application server is started, rather than being simply written into an extensions file, located within the container project, in a fixed form when the enterprise application is written/developed.

Abstract: A method and apparatus for converting a testcase written for a first member of a processor family to run on a second member of a processor family. The first and second members of the processor family have cache memory used by the testcase. The method includes steps of reading the testcase into a digital computer and searching for, and tabulating, cache initialization commands of the testcase. Tabulated cache initializations are then sorted by cache line address and way number and displayed. This information is used to determine whether the testcase will fit on the second member without modification, and to assist in making modifications to the testcase.

Abstract: Accordingly, embodiments of the present invention operate to intercept a call directed to a common dialog function and to redirect that call to another more desirable proxy function. An action module providing an internal function that makes a call to the external function is loaded into memory. The action module's import address table is accessed. The external function is identified within the import address table, and an address associated with the external function is replaced with an address to be used to access the proxy function. In one embodiment, the proxy function is designed to utilize settings acquired programmatically and is able to replace a common dialog function, thus, eliminating the need for user interaction to perform a particular task.

Abstract: Intercepting function calls. In one embodiment of the application, an import address table for an application is accessed and an address, in the import address table, associated with a function to which calls from the application are to be intercepted is replaced with an address to be used to access a proxy function. In another embodiment, the application is loaded in debugging mode. Once the import address table for the application has been populated with addresses for functions called by the application, the execution of the application is paused. An address, in the import address table, associated with a function to which calls from the application are to be intercepted is replaced with an address to be used to access a proxy function. Execution of the application is then resumed.

Abstract: A system and method for compiling computer code written to conform to a high-level language standard to generate a unified executable containing the hardware logic for a reconfigurable processor, the instructions for a traditional processor (instruction processor), and the associated support code for managing execution on a hybrid hardware platform. Explicit knowledge of writing hardware-level design code is not required since the problem can be represented in a high-level language syntax. A top-level driver invokes a standard-conforming compiler that provides syntactic and semantic analysis. The driver invokes a compilation phase that translates the CFG representation being generated into a hybrid controlflow-dataflow graph representation representing optimized pipelined logic which may be processed into a hardware description representation.

Abstract: A function execution method, a function execution apparatus, a computer program and a recorded medium to execute a program of stacking, in a stack area of a memory, a function record area according to a format of an invoked function which is invoked by an invoking function including a process to invoke another function, invoking the invoked function, executing the invoked function and then discarding the stacked function record area, wherein a predetermined alternative function which substitutes the invoking function is executed when it is judged, from analysis of the invoking function by byte-code such as a JVM, that the invoking function is a trail-recursive invoking function, so that the alternative function as an invoking function invokes the invoked function utilizing the function record area utilized for executing the invoking function and the invoked function which has been invoked is executed.

Abstract: A method, system and apparatus for performing selective data processing based upon a static analysis of the code of a compiled object. A compiled object, for example an enterprise bean, can be analyzed to determine how individual methods in the enterprise bean access specific objects. Those specific objects can include, for instance, data members of a class, or class objects passed into one or more individual methods of the enterprise bean. Where the individual methods of the enterprise bean do not mutate or otherwise change the state of the specific objects, those objects can be accessed by reference only. Importantly, where the specific objects are data fields linked to a table in a database as managed by a container managed persistence (CMP) bean, an update to the table will not be required when the static analysis of the enterprise bean otherwise indicates that the data fields are merely accessed, but not updated.

Abstract: A blueprint is described that provides a framework for writing a code generator. A blueprint translator translates the blueprint into one or more classes with source code. The newly generated code can then be compiled. If the user wishes to add additional functionality to a generated class, this is done in a separate source file. At compilation time, the compiler combines the generated class with the user's additions, as if they were written in a single class. Later, if the blueprint is ever changed, the generated code can safely be updated without overwriting the user's additions. Alternately, the user can embed his desired additions or changes directly into the blueprint (embedded code). In this manner, should the blueprint ever be re-compiled, the user's changes will still be present. The partial classes technique can be used in conjunction with the embedded code technique.

Abstract: An embodiment of the invention includes a method of forming a control-dataflow graph that includes separating a control flow graph into two or more basic blocks, and converting said two or more basic blocks into code blocks, where the code blocks are formed into the control-dataflow graph. Another embodiment of the invention includes a method of forming a control-dataflow graph that includes separating a control flow graph into two or more basic blocks, forming a lode node in at least one of said basic blocks, forming a store node in at least one of said code blocks, inserting a delay node in at least one of said code blocks, segregating external hardware logic modules from said control flow graph, and converting said two or more basic blocks into code blocks, wherein the code blocks are formed into the control-dataflow graph.

Abstract: A method for accelerating a compiled application, given its source code, by adapting it to the hardware on which it runs The method can also be applied to applications whose source is not given. The object of this invention is to provide an acceleration method, which is easy and effective to the and user. The invention does not require the user to own a secondary computation device, but attempts to change the software itself to fit best in the user's existing hardware. The method is for accelerating the running time of an application on a central processing unit (CPU) of a computer having a memory and a compiler by adapting the code of the application in an application file to the hardware on which it runs, the method includes the stop of identifying functions in the application to accelerate.

Abstract: An embodiment of the invention includes a method of simulating a hybrid instruction processor and reconfigurable processor implemented algorithm which utilizes a runtime selectable emulation library that emulates a reconfigurable processor and its resources, and a control-data flow emulator that emulates the reconfigurable logic for the algorithm. Another embodiment of the invention includes a method of simulating a control-dataflow graph that includes building an internal representation of the control-dataflow graph that includes one or more dataflow code blocks, and simulating the control-dataflow graph as a sequence of code block dataflow executions, where control is passed from one code block to another code block based on the output value of the code block until EXIT is reached.

Abstract: Some computer operating systems do not permit application programs to perform certain tasks. If there is a desire to perform a forbidden task, a virtual partition (228) is created (610) in a storage device (108), such as a hard disk drive, associated with the computer system (100). The virtual partition (228) is stored as a file within the file system of the storage device (108). Operating system files (414) are installed in the virtual partition (228), and the storage device (108) is configured (616) to boot the computer system (100) using the operating system in the virtual partition. When the task is complete, the computer system (100) is configured to boot using the operating system other than the one in the virtual partition.

Abstract: The method in accordance with the invention makes it possible to replace the programming conditions of a server(s) in real time, proceeding in such a way that the process which is to be replaced (1) coexists for a certain period of time with the replacement process (1′). The duration of this operation is decided by the replaced process (1), and it is possible to determine when the transactions which are already under way in the process which is to be replaced (1) have been completed.

Abstract: Systems and methods are disclosed for updating a software program through base image patching. In an exemplary method for base image patching, the method includes receiving a patch, retrieving a base image, wherein the base image corresponds to a base version of a software program, and combining the base image with the patch to create an updated program. In another exemplary method, the method includes receiving an updating patch, wherein the updating patch is used to create an updated software program, retrieving a patch from a repository, wherein the patch is a previous update to a stored program, distilling a base image of the stored program using the previous patch, combining the base image with the updating patch to create an updated program, and replacing the stored program with the updated program.

Abstract: It is made possible to update software appropriately. When additional software is installed, update management data for the additional software is generated. When the update management data for the additional software is attached to the additional software in advance, that data is used. If the update management data is not attached, cycles for confirming the presence of updates and the like are determined based on the nature of the software, and the update management data is thus generated. Then, the generated update management data is set in an update management table. The presence of software updates is checked for based on the cycles for confirming the presence of updates in the update management table.

Abstract: It is made possible to update installed software appropriately. A CE device stores an update management table in which are set, with respect to software bundled with the CE device, the names, IDs, version numbers, update cycles, and contact information (URLs of update data supplying servers) for making inquiries on the presence of updates. For example, assuming that everyday, when it is recognized that the time is past 10:00, there is a need to check for the presence of updates for software A, the CE device accesses a URL corresponding to software A, and makes an inquiry on the presence of updates.

Abstract: A software loading method comprises providing a first software package on one of a plurality of primary partitions in a storage medium. The first software package comprises a first boot loader module, an installer system, and a secure operating system. The installer system is operable to install a second software package, which comprises a second boot loader module, a primary operating system operable to be executed by a processor, and an appliance application. The method also comprises automatically installing the second software package on a second of the plurality of primary partitions.

Abstract: A method, apparatus, and means for silently customizing software within a multi-platform environment. A software grouping is copied from a control server to a software source server and de-serialized. The software grouping is customized by the control server passing user information to the software source server, where the information is then stored in a response file inside of the software grouping. The response file is then used to remotely customize the installation of the software grouping on workstations.

Abstract: A system and methods are provided for inserting probe points into an executing program, and measuring the time spent traversing code paths from one probe point to any other probe point or some other performance metric (e.g., instructions executed, cache misses, memory addresses accessed). One method is implemented by inserting N probes. Each probe has a corresponding function configured to: retrieve the identifier and timestamp of the previous probe executed, calculate the time spent traversing the path from the previous probe to the current probe, and update a matrix of N×N elements, wherein each element corresponds to a path from one probe to another probe. After completion of the program, this matrix is useful for identifying code paths that are bottlenecks and hence candidates for optimization.

Abstract: A system for automatically installing software on client computers is implemented in a client-server model that comprises a server (1), a plurality of client computers (3), and a communications network (2) linking the server and the client computers. The system includes a database (10) for storing setup programs of software; a first application (11) installed in the server for inputting setup programs in and retrieving setup programs from the database, and a second application (31) installed in each client computer for receiving setup programs and installing software. When the client computers log in the domain of a Local Area Network, the software installing system automatically checks software installed in the client computers against software stored in the server, and installs software in client computers that do not already have the software installed therein.

Abstract: Briefly, in accordance with one embodiment of the invention, applications may be dynamically reconfigured as execute-in-place applications or non-execute in place applications by monitoring application usage and configuring the applications based on the application usage data. Monitoring of application usage may be continuous, and the application usage data may be updated as application usage changes over time.

Abstract: A computer system employing a plurality of concurrent threads to perform tasks that dynamically identify further similar tasks employs a double-ended queue (“deque”) to list the dynamically identified tasks. If a thread's deque runs out of tasks while other threads' deques have tasks remaining, the thread whose deque has become empty will remove one or more entries from another thread's deque and perform the tasks thereby identified. When a thread's deque becomes too full, it may allocate space for another deque, transfer entries from its existing deque, place an identifier of the existing deque into the new deque, and adopt the new deque as the one that it uses for storing and retrieving task identifiers. Alternatively, it may transfer some of the existing deque's entries into a newly allocated array and place an identifier of that array into the existing deque.

Abstract: A mechanism is disclosed for implementing an interpreter with hierarchical execution loops. In one embodiment, the interpreter has a slow processing loop and a fast processing loop. In one embodiment, the slow processing loop comprises resources for executing infrequently executed instructions and instructions with relatively complicated implementations, and the fast processing loop comprises resources for executing frequently executed instructions and instructions with relatively simple implementations. Instructions are mostly executed in the fast processing loop. Only if an instruction is not supported by the fast processing loop will it be executed in the slow processing loop. Implementing the interpreter in this manner improves cache utilization and makes it easier for a compiler to generate more optimal code for the interpreter, thereby resulting in considerably faster execution times.

Abstract: A method for running real time tasks alongside a general purpose operating system, such that the real-time tasks are not pre-emptible by the general purpose operating system, and the general purpose operating system runs as if the real-time tasks were not present. This is achieved by disabling all interrupts except one, which is given to the real time tasks, and then periodically polling the hardware devices, notifying the general purpose operating system of hardware events and the passage of time as and when is necessary.

Abstract: A system and method for executing previously created run time executables in a configurable processing element array is disclosed. In one embodiment, this system and method begins by identifying at least one subset of program code. The method may then generate at least one set of configuration memory contexts that replaces each of the at least one subsets of program code, the at least one set of configuration memory contexts emulating the at least one subset of program code. The method may then manipulate the at least one set of multiple context processing elements using the at least one set of configuration memory contexts. The method may then execute the plurality of threads of program code using the at least one set of multiple context processing elements.

Abstract: The present invention provides a firewall that achieves maximum network security and maximum user convenience. The firewall employs “envoys” that exhibit the security robustness of prior-art proxies and the transparency and ease-of-use of prior-art packet filters, combining the best of both worlds. No traffic can pass through the firewall unless the firewall has established an envoy for that traffic. Both connection-oriented (e.g., TCP) and connectionless (e.g., UDP-based) services may be handled using envoys. Establishment of an envoy may be subjected to a myriad of tests to “qualify” the user, the requested communication, or both. Therefore, a high level of security may be achieved. The usual added burden of prior-art proxy systems is avoided in such a way as to achieve fall transparency-the user can use standard applications and need not even know of the existence of the firewall. To achieve full transparency, the firewall is configured as two or more sets of virtual hosts.

Abstract: A central processor of the computer executes a basic operating system and at least one additional operating system, such as an auxiliary operating system, that is executed substantially in parallel with the basic operating system. When executing the basic operating system, the central processor checks if a resource can be operated by the auxiliary operating system. If the check is affirmative, then the central processor operates the resource from the auxiliary operating system; however, if the check is negative, then the resource is operated by the basic operating system or by another additional operating system.

Abstract: Methods and apparatus for multi-threading on a simultaneous multi-threading processor are provided. The methods and apparatus described herein increase computational throughput by launching two or more computational threads to perform the same algorithm using two different software segments. One of the software segments is coded to perform the algorithm using primarily a first processor resource (e.g., a floating point unit). Another software segment is coded to perform the same algorithm using a primarily a second processor resource (e.g., an integer execution unit). A workload requiring execution of the algorithm is allocated to the threads in a balanced manner (e.g., faster code segments are given more of the workload). The threads use different processor resources, therefore the threads are able to execute in parallel in an efficient manner. When each of the threads completes execution, the results may be synchronized.

Abstract: Methods and arrangements are provided for use in multiple user computing environments. These methods and arrangements can be configured to allow for a plurality of separate and concurrent desktops and workspaces within the shared computing environment. One method includes creating a separate desktop thread for each user that is authenticated during a logon process, creating a separate desktop associated with each desktop thread, and maintaining a list of desktop threads that are created. In this manner, several users can be logged on simultaneously. In certain implementations, the method further includes establishing a separate user environment associated with each desktop and launching a separate user shell associated with each desktop. The list of desktop threads allows for selective and/or automatic switching from a first desktop to a second desktop without terminating a desktop thread associated with the first desktop. The methods and arrangements are also applicable to remote process logon and switching.

Abstract: The invention relates to a communication device comprising at least one processor to run at least two operating systems. The at least two operating systems include a first operating system comprising a first group of threads, and a second operating system comprising a second group of threads. The communication device further comprises at least one user interface, mobile station functions and data processing functions, and that of said at least two operating systems the first operating system relates to running of mobile station functions, and the second operating system relates to running of data processing functions.

Abstract: A method and system that prepares a task for being swapped out from processor utilization that is executing on a computer with multiple processors that each support multiple streams. The task has one or more teams of threads, where each team represents threads executing on a single processor. The task designates, for each stream that is executing a thread, one stream as a team master stream and one stream as a task master stream. For each team master stream, the task notifies the operating system that the team is ready to be swapped out when each other thread of the team has saved its state and has quit its stream. Finally, for the task master stream, the task notifies the operating system that the task is ready to be swapped when it has saved its state and each other team has notified that it is ready to be swapped out.

Abstract: Disclosed is a method and computer program product for sending a persistent message in a transaction-enabled messaging and queuing system comprising a message queue manager responsible for transferring messages from a sender program to a receiving program via a message queue. A message is sent from the sender program to the message queue manager, the message being defined so as to permit the message queue manager to select whether to treat the message transactionally or non-transactionally.

Abstract: A system provides an interface for a client application to programmatically access a Web site. A simple data extractor returns a retrieved Web page in a well-formed syntax (such as XHTML) to the client application. Web forms crawled or otherwise retrieved from the Internet are translated into service interfaces, or APIs. The service interfaces are expressed in a simple object access protocol (SOAP), and are registered in a universal description, discovery, and integration (UDDI) registry. For each Web form analyzed, the present system automatically generates a program code that receives SOAP requests and translates them into regular Web accesses, thus providing applications and application developers with an easy, programmatic interface to Web sites such as search engines and other databases. The Web pages are first processed by a component that analyzes the forms and generates a service description (SD) file for each form.

Abstract: The present invention routes object requests in a distributed system using address information identified in object headers that accompany the request. Specifically, when an object is created under the present invention, address information is inserted into a corresponding object header. When a request related to the object is later issued, the object header accompanies the request. The address information is used to ensure that the request is efficiently and accurately routed to a target process within a target node of a target cell.

Abstract: An interactive multimedia, two-way notification system and method transforms a notification message into a dynamic marketing channel. When a notification message is triggered, an external application provides promotional text that is personalized to the intended recipient of the notification message. The promotional text is added to the notification message, which is then forwarded to the recipient. If the recipient replies to the notification message, an interactive two-way messaging session is established between the recipient and the external application.

Abstract: One embodiment of the present invention provides a system that performs event notification in a distributed computing system. During operation, the system receives an event that was generated at a node in the distributed computing system, wherein the event includes a set of name/value pairs associated with the event. Next, the system compares the event against a set of client event registrations to determine a set of clients to be notified of the event, wherein each client event registration identifies a client and a target set of name/value pairs, wherein the client is to be notified of the event if the target set of name/value pairs matches a subset of the set of name/value pairs associated with the event. Finally, the system sends a notification of the event to the set of clients to be notified of the event.

Abstract: A system and method for conducting distributed transactions wherein a connect JDBC™ driver for a Microsoft™ SQL Server implements Java™ JTA distributed transactions. To conduct the JTA distributed transactions, JTA specific interfaces are engineered in the driver. The JDBC™ driver is a wire protocol driver in direct TCP communication with the SQL server. During communication, the JDBC™ driver sends packets of information back and forth to and from the database server. These packets may request information form the server, or instruct the server to perform a function, such as executing a stored procedure.

Abstract: Systems and methods for managing peripheral device drivers are provided. One such method includes receiving a request for a task to be performed by a peripheral device, and responsive to receiving the request, downloading a peripheral device driver that is configured to enable the peripheral device to perform the requested task.

Abstract: Intercepting calls to document production functions. In one embodiment of the application, an import address table for the application is accessed, document production functions being supplied by an operating system are identified within the import address table. For each identified document production function, an address associated with that function in the import address table is replaced with an address to be used to access a proxy document production function. In another embodiment, the application is loaded in debugging mode. Once the import address table for the application has been populated with addresses for functions called by the application, the execution of the application is paused. An address, in the import address table, associated with a document production function to which calls from the application are to be intercepted is replaced with an address to be used to access a proxy document production function. Execution of the application is then resumed.

Abstract: An object oriented mechanism and method provide exact information about the current invocation stack even when methods are inlined. A virtual stack frame mechanism determines whether a called method has been inlined, and counts both virtual frames and real frames when determining information corresponding to a called method. The virtual stack frame mechanism is preferably implemented in an object oriented class that provides methods for determining information corresponding to a called method.

Abstract: A system identifies which of first and second signal sources is supplying a program signal to a monitored receiver. The first and second signal sources and the monitored receiver are located in a household. The system extracts a reference program signature representative of an output of the monitored receiver and first and second source program signatures representative of an output of the first and second signal sources. The system identifies which of the first and second signal sources is a source of the program signal in response to the reference program signature and the first and second source program signatures.

Abstract: A method discovers patterns in unknown multi-dimensional data. A time-series of the multi-dimensional data is generated and a point cross-distance matrix is constructed by self-correlating the time-series. All minimum cost paths in the point cross-distance matrix are located at multiple time resolutions. The minimum cost paths are then related to temporal sub-sequences in the multi-dimensional data to discover high-level patterns in the unknown multi-dimensional data.

Abstract: Systems and methods to generate a video summary of a video data sequence are described. In one aspect, key-frames of the video data sequence are identified independent of shot boundary detection. A static summary of shots in the video data sequence is then generated based on key-frame importance. For each shot in the static summary of shots, dynamic video skims are calculated. The video summary consists of the calculated dynamic video skims.

Abstract: A picture ratio controlling apparatus and method by which a user controls a picture ratio of a video signal provided to a video display device so as to easily control the picture ratio of the video signal displayed on the video display device. The picture ratio controlling apparatus includes a video display device displaying a video, and a system controller determining at least one selectable picture ratio mode based on information of the picture ratio of a source video to be provided to the video display device and the information of the picture ratio that can be supported by the video display device, and controls the picture ratio of the source video provided to the video display device, when a user requests a picture ratio selection. Accordingly, the user can control the picture ratio of a video displayed on the video display device by simply manipulating a key.