Abstract: A computer-implemented method, system, and computer program product for planning and optimizing information technology (IT) infrastructure transformations is presented. A predictive effort estimation model for transforming an existing IT infrastructure into a transformed IT infrastructure is initially created. The introduction of a new application into the existing IT infrastructure through a use of a decision tree as a transformation path determination is emulated to create a transformation path emulation. The use of a software factory is emulated for introducing the new application into the existing IT infrastructure to create a software factory use emulation for creating the transformed IT infrastructure. The predictive effort estimation model is accurized using results from the transformation path emulation and the software factory use emulation to create an accurized transformed IT infrastructure model.

Abstract: The database system includes: a storage unit that stores a database including an entity data group and a plurality of identifier tables having only a plurality of fixed-length data; and a data processing unit that receives a query and performs data processing on the database on the basis of the received query. Each of the identifier tables includes at least one tuple that is defined in a row direction and at least one attribute field that is defined in a column direction and includes a plurality of data identifiers uniquely indicating the plurality of entity data as the fixed-length data. The database includes a link table that connects the tuples between the identifier tables, in addition to the plurality of identifier tables. The data processing unit performs the data processing using the link table and the identifier tables.

Abstract: Described embodiments provide an apparatus for calculating an N-point discrete Fourier transform of an input signal having multiple sample values. The apparatus includes at least one input configured to receive the sample values and a counter to count sample periods. Also included are at least two parallel multipliers to multiply each sample value, with each of the multipliers having a corresponding multiplication factor. There is at least one multiplexer to select one of the at least two parallel multipliers. An adder sums the scaled sample values and an accumulator accumulates the summed sample values. N is an integer and the at least two parallel multipliers are selectable based upon the value of N and the value of the sample period count.

Abstract: A method of holding information for identifying a cause for an object becoming problematic and presenting the information to a user. The method ascertains the cause of memory consumption by a program in a computer system. This method includes: acquiring a first call path related to the creation of an object from a memory; acquiring a second call path related to the connection to the object from the memory; and determining a common part of the acquired first and second call paths, wherein the common part indicates the cause in the program.

Abstract: A database is queried as of any wall-clock time within a retention period, via undo that uses database snapshots and a list of page level modifications. The snapshot is user-identified, automatically generated, or extracted from a backup. The list is maintained in a transaction log by persisting page content before a page is re-used, persisting deleted rows before they are moved, persisting compensation log record undo information, and/or logging a full page. To rewind an entire database, the undo scans the transaction log in reverse LSN order and undoes all page modifications. Undo reverses reallocated pages, table truncation, and/or table deletion, as well as page-level modifications of a schema, metadata values, and/or system tables. An as-of query is handled using as-of page(s) from a sparse page file. If the sparse page file does not already contain the responsive page(s), they are created and added to it.

Abstract: Described embodiments provide an apparatus for calculating an N-point discrete Fourier transform of an input signal having multiple sample values. The apparatus includes at least one input configured to receive the sample values and a counter to count sample periods. Also included are at least two parallel multipliers to multiply each sample value, with each of the multipliers having a corresponding multiplication factor. There is at least one multiplexer to select one of the at least two parallel multipliers. An adder sums the scaled sample values and an accumulator accumulates the summed sample values. N is an integer and the at least two parallel multipliers are selectable based upon the value of N and the value of the sample period count.

Abstract: A mechanism is provided for group communications using a MULTI-PIPE synthetic file system. A master application creates a multi-pipe synthetic file in the MULTI-PIPE synthetic file system, the master application indicating a multi-pipe operation to be performed. The master application then writes a header-control block of the multi-pipe synthetic file specifying at least one of a multi-pipe synthetic file system name, a message type, a message size, a specific destination, or a specification of the multi-pipe operation. Any other application participating in the group communications then opens the same multi-pipe synthetic file. A MULTI-PIPE file system module then implements the multi-pipe operation as identified by the master application. The master application and the other applications then either read or write operation messages to the multi-pipe synthetic file and the MULTI-PIPE synthetic file system module performs appropriate actions.

Abstract: A mechanism is provided for group communications using a MULTI-PIPE synthetic file system. A master application creates a multi-pipe synthetic file in the MULTI-PIPE synthetic file system, the master application indicating a multi-pipe operation to be performed. The master application then writes a header-control block of the multi-pipe synthetic file specifying at least one of a multi-pipe synthetic file system name, a message type, a message size, a specific destination, or a specification of the multi-pipe operation. Any other application participating in the group communications then opens the same multi-pipe synthetic file. A MULTI-PIPE file system module then implements the multi-pipe operation as identified by the master application. The master application and the other applications then either read or write operation messages to the multi-pipe synthetic file and the MULTI-PIPE synthetic file system module performs appropriate actions.

Abstract: A method for synchronizing files is provided. Current metadata including a filename and a hash identifier for each file of the synchronized folder is created. The current metadata is compared to previous metadata. Based on the comparison, a first file and a first folder added to the synchronized folder and a second file and a second folder deleted from the synchronized folder are identified. The hash identifiers of the first and second files are compared. If the hash identifiers match, the filenames of the first and second files are compared. If the filenames do not match, the first file is identified as a renamed file. Metadata is sent to a synchronized device with information related to the first folder sent before information related to the first file, which is sent before information related to the second folder.

Abstract: A module provides an interface between a multi-tenant database and a non-tenant-specific application instance such that the application instance sends data access commands to the module as if it is communicating with a single-tenant database. The module translates the non-tenant-specific data access command from the non-tenant-aware application into a multi-tenant data access command, as needed, without needing to alter the non-tenant specific application instance in any way. In this manner, a single-tenant application could be used by multiple tenants in a multi-tenant environment.

Abstract: Management roles in a role-based framework may be upgraded by updating existing management roles, updating derived roles, and deprecating or reducing existing and derived roles in the role-based framework. The existing management roles may include a set of existing role entries for defining an action using parameters, scripts, application program interface calls, and a special permission for enabling performance of tasks defined by the management roles. The derived roles may include custom management roles derived from the existing management roles in the role-based framework.