Abstract: A solution (300) for tracking computer software development (for example, based on UML diagrams) is proposed. In the solution of the invention, a completion coefficient is associated (312) with each activity concerning the development process (to indicate the effort required to complete it). The activities are organized into a tree (starting from a root node for the whole development process). In operation, a user tunes (333-336) a progress index for each micro-activity represented by a leaf node of the tree (to indicate its actual progress). The progress index of each macro-activity represented by a non-leaf node of the tree is instead calculated (357-360) by aggregating the progress indexes of its depending activities weighted according to the respective completion coefficients (with a recursive process down to the micro-activities). In this way, the progress of the development process can be tracked with an incremental approach at different levels of detail.

Abstract: A solution for facilitating the test of a command line interface (CLI) of a software product is proposed. A first phase of a process generates a scenarios matrix. Each command of the CLI is defined with its arguments and the corresponding properties; the test activity is defined by specifying a desired accuracy level of the test process. The scenarios matrix can then be generated automatically, by selecting (according to the desired accuracy level) predefined rules specifying happy paths and errors cases for each property. A second phase generates corresponding test cases. An expected result is associated with each test scenario in the respective matrix. This allows creating a test document for the manual execution of the test process and/or a bucket for its automatic execution by an automation tool.

Abstract: A method, system, and computer usable program product for a smart profiler are provided in the illustrative embodiments. An allowable number of interrupts for use by a profiler application is determined. A count number for a counter is determined. The counter is configured to count occurrences of an event in a data processing system up to the count number. An interrupt is raised when the counter has counted the occurrences of the event up to the count number. The interrupt is processed. The counting of occurrences of the event, raising the interrupt, and processing the interrupt are repeated for a predetermined time. A decision is made whether a total number of interrupts raised in the predetermined period differs from the allowable number. The count number of the counter is adjusted to cause the difference between the total number of interrupts in the predetermined period and the allowable number to decrease.

Abstract: A method, system, and computer usable program product for storing messages in a directory executing in a data processing system are provided in the illustrative embodiments. A message is received over a network and identified in the directory. A base message entry that corresponds to the message is selected in a hierarchy of entries in the directory. A message instance entry for the message is created, such that the message instance entry becomes a child entry of the base message entry in the hierarchy.

Abstract: A method for protecting sensitive data during execution time. The sensitive data are normally stored on permanent storage devices (e.g. a hard disk). The method, according to the present invention is based on the creation at system boot of a runtime process and a corresponding runtime memory space. The sensitive data are then moved to the runtime memory space and the copy on the storage device is deleted or made unusable by users. At shutdown time the sensitive data are copied back to the storage device according to the uptodate version on the runtime memory. In particular the present invention is applied to a license management system which allows nodelocked licenses on client system even if the client is disconnected from the network. License information are considered sensitive data which should be protected during execution. A device driver is created at system boot time and a kernel cache memory is allocated to the driver.

Abstract: A method, system, and computer usable program product for load balancing using replication delay are provided in the illustrative embodiments. In response to a request to update, a system updates data associated with a write server, forming updated data of a data partition. The system receives a read request for the data partition. The system calculates a time difference between an arrival time of the request to update and an arrival time of the read request. The system receives a set of average replication delays for a set of replica servers serving the data partition. The system directs the read request to a replica server in the set of replica servers whose average replication delay is less than or equal to the time difference.

Abstract: A circular edge detector on an integrated circuit including a plurality of edge detector cells, each of the plurality of edge detector cells having an input select block operable to receive a data signal and a previous cell signal and to generate a present cell signal, and a state capture block operably connected to receive the present cell signal. The present cell signal of each of the plurality of edge detector cells is provided to a next of the plurality of edge detector cells as the previous cell signal for the next of the plurality of edge detector cells, and the present cell signal from a last edge detector cell is provided to a first edge detector cell as the previous cell signal for the first edge detector cell.

Abstract: A method, system, and computer usable program product for deploying analytic functions are provided in the illustrative embodiments. A resource is identified in an analytic function specification. A set of input time series is identified for the analytic function specification. An analytic function instance corresponding to the analytic function specification is instantiated in relation to an object of the resource. Each input time series in the set of time series is located in relation to the object. The analytic function instance is associated with each input time series in the set of time series. An analysis is performed using the set of input time series and an analytic function described in the analytic function specification. The analytic function instance is instantiated if both the object and the set of data sources are present in an object graph where the analytic function instance is to be instantiated.

Abstract: A method of route determination for mobile elements in a network comprising a plurality of paths each having a predetermined path capacity. The method comprises the steps of registering centrally a plurality of route requests from a corresponding plurality of mobile elements each of said requests defining a journey between an origin and a destination and registering centrally for each route request a journey start time. Routing instructions are centrally determined so as to optimise use of path capacity across all synchronous journeys requests in said network with reference to said registered information, and issued to corresponding mobile elements. The mobile elements adapt their route to comply with the routing instruction. There may be provided further steps of monitoring and rerouting the mobile element whenever new journeys requests can impact its remaining trip.

Abstract: A method for scheduling execution of a work unit in a data processing system comprises assigning to the work unit an expected execution duration; executing the work unit; determining an actual execution duration of the work unit; determining a difference between the actual execution duration and the expected duration; and conditionally adjusting the expected execution duration assigned to the work unit based on the measured actual execution duration, wherein the conditionally adjusting includes preventing the adjustment of the expected execution duration in case said difference exceeds a predetermined threshold.

Abstract: A method and a corresponding apparatus for metering usage of software products on a computer are proposed. The solution of the invention is based on the idea of associating each product with an installation signature (indicative of the installation of the product on the computer) and with a running signature (indicative of the running of the product on the computer). The products that are installed on the computer are asynchronously determined according to their installation signatures; in this way, any ambiguities (for example, caused by different versions and/or configurations of a product sharing the same executable modules) can be resolved in advance. Therefore, when at run-time the invocation of an executable module is detected it is possible to use only the running signatures to identify the corresponding product uniquely (without the need of additional information about the executable module, such as its size).

Abstract: A method and a corresponding apparatus for a high availability license management system. The system has a License Backup Server for ensuring uninterrupted service, while at the same time preventing any possible malicious use. According to the present invention, only two servers are required for realizing a secure system. The first server hosts a License Server A 303 and Agent C 305. License Server A 303 contains certificates for all available licenses. The second server hosts a Backup Server B 309 which contains the same licenses of License Server A. Agent C monitors the operation making sure that Backup Server B does not grant any license while License Server A is up and running.

Abstract: A solution is proposed for reducing the response time of a long query submitted by a client (110) to a server (105)—storing a corresponding database (205). For this purpose, when the server receives the query from the client it starts collecting the result of the query into a table (210), wherein the corresponding selected records are directly accessible at page level (to the contrary of the database). As soon as a first page (Pg1) of the selected records is available in the table, the page is transmitted to the client for its display. Meanwhile, in a completely asynchronous manner, the server continues populating the table. Later on, the user of the client submits a browsing command to the server for moving to a different page (Pgk). In response thereto, the server extracts this page from the table (as soon as available) and returns it to the client directly.

Abstract: A method (300) and a corresponding system for allocating resources in a hierarchical data processing system are proposed. The system includes a plurality of nodes that are arranged in a tree. Each leaf-node, or client, controls corresponding local resources, while each intermediate node, or domain manager, controls global resources that are visible to all its dependent nodes; the global resources defined on a root node, or master domain manager, are then visible to all the nodes of the system. Whenever a job, being submitted (306) on a generic client, requests a set of resources for its execution, the request is sent (309,318,327) through the tree to the master domain manager. The master domain manager allocates (339) the corresponding global resources as soon as they are all available; this event enables (345) its child node (in a path to the client) to perform the same operations, and so on down to the client itself.

Abstract: A method, system and apparatus for ensuring that only randomly generated numbers that have passed a test is used for cryptographic purposes are provided. When a random number is generated, it undergoes a built-in self-test (BIST). If the number passes the test, it is forwarded to a cryptographic device to be used for cryptographic purposes. If the number does not pass the test, a signal is instead forwarded to the cryptographic device to indicate the failure of the test. In a particular embodiment, only one data line is used to forward either the randomly generated number or the signal. A selector is used to facilitate the selection between the number and the signal.

Abstract: A method is provided in a system wherein a transaction gateway daemon of a specified type is connected between first and second spatially separated servers, to integrate applications running on the first server with operation of the second server. The method automatically determines whether a detected address space is or is not a transaction gateway daemon of the specified type, such as a CICS transaction gateway, and includes the step of verifying that the detected address space is an Open multiple virtual storage (MVS) type of address space. The method further comprises carrying out a first set of tests pertaining to specified additional characteristics of the detected address space, and verifying that a program of the detected address space is running in a Language Environment. A second set of tests are also carried out, that are respectively associated with dubbing a task on the address space to Open MVS.

Abstract: A circular edge detector on an integrated circuit including a plurality of edge detector cells, each of the plurality of edge detector cells having an input select block operable to receive a data signal and a previous cell signal and to generate a present cell signal, and a state capture block operably connected to receive the present cell signal. The present cell signal of each of the plurality of edge detector cells is provided to a next of the plurality of edge detector cells as the previous cell signal for the next of the plurality of edge detector cells, and the present cell signal from a last edge detector cell is provided to a first edge detector cell as the previous cell signal for the first edge detector cell.

Abstract: A system, apparatus and method for transmitting data on a private network in blocks of data without using TCP/IP as a protocol are provided. When data is to be transmitted on a private network, the data is divided into a plurality of packets and a MAC header is added to each packet. The header contains hardware addresses of the transmitting and receiving hosts as well as parameters of the data being transmitted. The hardware addresses are used to route the packets through the private network therefore obviating the use of TCP/IP to perform the same task. The data is ordinarily stored in contiguous sectors of a storage device; thus, ensuring that almost every packet will either contain data from a block of sectors or is a receipt acknowledgement of such packet.

Abstract: A programmable clock generator circuit receives control signals and a global clock and generates a pulsed data clock and a scan clock in response to gating signals. The clock generator has data clock and scan clock feed-forward paths and a single feedback path. Delay control signals program delay elements in the feedback path and logic gates reshape and generate a feedback clock signal. The global clock and the feedback clock signal are combined to generates a pulsed local clock signal. A scan clock feed-forward circuit receives the local clock and generates the scan clock. A data clock feed-forward circuit receives the local clock and generates the data clock with a logic controlled delay relative to the local clock signal. The feedback clock is generated with controlled delay thereby modifying the pulse width of the data and scan clocks independent of the controlled delay of the data clock feed-forward path.

Abstract: A method and system for instantiating COM components in custom contexts are proposed. The solution of the invention is based on an auxiliary component, acting as a factory (215). Whenever a client (205) needs to instantiate a new target component in a desired custom context, it calls a dedicated method exposed by the factory, passing the identifier of the target component together with information about the custom context. The factory starts execution of an additional module, operating as an impersonator (225), in a new process (230) conforming to the custom context. The impersonator then instantiates the target component in its own process. The impersonator passes a pointer for the target component to the factory (calling a further method that is exposed by the factory); the factory in turn returns that pointer to the client.