Abstract: A method of and a system for processing an enterpise an application request on an end user application and an application server. This is accomplished by initiating the application request on the end user application in a first language (such as a markup language) with a first application program (such as a Web browser), and transmitting the application request to the server and converting the application from the first language of the first end user application to a language running on the application server, processing the application request on the application server, and transmitting the response from the application server back to the end user application, and converting the response from the language running on the application server to the language of the end user application.

Abstract: Disclosed is a system for providing information to a user on modifications made to a base software product with a program temporary fix. The program temporary fix is applied to the base software product. The program temporary fix includes informational text describing how the program temporary fix modifies the base software product. The informational text included with the program temporary fix is applied to informational text provided with the base software product to generate cumulative informational text. The cumulative informational text describes the base software product as modified by the program temporary fix. The cumulative informational text may be accessed and presented to the user.

Abstract: An exponential function on a base X raised to a power of N is performed in a processor in a manner that maximizes computing efficiency. The exponential function initially positions at a starting node in an exponential tree stored in a memory of the processor, wherein the starting node represents the value of N. A working value W is created in the memory of the processor and the working value W is initially set equal to the base X. The exponential tree is traversed in the memory of the processor from the starting node to an answer node and the working value W is updated in the memory of the processor at each node encountered during the traversal. The working value is squared in the memory of the processor when a next node is above and to the right of the current node. Otherwise, the working value is squared in the memory of the processor and a result thereof is multiplied by X in the memory of the processor when the next node is above and to the left of the current node.

Abstract: Disclosed is a system for processing program statements, such as statements included in a macro. An assembler program is provided a plurality of statements with an input file. The assembler program processes the statements. For each statement the assembler program determines whether the processed statement is a buffering directive including a statement operand. If the assembler program determines that the processed statement is a buffering directive, the assembler program writes the statement operand of the buffering directive into a memory area. Otherwise, the assembler program generates the processed statement into a data stream. The assembler program generates the statements stored in the memory area into the data stream after processing the statements associated with the macro.