Abstract: A method includes receiving a message comprising a user identification code via a social media messaging channel. In addition, the method includes receiving geo-location information of the device transmitting the message. The method also includes verifying the user identification code by confirming that the geo-location information complies with stored expected geo-location information. The method also includes accessing data associated with a transaction account linked to the user identification code based on the content of the message. The method further includes transmitting a reply to the received message on the social media messaging channel.

Abstract: Systems and methods for messaging balancing and control are disclosed. The system may retrieve aggregated message events from a first time window based on a balancing schedule. Each message event in the aggregated message events may include a timestamp. The timestamp may be within a time period assigned to the first time window. The system may execute an aggregated balancing operation on the aggregated message events. In response to determining in the aggregated balancing operation that the aggregated message events are out-of-balance, the system may execute an event balancing operation on the message events.

Abstract: A user may interact with a first application. A dynamic user interface consistency system may create a user interface blueprint file which stores explicit and inferred user preferences. The user may open a second application. The second application may refer to the user interface blueprint file to generate a user interface according to the user preferences.

Abstract: A method includes receiving a message comprising a user identification code via a social media messaging channel. In addition, the method includes receiving geo-location information of the device transmitting the message. The method also includes verifying the user identification code by confirming that the geo-location information complies with stored expected geo-location information. The method also includes accessing data associated with a transaction account linked to the user identification code based on the content of the message. The method further includes transmitting a reply to the received message on the social media messaging channel.

Abstract: The system may be configured to perform operations including receiving a transaction message based on a marker associated with the transaction message; applying a processing module to the transaction message, wherein the processing module is comprised in the processing machine; accessing processing information in the memory in order to execute the processing module; and processing the transaction message by executing the processing module on the transaction message. The transaction message may have been separated from an input file and may represent a transaction between a merchant and a consumer. The marker may represent a transaction characteristic of the transaction message.

Abstract: The system may be configured to perform operations including receiving a transaction message based on a marker associated with the transaction message; applying a processing module to the transaction message, wherein the processing module is comprised in the processing machine; accessing processing information in the memory in order to execute the processing module; and processing the transaction message by executing the processing module on the transaction message. The transaction message may have been separated from an input file and may represent a transaction between a merchant and a consumer. The marker may represent a transaction characteristic of the transaction message.

Abstract: An improved tessellation graphics pipeline that obviates that use of early stage vertex shaders and hull shaders and allows greater efficiency and flexibility. Embodiments provide a graphics pipeline beginning with a tessellator that may obtain tessellation factors in any manner such as reading from a memory of factors provided by a developer or computing the factors using a compute kernel. In some embodiments, a single vertex shader may follow the tessellator and perform all the necessary vertex shading for the pipeline. Furthermore, in some embodiments, a compute kernel is used to generate the tessellation factors. The compute kernel provides flexibility that allows its employment for some graphic portions and not others. In addition, the streamlined pipeline facilitates the efficient use of scaling to determine tessellation factors for the same graphic portion at different camera distances or desired levels of replication of the mathematical model.

Abstract: A method for facilitating the processing of markup language documents, e.g., XML documents, uses a code generator that creates programs configured to read dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML Parse” statements. In one embodiment, this process involves (1) creating a template document using the markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a data structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the data structure, and is configured to read, during run-time, the markup language document and generate a corresponding set of data elements corresponding to the data structure.

Abstract: A method includes receiving a message comprising a user identification code via a social media messaging channel. In addition, the method includes receiving geo-location information of the device transmitting the message. The method also includes verifying the user identification code by confirming that the geo-location information complies with stored expected geo-location information. The method also includes accessing data associated with a transaction account linked to the user identification code based on the content of the message. The method further includes transmitting a reply to the received message on the social media messaging channel.

Abstract: A method for facilitating the processing of markup language documents, e.g., XML documents, uses a code generator that creates programs configured to read dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML Parse” statements. In one embodiment, this process involves (1) creating a template document using the markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a data structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the data structure, and is configured to read, during run-time, the markup language document and generate a corresponding set of data elements corresponding to the data structure.

Abstract: A method for facilitating the processing of markup language documents, e.g., XML documents, uses a code generator that creates programs configured to read dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML Parse” statements. In one embodiment, this process involves (1) creating a template document using the markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a data structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the data structure, and is configured to read, during run-time, the markup language document and generate a corresponding set of data elements corresponding to the data structure.

Abstract: A method for generating markup language documents, e.g., XML documents, uses a code generator that creates programs configured to create dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML GENERATE” statements. In one embodiment, this process involves (1) creating a template document using a markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a working storage structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the working storage structure, and is configured to generate, during run-time, a markup language document corresponding to the original template document.

Abstract: A method for generating markup language documents, e.g., XML documents, uses a code generator that creates programs configured to create dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML GENERATE” statements. In one embodiment, this process involves (1) creating a template document using a markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a working storage structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the working storage structure, and is configured to generate, during run-time, a markup language document corresponding to the original template document.

Abstract: Process for reverse engineering a program application written in a legacy programming language (e.g., COBOL), where the program application was specifically designed using a markup language template so as to process documents in the markup language. The process involves extracting from the program application, line by line, content fragments of the original markup language template and reassembling them to obtain the original template.

Abstract: A method for generating markup language documents, e.g., XML documents, uses a code generator that creates programs configured to create dynamic XML documents at run time, avoiding many of the complexities arising from the use of conventional “XML GENERATE” statements. In one embodiment, this process involves (1) creating a template document using a markup language, wherein the template document includes a set of tags associated with the markup language documents; (2) parsing the template document to determine a working storage structure corresponding to the tags in the template document; and (3) generating an application program in the programming language (e.g., COBOL), wherein the application program includes a definition of the working storage structure, and is configured to generate, during run-time, a markup language document corresponding to the original template document.

Abstract: The present invention provides a computer program utility that may be employed in a COBOL programming environment to calculate the number of parameters passed from one program to another. The parameter counting utility may be called from a second program upon receiving a call with parameters from a first program. The parameter counting utility derives the number of parameters by examining the save area of a first program in relation to the save area of the second program which placed the call to the parameter counting utility. The parameter counting utility may then return the number of parameters to the calling program in the form of a variable.

Abstract: Process for reverse engineering a program application written in a legacy programming language (e.g., COBOL), where the program application was specifically designed using a markup language template so as to process documents in the markup language. The process involves extracting from the program application, line by line, content fragments of the original markup language template and reassembling them to obtain the original template.

Abstract: The present invention provides a computer program utility that may be employed in a COBOL programming environment to calculate the number of parameters passed from one program to another. The parameter counting utility may be called from a second program upon receiving a call with parameters from a first program. The parameter counting utility derives the number of parameters by examining the save area of a first program in relation to the save area of the second program which placed the call to the parameter counting utility. The parameter counting utility may then return the number of parameters to the calling program in the form of a variable.

Abstract: A security application for granting different access rights to web pages and objects on each web page is disclosed. A data table assigns one or more function identifiers (FIDs) to users. A second data table assigns a different object identifier (OID) to each web page, and to assign a different OID for each object on each web page. A third data table assigns an FID to each OID. When a user attempts to access a web page or an object on the web page, a web server compares each of the user's FIDs to the FID assigned to the web page or object. The web server grants access to the web page or object if one of the user's FIDs matches the FID assigned to the web page or object, the user is granted access to the web page or object according to the function of the matched FID.

Abstract: The present invention provides systems and methods for facilitating encryption and decryption of data. In accordance with an exemplary embodiment of the present invention, an encryption key having a number of characters is located. A character in the encryption key is located to provide a located character in the encryption key. The number of characters in the data is determined. The position of the located character in the encryption key is shifted by a predetermined amount to determine a shifted position of the located character in the encryption key. Accordingly, the shifted position is located at a position in the encryption key that is the located character shifted by the predetermined amount. A first character in the data is translated with the character located at the shifted position to provide an encrypted character. The shifting and translating are repeated for any remaining characters in the data to provide encrypted data.