| Patent application number | Description | Published |
|---|
| 20080222229 | DETERMINATION OF INCREMENTAL VALUE IN SERVER PROCESSED DATA - The accumulated change in values representative of actions taken by a processor, such as the number of email messages processed by an email server, in a given time period is determined. Actions are represented as data points on a plot. Look-ahead intervals are defined for each point. Candidate pairs of points are determined for each look-ahead interval by comparing the first value in the look-ahead interval with other values in the look-ahead interval. A candidate pair comprises the first point and another point having a lesser value. If a candidate pair has a value therebetween, the candidate pair is discarded. If, however, a candidate pair has no value therebetween, the first value of the candidate pair is a peak value for the look-ahead interval. The accumulated change is determined by calculating the sum of the peak values, plus the final value, minus the initial value, for the given time period. | 09-11-2008 |
| 20090313508 | MONITORING DATA CATEGORIZATION AND MODULE-BASED HEALTH CORRELATIONS - Architecture for aggregating health alerts from a number of related components into a single aggregated health state that can be analyzed to isolate the component responsible for the fault condition. In a hierarchy of related components within various component groups in a computer system, a number of health indicators can indicate alerts occurring in one or more of the related components whereas the fault condition occurs in only one component upon which the other components depend. The health indicators of related components are aggregated into an aggregated health state for each component group. These aggregated health states are analyzed to identify the related component associated with a root cause of the alert condition for an affected component group. | 12-17-2009 |
| 20110184951 | PROVIDING QUERY SUGGESTIONS - Methods and computer-readable media are provided for determining suggested queries. A user enters a search website, and the user is identified based on a user identification. Suggested queries are determined based on a group associated with the user. This association is created by extracting queries from data logs, categorizing the queries into groups based on their respective subject matter, associating the user with one or more groups, and determining suggested queries for each group. The suggested queries are communicated for display. | 07-28-2011 |
| 20120271594 | MONITORING DATA CATEGORIZATION AND MODULE-BASED HEALTH CORRELATIONS - Architecture for aggregating health alerts from a number of related components into a single aggregated health state that can be analyzed to isolate the component responsible for the fault condition. In a hierarchy of related components within various component groups in a computer system, a number of health indicators can indicate alerts occurring in one or more of the related components whereas the fault condition occurs in only one component upon which the other components depend. The health indicators of related components are aggregated into an aggregated health state for each component group. These aggregated health states are analyzed to identify the related component associated with a root cause of the alert condition for an affected component group. | 10-25-2012 |
| 20120278354 | USER ANALYSIS THROUGH USER LOG FEATURE EXTRACTION - Systems, methods, and computer media for efficiently processing user log data are provided. A received user log data analysis request specifies: target user log features that identify users in a target user group, analysis user log features that identify data associated with the users in the target user group, and an analysis to perform on the identified data associated with the users in the target user group. Occurrences of specified features are extracted from user logs and stored. Users associated with an occurrence of each of the extracted and stored target user log features are identified as users in the target user group. Occurrences of the analysis user log features that are associated with a user in the target user group are extracted and reformatted for the analysis specified in the analysis request. | 11-01-2012 |
| 20120284315 | OPTIMIZATION OF NON-DETERMINISTIC COMPUTATIONAL PATHS - Methods, computer systems and computer readable media for optimizing non-deterministic computational paths are provided. In embodiments, requests are received to generate reports derived from a plurality of series of data files whose metadata attributes form certain mathematical structures that can be used to choose the optimal path in the non-deterministic dependency model. Storage for each of the series of data files is optimized. Available data files needed for the report are processed and missing data files are identified. Based on the mathematical structure of the plurality of series of data files, an optimal transition with the missing data files available is determined. An entry into the transition is triggered and the missing data files are processed. The report is generated and the optimized storage is retained for future requests. | 11-08-2012 |
| Patent application number | Description | Published |
|---|
| 20090006370 | ADVANCED TECHNIQUES FOR SQL GENERATION OF PERFORMANCEPOINT BUSINESS RULES - Computer-implemented methods and computer-readable storage media are disclosed to facilitate the application of business rules. A rule is received, the rule defining one or more calculations to be performed on specified data stored in a multidimensional database to yield at least one result. At least one database query is generated seeking the specified data to be retrieved from the multidimensional database. An intermediary table is created to accommodate the specified data retrieved from the multidimensional database. The specified data is stored in the intermediary table and the specified data is manipulated when the data is retrieved or after the specified data is stored in the intermediary table. | 01-01-2009 |
| 20090210422 | Secure Database Access - Secure database access may be provided. First, a first schema associated with a database having a second schema may be defined. Next, a user type may be defined. The user type may comprise a user type that does not require a log-in. The defined user type may then be associated with the defined first schema. Next, at least one permission may be granted to the user type to the database on a database level. The at least one permission may comprise a create procedure permission, a create table permission, or a create function permission. Then permission to the second schema may be denied to the user type. Next, a procedure may be received comprising a procedure that poses a high security risk to the database. The received procedure may then be executed as the defined user type. The received procedure may be executed using a wrapper procedure. | 08-20-2009 |
| 20090292730 | SPREADSHEET FORMULA TRANSLATION OF SERVER CALCULATION RULES - Architecture includes for translating server calculations into client application formulas. The architecture determines dependencies, performs formulae translation, and processes data retrieval queries using the translated formulae. In one implementation, the architecture translates performance management server calculations into spreadsheet application formulas so that the impact of changes can be reflected immediately. Moreover, this technique does not require updating and querying of the performance management server. An algorithm is provided that allows translation of the backend formula (e.g., MDX—multidimensional expressions) directly into the spreadsheet application such that the impact on calculated values by an input change can be reflected instantaneously in the sheet. | 11-26-2009 |
| Patent application number | Description | Published |
|---|
| 20080208720 | Type-driven rules for financial intellegence - Financial intelligence architecture that employs financial types that are combined with rules to build financial behavior into the product. Types have behaviors such that types can be assigned that lead to the physical creation of underlying code which embodies the behaviors. Extensibility is provided at least by type parameterization and new type creation. Because types are a design time experience, types are two-way and can be modified, even after instantiation. This allows for mixing and matching of types and underlying behavior giving the system more flexibility at design time while providing a huge simplification of all the details that actually go into such financial applications. The type library is a set of rules that produce metadata, which metadata is later processed by a separate engine to produce the physical schema. The type library defines the basic interactions, data types, and behaviors for predefined dimensions in the system. | 08-28-2008 |
| 20090006301 | MULTI-PLATFORM BUSINESS CALCULATION RULE LANGUAGE AND EXECUTION ENVIRONMENT - Computer-readable storage media, computer-implemented methods, and systems are disclosed for a multi-platform calculation rule language and its environment. A calculation rule, presented in an expression language and specifying one or more functions, is received. The expression language, for a plurality of different platforms, allows each of a plurality of functions to be expressed using a common syntax. A selected platform is identified on which the calculation rule is to be executed. The calculation rule is resolved to the attributes of the data model in the selected platform to apply the calculation rule to the data model. The calculation rule is executed by performing the one or more functions specified in the calculation rule, and the results from executing the calculation rule are reported. | 01-01-2009 |
| Patent application number | Description | Published |
|---|
| 20120278354 | USER ANALYSIS THROUGH USER LOG FEATURE EXTRACTION - Systems, methods, and computer media for efficiently processing user log data are provided. A received user log data analysis request specifies: target user log features that identify users in a target user group, analysis user log features that identify data associated with the users in the target user group, and an analysis to perform on the identified data associated with the users in the target user group. Occurrences of specified features are extracted from user logs and stored. Users associated with an occurrence of each of the extracted and stored target user log features are identified as users in the target user group. Occurrences of the analysis user log features that are associated with a user in the target user group are extracted and reformatted for the analysis specified in the analysis request. | 11-01-2012 |
| 20120284315 | OPTIMIZATION OF NON-DETERMINISTIC COMPUTATIONAL PATHS - Methods, computer systems and computer readable media for optimizing non-deterministic computational paths are provided. In embodiments, requests are received to generate reports derived from a plurality of series of data files whose metadata attributes form certain mathematical structures that can be used to choose the optimal path in the non-deterministic dependency model. Storage for each of the series of data files is optimized. Available data files needed for the report are processed and missing data files are identified. Based on the mathematical structure of the plurality of series of data files, an optimal transition with the missing data files available is determined. An entry into the transition is triggered and the missing data files are processed. The report is generated and the optimized storage is retained for future requests. | 11-08-2012 |
| 20120324455 | MONAD BASED CLOUD COMPUTING - Systems and methods are provided for using monads to facilitate complex computation tasks in a cloud computing environment. In particular, monads can be employed to facilitate creation and execution of data mining jobs for large data sets. Monads can allow for improved error handling for complex computation tasks. Monads can also facilitate identification of opportunities for improving the efficiency of complex computations. | 12-20-2012 |
| Patent application number | Description | Published |
|---|
| 20090076975 | STOCK INDEX LIQUIDITY SCREEN - A method of identifying global securities considered adequately liquid for foreign investment and/or inclusion in a global index. For each security, the method selects a portion of its issues (e.g., local issues) and calculates an Average Daily Trading Volume (“ADTV”) for each issue. The issue having the largest ADTV is identified as the primary issue. The method calculates the Active Trading Ratio (“ATR”) of the primary issue and determines the security is adequately liquid if the ADTV of the primary issue is greater than or equal to a minimum ADTV threshold and the ATR of the primary issue is greater than or equal to a minimum ATR threshold. The method may determine an inadequately liquid security is adequately liquid if the ADTV and ATR of another issue (e.g., a foreign issue) or depository receipts are greater than or equal to the minimum ADTV and ATR thresholds, respectively. | 03-19-2009 |
| 20090076976 | GLOBAL RELATIVE MARKET CAPITALIZATION - A method of constructing one or more global cap-size stock indexes. The method includes aggregating securities traded in a plurality of regions of the world into a single pool. Optionally, the securities may be screened to remove securities that are not available for investment by foreign investors. Additionally, a portion of the securities issued by companies having small company total market capitalizations may be screened from the pool. Then, the method determines a global market capitalization associated with each security in the pool. Finally, a portion of the securities is assigned to one of the global cap-size stock indexes based on the global market capitalization associated with the securities and one or more threshold values calculated as a function of the global market capitalizations of the securities in the pool. The global market capitalization associated with each security may include the company total market capitalization of the security's issuing company. | 03-19-2009 |
| 20090076977 | METHOD OF ASSIGNING SECURITIES TO A COUNTRY - A method of assigning securities to countries/regions. A company having a formation country/region, headquarters country/region, and primary exchange country/region issued each security. Countries/regions are classified as special, no domestic exchange (“NDE”), benefits driven incorporation (“BDI”), and non-BDI. Special rules apply to securities issued by companies formed in special countries/regions. Securities issued by companies formed in NDE countries/regions are assigned to their primary exchange countries/regions. Each security issued by a company formed in a non-BDI country/region is assigned to its formation country/region if its formation, headquarters, and primary exchange country/region are identical. If these three countries/regions are not identical and the formation country/region is a BDI country/region, the security is assigned to either the headquarters or primary exchange country/region. If these three countries/regions are not identical and the formation country/region is not a BDI country/region, the security is assigned to one of the formation, headquarters, or primary exchange country/region. | 03-19-2009 |
| 20090113396 | Monitoring asset state to enable partial build - When an up to date state has been achieved for the inputs and outputs of a build process, an asset state indicator is set to indicate that all the inputs and outputs are up to date. Those inputs and outputs are monitored. If a change to any of the inputs and/or outputs is detected, the asset state indicator is updated to indicate that some build execution is needed. When a build request is detected, the current state of the asset state indicator is exposed. An execution sequence for targets of the build process based on dependencies between targets is determined. A starting point for a partial build is determined by determining the earliest-appearing target in the sequence that is affected by the detected changes to the inputs and outputs to the targets of the execution sequence. Executing the build process from this starting point will produce the updated outputs and return the system to the up to date state. | 04-30-2009 |
| 20110099494 | DYNAMIC GRAPHICAL USER INTERFACE LAYOUT - A system and method for laying out graphical user interface elements at a client device. A client device receives a set of containers, each container including program instructions and specifications. The program instructions of each container are executed to determine a size and position of each graphical user interface element. Each type of container has corresponding logic upon which sizing and positioning of graphical user interface elements is based. The client device may receive data metadata descriptive of the graphical user interface elements and application specifications. Sizing and positioning of the graphical user interface elements may be based on the data metadata and application specifications. A layout process may recursively descend a structure of containers to determine sizes and positions of each GUI element. | 04-28-2011 |
| 20110131512 | UPDATEABLE RUNNING APPLICATION - An application can be run and initial user interface definitions for the application can be loaded into memory. The application can use the initial user interface definitions in the memory to present an initial user interface for the application. In response to user input, one or more updates can be made to the initial user interface definitions in the memory, and the application can use the updated user interface definitions to present an updated user interface for the application. Presenting the initial user interface, making the updates, and using the updated definitions to present the updated user interface can be done while the application continues to run. | 06-02-2011 |
