Abstract: At least one embodiment of the present invention is directed to a method and/or an apparatus for automatically providing a common modelling pattern as a function of a plurality of stored process models. The common modelling patterns are identified according to three substeps, namely semantic annotation, extraction of pattern based description and composite process pattern mining. The detected common modelling patterns serve as best practice candidates as regards process engineering. At least one embodiment of the present invention finds application in a variety of domains being related to process management, such as process design, process mining and semantic process planning.

Abstract: A method for optimizing if statements in a program includes obtaining, by a processing device, for each of conditional expressions of a plurality of if statements in the program, a set of conditional expressions having an inclusion relation; computing, for each of the set, a position with low execution frequency in the program as a move destination of a conditional expression having an inclusion relation, using information of the set in which the conditional expression is included; and moving the conditional expression to the computed move destination of the conditional expression.

Abstract: A method for optimizing if statements in a program includes obtaining, by a processing device, for each of conditional expressions of a plurality of if statements in the program, a set of conditional expressions having an inclusion relation; computing, for each of the set, a position with low execution frequency in the program as a move destination of a conditional expression having an inclusion relation, using information of the set in which the conditional expression is included; and moving the conditional expression to the computed move destination of the conditional expression.

Abstract: A method, system and computer program product for selecting virtual machines to be migrated. The page consumption is monitored and recorded for each virtual machine running on a physical machine in a cloud computing node. Those virtual machines with a positive gradient of page consumption that is less than a threshold are placed in a list of virtual machines to be ranked. The virtual machines in the list are ranked based on an increasing order of the relative page consumption value at each sample interval within an observation window of time. A final rank for each virtual machine in the list is computed based on averaging its ranking across each sample interval within the observation window of time. One or more virtual machines are then selected to be migrated to another physical machine that have the lowest final ranking (i.e., with the lowest relative page consumption values).

Abstract: An electronic document retrieval system is disclosed. It has particular utility to World-Wide Web searching. The system requires webmasters to put forward categories into which the pages on their web-site might sensibly be divided, and to provide a list of those categories together with a list of popular keywords associated with those categories to a global search engine. The global search engine is then able to augment one or more of its search results with links to category-heading pages which most closely relate to the query provided by the user. In this way, a user is able to find the page most relevant to his query more rapidly than has hitherto been possible.

Abstract: A system generates a test path set in a very efficient manner. The test path set may be tailored to test a target physical system, such as a complex set of source code, a manufacturing line of multiple process nodes, or other physical system. The system may generate the test path set to meet certain goals in testing the target physical system, for example comprehensive testing of system paths, system nodes, or particular subsets. As one example, the system may efficiently generate a test path set that uses the minimum number of test paths to test a coverage goal, for example traversing each of the prime paths in the target physical system.

Abstract: A novel allocate instruction and a novel API call are received onto a compiler. The allocate instruction includes a symbol that identifies a non-memory resource instance. The API call is a call to perform an operation on a non-memory resource instance, where the particular instance is indicated by the symbol in the API call. The compiler replaces the API call with a set of API instructions. A linker then allocates a value to be associated with the symbol, where the allocated value is one of a plurality of values, and where each value corresponds to a respective one of the non-memory resource instances. After allocation, the linker generates an amount of executable code, where the API instructions in the code: 1) are for using the allocated value to generate an address of a register in the appropriate non-memory resource instance, and 2) are for accessing the register.

Abstract: In an embodiment, an address watch is established on a memory address while the execution of a first thread of a program is halted. In response to a second thread modifying memory contents at the memory address, encountering the address watch and halting, a determination is made whether a first variable in the program that represents the memory address is displayed on a user interface for the first thread. If the first variable in the program that represents the memory address is displayed on the user interface for the first thread, the value of the first variable is read and displayed on the user interface of the first thread.

Abstract: Methods and systems described herein implement a recommendation system for providing recommendations for generating a requirements specification for agile software development. In one implementation, the system includes a processor and a memory coupled to the processor. The memory comprises a mapping module and an agile recommendation module. The mapping module is configured to map knowledge elements of at least one ontology instance selected from among a plurality of ontology instances with another ontology instance selected from among the plurality of the ontology instances. The agile recommendation module is configured to generate a knowledge corpus based on the mapped knowledge elements of the ontology instances and at least one environmental parameter, receive modifications in the knowledge corpus, and provide recommendations to generate a requirements specification based at least, in part, on the received modifications.

Abstract: A method of generating a signal having a converted sampling rate in a communication system is provided. The method includes selecting effective input samples among S number of input samples included in an input stream corresponding to an input sampling rate, generating a filter coefficient set including filter coefficients having a length of a second tap, the filter coefficients having the length of the second tap being generated by dividing a filter coefficient having a length of a first tap configuring a low-pass filter into the filter coefficients having the length of the second tap corresponding to a number of selected effective input samples, selecting filter coefficients corresponding to each of the effective input samples among the filter coefficients included in the filter coefficient set, and outputting output samples having an output sampling rate which is converted from the input sampling rate.

Abstract: A system and associated method for generating a Service Component Architecture (SCA) module with Service Oriented Architecture (SOA) model elements. A service model is created according to a process model that has activities and a process flow. Services of the service model are respectively associated with the activities. Each service is determined to employ only one service operation definition to render a message specification of a respective activity that is associated with each service. The activities, the process flow, and the message specification are utilized to produce the SCA module in executable implementations.

Abstract: A system includes a decimation module having an adjustable decimation rate and a filter module responsive to the decimation module. A digital phase lock loop is operable to control a decimation rate of the decimation module. The decimation module is a cascade integrator comb decimation module.

Abstract: According to one embodiment, a computer program product for collaboratively installing a computer application includes a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code including computer readable program code configured to: monitor an installation process of an application, send a remote assistance request in response to a determination that the installation process requires remote assistance, receive a response to the remote assistance request, and continue the installation process of the application using the remote assistance information. The response includes remote assistance information required for installing the application, and the remote assistance information is invisible to an installer of the application.

Abstract: A method and structure for an in-place transformation of matrix data. For a matrix A stored in one of a standard full format or a packed format and a transformation T having a compact representation, blocking parameters MB and NB are chosen, based on a cache size. A sub-matrix A1 of A, A1 having size M1=m*MB by N1=n*NB, is worked on, and any of a residual remainder of A is saved in a buffer B. Sub-matrix A1 is worked on by contiguously moving and contiguously transforming A1 in-place into a New Data Structure (NDS), applying the transformation T in units of MB*NB contiguous double words to the NDS format of A1, thereby replacing A1 with the contents of T(A1), and moving and transforming NDS T(A1) to standard data format T(A1) with holes for the remainder of A in buffer B. The contents of buffer B is contiguously copied into the holes of A2, thereby providing in-place transformed matrix T(A).

Abstract: A method for detecting defects in a computer program.

Abstract: According to an aspect of the present invention, the dependency information of software components implementing an enterprise application, is used to minimize the down time of the components when applying patches. In an embodiment, all the software components are shut down before applying patches. The patches are then applied and the components are started in a dependency order starting from an independent component. The down time is reduced as a result. According to another aspect, the shutdown also is performed in the reverse of the dependency order. The shutdown and starting are performed using recursive logic.

Abstract: Systems, methods, and other embodiments associated with automated upgrade of an operating system are described. In one embodiment, a method includes receiving a request for an upgrade package in a gateway server from a remote device and determining a source location for the upgrade package. The example method may also include sending the request to the source location to cause the source location to provide the upgrade package to the remote device.

Abstract: A technique is provided for performing a mixed precision estimate. A processing circuit receives an input of a first precision having a wide precision value. The processing circuit computes an output in an output exponent range corresponding to a narrow precision value based on the input having the wide precision value.

Abstract: Embodiments include a computer-readable medium embodying program code comprising code for receiving input defining a plurality of cells and a logical relationship between the cells, each cell representing a master screen of an application under development. Additional code for associating an asset with a cell, and code for storing a hyper-wireframe data structure identifying the plurality of cells, the logical relationship between the cells, and the asset may be included. The cells may be part of a hyper-wireframe embodied in a data structure alongside a plurality of assets and a target characteristic value of an intended target of the application under development. An application may determine whether to enable or disable an editing feature of an editing application based on the asset and the target characteristic value. Additionally or alternatively, permission data associated with assets may be used to enable or disable the editing feature.

Abstract: A residue generating circuit for an execution unit that supports vector operations includes an operand register and a residue generator coupled to the operand register. The residue generator includes a first residue generation tree coupled to a first section of the operand register and a second residue generation tree coupled to a second section of the operand register. The first residue generation tree is configured to generate a first residue for first data included in the first section of the operand register. The second residue generation tree is configured to generate a second residue for second data included in a second section of the operand register. The first section of the operand register includes a different number of register bits than the second section of the operand register.