Patent application number | Description | Published |
20160132801 | GLOBAL WORK ALLOCATOR SYSTEM - An end-to-end, centralized and globally-accessible platform for work assignment input, allocation, performance and tracking is herein described. The platform is configured to improve operational and quality assurance effectiveness and efficiency through automated work allocation, performance tracking and reporting. The end-to-end approach accounts for work assignment input, work assignment allocation, work assignment processing and quality assessment and assurance of the completed work assignments. In addition, both automated and manual work assignment allocations from both an operation (i.e., work input and allocation) perspective, as well as, a quality assurance perspective are possible. | 05-12-2016 |
20160132813 | SYSTEMS FOR MANAGING QUALITY ASSURANCE OF WORK ASSIGNMENTS - Systems, apparatus, and computer program products provide for a comprehensive quality assurance platform for automatically assessing the quality of work performance of associates. The described quality assurance system/module that can be implemented in conjunction with the work allocation system described herein or the system can operate as a standalone quality assurance system/module. The quality assurance system provides for automated collection and tracking of quality metrics and automated quality calibrations (i.e., automated and random selection of work assignment/transactions for comparison to standards). Additionally, the quality assurance system provides for validating the quality assurance work by random sampling and quality assurance assessment of the auditor's work and an associate improvement plan, whereby quality assurance metrics may be systematically adjusted and/or sampling sizes increased for associates with quality scores that dictate a need for improvement. | 05-12-2016 |
Patent application number | Description | Published |
20120136781 | REAL-TIME PAYMENTS THROUGH FINANCIAL INSTITUTION - A payment provider uses bank rails to enable a bank customer to send real-time payments through the bank site by simply entering a recipient identifier, such as an email address or mobile number. The bank has an account with the payment provider. Thus, when the customer sends a payment through the bank, the payment provider transmits the payment to the recipient through the bank's payment provider account. The bank debits the amount from the user's bank account or from a third party, in which case the bank makes a payment to the third party. The sender does not have to have an account with the payment provider, just an account with the bank. | 05-31-2012 |
20130080325 | DEPOSITING AND WITHDRAWING FUNDS - A user without Internet access or a bank account can fund an online payment provider account by depositing cash or voucher from a third party into a machine or with a person, and entering an account identifier, such as an email or phone number. The user can receive cash through the online payment provider by logging into an account through a machine, entering the amount of cash requested, and receiving a voucher. The user can then insert the voucher into a cash dispensing machine or present the voucher to a person to redeem the voucher for cash or redeem the voucher for store merchandise. | 03-28-2013 |
20150278782 | DEPOSITING AND WITHDRAWING FUNDS - A user without Internet access or a bank account can fund an online payment provider account by depositing cash or voucher from a third party into a machine or with a person, and entering an account identifier, such as an email or phone number. The user can receive cash through the online payment provider by logging into an account through a machine, entering the amount of cash requested, and receiving a voucher. The user can then insert the voucher into a cash dispensing machine or present the voucher to a person to redeem the voucher for cash or redeem the voucher for store merchandise. | 10-01-2015 |
20160132884 | REAL-TIME PAYMENTS THROUGH FINANCIAL INSTITUTION - A payment provider uses bank rails to enable a bank customer to send real-time payments through the bank site by simply entering a recipient identifier, such as an email address or mobile number. The bank has an account with the payment provider. Thus, when the customer sends a payment through the bank, the payment provider transmits the payment to the recipient through the bank's payment provider account. The bank debits the amount from the user's bank account or from a third party, in which case the bank makes a payment to the third party. The sender does not have to have an account with the payment provider, just an account with the bank. | 05-12-2016 |
Patent application number | Description | Published |
20090265296 | Scalable and Interactive Method of Generating and Modifying Network Configurations to Enforce Compliance with High-Level Requirements - A system and method provides a solution to the problem of applying end-to-end requirements of connectivity, security, reliability and performance to configure a network and ultimately assign network components to the network. All requirements are modeled as constraints and a constraint solver does the resolution Not every constraint to be solved is solved by the model-finder. Instead, we “factor away” subsets of a constraint that can be efficiently solved via a special-purpose constraint solver, such as an SQL/Prolog engine, linear programming system, or even an algorithm, leaving behind a constraint that truly requires the power of model-finding, and that is often efficiently solvable by existing model-finders. Such constraints are compiled into quantifier-free constraints that are Boolean combinations of constraints of two forms x=y and x=c where x, y are variables and c is a constant. Such constraints can be efficiently solved by modern SAT-based model-finders. The system intelligently removes the quantifiers instead of having the model-finder remove the quantifiers. An “unsatisfiability-core” analysis efficiently guides the search for configurations to change to restore consistency. | 10-22-2009 |
20120016909 | QUERY-BASED SEMANTIC ANALYSIS OF AD HOC CONFIGURATION LANGUAGES FOR NETWORKS - A method is provided for analyzing the semantic content of network configuration files, comprising the steps of accessing configuration files associated with corresponding network components, the files containing commands that define the configuration of those components; transforming the commands into a structural database based, at least in part, on a non-grammatical analysis of the commands, wherein the structure of the commands is represented as the structural database; and constructing a semantic database of the configuration files by querying the structural database. | 01-19-2012 |
20120017260 | VERIFYING ACCESS-CONTROL POLICIES WITH ARITHMETIC QUANTIFIER-FREE FORM CONSTRAINTS - A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving. | 01-19-2012 |
20120130939 | RECONFIGURATION PLANNING - A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values. | 05-24-2012 |
20120331115 | OPTIMAL NETWORK CONFIGURATION REPAIR - Changing a network configuration to restore compliance to one requirement may invalidate the network compliance with another requirement. A method changes a configuration to restore compliance to all requirements at minimum cost. The requirements are a hybrid of symbolic, arithmetic and bit-vector constraints, so traditional optimization techniques such as linear programming, that work only for purely arithmetic constraints, do not apply. The requirements are represented as SMT (satisfiability-modulo-theory) constraints on configuration variables, and then a weighted Max-SAT solver is used to compute the optimal configuration changes in order to minimize the cost. | 12-27-2012 |
20140337917 | VERIFYING ACCESS-CONTROL POLICIES WITH ARITHMETIC QUANTIFIER-FREE FORM CONSTRAINTS - A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving. | 11-13-2014 |