Abstract: Various methods, apparatuses/systems, and media for generating a data structure are provided. A database stores a historic version of taxonomy data and a new version of taxonomy data. A processor, operatively connected to the database, accesses the database and analyzes the historic version of taxonomy data and the new version of taxonomy data. The processor determines what changes have been made in connection with a particular reference data based on analyzing the historic version of taxonomy data and the new version of taxonomy data; creates, based on determining, an association between the historic version of taxonomy data and the new version of taxonomy data corresponding to said particular reference data; generates consistent metadata from said association; and generates a data structure that illustrates history of evolution of taxonomy in connection with said particular reference data based on the metadata.

Abstract: Various methods, apparatuses/systems, and media for application of an N-dimensional hypercube datatype for automatically generating a data structure are provided. A database stores a plurality of data each associated with a corresponding application and each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata and store the taxonomies onto the database; receive the metadata and the taxonomies from the database via a communication network; automatically generate a cube set including a set of N-dimensional hypercubes from the received metadata to represent the metadata describing the information about the data; automatically generate a map from the cube set to express data quality checks and rules that apply to nodes in the map; and apply the data quality checks and rules to the received metadata to automatically generate a data structure.

Abstract: Various methods, apparatuses/systems, and media for generating a data structure are provided. A database stores a historic version of taxonomy data and a new version of taxonomy data. A processor, operatively connected to the database, accesses the database and analyzes the historic version of taxonomy data and the new version of taxonomy data. The processor determines what changes have been made in connection with a particular reference data based on analyzing the historic version of taxonomy data and the new version of taxonomy data; creates, based on determining, an association between the historic version of taxonomy data and the new version of taxonomy data corresponding to said particular reference data; generates consistent metadata from said association; and generates a data structure that illustrates history of evolution of taxonomy in connection with said particular reference data based on the metadata.

Abstract: Various methods, apparatuses/systems, and media for application of an N-dimensional hypercube datatype for automatically generating a data structure are provided. A database stores a plurality of data each associated with a corresponding application and each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata and store the taxonomies onto the database; receive the metadata and the taxonomies from the database via a communication network; automatically generate a cube set including a set of N-dimensional hypercubes from the received metadata to represent the metadata describing the information about the data; automatically generate a map from the cube set to express data quality checks and rules that apply to nodes in the map; and apply the data quality checks and rules to the received metadata to automatically generate a data structure.

Abstract: Various methods, apparatuses/systems, and media for implementing an N-dimensional hypercube visualization module are provided. A database stores a plurality of data each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata; receives the metadata and the taxonomies from the database via a communication network; automatically generates a cube set including a set of N-dimensional hypercubes from the received metadata; for each dimension of the cube set, automatically generates a map from values in that dimension to a number range; receives input for selecting three or fewer dimensions from the cube set to be displayed onto a graphical user interface (GUI) based on the number range; and automatically build a tree-view user interface (UI) component onto the GUI based on the received input representing selected and unselected terms from a taxonomy among the created taxonomies corresponding to a dimension.

Abstract: A system for authenticating a customer is disclosed. The customer may attempt to access protected resources located at an authentication server. The customer may log in to the authentication server's website, thereby submitting an authentication request. The authentication request may comprise attributes of the device the customer uses to log in. The authentication server may generate a device ID using the received device attributes and generate an authentication token that is signed with the device ID. The authentication server may transmit the authentication token to the client device. Subsequent requests to access protected resources from the client device may include the authentication token that is signed with the device ID.

Abstract: A system for authenticating a customer is disclosed. The customer may attempt to access protected resources located at an authentication server. The customer may log in to the authentication server's website, thereby submitting an authentication request. The authentication request may comprise attributes of the device the customer uses to log in. The authentication server may generate a device ID using the received device attributes and generate an authentication token that is signed with the device ID. The authentication server may transmit the authentication token to the client device. Subsequent requests to access protected resources from the client device may include the authentication token that is signed with the device ID.

Abstract: A system for authenticating a mobile user's identity is disclosed. The user may be required to log in upon first launching a mobile application. Subsequent launches of the mobile application may not require the user to log in. Upon subsequently launching the mobile application, the mobile device may transmit a token validation request that includes a soft token stored at the mobile application. An authentication server may receive the request and transmit a one-time password to a device that has the phone number associated with the soft token. The authentication server may also transmit a session ID number. When the authentication server receives an identity validation response from the mobile device that includes the session ID number and the one-time password, the authentication server may output requested customer account information.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: A method for processing information, such as user preferences and other user information, operates in connection with a server and/or a browser device. A connection is established between the browser device and the server, and a unique identifier is transmitted from the server to the browser device for storage on the browser device. User information is then received at the server, from the browser device and stored in a memory of the server, and the unique identifier is associated with the user information in the memory of the server. The user information includes one or more of the following types of information: language preferences, graphic display configuration preferences, other display preferences, disability preferences, marketing preferences, content preferences, personal user information, browsing history information, visitor type information, customer status information, relationship information, and user analytic information.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique.