Abstract: A method for solving finite capacity problems such as how to satisfy a customer's request for a manufactured product, by describing the environment in which the problem exists in the form of a demand (e.g., customer order), including the available resources for satisfying the demand, defining the demand, selecting a plan for achieving the various objectives of the demand in an optimal order, and evaluating whether the plan will work. Also disclosed is a computer program product implementing the invention, and a system for coordinating multiple sources of input into a system implementing the disclosed invention.

Abstract: A C-language program performance tuning advisor that helps a systems analyst to improve the performance of an application. The tuning advisor identifies critical regions (hot spots) of an application, and helps the user to analyze the region. Once the region has been identified and analyzed, the tuning advisor advises the user on how to rewrite the original C code to improve the performance of the overall application. When the compiler needs to be conservative to be semantically correct, the tuning advisor suggests code modifications to remove the semantic constraints. The tuning advisor recognizes most commonly used C code patterns which if modified could improve the performance.

Abstract: A large pore (500.degree.-2000.degree. A) ceramic membrane is used to separate asphaltenes from heavy crude oil. Permeate is recycled to the feed for an initial period, during which the pores are deliberately fouled to reduce pore size. This reduction eventually levels off, at which point recycling is terminated and ultrafiltration is continued thereafter at good flux rates with effective asphaltenes removal.

Abstract: A controlled release preparation for oral administration contains tramadol, or a pharmaceutically acceptable salt thereof, as active ingredient.

Abstract: An improved optimizer, in conjunction with a set of initial instruction ordinal assignment policies, a set of instruction ordinal adjustment policies and a set of instruction ordinal to instruction operation size mapping policies, is provided to the code generator of a compiler of the target machine. In addition to logic for performing standard optimizations, the improved optimizer further comprises logic for assigning initial instruction ordinals to instructions in the code being generated for the program being compiled in accordance to the assignment policies, iteratively adjusting the assigned instruction ordinals in accordance to the adjustment policies until they converge into a set of compatible and optimized instruction ordinals, and mapping the final instruction ordinals to instruction operation sizes, inserting additional code where necessary, in accordance to the mapping policies.

Abstract: An improved register allocator is provided to the code generator of a compiler. The improved register allocator allocates registers using an improved register candidate usage matrix. The improved register candidate usage matrix comprises row entries, one for each register candidate. Each row entry comprises usage bits indicating at least whether its register candidate is live at the entries, in the bodies, and at the exits of the various basic blocks. The improved register allocator allocates registers by block, deriving interference information from the improved usage matrix. It then merges the register allocation introducing spill code at points where register candidates are split. As a result, a register can be allocated to two register candidates that are live in the same basic block as long as they are not both live at some point in the basic block, and at the same time, a register candidate can be spilled in one basic block and allocated a register in another basic block.

Abstract: An improved register allocator, an improved instruction scheduler, an instruction combiner, and an improved loop unroller is provided to the code generator of a compiler of a computer system. Both the improved instruction scheduler and the improved loop unroller support a "preliminary" and a "final" mode of operation. Upon invocation, the improved register allocator determines and prioritizes regions of the program being compiled. Next, the improved register allocator, in cooperation with the improved instruction scheduler, the instruction combiner, and the improved loop unroller, determines the optimal partitioning for global and local registers for each region. Then, the improved register allocator allocates registers to each region based on the determined number of global registers for the region. After allocating registers for each region, the improved register allocator merges the regions together.

Abstract: An improvement in the process for the oxidative coupling of methane is provided. Typically, the reaction takes place in a reactor that includes a catalyst zone. A primary CH.sub.4 /O.sub.2 stream is fed into the entrance of the reactor and reacted at a temperature of 600.degree. C.-1000.degree. C. and a pressure of between 101 kPa and 800 kPa. The improvement comprises introducing an auxiliary oxygen stream directly into the catalyst zone and one or more points to thereby selectively increase the yield of C.sub.2+ products.

Abstract: A portable wheel-about greenhouse is provided formed with a transparent top portion of double wall insulated construction configured to engage in interfitting relationship with a bed portion also formed of double wall construction providing further insulation to said bed thereby. Said transparent cover portion may be positioned in spaced relationship to said bed portion periodically by means of spacer elements positionable at respective corners of the bed and cover members. At least one pair of over-sized wheels are utilized for ease of portability and convenience in transport of said greenhouse from one site to another.