Abstract: Embodiments of the present invention relate to techniques for creating policies. A plurality of objects representative of semantic objects are provided to a user. An arrangement of a subset of the objects, the arrangement representative of a policy, is received. The arrangement is converted to instructions for implementation by an application configured to implement policies. One or more of the objects may include fields and/or controls for specifying criteria of semantic objects represented by the objects.

Abstract: The disclosed embodiments provide a system that detects counterfeit electronic components in a target device, which is part of an electrical generation and distribution system. During operation, the system obtains target EMI signals, which were gathered by monitoring target electromagnetic interference (EMI) emissions generated by the target device using one or more target antennas positioned in proximity to the target device. Next, the system generates a target EMI fingerprint for the target device from the target EMI signals. Finally, the system compares the target EMI fingerprint against a reference EMI fingerprint for the target device to determine whether the target device contains one or more counterfeit electronic components.

Abstract: A runtime environment generates a proxy class in response to detecting a request for a proxy object. The proxy class implements a set of interfaces specified by the request for the proxy object. The runtime environment selects or generates a proxy module, in a module system, to include the proxy class. The runtime environment exposes interfaces from other modules to the proxy module using a qualified export that does not expose the interfaces to modules other than the proxy module. The runtime environment does not expose the proxy class, of the proxy module, to other modules in the module system.

Abstract: Computer-implemented techniques described herein provide efficient data decoding using runtime specialization. In an embodiment, a method comprises a virtual machine executing a body of code of a dynamically typed language, wherein executing the body of code includes: querying a relational database, and in response to the query, receiving table metadata indicating data types of one or more columns of a first table in the relational database. In response to receiving the table metadata: for a first column of the one or more columns, generating decoding machine code to decode the first column based on the data type of the first column, and executing the decoding machine code to decode the first column of the one or more columns.

Abstract: User interface controls that facilitate the specification/modification of data hierarchies. In one set of embodiments, a first UI control component can be provided that comprises an ordered group of drop-down menus. Each drop-down menu in the ordered group can be populated with a selectable list of attributes from a data set and can be associated with a level in a data hierarchy. By selecting values using the various drop-down menus, a user can interactively specify a data hierarchy for the data set. The data set can then be visualized according to the specified hierarchy. In further embodiments, a second UI control component can be provided in addition to the first UI control component. The second UI control component can allow a user to interactively enable or disable certain drop-down menus in the ordered group, thereby acting as a “depth filter” for controlling the depth of the data hierarchy.

Abstract: Systems and methods for extracting tuples using dynamically generated extractor classes are disclosed. In some examples, an optimized tuple extraction class can be dynamically generated to enable more efficient tuple extraction.

Abstract: Techniques are described herein for introducing transcode operators into a generated operator tree during query processing. Setting up the transcode operators with correct encoding type at runtime is performed by inferring correct encoding type information during compile time. The inference of the correct encoding type information occurs in three phases during compile time: the first phase involves collecting, consolidating, and propagating the encoding-type information of input columns up the expression tree. The second phase involves pushing the encoding-type information down the tree for nodes in the expression tree that do not yet have any encoding-type assigned. The third phase involves determining which inputs to the current relational operator need to be pre-processed by a transcode operator.

Abstract: Systems, devices, and methods of the present disclosure use discourse analysis and other techniques to form questions and answers from text. The questions and answers can be used for different applications, including providing a virtual dialogue or generating training data for machine-learning models. For example, a dialogue application generates a discourse tree that represents text and identifies a question from a satellite elementary discourse unit of the discourse tree. The dialogue application annotates the text by inserting the generated question and labeling the satellite elementary discourse unit as an answer.

Abstract: The system receives original time-series signals from sensors in a monitored system. Next, the system detects and removes spikes from the original time-series signals to produce despiked original time-series signals, which involves using the original time-series data to optimize a damping factor, which is applied to a threshold for a spike-detection technique, and using the spike-detection technique with the optimized damping factor to detect the spikes. The system then generates despiked synthetic time-series signals, which are statistically indistinguishable from the despiked original time-series signals. The system also includes synthetic spikes, which have the same temporal, amplitude and width distributions as the spikes in the original time-series signals, in the despiked synthetic time-series signals to produce synthetic time-series signals with spikes.

Abstract: A method, system, and computer program product for management of large multi-database installations. The method form commences by analyzing a multiple database installation to determine a set of candidate upgrade operations to apply to individual instances of heterogeneous databases in the multiple database installation, and then scheduling an order in which order to apply individual operations from among the set of candidate upgrade operations. In exemplary operation, the candidate upgrade operations comprise database version upgrades, database stack upgrades, and/or database listener upgrades. Some embodiments exploit homogeneity and/or groupings in order to parallelize performance of various upgrade operations during mass upgrade of multi-database installations. In addition to performing upgrade operations in the form of database version upgrades, database stack upgrades, and/or database listener upgrades, the installation can be upgraded by receiving application upgrades.

Abstract: The present disclosure generally relates to techniques for determining a segment of a content distribution plan. More specifically, the present disclosure discloses techniques for determining one or more key-value pairs of a content distribution plan by leveraging a trained machine learning model. A plurality of electronic communications may be generated based on completed key-value pairs with a content distribution plan. The plurality of electronic communications may then be distributed to a plurality of devices within a networked environment.

Abstract: Techniques are provided for eager replication of uncommitted transactions. In embodiments, a replication client receives, in a data stream, change records corresponding to database changes applied to a source database in a transaction. The change records does not include a commit record that indicates that the transaction is committed on the source database. Before receiving the commit record, the replication client computes transaction dependency data based on the change records and detects, based on the transaction dependency data, that the transaction can be at least partially applied to a target database. Also before receiving the commit record, the replication client applies, to a target database and based on the detecting, at least some of the change records. Upon receiving the commit record of the transaction, the replication client completes applying the change records and commits the transaction on the target database.

Abstract: The present disclosure provides a detailed description of techniques used in systems, methods, and in computer program products for bi-directional social media broker services that connect multiple social media sites using a common management framework. The claimed embodiments address the problem of efficiently scaling and managing bidirectional interaction with multiple social media publishing channels. More specifically, the claimed embodiments are directed to approaches for a computing platform having multiple message broker modules that enable bi-directional communication of messages between a common resource manager and a plurality of social media sites. The message broker modules can receive messages in a unified message format from the common resource manager, queue the messages for asynchronous processing, translate the messages from the unified message format to a site-specific format, and deliver the translated messages to multiple social media sites.

Abstract: A cloud-based ETL system provides error detection, error correction and reporting of data integration flows hosted by cloud services. Categories of errors are identified using one or more checks at different points of a data integration flow and one or more actions selected based at least in part on the error category. A determination can be made whether the error category is fault tolerant and one or more actions can be selected based at least in part on the error fault tolerance to correct the error, restart a flow, or generate a notification assisting a user to correct the error.

Abstract: A payment device is provided for use in transactions such as credit purchases at a retail store. The device includes a non-volatile memory containing a set of multiple identifiers that are associated with a customer account. The multiple identifiers are also known to an agency that provides the customer account. The device further includes a processor operable to select one identifier out of the set of multiple identifiers for use with any particular transaction involving the device and the customer account. This identifier is then conveyed from the device, typically via a store terminal, to the agency that maintains the account.

Abstract: According to one or more embodiments, multiple related data streams are compressed jointly, such that substantive similarities between the multiple related streams are leveraged to reduce the overall size of the resulting compressed data. Specifically, given the compressed version of a primary data stream, a secondary data stream may be highly compressed by utilizing portions of the compressed version of the primary data stream to represent similar portions of the secondary data stream. A compression application is configured to receive (either concurrently or separately) information identifying multiple related input streams. For each input stream provided to the compression application, the application outputs one output stream. The computing system writes the output streams of the compression application to storage. Embodiments allow the size of the compressed version of a secondary data stream to be greatly reduced compared to the size of the stream compressed without reference to a primary data stream.

Abstract: Systems, devices, and methods of the present invention detect argumentation in text. In an example, an application executing on a computing device accesses text comprising fragments. The application creates a discourse tree from the text. The discourse tree includes nodes, each nonterminal node representing a rhetorical relationship between two of the fragments and each terminal node of the nodes of the discourse tree is associated with one of the fragments. The application matches each fragment that has a verb to a verb signature, thereby creating a communicative discourse tree. The application determines whether the communicative discourse tree represents text that includes argumentation by applying a classification model trained to detect argumentation to the communicative discourse tree.

Abstract: A computer system including one or more processors and persistent, word-addressable memory implements a persistent atomic multi-word compare-and-swap operation. On entry, a list of persistent memory locations of words to be updated, respective expected current values contained the persistent memory locations and respective new values to write to the persistent memory locations are provided. The operation atomically performs the process of comparing the existing contents of the persistent memory locations to the respective current values and, should they match, updating the persistent memory locations with the new values and returning a successful status. Should any of the contents of the persistent memory locations not match a respective current value, the operation returns a failed status. The operation is performed such that the system can recover from any failure or interruption by restoring the list of persistent memory locations.

Abstract: A method, apparatus, and system for tracking row and object database activity into block level heatmaps is provided. Database activity including reads, writes, and creates can be tracked by a database management system at the finest possible level of granularity, or the row and object level. To efficiently record the tracked database activity, a two-part structure is described for writing the activity into heatmaps. A hierarchical in-memory component may use a dynamically allocated sparse pool of bitmap blocks. Periodically, the in-memory component is persisted to a stored representation component, sharable with multiple database instances, which may include consolidated last access times and/or a history of heatmap snapshots to reflect access over time. The heatmaps may then be externalized to database users and applications to provide and support a variety of features.

Abstract: Using and updating topological relationships amongst a set of nodes in event clustering is disclosed. A current event occurs on a current node. A first cluster of related events includes a first event, occurring on a first node, that is time-correlated with the current event. The first cluster does not include any event that is topologically-correlated with the current event based on the existing set of topological relationships. A level of interdependence is determined between (a) occurrence of events on the current node and (b) occurrence of events on the first node. Based on the level of interdependence, the current event is added to the first cluster. Further, an event-based topological relationship between the first node and the second node is added to the set of topological relationships. Subsequently, clustering for new events may be determined based on the event-based topological relationship between the first node and the second node.

Abstract: In accordance with an embodiment, described herein is a system and method for high availability and load balancing in a database environment. A transparency engine can be provided between client applications and a database, and can operate as a proxy engine for the database and as a session abstraction layer for the client applications, to enable the client applications to utilize database features provided by the connection pool without code changes to the client applications. The transparency can keep track of session states, request boundaries and cursors to efficiently reuse the database connections across the client applications. The transparency engine can use the request boundaries and indicators from the database to detect safe places to drain database connections in the event of database outages.

Abstract: Techniques are provided for storing in in-memory unit (IMU) in a lower-storage tier and copying the IMU to DRAM when needed for query processing. Techniques are also provided for copying IMUs to lower tiers of storage when evicted from the cache of higher tiers of storage. Techniques are provided for implementing functionality of IMUs within a storage system, to enable database servers to push tasks, such as filtering, to the storage system where the storage system may access IMUs within its own memory to perform the tasks. Metadata associated with a set of data may be used to indicate whether an IMU for the data should be created by the database server machine or within the storage system.

Abstract: Techniques are described for encoding join columns that belong to the same domain with a common dictionary. The tables are encoded with dictionary indexes that make the comparison operation of a join query a quick equality check of two integers and there is no need to compute any hashes during execution. Additionally, the techniques described herein minimize the bloom filter creation and evaluation cost as well because the dictionary indexes serve as hash values into the bloom filter. If the bloom filter is as large as the range of dictionary indexes, then the filter is no longer a probabilistic structure and can be used to filter rows in the probe phase with full certainty without any significant overhead.

Abstract: A DBMS maintains delayed and non-delayed messages within a non-delay shard and a delay shard that function as a pair. The DBMS stages non-delayed messages in enqueue-time order within the non-delay shard, and maintains a non-delay dequeue pointer that moves in physical order of the enqueued non-delay messages. The DBMS stages delayed messages in enqueue-time order within bucket shards of the delay shard. Each bucket shard, of a delay shard, represents a time span of delivery times, and messages are assigned thereto based on message delivery time. The delay dequeue pointer comprises a sub-routine to determine the message with the minimum delivery time within a current bucket shard with a time span that includes the current time. The DBMS delivers the next available message out of the delayed and non-delayed shards by comparing the delivery time of the next available message from each shard and delivering the earliest available message.

Abstract: Techniques are described for orchestrating execution of multi-step recipes. In an embodiment, a method comprises receiving a request to execute a recipe specification that defines a sequence of steps to execute for a particular recipe; responsive to receiving the request to execute the recipe specification, instantiating a set of one or more recipe-level processes; wherein each recipe-level process in the set of one or more recipe-level processes manages execution of a respective instance of the particular recipe; triggering, by each recipe-level process for the respective instance of the particular recipe managed by the recipe-level process, execution of the sequence of steps; wherein triggering execution of at least one step in the sequence of steps by a recipe-level process comprises instantiating, by the recipe-level process, a plurality of step-level processes to execute the step on a plurality of target resources in parallel.

Abstract: Techniques are described herein for executing queries with a recursive clause using a plurality of processes that execute database operations in parallel. Each process of the plurality of processes either generate or are assigned a segment that is part of a temporary table. For each iteration of the recursive query, work granules are divided up and assigned to each of the plurality of processes. As each respective process produces a portion of a result set for a given iteration, that process appends said portion of the result set to the respective segment that the respective process manages. Each slave process then publishes, to one or more sources, a reference to the newly generated results. During the next iteration, any slave process may access any of the data from the previous iteration.

Abstract: A system that processes trade events is provided. The system receives events associated with a supply chain financial orchestration flow, where a supply chain financial orchestration flow defines a trade relationship between a first entity and a second entity. The system further determines whether at least one event indicates an ownership change of an item between a first entity and a second entity. The system further generates trade events where at least one event indicates an ownership change. The system further sends the trade events to a cost accounting system. The cost accounting system further performs accounting based on the trade events and generates trade accounting events.

Abstract: Techniques are provided for reducing synchronization of tasks in a task scheduling system. A task queue includes multiple tasks, some of which require an I/O operation while other tasks require data stored locally in memory. A single thread is assigned to process tasks in the task queue. The thread determines if a task at the head of the task queue requires an I/O operation. If so, then the thread generates an I/O request, submits the I/O request, and may place the task at (or toward) the end of the task queue. When the task reaches the head of the task queue again, the thread determines if data requested by the I/O request is available yet. If so, then the thread processes the request. Otherwise, the thread may place the task at (or toward) the end of the task queue again.

Abstract: A method may include obtaining, for a thread executing application code, a recurring task, a recurring interval, a previous callback time, a starting counter value, and a counter trigger, initializing a current counter value to the starting counter value, and performing checks in response to adjustments to the current counter value. Each check may determine whether the respective adjusted current counter value satisfies the counter trigger. The method may further include in response to a check determining that the adjusted current counter value satisfies the counter trigger, invoking a callback handler with a callback that performs the recurring task, and in response to an elapsed time exceeding the recurring interval, executing, by the callback handler, the callback. The elapsed time may be an amount of time elapsed between the previous callback time and the first invocation. The method may further include modifying the starting counter value using the elapsed time.

Abstract: The disclosed embodiments relate to a system that performs low-temperature desalination. During operation, the system feeds cold saline water through a liquid-cooling system in a computer data center, wherein the cold saline water is used as a coolant, thereby causing the cold saline water to become heated saline water. Next, the system feeds the heated saline water into a vacuum evaporator comprising a water column having a headspace, which is under a negative pressure due to gravity pulling on the heated saline water in the water column. This negative pressure facilitates evaporation of the heated saline water to form water vapor. Finally, the system directs the water vapor through a condenser, which condenses the water vapor to produce desalinated water.

Abstract: A method may include obtaining a list of to-be-analyzed modules of an application. The list of to-be-analyzed modules may include a first module including a statement. The method may further include generating initial results by performing an initial iteration of a static analysis that analyzes each module in the list of to-be-analyzed modules, determining, by the initial iteration, that the statement is a function call to a second module not in the list of to-be-analyzed modules, in response to the determination, assigning, by the initial iteration, an abstract value to a memory address associated with the statement, adding, to the abstract value, a tag including a name of the second module, updating, using the tag and the initial results, the list of to-be-analyzed modules, and generating next results by performing a next iteration of the static analysis that analyzes each module in the updated list of to-be-analyzed modules.

Abstract: In some embodiments, a memory initialization detection process includes detecting a read instruction of a program, where the read instruction addresses a particular memory location, and where data corresponding to the particular memory location is cached in a particular cache line of a memory cache. The memory initialization detection process further includes determining, based on metadata stored in the memory cache, that a section of the particular cache line does not store valid data of the program. The memory initialization detection process further includes obtaining validity data from the section of the particular cache line. The memory initialization detection process further includes determining, based on the validity data, whether the read instruction is authorized to proceed.

Abstract: Systems and methods for InfiniBand fabric optimizations to minimize SA access and startup failover times. A system can comprise one or more microprocessors, a first subnet, the first subnet comprising a plurality of switches, a plurality of host channel adapters, a plurality of hosts, and a subnet manager, the subnet manager running on one of the one or more switches and the plurality of host channel adapters. The subnet manager can be configured to determine that the plurality of hosts and the plurality of switches support a same set of capabilities. On such determination, the subnet manager can configure an SMA flag, the flag indicating that a condition can be set for each of the host channel adapter ports.

Abstract: The disclosed embodiments relate to the design of a temperature sensor, which is integrated into a semiconductor chip. This temperature sensor comprises an electro-thermal filter (ETF) integrated onto the semiconductor chip, wherein the ETF comprises: a heater; a thermopile, and a heat-transmission medium that couples the heater to the thermopile, wherein the heat-transmission medium comprises a polysilicon layer sandwiched between silicon dioxide layers. It also comprises a measurement circuit that measures a transfer function through the ETF to determine a temperature reading for the temperature sensor.

Abstract: A method of resilvering a plurality of failed devices in a storage pool may include detecting a failure of a first storage device in the storage pool, and determining a plurality of data blocks that are stored on the first storage device. The method may also include sorting the plurality of data blocks into one or more buckets in an order in which the plurality of data blocks are located on the first storage device, and detecting a failure of a second storage device in the storage pool after detecting the failure of the first storage device. The method may further include determining that one or more of the plurality of data blocks are also located on the second storage device, and reusing at least part of the one or more buckets to resilver the second storage device.

Abstract: Embodiments of the invention provide systems and methods for automatic or adaptive sizing of a customer service agent's co-browsing view of a contact's user interface. According to one embodiment, at least a portion of the agent's interface in which the customers interface is presented can be resized so that the agent's view matches the customer's view, e.g., one-to-one. This sizing of the agent's view may be performed automatically, when the co-browsing view of the customer's interface is first presented to the agent or, according to one embodiment, may be toggled on and off by the agent, e.g., by the agent selecting a button or other control presented in the agent's interface. In this way, embodiments allow the agent to see exactly the same view of the web site as the customer sees in the customer's interface regardless of the device or screen size used by the customer.

Abstract: Implementations generally relate to optimizing bar charts. In some implementations, a method includes receiving a plurality of data points, where each data point of the plurality of data points has a value. The method further includes determining a plurality of bars of the bar chart based on the plurality of data points, where each bar of the plurality of bars has a length and a width. The method further includes associating a plurality of pixels used to render the bar chart with the plurality of bars. The method further includes determining for each pixel of the plurality of pixels at least one or more of a highest positive bar and a lowest negative bar. The method further includes rendering for each pixel one or more of the respective highest positive bar and the respective lowest negative bar.

Abstract: Techniques for generating plug-in application recipe (PIAR) extensions are disclosed. A PIAR management application discovers a particular data type within one or more data values for a particular field of a plug-in application, where the particular data type is (a) different from a data type of the particular field as reported by the plug-in application and (b) narrower than the data type of the particular field while complying with the data type of the particular field. The PIAR management application identifies one or more mappings between (a) the particular data type and (b) one or more data types for fields accepted by actions of plug-in applications. The PIAR management application presents a user interface including one or more candidate PIAR extensions based on the mapping(s). Based on a user selection of a candidate PAIR extension, the PIAR management application executes a PIAR that includes the selected PIAR extension.

Abstract: The disclosed embodiments relate to a system that performs low-temperature desalination. During operation, the system feeds cold saline water through a liquid-cooling system in a computer data center, wherein the cold saline water is used as a coolant, thereby causing the cold saline water to become heated saline water. Next, the system feeds the heated saline water into a vacuum evaporator comprising a water column having a headspace, which is under a negative pressure due to gravity pulling on the heated saline water in the water column. This negative pressure facilitates evaporation of the heated saline water to form water vapor. Finally, the system directs the water vapor through a condenser, which condenses the water vapor to produce desalinated water.

Abstract: Suspending and resuming a card runtime environment for a card computing device are disclosed. A card computing device obtains a suspension request. The suspension request includes a proposed value for a minimum suspension interval and/or a proposed value for a maximum suspension interval. The suspension request is accepted or rejected, by the card computing device, based on the proposed value for the minimum suspension interval and/or the proposed value for the maximum suspension interval. The card computing device may negotiate a different value for the maximum suspension interval. Additionally, a card computing device obtains a resumption request. The resumption request includes a resume token. The card computing device determines whether the resume token in the resumption request is valid. The card computing device determines whether the suspension interval is valid. The card computing device resumes the state that was associated with the card computing device at the time of suspension.

Abstract: Disclosed is an approach for integrating one or more enterprise applications with a social networking application. Integration is provided between a CRM application and the social networking application.

Abstract: A method may include maintaining first data structure with records organized in a first hierarchy, and maintaining a second data structure with records organized in a second hierarchy. The method may also include receiving a first change request for a value stored in a first record. The first change request may be received from a parent in the first data structure of the first record. The method may additionally include changing the first value according to the first change request, and receiving a second change request for the value stored in the first record. The second change request may be received from a parent in the second data structure of the first record. The method may further include sending a notification to the parent in the first data structure that the parent in the second data structure is attempting to change the first record.

Abstract: These techniques detect and compare amounts of motion of objects within video footage having sources of apparent motion. In an embodiment, for each frame of a video, a computer subtracts a background from the frame, converts the frame from grayscale to monochrome, and isolates regions of interest (ROIs) in the frame. For each frame, the computer identifies identifiable objects in the ROIs, selects selectable objects from the identifiable objects that have a percentage of motion that is within a particular range, and merges, into merged objects, subsets of the selectable objects that are separated by no more than a particular distance. Based on the merging, metadata is generated for any of: an object of the merged objects, the frame, or the video. The metadata may have a bounding rectangle, a bounding polygon, a frame timestamp, a frame identifier, or an object(s)'s identifier or percentage of motion.

Abstract: A method of reconstructing data from a failed storage device in a storage pool includes identifying a plurality of data blocks that are stored on the failed storage device, and sorting the plurality of data blocks in an order in which the plurality of data blocks are located on the failed storage device. Each of the plurality of data blocks may be associated with an I/O operation. The method may also include grouping the I/O operations for the plurality of data blocks into sequential I/O operations based on the order in which the plurality of data blocks are located on the failed storage device, and executing the sequential I/O operations to resilver a new storage device replacing the failed storage device.

Abstract: Techniques for inferring code deprecation from module deprecation are disclosed. A system detects a reference to a type. The system determines that a particular module, in a plurality of modules in a module system, exposes the referenced type. The system determines that the particular module is associated with a deprecation status. Responsive to determining that the particular module is associated with the deprecation status, the system presents information indicating that the reference references a deprecated module.

Abstract: Techniques for performing database operations using vectorized instructions are provided. In one technique, it is determined whether to perform a database operation using one or more vectorized instructions or without using any vectorized instructions. This determination may comprise estimating a first cost of performing the database operation using one or more vectorized instructions and estimating a second cost of performing the database operation without using any vectorized instructions. Multiple factors that may be used to determine which approach to follow, such as the number of data elements that may fit into a SIMD register, a number of vectorized instructions in the vectorized approach, a number of data movement instructions that involve moving data from a SIMD register to a non-SIMD register and/or vice versa, a size of a cache, and a projected size of a hash table.

Abstract: A system and method for supporting load balancing in a multi-tenant cluster environment, in accordance with an embodiment. One or more tenants can be supported and each associated with a partition, which are each in turn associated with one or more end nodes. The method can provide a plurality of switches, the plurality of switches comprising a plurality of leaf switches and at least one switch at another level, wherein each of the plurality of switches comprise at least one port. The method can assign each node a weight parameter, and based upon this parameter, the method can route the plurality of end nodes within the multi-tenant cluster environment, wherein the routing attempts to preserve partition isolation.

Abstract: In accordance with an embodiment, described herein is a system and method for resource isolation and consumption in an application server environment. The system can provide, at one or more computers, including an application server environment executing thereon, a plurality of resources which can be used within the application server environment, and one or more partitions, wherein each partition provides an administrative and runtime subdivision of a domain. The system can also configure a resource consumption management module to monitor each partition's usage of the plurality of resources. The resource consumption management module can comprise at least one member of the group consisting of resource reservations, resource constraints, and resource notifications.

Abstract: Various embodiments provide for obtaining snapshots of a form. A process design that specifies stages of a lifecycle of a process and a point between the stages is created. Electronic computer executable snapshot instructions for obtaining a snapshot of a form that is part of the process are received. The snapshot instructions are associated with the point. In response to displaying the form on a display screen, a snapshot of the form is obtained at the point that is between the stages the lifecycle of the process based on execution of the snapshot instructions.

Abstract: Systems and methods described herein are directed towards controlling a level of detail for geostreaming data. In some examples, an identifying event data that includes location information. A polygon may be defined that comprises points on a map corresponding to the event data. A first level of detail may be determined and a fidelity of the polygon may be changed based at least in part on the first level of detail. Second event data may be received that identifies a location of an object. It may be identified whether the object is within the location information and a user interface may be prepared that presents whether the object is in an affected area.