Past login activity is used to train a machine learning model and pre-compute network intrusion risk profiles. Subsequent login attempts can be evaluated with the pre-computed network intrusion risk profiles. If the profile shows sufficient intrusion risk, actions can be taken to avoid intrusion, such as requiring further authentication steps.
Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
G06F 16/176 - Support for shared access to filesFile sharing support
A system for managing database logging, the comprises a processor; and a user task executing in a database server process and executable by the processor, the user task to: receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtain a lock on the portion of the database; create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueue the first log record to a queue; and release the lock on the portion of the database after copying the first log record to the queue.
Techniques are provided for providing multi-factor authentication with Uniform Resource Locator (URL) validation (MFAUV). One of the multiple authentication factors used may include a unique, user-specific URL that is sent to the user within a message. In this way, the user may simply click on, or otherwise execute or select, the provided URL, directly from within the message in which the URL is provided.
G06F 21/35 - User authentication involving the use of external additional devices, e.g. dongles or smart cards communicating wirelessly
H04L 9/32 - Arrangements for secret or secure communicationsNetwork security protocols including means for verifying the identity or authority of a user of the system
In one embodiment, a local computer network includes profile information local identifications for multiple organizations. Remote profile information is stored on a remote computer network and transferred to the local network to perform secure transactions with other computer networks. Embodiments of the disclosure include linking remote and local identifications. In another embodiment, remote and local identifications are linked by generated multiple messages to different users in different roles to prevent fraud, for example.
A method for reliable data synchronization within a network is disclosed. The producer system stories data in a persistent data store and produces one or more data updates. The producer system simultaneously transmits the data updates to a consumer system and initiating storage of the data updates at the producer system. When storage of the data updates at the producer system is complete, the producer system transmits a first acknowledgment to the consumer system. The producer system determines whether a second acknowledgment has been received from the consumer system, wherein the second acknowledgment indicates that the consumer system has successfully stored the data updates at the consumer system. In accordance with a determination that the second acknowledgment has been received from the consumer system, the producer system changes the temporary status of the data updates stored at the producer system to a permanent status.
G06F 16/00 - Information retrievalDatabase structures thereforFile system structures therefor
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
G06F 11/16 - Error detection or correction of the data by redundancy in hardware
G06F 11/20 - Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
Systems and methods for receiving, at a server computer, an indication that a user is exiting an application on a client device displaying a first document, causing a footprint of the first document to be stored, receiving, at the server computer, a request for a second document from the client device operated by the user, determining that the user is enrolled in a footprint services, retrieving a footprint associated with the user including information related to a document previously accessed by the user, causing information related to the footprint to be displayed to the user on the client device, receiving, from the client device operated by the user, a response to the information related to the footprint displayed to the user on the client device, determining, from the response, a request to display the document associated with the footprint, and causing the document associated with the footprint to be displayed to the user instead of the second document requested by the user.
Techniques are provided for providing multi-factor authentication with Uniform Resource Locator (URL) validation (MFAUV). One of the multiple authentication factors used may include a unique, user-specific URL that is sent to the user within a message. In this way, the user may simply click on, or otherwise execute or select, the provided URL, directly from within the message in which the URL is provided.
G06F 21/35 - User authentication involving the use of external additional devices, e.g. dongles or smart cards communicating wirelessly
H04L 9/32 - Arrangements for secret or secure communicationsNetwork security protocols including means for verifying the identity or authority of a user of the system
H04L 29/06 - Communication control; Communication processing characterised by a protocol
Disclosed herein are methods for retrieving data from a database. An embodiment operates searching for a key in a first index. The method determines that the searching will require a storage access request and issues the storage access request. The method continues searching for the key in a second index.
An operator tree is formed for a data processing plan, the operator tree containing a plurality of interconnected nodes and including a grouping of two or more duplicative portions, each of the two or more duplicative portions having identical nodes and structure such that when the operator tree is executed, operators executed in a first duplicative portion using a first thread perform same functions use different data than operators in a second duplicative portion using a second thread. One or more operators in the first portion and one or more operators in the second portion to be synchronized with each other are identified. A synchronization point is created for the identified operators in the first thread and one or more subsequent threads, wherein the synchronization point receives information from each of the identified operators to build an artifact to deliver to one or more operators that depend on the artifact.
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
G06F 16/21 - Design, administration or maintenance of databases
G06F 9/52 - Program synchronisationMutual exclusion, e.g. by means of semaphores
11.
Optimizing performance in CEP systems via CPU affinity
In an example embodiment performance is optimized in a complex event stream (CEP) system. Information about a plurality of CEP threads is obtained. Then nearness among the plurality of CEP threads is determined, wherein nearness between a first and a second CEP thread indicates how much interaction is expected to occur between the first and second CEP thread. Based on the determined nearness, the plurality of CEP threads are organized into a plurality of CEP thread groups. Then, each of the plurality of CEP thread groups are assigned to a different processing node, with each processing node having one or more processors and a memory.
Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
G06F 16/176 - Support for shared access to filesFile sharing support
Disclosed in some examples is a method of database replication, the method including at a Relational Database Management System (RDMS), determining a first replication mode; identifying a triggering event; determining that the triggering event indicates a change in the first replication mode; responsive to determining that the triggering event indicates a change in the first replication mode, determining a second replication mode, the second replication mode being a different replication mode than the first replication mode; identifying a database change made by one or more database tasks; and replicating the database change to an external replication component according to the second replication mode.
G06F 16/00 - Information retrievalDatabase structures thereforFile system structures therefor
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
The present disclosure includes an adaptive tile framework. In one embodiment, a method is disclosed comprising sending an access request from a mobile application operating on a mobile device to one or more remote systems, receiving a plurality of interactive features available on the remote systems, associating the plurality interactive features with a plurality of tiles, where particular interactive features are associated with particular tiles, and where the tiles are user interface elements for interfacing with one or more specific interactive features of the remote systems, and displaying the tiles.
H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
G06F 16/957 - Browsing optimisation, e.g. caching or content distillation
H04W 4/20 - Services signallingAuxiliary data signalling, i.e. transmitting data via a non-traffic channel
G06F 3/0481 - Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
15.
Splitting of a join operation to allow parallelization
A system and method for processing a database query is described. In response to detection that a database query involves a star or snowflake join operation, a join operator in a preliminary query plan can be split into a build operator and a probe operator. The probe operator can be placed in a final query plan in the same place as the join operator in the preliminary query plan, while the build operator can be placed beneath the probe operator in the final query plan, between an exchange operator and the exchange operator's child from the preliminary query plan.
In an example embodiment, a method of operating a task scheduler for one or more processors is provided. A topology of one or more processors is obtained, the topology indicating a plurality of execution units and physical resources associated with each of the plurality of execution units. A task to be performed by the one or more processors is received. Then a plurality of available execution units from the plurality of execution units is identified. An optimal execution unit is then determined, from the plurality of execution units, to which to assign the task, based on the topology. The task is then assigned to the optimal execution unit, after which the task is sent to the optimal execution unit for execution.
The embodiments described in this disclosure relate to an extendable data model framework that enables users to develop applications without having to write code. The embodiments provide a user interface for users to build and maintain applications based on the framework, create custom user interfaces for the application, as well as define data objects, relationships between objects, workflows, business logic, and rules for applications the users are developing. The extendable data model framework includes an extendable data objects data structure and an extendable data object relationships data structure for users to customize data objects and relationships of the data objects for their applications using the described system. These data structures may include common data objects and relationship elements. The data structures can facilitate extension of data objects of the application as well as definition of new objects to be customized based on the business requirements of users.
G06F 3/0484 - Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
A method can include receiving a request to execute a database command identifying a target table; identifying a plurality of rows to insert into the target table based in part on the database command; writing rows, from the plurality of rows, into a data page until the data page is full; determining, by an index thread manager, a number of threads to use for updating indexes defined for the target table; and upon determining the data page is full, updating, in parallel, the indexes defined for the target table using the number of threads.
Various embodiments of the present disclosure provide improved mechanisms and techniques for integrating complex data structures with collaboration environments. Various embodiments involve creating a collaboration group around a selected complex data structure, and including the selected complex data structure as well one or more other related complex data structures in the collaboration group. In some embodiments, an object consumption definition is applied to metadata associated with the complex data structure to determine the related complex data structures.
An employee compensation modeling approach generates a model from a stored template. The model template may include fields for eligibility rules, performance ratings, guidelines, exchange rates, pay ranges, and other information. A modeling engine then populates that model with specific data from a human resources (HR) database, according to the structure of the template. Examples of HR data stored in an underlying database can include employee names, job codes, pay grades, physical job locations, base salaries, and other compensation-relevant information. The resulting compensation model includes a name, a description, target(s), and other information including allocation(s). The compensation model is displayed on an interface configured to receive further user inputs for purposes of model exploration and/or update. In certain embodiments, the HR database may be an in-memory database, with the template and/or engine also being present within the in-memory database in order to leverage its processing power and storage capacity.
An Application Program Interface (API) manages synchronization and replication of master data of a system with different consumers. An API engine is configured to receive from the third party, a query including content information and date-relevant information including a start date, an end date, and a date of last synchronization. The API engine processes the query to access the database and produce a query result replicating only data changes affecting that period or a previous time. The consumer thus specifies the time period in which to consider changes to the stored database data, and the API calculates the delta according to that period. In this manner complex, time-dependent delta calculation and filtering logic can be implemented in the API without requiring substantial logic or additional data persistence in middleware. Particular embodiments may facilitate efficient synchronized replication of employment data to outside (e.g., payroll, benefits) providers.
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
22.
Role-based permissions for hierarchy-based relationships
Some embodiments provide a program that receives, from an application, a role-based permission (RBP) request specifying an RBP, a first user, and a second user. The RBP specifies a set of actions, a first set of users authorized to perform the set of actions, a second set of users on which the first set of users is authorized to perform the set of actions, and a relationship condition. When the relationship condition specifies a hierarchy-based relationship, the program determines valid users in the second set of users according to a hierarchy of users. When the relationship condition specifies a non-hierarchy-based relationship, the program determines valid users in the second set of users according to a relationship not based on the hierarchy of users. The program determines whether the first user is authorized to perform the set of actions on the second user based on the determined valid users.
A system and method for implementing a self-learning webpage layout based on history data is disclose. A server system collects user preference data from one or more client system. The server system stores the collected user preference data in a database associated with the server system. The server system receives a webpage request from a client system, wherein the requested webpage includes a plurality of topical sections. For each respective topical section, the server system accesses user preference data associated with the respective topical section from the database associated with the server system. The server system automatically generates a customized layout for the requested webpage by arranging the one or more topical sections in association with the user preference data associated with each topical section.
In some example embodiments, a method comprises: receiving, by a first node of a plurality of nodes in a distributed database system on a shared disk cluster infrastructure, a transaction request to perform a user database transaction a data item in a user database on a shared disk; acquiring, by the first node, a transaction lock for the data item; storing a lock file for the user database transaction in a lock information database on the shared disk, the lock file comprising lock information for the transaction lock and an indication of a status of the user database transaction, and the lock information comprising an identification of a location of the data item; and storing a transaction record of the user database transaction in the user database on the shared disk subsequent to the storing of the lock file in the lock information database on the shared disk.
G06F 11/07 - Responding to the occurrence of a fault, e.g. fault tolerance
G06F 11/20 - Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
G06F 17/30 - Information retrieval; Database structures therefor
25.
Computer implemented systems and methods for fraud prevention in data transactions across disparate computing networks
In one embodiment, a local computer network includes profile information local identifications for multiple organizations. Remote profile information is stored on a remote computer network and transferred to the local network to perform secure transactions with other computer networks. Embodiments of the disclosure include linking remote and local identifications. In another embodiment, remote and local identifications are linked by generated multiple messages to different users in different roles to prevent fraud, for example.
G06Q 20/40 - Authorisation, e.g. identification of payer or payee, verification of customer or shop credentialsReview and approval of payers, e.g. check of credit lines or negative lists
H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
This disclosure provides a method, system, and computer-readable medium for maintaining a history of copied objects using a mobile device and providing a menu listing the history of copied objects when a preconfigured gesture is received by the mobile device. The history of copied objects includes text objects, such as words, phrases, sentences, or complete paragraphs, and non-text objects, such as images, sounds, movies, and other such non-text objects. In addition, the mobile device is configured to be context-sensitive such that the alphanumeric characters of the text objects are saved in a persistent data storage whereas references to the non-text objects are saved.
G06F 3/0482 - Interaction with lists of selectable items, e.g. menus
G06F 3/0484 - Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
G06F 3/0488 - Interaction techniques based on graphical user interfaces [GUI] using specific features provided by the input device, e.g. functions controlled by the rotation of a mouse with dual sensing arrangements, or of the nature of the input device, e.g. tap gestures based on pressure sensed by a digitiser using a touch-screen or digitiser, e.g. input of commands through traced gestures
G06F 9/451 - Execution arrangements for user interfaces
G06F 3/0481 - Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
Systems and methods of providing data change notifications using OData entity keys are disclosed. In some example embodiments, a first modification of a first property data of a first entity of a first entity type in a relational database is detected, with the first entity having at least one first OData key distinct from the first property data. In some example embodiments, a first event notification comprising a first indication that the first property data has been modified and the at least one first OData key is generated based on an event structure model in response to the detection of the first modification of the first property data, with the first event notification being absent the modified first property data, and the first event notification is transmitted to at least one API.
In an example embodiment, a data structure is received and automatically reconciled with other data structures in a computer system by comparing fields such as dates, transaction amounts, and discount amounts. A user is alerted as to whether the matches or discrepancies occur by displaying a message in a user interface.
In one embodiment, a local computer network includes profile information local identifications for multiple organizations. Remote profile information is stored on a remote computer network and transferred to the local network to perform secure transactions with other computer networks. Embodiments of the disclosure include linking remote and local identifications. In another embodiment, remote and local identifications are linked by generated multiple messages to different users in different roles to prevent fraud, for example.
A current time associated with a first received notification of a new object in a data set of a first system is accessed and a replication time is set to the current time. For each notification received regarding a new object in the data set of the first system, the new object is added to the replication queue. The new objects added to the queue are assigned the replication time until a specified maximum number of new objects have been added to the replication queue. Afterwards, new objects are added to the queue with no assigned replication time. When the objects in the queue are to be replicated, only the objects with the assigned replication time are copied from the queue to a second system. A new replication time is set to a new current time associated with confirmation of receipt of the copied objects received from the second system.
A database system provides a non-volatile cache memory layer for caching pages for a set of database from the database system. The non-volatile cache memory layer may include a non-volatile cache for caching pages for a database from the set of database on the database system. The non-volatile cache may be configured through invoking a configuring stored procedure persistent on the database system. A request is received at the non-volatile cache memory layer for performing an operation on a page from the database on the database system. Based on the received request and an identification of the page, a caching operation is performed on the non-volatile cache memory layer. The caching operation is associated with the request. Data associated with the requested operation on the page is stored and organized on the NV cache memory layer.
G06F 17/30 - Information retrieval; Database structures therefor
G06F 12/0875 - Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches with dedicated cache, e.g. instruction or stack
32.
Logical level difference detection between software revisions
A comparison system includes a memory including a first compiled version and a second compiled version of a target application, at least one processor, and a comparison engine, executing on the at least one processor. The comparison engine is configured to identify a method in the first compiled version, locate the method in the second compiled version, compare the method in the first compiled version to the method in the second compiled version, and providing an indication that the method is an altered method from the first compiled version to the second compiled version of the target application.
A system is provided. The system includes one or more hardware processors, a memory storing a plurality of parsing mechanics, each parsing mechanic of the plurality of parsing mechanics being associated with a plurality of functions provided by a software system, and a natural language interface engine, executing on the one or more hardware processors. The natural language interface engine configured to receive a first execution job from a user device of the natural language interface engine, the first execution job including a first sentence in a natural language, identify a first parsing mechanic from the plurality of parsing mechanics based on natural language contents of the first sentence, identify, from the identified first parsing mechanic, that a first function of the plurality of functions is associated with the first parsing mechanic, execute a first function call to the first function, and provide results to the user device.
Disclosed herein are system, method, and computer program product embodiments for generating a native access plan from a query execution plan for dynamic entity calling. An embodiment operates by receiving the query execution plan comprising at least one call to an entity, the entity being implemented by a plurality of classes, and generating source code of a native access plan that implements the query execution plan. The source code of the native access plan includes instructions to translate a run-time call to the entity to a call to a corresponding implementation of the entity based on an identifier of the called implementation of the entity.
Disclosed herein are system, method, and computer program product embodiments for generating a native access plan for semi join operators. An embodiment operates by generating a plurality of variables based upon the positions of a plurality of operators in a compiled query plan, opening and traversing tables as the query plan is executed, and closing those tables based on the rows queried and the plurality of variables.
Disclosed herein are system, method, and computer program product embodiments for eliminating redundancy when generating intermediate representation code. An embodiment operates by traversing a query execution plan, and for at least one operator in the query execution plan, determining whether the operator is derived from a parent class operator. If it is determined that the operator is derived from the parent class operator, source code for the native access plan is generated using one or more code generator functions corresponding to the parent class operator and/or one or more generator functions specifically corresponding to the child class operator. If it is determined that the operator is not derived from the parent class operator, source code for the native access plan is generated using one or more code generator functions corresponding to the operator.
Disclosed is event processing a computing center, which may include receiving events from users of the computing center to be processed. Each received event may be stored in an event queue that is associated with a customer of the user. Events in an event queue may then be processed by an event processor that is associated with that event queue.
Systems and methods are presented for determining, by a server computer, at a predetermined time, a plurality of jobs to be run, determining, by the server computer, a priority queue for the jobs based on an account type associated with each job of the plurality of jobs, and for each account type, in an order according to the priority queue, calculating a target group for each account type based on the number of tasks for each job associated with the account type, splitting the target group for each account type into a plurality of packages wherein the size of each of the packages is based on the account type and a complexity of rules associated with the account type, determining a number of threads for executing the plurality of packages for each account type based on a number of the plurality of packages, and wherein for each of the plurality of packages, business logic associated with the package is executed by one of the number of threads and notification is provided indicating that execution of the package is complete.
Some embodiments provide a non-transitory machine-readable medium that stores a program executable by at least one processing unit of a device. The program receives a selection of a navigation route through a relational data model. The relational data model includes several entities and a set of relationships among the several entities. The program also provides, through a graphical user interface (GUI), a tool for qualifying an attribute associated with an entity in the selected navigation route. The program further receives a selection of a value for the attribute associated with the entity in the navigation route for a data integration operation.
G06F 17/30 - Information retrieval; Database structures therefor
G06F 17/00 - Digital computing or data processing equipment or methods, specially adapted for specific functions
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
G06F 3/048 - Interaction techniques based on graphical user interfaces [GUI]
G06F 16/25 - Integrating or interfacing systems involving database management systems
G06F 16/28 - Databases characterised by their database models, e.g. relational or object models
40.
Graphical user interface for querying relational data models
Some embodiments provide a non-transitory machine-readable medium that stores a program executable by at least one processing unit of a device. The program receives a selection of a first entity and a second entity in a relational data model. The relational data model includes several entities and a set of relationships among the several entities. The program also determines a set of navigation routes through the relational data model based on the first and second entities. The program further provides the determined navigation routes through a graphical user interface (GUI) in order to provide a visual context of data in the relational data model.
G06F 3/00 - Input arrangements for transferring data to be processed into a form capable of being handled by the computerOutput arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
Some embodiments provide a non-transitory machine-readable medium that stores a program executable by at least one processing unit of a device. The program provides, through a graphical user interface (GUI), a tool for creating a field calculation that operates on data defined in a relational data model. The program also receives, through the GUI, the field calculation created using the tool. The program further generates data for a data integration operation based on the field calculation. The program also performs the data integration operation based on the generated data.
G06F 3/0484 - Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
Embodiments described herein relate to an improved system and method for defining and reconfiguring process flows for one or more processes within an organization visually in a graphical display at a client system using a process flow diagram comprising activity elements and decision elements representing the activities and decisions to be performed during execution of a process flow. Modifications to the process flow diagram at the client display can be saved and used to update the process flow. The process flow definitions and/or reconfigurations can be supplied to a server for storage in a database, and can be later accessed during execution of the process flow. During execution of the sequence of activities of a particular process flow, the server can access one or more services from a plurality of different service modules in communication with the server to provide those services.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
G06F 17/30 - Information retrieval; Database structures therefor
H04L 29/06 - Communication control; Communication processing characterised by a protocol
44.
Visually representing information related to an application
Various embodiments of systems, computer program products, and methods to visually represent information related to an application are described herein. A request can be received to view latest data modification information for an application. A plurality of data values and a plurality of data modification time periods corresponding to the plurality of data values can be retrieved. A plurality of latest data values from the retrieved plurality of data values can be visually modified. The modified data values and time periods can be displayed at the application.
Systems and methods for receiving, at a server computer, an indication that a user is exiting an application on a client device displaying a first document, causing a footprint of the first document to be stored, receiving, at the server computer, a request for a second document from the client device operated by the user, determining that the user is enrolled in a footprint services, retrieving a footprint associated with the user including information related to a document previously accessed by the user, causing information related to the footprint to be displayed to the user on the client device, receiving, from the client device operated by the user, a response to the information related to the footprint displayed to the user on the client device, determining, from the response, a request to display the document associated with the footprint, and causing the document associated with the footprint to be displayed to the user instead of the second document requested by the user.
This disclosure is directed to a procurement server for processing one or more requisition requests from various client devices. The procurement server determines whether there is an approver that can approve of the various requisition requests. The procurement server performs this determination by evaluating one or more requisition expressions, which include various expression attributes associated with corresponding condition operators. To expedite such processing, the procurement server builds an expression index corresponding to the various requisition expressions, where the expression index includes various nodes and associations between nodes. Each node represents a unique value assignable to the expression attributes of the various requisition expressions. When the nodes of the expression index are traversed, the last node in the traversal yields an approver that can approve the requisition request. The expression index requires less memory and time to evaluate than the various requisition expressions.
Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a queue message from a computing device. The queue message includes a request to perform a set of actions on a resource in a private network and a security signature generated from an authentication operation. The program also stores the queue message in a message queue for later retrieval when the queue message is determined to be valid based on the security signature. The program further sends the queue message to a queue monitor for the queue monitor to instruct the resource to perform the set of actions. Upon receiving a response associated with the queue message from the queue monitor, the program forwards the response associated with the queue message to the computing device.
H04L 9/32 - Arrangements for secret or secure communicationsNetwork security protocols including means for verifying the identity or authority of a user of the system
H04L 9/30 - Public key, i.e. encryption algorithm being computationally infeasible to invert and users' encryption keys not requiring secrecy
H04L 12/911 - Network admission control and resource allocation, e.g. bandwidth allocation or in-call renegotiation
H04L 29/06 - Communication control; Communication processing characterised by a protocol
A transaction descriptor associated with a vertical chain of row versions is received. The vertical chain of row versions is traversed. The vertical chain is part of a grid structure formed by a number of vertical chains intersected with a number of horizontal chains. A link to a current row version is terminated. A link from the current row version to an older row version in a horizontal chain is locally stored and terminated. The older row version is set as ready for garbage collection. The current row version is set as ready for garbage collection. A link from the current row version to a next row version in the horizontal chain is locally stored and terminated. The next row version is appointed as current.
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
49.
Use case driven stepping component automation framework
A framework for improving robustness in the execution of software workflows is described herein. One such workflow is a testing scenario, where multiple testing modules are to be executed sequentially, with some of the modules receiving as input the output of other modules. Many types of modules are contemplated, such as Application Program Interface (API) modules, User Interface (UI) modules, Database (DB) modules, and the like. Each of these modules may invoke, respond to, and/or extract data from various subjects of the testing scenario, among other operations. One aspect of the invention wraps each of these modules in a software component, such that disparate module types can be operated on with a common interface. In one embodiment, the common interface enables a test executor to retry and/or debug the software components in novel ways.
Described herein is a test data framework. In accordance with one aspect, the framework creates a test data container that stores test data corresponding to one or more attributes of a business object. The framework may further create a test metaobject instance corresponding to the business object, wherein the test metaobject instance defines associations with the test data container and the business object. The test data container and the test metaobject instance may be sent to a test system for creating one or more instances of the business object that reflect the test data.
A data model defines a structure of data objects with data fields, together with presentation properties. Data is stored according to data models. A request is received that identifies a data object described in a data model. Based on the request, data associated with the data object is invoked according to the data model. The data associated with the data object is invoked from a database and comprises fields' data, field identifiers, field labels, and field properties assigned to a plurality of fields of the data object. A set of contexts is defined to be associated with the data model. A context from the set of contexts is determined to be associated with the invoked data. A presentation of the invoked data is configured according to context specific conditions defined for the determined context. The configured presentation of the data is displayed on a presentation interface.
Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a query for a set of records in a database system having values in a field of a table that fall within a range of values. The program also determines a number of bits used to represent the values in the field of the table. The program further determines a set of operations to perform on the values in the field of the table based on the determined number of bits. The program also performs the determined set of operations on the values in the field of the table in order to identify the set of records in the database.
Some embodiments provide a system that includes a set of event publishers configured to publish events occurring on the event publishers. The system also includes a uniform event framework configured to receive, from an event publisher in the set of event publishers, an event notification indicating an event occurred on the event publisher and generate an event structure based on the event notification. The system further includes an event bus configured to receive the event notification from the uniform event framework and send the event structure to a set of event subscribers for consumption of the event structure. Each event publisher in the set of event publishers is further configured to receive different callbacks from different event subscribers in the set of event subscribers for different sets of data associated with the event.
An original query execution plan of a database query is received. The original query execution plan represents a tree of operators. Source code for the original query execution plan is generated by a single traversal of the tree of operators. The generated source code is compiled into native machine code. The native machine code represents a simplified native access plan (SNAP).
Various embodiments of systems and methods to generate native access plan source code are described herein. In one aspect, a database query is received. A query execution plan, including a parent operator and one or more descendent operators, corresponding to the database query is retrieved. Further, a check is made to determine whether the parent operator and the one or more descendent operators include at least one loop. When both the parent operator and the one or more descendent operators include at least one loop, consume points for the at least one loop are defined. The parent operator and the one or more descendent operators are merged based on consume point types to generate native access plan source code.
Some embodiments provide a non-transitory computer-readable medium that stores a program executable by at least one processing unit of a first device. The program receives from a second device a selection of a set of measures associated with data. The program also receives from the second device a selection of a set of dimensions associated with data. The program further receives from the second device a selection of a type of analysis. Based on the set of measures, the set of dimensions, and the type of analysis, the program also determines a type of visualization of the set of measures and the set of dimensions.
A method may include accepting a database query including an operator requesting two or more incoming tuple streams be combined into a result tuple stream. At least one data value in the incoming tuple streams may be represented by an enumeration value. The method may include generating a query execution plan for the database query. The query execution plan may include encoding the enumeration value and a corresponding source identifier into a composite union enumeration. The source identifier may identify which of the two or more tuple streams corresponds to the enumeration value. The method may further include executing the database query according to the query execution plan to obtain the data value and providing the data value in response to the database query.
Systems and methods for debugging in a production environment are disclosed. An example method includes receiving, by a processor, a discussion thread that includes a plurality of first level posts and a reply grouping that contains a plurality of second level posts, wherein each of the plurality of second level posts are made in response to the first level post or a second level post from the plurality of second level posts. The method then presents, by the processor, the plurality of first level posts according to a first sorting order. The method then presents, by the processor, at least some of the plurality of second level posts from the plurality of first level posts according to a second sorting order that is different than the first sorting order.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
A database query may include an operator requesting two or more incoming tuple streams be combined into a result tuple stream. Generating a query execution plan may include constructing an equivalence union enumeration lookup table for a result domain of an element within the result tuple stream by taking a set union of incoming tuple domains, wherein each distinct value within that result domain is assigned an enumeration value. Generating the query execution plan may include constructing a secondary enumeration for each incoming tuple stream, wherein each secondary enumeration maps enumerated values within the incoming tuple stream into secondary ordinal values that correspond to equivalence union enumeration values. Generating the query execution plan may include mapping an incoming enumeration value through the secondary enumeration to produce an equivalence union enumeration value, and/or mapping, with the equivalence union enumeration lookup table, the equivalence union enumeration value to a cell value.
In an example embodiment, identifications of user actions are received from a first user device, the user actions being actions related to identifying data from a multi-tenant database to view. A portion of a first search query is received from a first user device corresponding to a first tenant in a multi-tenant architecture. A list of permissions for the first user device is then obtained. A plurality of fields is retrieved from a multi-tenant database based on the portion of the first search query, the fields obtained from data stored by multiple different tenants in the multi-tenant database, the plurality of fields retrieved being limited to fields for which the first user device has permission to view. Then a plurality of autocomplete suggestions are identified from the plurality of retrieved fields, the identifying based on the user actions.
Disclosed herein are system, method, and computer program product embodiments for rollover strategies in an n-bit dictionary compressed column store. An embodiment operates by receiving a new value for addition to a compressed column store. It is determined that a maximum storage capacity for tokens in the compressed column store has been reached for the data dictionary. The compressed column store is converted into a composite store including the existing compressed column store and a newly created flat store. The new value is stored in the flat storage portion of the composite store.
In an example embodiment, a listing of factors to evaluate during calculating of an index score for documents in a database is received, as well as a ranking of each factor in the listing of factors. A relevance multiplication factor is also obtained. Then a document to index in the database is received and the document is indexed. An index score is calculated for the document based on the listing of factors and the ranking of each factor. Then a search query on the database is received. A search score for the document is calculated based on the search query. Then an overall relevance score is calculated for the document for the search query by combining the index score and the search score using the relevance multiplication factor.
Systems and methods for debugging in a production environment are disclosed. An example method includes first receiving, by a processor, a user request from a development environment to execute a debugging program in a production environment, wherein the production environment is inaccessible by the development environment. The method then approves, by the processor, the execution of the debugging program in the production environment by seeking approval from at least one member from the production environment and the development environment. The method then in response to the approving, transmitting, by the processor, a communication to the production environment to cause the debugging program to be executed in the production environment.
In one embodiment, during runtime use of a configurable application that is used by multiple service requesters, a configuration dependency manager is integrated in the configurable application to check a set of features for one of the service requesters. The method receives a service requester configuration for the set of features. A configuration dependency manager determines a set of dependencies for the set of features that have been configured by the service requester configuration and determines a developer's configuration for a plurality of features for the configurable application. Then, the configuration dependency manager analyzes the set of dependencies with corresponding dependencies in the developer's configuration to determine when an issue exists with the service requester configuration and provides a visualization of the set of features based on the analyzing the set of dependencies, wherein the issue is shown on the visualization.
Increasing the efficiency of performing queries on databases by eliminating partitions during a database query. The database query configured to access a database table having one or more columns and one or more rows, the database query including a condition on a specified basis column. The database table being partitioned on the basis of the specified column, the specified column having one or more distinct values and the partitioning including mapping, by the at least one programmable processor, individual ones of the one or more distinct values to individual partitions causing each row in the table to be mapped to a specific partition. Candidate partitions and guaranteed partitions can be identified. The database query can be applied only to candidate partitions. All rows which satisfy the database query and all the rows of the guaranteed partition can be forward for processing.
In an example embodiment, a method of operating a task scheduler for one or more processors is provided. A topology of one or more processors is obtained, the topology indicating a plurality of execution units and physical resources associated with each of the plurality of execution units. A task to be performed by the one or more processors is received. Then a plurality of available execution units from the plurality of execution units is identified. An optimal execution unit is then determined, from the plurality of execution units, to which to assign the task, based on the topology. The task is then assigned to the optimal execution unit, after which the task is sent to the optimal execution unit for execution.
A plurality of reserve and commit log operations are initiated in a database system. Thereafter, at least a portion of the database operations are logged in a log such that transient data structures are kept in-memory of the database system and persistent data structures are kept in byte-addressable memory. Next, each of one or more clients concurrently accessing the log are registered to enable such clients to access the log.
Techniques of implementing partition level operations with concurrent activities are disclosed. A first operation can be performed on a first partition of a table of data. The first partition can be one of a plurality of partitions of the table, where each partition has a plurality of rows. A first partition level lock can be applied to the first partition for a period in which the first operation is being performed on the first partition, thereby preventing any operation other than the first operation from being performed on the first partition during the period the first partition level lock is being applied to the first partition. A second operation can be performed on a second partition of the table at a point in time during which the first operation is being performed on the first partition.
Methods, systems, and computer program products for decompressing data are described. An ordinal column number of columnar data to be accessed is obtained, the ordinal column number identifying a location of the columnar data in a corresponding uncompressed row, the columnar data being stored in a first data structure. A breakpoint value in a breakpoint field of the at least partially compressed row is determined, the breakpoint value indicating a location of an end of a common prefix in the corresponding uncompressed row, the common prefix being stored in a second data structure. The ordinal column number of the columnar data to be accessed and a column number indicated by the breakpoint value are compared, the comparison identifying one or more locations of the columnar data to be accessed.
A system includes a gateway that is configured to receive a message from a source for transmission to a destination and multiple communication channels on which to transmit the message to the destination, where the communication channels include different types of communication channels. The system includes a decision engine that is operably coupled to the gateway and the communication channels. The decision engine is configured to select a first communication channel from the communication channels to route the message for transmission to the destination. The decision engine is configured to select a second communication channel from the communication channels to route the message for transmission to the destination in response to a period of time expiring without receiving an acknowledgement from the destination via the first communication channel, where the second communication channel is a different type of communication channel than the first communication channel.
Disclosed in some examples is a method, the method including detecting that an RDMS is recovering from a failure; sending a request for a last committed transaction on a replication component to the replication component; receiving, from the replication component, the last committed transaction which identifies a transaction that was the last committed transaction at a replication component at a time of RDMS failure; determining that a transaction log on the RDMS includes a transaction that had not yet been replicated at the time of RDMS failure which was committed on the transaction log subsequent to the last committed transaction received from the replication component; and based on that determination rolling back the transaction that had not yet been replicated at the time of RDMS failure.
G06F 17/30 - Information retrieval; Database structures therefor
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
G06F 11/16 - Error detection or correction of the data by redundancy in hardware
G06F 11/20 - Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
Disclosed herein are system, method, and computer program product embodiments for providing point in time recovery on a database. An embodiment operates by determining that one or more values were written to one of a plurality of database nodes of a database as part of a write transaction. The one or more data pages to which the one or more values were written are copied to a storage location of a backup corresponding to the write transaction. The storage location of the one or more data pages in the backup are written to a location in a transaction log corresponding to the write transaction.
G06F 17/30 - Information retrieval; Database structures therefor
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
Disclosed herein are system, method, and computer program product embodiments for stream optimized data processing. An embodiment operates by receive a stream of data in a streaming data format. A query associated both with the stream of data and one or more records of a database is determined. It is determined whether the one or more records of the database are stored in a local cache. Those records not stored in the local cache are retrieved from the database and converted into the streaming data format. A query response, including references to each of the one or more records stored in the local cache in the streaming data format, is provided for execution of the query.
In an example embodiment, data communications to a first database intercepted and divided based on tenant. For each tenant of multiple tenants sharing the first database, the commands to update the one or more records in the first database within the data communications corresponding to the tenant are translated into commands to update one or more records in a second database of a different type than the first database, the translated commands corresponding to the tenant are replayed against a copied version of the first database in the second database, and the performance of the second database in handling the translated commands during the replaying is tracked. Serialization and timely execution, among the translated commands corresponding to the tenant, of execution of the translated commands is maintained during the replaying and synchronization of execution of translated commands between multiple tenants is maintained.
A method and corresponding apparatus configured to collect raw data from a plurality of wireless devices. The raw data includes activity recorded when the wireless devices are at a selected topographic region. The raw data is combined to produce aggregated data representative of the activities of the individual wireless devices. Either the aggregated data or the raw data are selected for analysis depending on whether the raw data meets a threshold activity or subscriber density level. The selected data are analyzed to identify activity patterns of users of the wireless devices.
As individuals increasingly engage in different types of transactions they face a growing threat from, possibly among other things, identity theft, financial fraud, information misuse, etc. and the serious consequences or repercussions of same. Leveraging the ubiquitous nature of wireless devices and the popularity of (Short Message Service, Multimedia Message Service, etc.) messaging, an infrastructure that enhances the security of the different types of transactions within which a wireless device user may participate through a Second Factor Authentication facility. The infrastructure may optionally leverage the capabilities of a centrally-located Messaging Inter-Carrier Vendor.
In an example embodiment, primary data is received from a first tenant in a computer network. Then auxiliary data relating to the primary data is received from the first tenant. A first index is created for the primary data and the auxiliary data from the first tenant. Then the first index is stored as a first shardlet. The first shardlet is bundled with one or more other shardlets for the tenant in a shard group. The shard group is packed with one or more other shard groups in a first shard. Then the first shard is stored in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device.
In an example embodiment, a first data change and a second data change to data stored in a distributed database are received. The first data change and the second data change are batched in a communication to an index manager. The distributed database is reindexed based on the first data change and the second data change by creating a revised first shard index for a first shard in the distributed database and a revised second shard index for a second shard in the distributed database. The first shard and the second shard are instructed to update respective shard indexes. Confirmation that the first shard index has been updated is received. Then confirmation that the second shard index has been updated is received. In response to both of the confirmations, both the first shard and the second shard are instructed to commit their respective updates.
In an example embodiment, a method for indexing data is provided. Primary data and auxiliary data is received from a first tenant in a computer network. A first index is then created for the primary data and the auxiliary data from the first tenant. The first index is stored in a first shard. Then primary data and auxiliary data are received from a second tenant in the computer network. A second index is created for the primary data and the auxiliary data from the second tenant. The second index is then stored in the first shard. The first shard is then stored in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device.
G06F 17/30 - Information retrieval; Database structures therefor
G06F 16/27 - Replication, distribution or synchronisation of data between databases or within a distributed database systemDistributed database system architectures therefor
In an example embodiment, zone information is received from a distributed database, the zone information including a mapping between each of a plurality of client applications and a corresponding zone. Then a first adapter is assigned to a first client application based on the mapping. A second adapter is then assigned to a second client application based on the mapping. When data is received from the first client application, the data from the first client application is parsed using the first adapter, producing output to a search core and an indexing core associated with a zone corresponding to the first client application.
H04W 4/021 - Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences
H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
H04W 4/18 - Information format or content conversion, e.g. adaptation by the network of the transmitted or received information for the purpose of wireless delivery to users or terminals
Enterprise data sources can be monitored to detect metric conditions via rules, and alerts can be generated. The alerts can be presented as natural language descriptions of metric conditions. From an alert, the reader can navigate to a story page that presents additional detail and allows further navigation within the data. Additional detail presented can include a drill down synopsis, strategies for overcoming a negative condition, links to discussions within the organization about the condition, options for sharing or collaborating about the condition, or the like.
In an example embodiment, a disaster is detected at a primary data center and, in response to the detection, a system switches over from the primary data center to a secondary data center such that searches from one or more client applications are routed to the secondary data center. Then, for each document stored in a search core of the secondary data center: a count is requested for the document from a first client application, it is determined whether the count for the document from the first client application matches a count for the document from the search core of the secondary data center, and, in response to a determination that the count for the document from the first client application does not match a count for the document from the search core of the secondary data center, a full publish for the document is requested from the first client application.
G06F 11/14 - Error detection or correction of the data by redundancy in operation, e.g. by using different operation sequences leading to the same result
G06F 17/30 - Information retrieval; Database structures therefor
G06F 11/20 - Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
83.
Computer automated learning management systems and methods
The present disclosure includes techniques pertaining to computer automated learning management systems and methods. In one embodiment, a system is disclosed where information is represented in a learning graph. In one embodiment, a framework may be used to access different algorithms for identifying customized learning content for a user. In another embodiment, the present disclosure includes techniques for analyzing content and incorporating content into an organizational glossary.
The present disclosure includes techniques pertaining to computer automated learning management systems and methods. In one embodiment, a system is disclosed where information is represented in a learning graph. In one embodiment, a framework may be used to access different algorithms for identifying customized learning content for a user. In another embodiment, the present disclosure includes techniques for analyzing content and incorporating content into an organizational glossary.
A message identifier collector may collect message identifiers identifying sent messages having been sent by originating devices and identifying received messages of the sent messages that have been received at corresponding recipient devices. A message identifier matcher may match a sent message identifier for a sent message of the sent messages with a received message identifier for a corresponding received message of the received messages at a corresponding recipient device, and a delivery notification generator may send a delivery notification to an originating device of the originating devices that originally sent the sent message, thereby indicating receipt of the message at the corresponding recipient device. A delivery notification network path along which the message identifiers and the delivery notification are sent is different from a message delivery network path along which the message is sent.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
There is provided a method. The method may include selecting a rule defined by one or more of a location, a time, or other factor stored in a database. The method may further include selecting an external service to be triggered by application of the rule to one or more of a current location, a current time, or current other factor at a mobile station. The method may include determining the current location of the mobile station, applying the selected rule to the one or more of the current location, the current time, and a current value of other factor, and/or triggering the external service based on the applying the selected rule.
Disclosed herein is a framework for analyzing and determining the impact and importance of software code or method changes. In accordance with one aspect, invocations of methods are tracked by generating marking records. The marking records may be used to rebuild a call stack, which can be used to organize the methods to generate a calling dependency representation. The methods may then be ranked based on such calling dependency representation.
A method includes identifying a service request including a first and a second computing tasks. The first computing task includes a first program suite having a first data stack and a first code library. The second computing task includes a second program suite having a second data stack and a second code library. The method also includes, executing the first and the second computing tasks on the first and the second computing systems to produce first and second results, respectively. Executing the second computing task includes, transferring the second data stack and the second code library from the first computing system to the second computing system; producing a third data stack by executing the second code library on the second data stack; and transferring the third stack from the second computing system to the first computing system to produce the second results.
Disclosed herein are technologies for automatically updating object model and associated code for software applications, such as web pages, by invoking an automatic componentization engine client to determine changes in the component code of web pages, receiving the changes in the component code, and compiling and verifying the code. Generated or revised and updated code may then be provided to a user.
Disclosed herein is a framework for customizing multiple levels of relationships between entities in a social media network. In accordance with one aspect, n number of levels of entities related to a user of an account in the social media network may be defined with a multi-level entities module, and a list of entities in relationship to the user from level 1 to n may be determined, where level 1 entities are in a direct relationship to the user, level i entities are in a direct relationship with level i−1 entities, where i is from 1 to n, and entities in level 2 to n are in an indirect relationship to the user. The entities list may then be displayed to the user.
G06F 15/16 - Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
G06F 3/0482 - Interaction with lists of selectable items, e.g. menus
G06Q 50/00 - Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
G06T 11/20 - Drawing from basic elements, e.g. lines or circles
91.
Methods and systems for load balancing databases in a cloud environment
Systems and methods are presented for load balancing databases in a cloud server environment. In some embodiments, a method can include accessing, by a server in a network-based system, one or more system configuration parameters of the network-based system, with the one or more system configuration parameters defining one or more performance capabilities of the network-based system. The method may also include accessing performance characteristics of a query of a queried database; generating a quadtree decomposition, with the quadtree decomposition modeling a cost estimate of the database query as a function of a range of the performance capabilities of the one or more system configuration parameters; and generating a proposed packing of databases based on the modeled cost estimate of the query including the queried database and defining a configuration of a plurality of databases to be stored in the server.
Disclosed herein are technologies for a generic annotation seeker to generate an index of class annotation, mapping classes with annotations during build time. Files may be dynamically registered and scanned by a registration seeker for revised and updated annotation. This Abstract is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.
A dependent object delegation testing approach can feature use of a dependent object delegation tester object that prompts a service provider to make delegation calls and a mock enterprise services infrastructure that include mock objects for receiving the delegation calls and verifying compliance of those delegation calls with one or more predefined check types.
Methods and apparatus, including computer program products, are provided for finger gestures. In one aspect there is provided a method, which may include detecting a first finger gesture proximate to or making contact with a graphical user interface element representative of a first picker wheel presented on a user interface; detecting a second finger gesture proximate to or making contact with the user interface, the second finger gesture detected during a time period comprising a time when the first finger gesture is proximate to or making contact with the first picker wheel; changing, when the second finger gesture is detected, a second picker wheel from an independent mode to a dependent mode; and updating, when in the dependent mode, the second picker wheel based on a selection value made via the first finger gesture at the first picker wheel. Related systems, methods, and articles of manufacture are also described.
G06F 3/0482 - Interaction with lists of selectable items, e.g. menus
G06F 3/0488 - Interaction techniques based on graphical user interfaces [GUI] using specific features provided by the input device, e.g. functions controlled by the rotation of a mouse with dual sensing arrangements, or of the nature of the input device, e.g. tap gestures based on pressure sensed by a digitiser using a touch-screen or digitiser, e.g. input of commands through traced gestures
G06F 3/0484 - Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
95.
Data replication among portable electronic devices
Various embodiments of systems and methods for replicating data included in a portable electronic device to a new portable electronic device are described herein. Initially a copy of data, including an application, stored in the portable electronic device is generated. Next a determination is made whether the application is included in an application distribution platform corresponding to an operating system of the new portable electronic device. Finally based on the determination, the application is downloaded from the application distribution platform to the new portable electronic device.
Various embodiments of systems and methods for dynamically switching device configuration based upon context are described herein. In an aspect, the method includes reading a tag attached to an entry gate of a restricted area through a device. Upon reading the tag, an application is executed to connect the device to a mobile device management (MDM) server. Upon establishing the connection, the restricted area identifier (ID) is sent to the MDM server. The device receives one or more policies applicable for the restricted area from the MDM server. The received one or more policies are executed on the device to change the device configuration. After execution, the device sends a confirmation message to the MDM server to indicate that the device is policy complaint. Upon receiving the confirmation, the MDM server instructs to open the entry gate to allow the device within the restricted area.
Techniques are described for scrolling through a data table containing a list of items. A portion of a list of items can be presented in a container. During scrolling, selected items can become locked to a boundary of the container. When an item becomes locked, the item remains at a fixed position within the container, even during scrolling. A second container configured to present locked items can be generated once a predefined number of selected items have become locked within the container. The locked item can be moved from the container to the second container, thus freeing up available space within the container for the scrolling of items within the data table.
G06F 3/0484 - Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
98.
Customizable web application firewall for software as a service platform
Disclosed herein are technologies for implementing a web application firewall specific to tenants, and providing different security rules that are particular to the tenants. In accordance with one implementation, authentication instructions as to one or more tenants may be received and the one or more tenants may be registered. Rules associated to and specific to each of the one or more tenants may further be identified and implemented.
Systems and methods for prioritizing cloud-based computing tasks are provided. An example method includes, identifying a first plurality of service requests submitted by a plurality of users including a first user; selecting a first service request, in the plurality of service requests, in accordance with a first priority, where the first service request is submitted by the first user; selecting a second service request submitted by the first user, in a second plurality of service requests submitted by the first user, in accordance with a second priority, where the second service request is associated with a first job type; and selecting a third service request submitted by the first user, in a third plurality of service requests submitted the first user, in accordance with a third priority, where the third plurality of service requests submitted the first user are associate with a same job type.
A system, a method, and a computer program product for providing a user interface configuration tool are disclosed. A first user interface containing a presentation is generated. The presentation is generated based on a template stored in a memory and includes a plurality of portions. The presentation is modified based on information stored in the memory. The information relates to at least one user and at least one activity to be performed by the user. A modified presentation is generated for displaying in the first user interface, where the modified presentation is presented in a first format. A second user interface is generated for displaying the modified presentation in the first format. The modified presentation is presented to the user in the second user interface.
H04L 29/08 - Transmission control procedure, e.g. data link level control procedure
G06F 3/0489 - Interaction techniques based on graphical user interfaces [GUI] using specific features provided by the input device, e.g. functions controlled by the rotation of a mouse with dual sensing arrangements, or of the nature of the input device, e.g. tap gestures based on pressure sensed by a digitiser using dedicated keyboard keys or combinations thereof
G06F 9/44 - Arrangements for executing specific programs
G06F 3/0481 - Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
