Abstract: Computing equipment may perform format-preserving encryption and decryption by partitioning an input string into first and second portions. The computing equipment may combine the first portion with the second portion after the second portion has been passed through a pseudorandom function using a format-preserving combination operation that requires inputs having a similar domain size. A data size adjustment engine may adjust the domain size of the output of the pseudorandom function to be similar to the domain size of the first string. In order to mitigate undesirable data overflows, the output of the pseudorandom function may be partitioned into a number of computationally simpler terms each having a modulo factor and a pre-computed constant value. The computing equipment may pre-compute the constant values in advance, thereby reducing the computational complexity required for performing the size adjustment operations without generating undesirable data overflows.

Abstract: Example implementations relate to updating an inference graph absent node locking. For example, a processor executing a first thread may receive a first task for updating a node of an inference graph stored by a storage device accessible to a second thread, the first task being assigned during a first iteration of a graph update loop. Absent locking the node from access by the second thread, the processor may generate a value for the node and update the node with the value. Based on detecting that each node of the inference graph has been updated, the processor may continue with a second iteration of the graph update loop.

Abstract: Examples discussed herein disclose, among other things, an encrypting device. The encrypting device may include a key engine to obtain a first key associated with a first access level, and a second key associated with a second access level. The encrypting device may also include a multi-key encryption engine to encrypt a first portion of the plaintext with the first key, and encrypt a second portion of the plaintext with the second key, where the first portion may include more detailed information than the second portion, and where the first access level may be higher than the second access level.

Abstract: In one example, a system for a sort function race can include a processor, and a memory resource storing instructions executable by the processor to generate a plurality of variant sort functions that utilize a variant of an input from a parent sort function, that perform the plurality of variant sort functions as a plurality of separate processes, identify a variant sort function from the plurality of variant sort functions that completes a function in a shortest period of time, and receive results from the identified variant sort function.

Abstract: Managing a presentation includes identifying audience member interactions with a plurality of presentation pages. Each of the plurality of presentation pages is associated with data indicative of the audience member interactions. That data is processed to identify an action plan specifying an update to the presentation. That update is based on identified audience member interactions with at least one of the plurality of presentation pages. The action plan is implemented to update the presentation.

Abstract: According to examples, an apparatus may include a processor and a non-transitory computer readable medium storing machine readable instructions. The instructions may cause the processor to access a plurality of widgets, in which each of the plurality of widgets includes a data value. The instructions may also cause the processor to identify a widget of the plurality of widgets including a data value that has changed over time by an amount that exceeds a pre-defined threshold as a widget-of-interest and output a notification regarding a suggestion for the widget-of-interest to be displayed on a user dashboard.

Abstract: Systems and methods are provided for securing payment card information. A user may present a payment card such as a credit card to point-of-sale equipment. The point-of-sale equipment may encrypt the payment card information. An encryption algorithm may be used that takes as inputs a first part of the payment card information, a tweak formed by a second part of the payment card information, and an encryption key. The encrypted payment card information may be conveyed to a gateway over a communications network. The gateway may identify which encryption algorithm was used in encrypting the payment card information and may re-encrypt the payment card information using a format preserving encryption algorithm. A network-based service may be used to remotely perform functions for the gateway.

Abstract: A technique includes dynamically assigning, by a server, network addresses selected from a plurality of network addresses to network devices of a network based on a schedule. The schedule represents a time during which a given network address is to remain unassigned. The technique includes, based on the schedule, detecting anomalous behavior associated with the network.

Abstract: A method for evaluating user interface efficiency includes discerning user actions with the user interface occurring between each of a plurality of adjacent pairs of transaction points. Those adjacent pairs of transaction points are evaluated to identify a given one of a plurality of user flows associated with the user interface. The identified user actions occurring between each adjacent pair of transaction points are assessed to calculate an efficiency score. The efficiency score is associated with the identified user flow and is indicative of user interface efficiency.

Abstract: In an example, data from a source location is merged into a target location containing existing data, in which the source location and the target location contain tuples of data. For each tuple in the source location, during a single operation, a determination is made as to whether there is a matched tuple in the target location that satisfies a predetermined condition. For each matched tuple that satisfies the predetermined condition, the matched tuple in the target location is updated with a count value that is equal to a count of the matched tuple in the source location and the target location. In addition, for each tuple that does not have a matched tuple that satisfies the predetermined condition, the unmatched tuple is inserted into the target location.

Abstract: In an example, a top-k function is associated with a top-k projection for a data storage system. Input data to be loaded into the data storage system is divided and ranked according to the top-k function and stored in the top-k projection.

Abstract: In some examples, a system includes query path determination circuitry to identify an aggregate projection to consider for generating a query path for the query. The aggregate projection may include an aggregated value calculated from a table column of a database table using an aggregate function. The query path determination circuitry may further be to compare candidate query paths for the query derived using the aggregate projection with candidate query paths for the query derived using a non-aggregate projection, determine a selected query path among the candidate query paths derived using the aggregate projection and the non-aggregate projection and use the selected query path as part of the query path for handling the query.

Abstract: In some examples, geographical track data obfuscation may include ascertaining geographical data points that include a first data point and subsequent data points. For each of the subsequent data points, a delta degree value may be determined as a difference between a subsequent data point and a corresponding previous data point. A first format preserving encryption (FPE) may be applied to encrypt longitude and latitude values of the first data point. A second FPE may be applied by applying a translation of a plurality of translations to encrypt each delta degree value. A total distance traveled, a total time, and/or a total elevation gain may be extracted from the encrypted first data point and the encrypted delta degree values.

Abstract: Resource management in a cloud environment is disclosed. One example is a system including at least one processor and a memory storing instructions executable by the at least one processor to receive an action trigger indicative of a status of a user from a source application, wherein the source application includes a mobile application, a biometric application or a geo-fencing application, retrieve an activity status for a resource of a plurality of resources in a hybrid cloud environment, and provide, based on the action trigger and the activity status, a recommendation for deployment or non-deployment of the resource to achieve resource efficiency.

Abstract: Methods, devices, and techniques for base user defined functions in a database management system are discussed herein. For example, in one aspect, a query request is received from a computer device. The query request may include a query operator representing a specialized user defined function (SUDF). The SUDF may then be executed. Executing the SUDF may include executing a base operation of a base user defined function (BUDF). The base operation may interact with an application programming interface (API) of the query engine to obtain a tuple stored in the database. Executing the SUDF may further include executing a specialized operation that processes the tuple according to an analytics function. The specialized operation may generate a result. Then, a query result may be returned to the computer device. The query result can include the result.

Abstract: According to an example, pre-cognitive SIEM may include using trained classifiers to detect an anomaly in input events, and generating a predictive attack graph based on the detected anomaly in the input events. The predictive attack graph may provide an indication of different paths that can be taken from an asset that is related to the detected anomaly to compromise other selected assets in a network of the asset, and the other selected assets may be selected based on a ranking criterion and a complexity criterion. A rank list and a complexity list may be generated. The rank list, the complexity list, a depth of the predictive attack graph, and a weighted value may be used to generate a score that provides an indication of a number of assets that can be compromised and a difficulty of exploiting vulnerabilities related to services of the assets that can be compromised.

Abstract: A test system accesses a test script. The test script is to test an application at a target screen resolution. The test system tests the application using the test script, and a current screen resolution of the test system is different from the target screen resolution. In the test, the test system initializes a system web browser to run the application, and in the test, the test system overwrites a size parameter of the system web browser to cause a content window of the system web browser to display application content at the target screen resolution instead of the current screen resolution.

Abstract: Examples disclosed herein relate, among other things, to an apparatus that includes a processor and a non-transitory machine-readable medium on which is stored instructions that, when executed by the processor, cause the processor to generate a report, the report including a value, access a memory, the memory storing indications of whether values are to be masked, determine that the value is to be masked based on the accessed memory, and substitute the value in the report with a masked value.

Abstract: A technique includes modeling assignments of a plurality of nodes to a plurality of shards associated with a database operation based on a target throughput for the plurality of nodes. The modeling includes constraining the assignments based on an aggregate outflow from the plurality of nodes. The technique includes initializing the aggregate outflow to be less than the target throughput; and determining the assignments based on the modeling.

Abstract: Examples herein involve a document object model (DOM) transaction crawler. Examples herein involve identifying an event in a first state of a document object model. The event is executed to cause a state change from the first state of the document object model to a second state of the document object model. Furthermore, the state change is stored in a transaction log to store the difference between the first state of the document object model and the second state of the document object model.