Abstract: A dynamic predictive and/or exact caching mechanism is provided in various stages of a microprocessor pipeline so that various control signals can be stored and memorized in the course of program execution. Exact control signal vector caching may be done. Whenever an issue group is formed following instruction decode, register renaming, and dependency checking, an encoded copy of the issue group information can be cached under the tag of the leading instruction. The resulting dependency cache or control vector cache can be accessed right at the beginning of the instruction issue logic stage of the microprocessor pipeline the next time the corresponding group of instructions come up for re-execution. Since the encoded issue group bit pattern may be accessed in a single cycle out of the cache, the resulting microprocessor pipeline with this embodiment can be seen as two parallel pipes, where the shorter pipe is followed if there is a dependency cache or control vector cache hit.

Abstract: A mobile platform is provided. The mobile platform includes a interior overhead structure and at least one compartment rotatably coupled to the interior overhead structure. The compartment is rotatable into an opened position and a closed position. The mobile platform further includes a pivot system coupled to the interior overhead structure and the compartment to enable the compartment to rotate into the opened position and the closed position. The pivot system comprises a first fitting that defines a raceway and a second fitting that defines a hub and a guide. The hub of the second fitting is for engagement with the raceway and the guide directs the first fitting into the second fitting to couple the first fitting to the second fitting.

Abstract: Therefore, the illustrative embodiments provide a computer program product comprising a computer recordable media having computer usable program code. Resource needs are determined for each plant in a plurality of plants to form individual resource needs. Conditions are identified in an environment in which the plurality of plants are located by receiving input from a sensor system to form current conditions. A plurality of per plant prescriptions are calculated for the plurality of plants using the individual resource needs and the current conditions. The application of the resource is controlled from a mobile utility vehicle to each plant in the plurality of plants using the plurality of per plant prescriptions.

Abstract: Generating synthetic events based on a vast amount of data. First and second data are received. The first data is organized into a first cohort. The second data is organized into a second cohort. The first cohort and the second cohort are processed to generate a synthetic event. The synthetic event comprises third data representing a result of a mathematical computation defined by S(p1)==>F(p2), wherein S comprises input facts with probability p1, wherein the input facts comprise the first cohort and the second cohort, and wherein F comprises an inferred event with probability p2. The term “event” means a particular set of data that represents, encodes, or records at least one of a thing or happening. Each of the first data, the second data, the first cohort, the second cohort, the synthetic event, and subcomponents thereof all comprise different events. The synthetic event is stored.

Abstract: Computer implemented method, system and computer usable program code for processing a data object, for example, for searching for, creating or updating a data object. A computer implemented method for processing a data object includes receiving a request for the data object. A static portion and a dynamic portion for the data object are determined, and an instruction for the static portion and an instruction for the dynamic portion are processed separately. To search for a data object, a result from processing an instruction for the static portion and a result from processing the instruction for the dynamic portion are merged to form a hybrid data object. To create or update a data object, a result from processing an instruction for the static portion and a result from processing the instruction for the dynamic portion is saved in a database.

Abstract: A computer implemented method, apparatus, and computer usable program product for processing tasks. A set of one or more tasks is presented on a user interface, wherein the set of tasks are part of a process. A set of one or more policies are associated. Each respective policy is associated with one or more of the set of tasks in which at least one of the tasks in the set of tasks is associated with a policy restricting modification of the task. The set of tasks and set of policies are sent to a flow engine, wherein the flow engine enforces performance of the set of tasks according to the set of policies.

Abstract: System, computer implemented method and program for assessing value of a computer program installed in a computer of a company. Determinations are made as to (a) an order that the computer program is started in a startup sequence of the computer, (b) whether the computer is used for production purposes, (c) how frequently or at what interval the computer program or data generated by the computer program is backed up, (d) an order or time in which the computer program is scheduled for recovery in event of disaster, (e) a type of a library which contains the computer program, (f) an amount of usage of the computer program by the company, and (f) how recently the computer program or data generated by the computer program has been accessed. Respective weighting factors are applied to results of the three or more determinations and the weight factored results are combined.

Abstract: A mechanism for folding all the data dependencies in a loop into a single, conservative dependence. This mechanism leads to one pair of synchronization primitives per loop. This mechanism does not require complicated, multi-stage compile time analysis. This mechanism considers only the data dependence information in the loop. The low synchronization cost balances the loss in parallelism due to the reduced overlap between iterations. Additionally, a novel scheme is presented to implement required synchronization to enforce data dependences in a DOACROSS loop. The synchronization is based on an iteration vector, which identifies a spatial position in the iteration space of the loop. Multiple iterations executing in parallel have their own iteration vector for synchronization where they update their position in the iteration space. As no sequential updates to the synchronization variable exist, this method exploits a greater degree of parallelism.

Abstract: Verifying ballots that are cast in an election is provided. A mutual attestation procedure is executed between a plurality of devices communicating in a voting system via a network. A number of certificates are published. Each certificate corresponds to one of the plurality of devices and contains a public key and reference election configuration data defining a reference machine execution environment state of its corresponding device. A voter authorization token is generated for each voter. Voting results are generated in response to using a given voter authorization token to cast a given ballot using a specified voting device. Current election configuration data is generated that defines a current machine execution environment state of the specified voting device when the given ballot was cast. The current election configuration data is compared with the reference configuration data to verify a valid machine execution environment state of the specified voting device.

Abstract: A computer implemented method, apparatus, and computer program product for managing just-in-time compilation. The process designates a set of compilation threads for exclusively performing compilation functions associated with an application. A set of computation threads is designated for executing the application. Processor cycles are dynamically allocated during runtime between the set of compilation threads and the set of computation threads to maintain a ratio of processor cycles consumed by the set of compilation threads to processor cycles consumed by the set of computation threads.

Abstract: A method, apparatus, and computer program instructions for automatically performing test builds of natural language translated files for a software product. When a translated file is received from a translator, a test build of the translated file is executed in a translation test build environment, wherein the translation test build environment is separate from the main software product build environment. A determination is made as to whether the test build of the translated file is successful. If the test build is successful, the translated file is submitted to the main software product build environment. If the test build is unsuccessful, a log file containing error information is sent to the translator to allow the translator to fix compile errors identified in the translated file and resubmit the translated file to the translation test build environment.

Abstract: A system for stealing interrupt vectors from an operating system. Custom interrupt handler extensions are copied into an allocated block of memory from a kernel module. Also, operating system interrupt handlers are copied into a reserved space in the allocated block of memory from an interrupt vector memory location. In response to copying the operating system interrupt handlers into the reserved space in the allocated block of memory, custom interrupt handlers from the kernel module are copied over the operating system interrupt handlers in the interrupt vector memory location. The custom interrupt handlers after being copied into the interrupt vector memory location handle all interrupts received by the operating system.

Abstract: A method and system for monitoring power consumption of software applications. In a preferred embodiment of the present invention, a new feature is inserted in a system availability monitoring product which estimates the power consumption of the system, starting from the measurement of some parameters collected by a monitoring tool. All systems are impacted by energy consumption, by the usage of its resources (hard-disk, CPU, memory, CDROM, etc.); when the usage of these components increases, the energy consumption increases too. The usage of the resources can be calculated through the monitoring tool according to some specific parameters. The calculated metrics of the usage are based on the measurement of the time during which a resource is in a predetermined status. Each resource has an associated table for determining the expected power consumption according to the status.

Abstract: Provided is a method, for using schemas to generate application specific business objects for use in an integration broker. A schema is accessed defining an application specific data structure for one application. A business object is generated including fields corresponding to elements and attributes indicated in the accessed schema. A determination is made of application specific information for the generated business object indicating a correspondence of the fields in the business object to the application specific data structure. The business object is written out with the determined application specific information in a format that is understandable to an integration broker that communicates business objects to a plurality of applications, wherein the business object is capable of being processed by an adapter enabling communication with the application for which the accessed schema is provided.

Abstract: A technique to facilitate the automatic obtaining or extraction of dialogs or screens such as a graphical user interface from executable program code and saving a snapshot of such dialogs or screens in a graphical format. The executable program code is scanned or searched for particular modules within such program code that are used to generate a user interface or dialogue. Each one of these identified GUI-accessible modules is then processed in order to generate, display, and capture their associated user interface(s) or dialogue(s). Any requisite user input or sample data that is required by these modules is automatically generated and provided to assist in the generation, display, and capture of the interfaces/dialogues.

Abstract: A computer implemented method, system and computer program product for managing heuristic properties for controlling an optimization transformation in a compiler or in other heuristically controlled software in a data processing system. A computer implemented method for controlling an optimization transformation in heuristically controlled software includes defining at least one heuristic property for controlling a behavior of an optimization transformation, and creating at least one heuristic property modifier for each desired change in the behavior of the optimization transformation. At least one of the at least one heuristic property is then modified using the at least one heuristic property modifier for achieving each desired change in the behavior of the optimization transformation.

Abstract: Inter-procedural strength reduction is provided by a mechanism of the present invention to optimize software program. During a forward pass, the present invention collects information of global variables and analyzes the information to select candidate computations for optimization. During a backward pass, the present invention replaces costly computations with less costly or weaker computations using pre-computed values and inserts store operations of new global variables to pre-compute the costly computations at definition points of the global variables used in the costly computations.

Abstract: A method for minimizing the message flow wait time for management user exits in a message broker application. A message broker application processes a request in a request and a response message flow. The request message flow generates a request identifier, collects information about the request message flow, and stores the request identifier and information in a global data map. The response message flow uses the request identifier to access the map and read the collected information without having to acquire a lock on the map. The response message flow also collects information about the response message flow, and generates management information about the request based on the information about the request message flow and the information about the response message flow. A dedicated clean up thread in the message broker application is used to remove used items from the global data map.

Abstract: A technique for determining a match between a character string including an evaluation and product information stored in a storage device and including a feature description of a product. The character string includes a name of an evaluation object to be evaluated and an evaluation expression representing the evaluation of the evaluation object. The matching method includes a first determining step of determining from the evaluation object and the evaluation expression whether the evaluation expression represents a positive evaluation of the evaluation object or a negative evaluation of the evaluation object; and a second determining step of determining, when the evaluation expression represents a positive evaluation of the evaluation object, if the evaluation expression is included in a feature description of a product, the product to be a matched product, and if the evaluation expression is not included in a feature description of a product, the product to be a mismatched product.

Abstract: A stream processing system provides a description language for stream processing workflow composition. A domain definition data structure in the description language defines all stream processing components available to the stream processing system. Responsive to receiving a stream processing request, a planner translates the stream processing request into a problem definition. The problem definition defines stream properties that must be satisfied by property values associated with one or more output streams. The planner generates a workflow that satisfies the problem definition given the domain definition data structure.