Abstract: A method for establishing a simulating signal suitable for estimating a complex exponential signal includes the following computer-implemented steps: sampling a time domain signal of a physical system to obtain a sampling signal; transforming the sampling signal to a frequency domain signal using Fast Fourier Transform; determining parameters of the frequency domain signal; establishing a simulating signal; establishing a target function which is a deviation of the simulating signal from the sampling signal; obtaining correcting factors; iterating the target function using a gradient method and the correcting factors to obtain three sets of iterated signal parameters; obtaining corrected parameters using quadratic interpolation; and using the corrected parameters to correct the simulating signal, and establishing an updated target function. The simulating signal can be used to estimate dynamic behavior of the physical system if the updated target function converges to a tolerable range.
Abstract: Multiplication engines and multiplication methods are provided. A multiplication engine for a digital processor includes a first multiplier to generate unequally weighted partial products from input operands in a first multiplier mode; a second multiplier to generate equally weighted partial products from input operands in a second multiplier mode; a multiplexer to select the unequally weighted partial products in the first multiplier mode and to select the equally weighted partial products in the second multiplier mode; and a carry save adder array configured to combine the selected partial products in the first multiplier mode and in the second multiplier mode.
Abstract: Program execution profile data is collected by direct measurement of some code paths, and by inferring data for unmeasured paths. The data collection process may cause errors, which are propagated by the inferencing process. The profile data thus constructed is further enhanced by detecting certain data mismatches, and adjusting inferred data to reduce the scope of errors propagated during the inferencing process. Preferably, a control flow graph of the program being measured is constructed. Mismatches in the total weights of input arcs versus output arcs are detected. For certain specific types of mismatches, it can be known or guessed which count is incorrect, and this count is accordingly corrected. Correction of arc counts proceeds recursively until it is no longer possible to correct mismatches. Additionally, certain other conditions are adjusted as presumed inaccuracies.
Type:
Grant
Filed:
April 9, 2008
Date of Patent:
September 18, 2012
Assignee:
International Business Machines Corporation
Abstract: Programs, systems and methods are described for efficiently storing data as used under a workflow-driven model. A workflow process is defined to control the processing of data objects through different states, e.g., such as an insurance claim document passing through different stages of processing. The workflow process is modeled and employed to manage the storage system based upon predicted state changes derived from state statistics that can be applied to enhance efficiency. For example, copies of the data object may be automatically made when the data object is expected to change state. Some anticipated states implicating high access may direct a storage location with low access time. Hints or requirements for the data object may be applied upon occurrence of an expected state change. Storage management of expected state changes may be further enhanced through dynamic adjustment of the state statistics using collected historical state information to further enhance efficiency.
Type:
Grant
Filed:
November 13, 2007
Date of Patent:
June 12, 2012
Assignee:
International Business Machines Corporation
Abstract: A computer-implementable method, system and computer media are presented for calculating software test coverage of a Graphical User Interface (GUI). In one embodiment, the method includes the steps of: detecting an activation of a monitored active area in a GUI; recording the activation and a name of a user who activated the monitored active area; recording an order of any prior and subsequent activations of active areas in the GUI, wherein the prior and subsequent activations are performed prior to and subsequent to the activation of the monitored active area; recording any errors associated with the activation of the monitored active area; recording a total number of times that the monitored active area was activated during a pre-determined test period; and creating a report that describes test results for the monitored active area.
Type:
Grant
Filed:
March 20, 2007
Date of Patent:
June 12, 2012
Assignee:
International Business Machines Corporation
Inventors:
Joshua D. Ghiloni, Wes Hayutin, Howard S. Krovetz, Seth A. Schwartzman
Abstract: A method and apparatus for producer graph oriented programming and execution. According to one aspect of the invention, a runtime is provided that interprets producer dependency declarations for methods. The producer dependency declarations identify at run time a set of zero or more producers, where a producer is a runtime instantiatable construct that includes at least an instance and a method associated with that instance. The runtime automatically generates and executes, responsive to receiving a designation of a producer of interest whose method has a producer dependency declaration, a producer graph. The producer graph initially includes the producer of interest and is generated, from the producer of interest to source producers, through instantiation of producers based on the producer dependency declarations of the methods of the producers already in the producer graph. The runtime sequences the execution of the producers in the producer graph as by the producer graph.