Abstract: Methods, systems, and computer-readable media for a scalable architecture for a distributed time-series database are disclosed. Using a fleet of ingestion routers, time-series data generated by a plurality of client devices is stored into a plurality of durable partitions. The time-series data comprises a plurality of time series, and an amount of the ingestion routers is determined based at least in part on an ingestion rate of the time-series data. Using a fleet of stream processors, the time-series data from the durable partitions is stored into a plurality of storage tiers including a first storage tier and a second storage tier. A retention period for the first storage tier differs from a retention period for the second storage tier. An amount of the stream processors is determined based at least in part on the time-series data in the durable partitions.

Abstract: A method for training hotword detection includes receiving a training input audio sequence including a sequence of input frames that define a hotword that initiates a wake-up process on a device. The method also includes feeding the training input audio sequence into an encoder and a decoder of a memorized neural network. Each of the encoder and the decoder of the memorized neural network include sequentially-stacked single value decomposition filter (SVDF) layers. The method further includes generating a logit at each of the encoder and the decoder based on the training input audio sequence. For each of the encoder and the decoder, the method includes smoothing each respective logit generated from the training input audio sequence, determining a max pooling loss from a probability distribution based on each respective logit, and optimizing the encoder and the decoder based on all max pooling losses associated with the training input audio sequence.

Abstract: Two versions of a database can be held in two trees that have many of the same nodes. Both trees can be concurrently searched using recursive algorithms. A root node indicator indicates a root node for a tree search algorithm. The root node indicator can indicate a first root node of a first tree. A tree search algorithm can identify a record node in the first tree. Intermediate nodes between the record node and the first root node can be identified and retained nodes can be identified. A second root node and replacement intermediate nodes can be instantiated. A second tree that includes the second root node, the replacement intermediate node, and the retained nodes can be created. The root node indicator can be set to indicate the second root node after creating the second tree.

Abstract: A method for situation-based processing of sensor data from a motor vehicle. Sensor data generated by sensors relating to the situation in the surroundings of the motor vehicle is transferred to a processing unit via a bus. The processing unit takes into account the transferred sensor data to determine an information requirement, and generates a request for additional sensor data on the basis of the determined information requirement and the load on the bus, and sends this request to the sensors. A corresponding device is also described.

Abstract: A method for reverse range lookup in an ordered data structure of keys, wherein each key comprises a logical block address (LBA) and a snapshot identifier (ID) of one of one or more snapshots in a snapshot hierarchy, is provided. The keys in the ordered data structure are in an order from smallest to largest LBA, wherein in the order, keys having a same LBA are ordered from smallest to largest snapshot ID. The method includes determining a range of LBAs and traversing the ordered data structure in reverse order until a key is found that: has an LBA and a snapshot ID that is less than or equal to the last LBA and the largest snapshot ID, respectively. The method further includes adding an extent corresponding to the located key to an extent result list if the snapshot ID of the located key is not within a deny list.

Abstract: A method for generating a composite visibility indicator of at least one entity includes selecting a first category of entities; selecting a first position; associating the first position with a first geographical zone, said first geographical zone defining a zone around the first position as a function of the selected category; generating at least one request to collect a plurality of indicators, and generating a composite visibility indicator for each entity of the first category selected within the first zone, the visibility indicator being a function of the first indicator and of the second indicator.

Abstract: Methods, non-transitory computer readable media, and devices that more effectively manage snapshots by creating a namespace including files described by stored file recipe objects and each comprising fragments, directories described by metadata in the file recipe objects and each comprising one or more of the files, and snapshots described by stored snapshot request objects. Content of one of the directories are identified based on an identification of corresponding ones of the file recipe objects that existed within the namespace at a specified time. At least one of the files, included in the identified content and existing within the namespace at the specified time, is accessed in response to one or more received requests. A garbage collection operation is periodically performed to delete the recipe objects that are marked for deletion by tombstone objects and are unreferenced by any of the snapshots as determined based on the snapshot request objects.

Abstract: Techniques are provided for reporting space savings due to pattern matching in storage systems. For example, in one embodiment, an exemplary method comprises, when a given allocation unit in a storage system matches one or more predefined patterns, (i) setting a corresponding pattern flag for the given allocation unit, and (ii) incrementing at least one pattern counter; generating at least one snapshot of at least a portion of a file comprising the given allocation unit; and determining a range of data reduction attributed to pattern matching based on said at least one pattern counter, wherein one extreme of said range of data reduction attributed to pattern matching excludes said one or more predefined patterns in said at least one snapshot.

Abstract: A system, method, and computer-readable medium are disclosed for performing a data schema mapping operation. The data schema mapping operation includes receiving product information from a product supplier, the product information comprising a first document corresponding to a first data schema, the first data schema comprising an unspecified JavaScript Object Notation (JSON) schema; identifying a plurality of components within the first document corresponding to the first data schema, the plurality of components comprising a plurality of JSON data elements; compacting the plurality of JSON data elements via a data schema compacting operation to provide a set of compacted JSON data elements; identifying a second plurality of components corresponding to a second data schema, the second data schema comprising a defined data schema; and, mapping a component of the document corresponding to the first data schema to a component corresponding to the second data schema.

Abstract: A block storage service can ensure volumes are placed in a same region as an attached virtual machine instance for performance and durability guarantees. A region can reference multiple things, but one example is that a volume is within a same spine as a virtual machine in order to meet performance guarantees. Each region can have a buffer of server computers held in reserve for volumes having a type where performance guarantees are required. If performance guarantees cannot be met, a rejection is transmitted to the customer. In another embodiment, the customer can provide a list in priority order of different volume types so that if a desired volume type cannot be placed, then alternative volume types can be used.

Abstract: Embodiments use a phantom apex node to graphically illustrate a plurality of hierarchical records. Each record includes a parent field, and an entry in the parent field identifies a parent record of a given record. The parent record is higher in hierarchy than the given record. Embodiments identify record(s) that have no entry in the parent field. A phantom apex record is added to the database. A reference to the phantom apex record is inserted for each record that did not have an entry in the parent field. An x-y coordinate position is determined for all hierarchical records based on the parent field in each record. Once the positions are determined, all references to the phantom apex record are removed from all of the parent fields, and the phantom apex record itself is removed from the database. The plurality of records are then graphically rendered on a target output medium.

Abstract: Disclosed are techniques for defragmentation in deduplication storage systems. Machine language determines using deduplication metadata that at least some of an incoming input/output stream is a duplicate of at least part of a source volume whose physical locations of its stored data are fragmented in backend storage. Subsequently, defragmentation is carried out on the stored data by using the incoming input/output stream to write the data into sequential chunks at new physical locations in the backend storage and updating the source volume location mappings to the new physical locations.

Abstract: A method that includes receiving a first configuration and a second configuration that define a set of rules for matching and merging a set of source data objects that are associated with a tenant and that are received from a plurality of data sources. The method may further include generating a set of merged data objects from the set of source data objects based on an identification of matching values from fields of the set of source data objects and selecting a value for each field of each merged data object having multiple values. The method may further include generating a mapping between primary keys associated with each merged data object and corresponding primary keys of the source data objects. The method may further include storing the merged data objects and the mappings in a first datastore and a second datastore that is different from the first datastore.

Abstract: A solution for deteriorated non-volatile memory is shown. When determining that raw data read from the non-volatile memory is undesirable data, the controller updates a deterioration table to record a deteriorated logical address of the raw data that is the undesirable data. When performing garbage collection from a source block associated with the deteriorated logical address to a destination block and determining that the deteriorated logical address is listed in the deterioration table, the controller invalidates target data stored in the source block and mapped to the deteriorated logical address, without moving the target data from the source block to the destination block in the garbage collection.

Abstract: Embodiments use a phantom apex node to graphically illustrate a plurality of hierarchical records. Each record includes a parent field, and an entry in the parent field identifies a parent record of a given record. The parent record is higher in hierarchy than the given record. Embodiments identify record(s) that have no entry in the parent field. A phantom apex record is added to the database. A reference to the phantom apex record is inserted for each record that did not have an entry in the parent field. An x-y coordinate position is determined for all hierarchical records based on the parent field in each record. Once the positions are determined, all references to the phantom apex record are removed from all of the parent fields, and the phantom apex record itself is removed from the database. The plurality of records are then graphically rendered on a target output medium.

Abstract: A system executes a set of database operations and determines counts of instances that each key is specified for a corresponding column by any database operations on a database table. The system identifies each key which is associated with any determined count that satisfies a threshold as a corresponding frequently accessed key. The system creates an optimized index for each column which stores any frequently accessed key. The system inserts each frequently accessed key into a corresponding optimized index. The system receives a database operation that specifies a specific key for a specific column in the database table. If any optimized index matches the specific column and stores any frequently accessed key that matches the specific key, then the system references a matching frequently accessed key in a matching optimized index to access a record, which is associated with the specific column and the specific key, via the database table.

Abstract: Methods and systems for controlling production resources in a supply chain are described. The system automatically generates predicted supply chain operational metrics across a nodes of a supply chain. The system automatically infers causal factors that impact the predicted supply chain operational metrics. The causal factors include a change to a utilization of the production resource. The system communicates a user interface including production runs being scheduled on the production resource including a user interface element representing the scheduling of the production run associated with a value at risk. The system receives input causing a change to the utilization of the production resource. The change to the utilization of the production resource impacts the predicted supply chain operational metrics including the value at risk associated with the scheduling of the production run.

Abstract: A method, and the associated design, schema and techniques for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes of encryption/decryption or compression/decompression or both, including the use of Digital Lensing, Unlimited Code System, and other associated techniques. There is no assumption of or requirement for the digital information to be processed before processing.

Abstract: Staging data on a storage element integrating fast durable storage and bulk durable storage, including: receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique.

Abstract: Mechanisms for automatically modifying a set of instructions based on an expanded domain specific knowledge base is provided. The mechanisms generate a domain specific knowledge base comprising a set of entities and corresponding domain specific attributes and expand the domain specific knowledge base to include values for the domain specific attributes through an automated bootstrap learning process that performs natural language processing and analysis of natural language content using a set of pre-condition annotated action terms. The mechanisms receive electronic content comprising an initial set of instructions to perform an operation and evaluate the initial set of instructions based on the expanded domain specific knowledge base to identify a missing instruction. The mechanisms modify the initial set of instructions to include an additional instruction based on the missing instruction and thereby generate a modified set of instructions.

Abstract: A method for managing and routing client queries within an entity is provided. The method may include receiving a client query including origination identification data associated with a sender of the client query. In response to searching in a database for history correlating to the origination identification data, determining that no relevant history exists with respect to the origination identification data. The method may include identifying the sender by identifying, within the query, a first character string identical to a first keyword stored in a classification model within a database, using the first keyword to identify a second character string that includes the first keyword in addition to other characters, identifying, from a list of sub-entities, a sub-entity associated with the first keyword and using a combination of the first keyword, the sub-entity and one or more attributes to identify the sender as an existing client.

Abstract: One embodiment provides a method for graphically displaying and interacting with digital standards, the method including: displaying, on an interactive display, a digital standard interface display for displaying and interacting with information corresponding to at least one digital standard, wherein the digital standard interface display comprises a plurality of icons that are selectable by a user; wherein at least one of the plurality of icons comprises a standards category icon for displaying information related to digital standards within a category corresponding to the standards category icon; displaying a digital standard selection field in response to a user selection of one of the standards category icons; and displaying, responsive to a user providing input to the digital standard selection field, information related to a digital standard identified from the provided input and of the category type corresponding to the selected standards category icon. Other aspects are described and claimed.

Abstract: A system to control navigation of graphical user interface (GUI) panels on a web page includes a processor and a storage medium that stores instructions that are configurable to cause the processor to perform a method of navigating the GUI panels. The method controls display of a web page having GUI panels, and receives input associated with a command to change focus away from a first GUI panel. The input is generated in response to selection of an assigned keyboard key, selection of an assigned combination of keyboard keys, or selection of an assigned sequence of keyboard keys by a user. In response to receiving the input, a second GUI panel is identified, and focus is switched from the first GUI panel to the second GUI panel.

Abstract: An apparatus stores received data blocks as deduplicated data blocks. The apparatus is configured to: maintain a plurality of containers, where a reference to a container is unique within the apparatus and each container includes one or more data segments and segment metadata for each data segment, the segment metadata including a segment identifier and a segment reference, where the segment identifier is unique within the container and the segment reference is unique within the apparatus; and maintain a plurality of deduplicated data blocks storing received data blocks, where each deduplicated data block includes a plurality of identified container references, where a container reference identifier is unique within the deduplicated data block, and an ordered list of one or more segment indicators.

Abstract: A method and system for accessing a digital object in a Human-Cyber-Physical environment are provided. A P2P network is established based on a distributed hash table (DHT); a Kademlia algorithm is used to establish a forward routing table corresponding to each node; and an index binary tree is established according to a logical distance between each node in the forward routing table and a target node. In a process of transmitting a message from a node of a storage digital object to a root node, all nodes that the message passes establish backward routing tables for the digital object, so that in a data query stage, target data may be found from any node through the forward routing table and the backward routing table, and a data identifier of a data entity in the DHT-based P2P network from a storage location of the data identifier may be decoupled.

Abstract: The present disclosure involves systems, software, and computer implemented methods for providing default values for fields of data objects in an offline mode. One example method includes receiving, at a client device, a default group mapping that includes a default group identifier and a default value to be used as an initial value for a field. A field mapping can be received that includes a default group identifier and a field identifier. A request can be received while the client device is offline to create an instance of an object. A determination can be made that the field mapping includes a field identifier for a field of the object. A default value can be retrieved, from a local repository on the client device. A field value of the field in a created instance of the data object can be set to be the default value.

Abstract: A proxy slave in a first LIN partition receives data from a proxy master in the second LIN partition which in turn receives the data from a slave in the second LIN partition. The proxy slave stores the data in a data structure and receives a read request from an originating master in the first LIN partition after the data is stored. The read request comprises a LIN message identifier subscribed to by the slave in the second LIN partition. The proxy slave accesses the data stored in the data structure based on the LIN message identifier in the read request; and sends a LIN response to the originating master with the stored data from the slave in the second LIN partition.

Abstract: Disclosed herein is a process that involves retrieving a data model for a data source, establishing at least one filter operation or at least one clean operation that modifies an aspect of the retrieved data model, onboarding underlying data from the data source while applying the established at least one filter operation or at least one clean operation, defining at least one transformation operation to apply to a portion of the underlying data that has been onboarded, and applying the at least one transformation operation to the portion of the underlying data to thereby assign the data to a semantic network, the semantic network comprising conceptual data components and associative data components.

Abstract: Aspects of the invention include a method for providing a master computing environment containing a master repository. The method periodically conducts a search of proprietary data repositories and causes the master computing environment to create a merged collection in the master repository after the periodical conducted search of the proprietary data repositories. The method correlates metadata with the proprietary data repositories and puts the correlated metadata into the master repository. The method sets up a question feeder server to receive queries and to pass the queries to the master computing environment. The method causes the master computing environment to provide results in response to a query, where the master computing environment acts as an autonomous information provider that finds and sorts subject matter on a proprietary development project.

Abstract: Methods, non-transitory computer readable media, and devices that more effectively manage snapshots by creating a namespace including files described by stored file recipe objects and each comprising fragments, directories described by metadata in the file recipe objects and each comprising one or more of the files, and snapshots described by stored snapshot request objects. Content of one of the directories are identified based on an identification of corresponding ones of the file recipe objects that existed within the namespace at a specified time. At least one of the files, included in the identified content and existing within the namespace at the specified time, is accessed in response to one or more received requests. A garbage collection operation is periodically performed to delete the recipe objects that are marked for deletion by tombstone objects and are unreferenced by any of the snapshots as determined based on the snapshot request objects.

Abstract: Various embodiments are generally directed to techniques for creating and utilizing multidimensional embedding spaces for data objects, such as to condition the data for input to a neural network, for instance. Some embodiments are particularly directed to converting semi-structured data, such as a set of data objects, into object vector sets mapped to a multidimensional embedding space. In many embodiments, an embedding space for a set of data objects may be customized with a set of dimensions that correspond to various characteristics of the set of data objects. These and other embodiments are described and claimed.

Abstract: A computer-implemented method for implementing a computer system task involving streaming data by removing biased gradients from memory includes generating a parameter sequence including a plurality of parameters corresponding to respective iteration counts. Generating the parameter sequence includes obtaining a first parameter value corresponding to a given iteration count by updating memory corresponding to the given iteration count based on a second parameter value corresponding to a prior iteration count, adapting a size of the updated memory to remove biased gradients, and obtaining the first parameter value by performing a step of a gradient descent method based on the adaptation and the second parameter value. The method further includes learning a time-series model based on the parameter sequence, and implementing a computer system task using the time-series model.

Abstract: Partitioning of a monitored index commences upon receiving a trigger. Properties of the index are fetched and analyzed using a pipes analytics engine. A new partitioned index is generated and an alias is assigned to the new partitioned index. The alias is added to a partitioned index alias table.

Abstract: A method of identifying network devices such as a router includes accessing an HTTP server on at least one network device, and evaluating a web page served by the device's HTTP server. The web page is evaluated to determine whether it is similar to a page group from a plurality of page groups, where each of the plurality of page groups comprises a group of web pages similar to other pages in the page group. If the evaluated web page is determined similar to a page group, the page group most similar to the evaluated web page is identified as corresponding to the identity of the network device.

Abstract: Methods for providing a highly assisted driving (HAD) service include: (a) transmitting telematics sensor data from a vehicle to a remote first server; (b) transmitting at least a portion of the telematics sensor data from the remote first server to a remote second server, wherein the remote second server is configured to execute a HAD application using received telematics sensor data, and wherein the HAD application is configured to output a HAD service result; and (c) transmitting the HAD service result from the remote second server to a client. Apparatuses for providing a HAD service are described.

Abstract: A memory system is disclosed. The memory system may include a Big Hash Table and a Little Hash Table. The memory system may also include an Overflow Region and a Translation Table to map a logical address to a Physical Line Identifier (PLID), which may include a region identifier and a physical address.

Abstract: A method and apparatus is disclosed for transferring data from a first processor core to a second processor core. The first processor core executes a stash instruction having a first operand associated with a data address of the data. A second processor core is determined to be a stash target for a stash message, based on the data address or a second operand. A stash message is sent to the second processor core, notifying the second processor core of the written data. Responsive to receiving the stash message, the second processor core can opt to store the data in its cache. The data may be included in the stash message or retrieved in response to a read request by the second processing core. The second processor core may be determined by prediction based, at least in part, on monitored data transactions.

Abstract: The described technology is generally directed towards data storage using a node cluster, and garbage collecting unused chunks (data storage units) in the cluster based on which node owns the particular unused chunks. A node determines which chunks are in use, and exchanges datasets identifying those chunks with other nodes such that the other nodes know which of the chunks that they own are in use. When a node obtains the dataset identifying the chunks in use, the node determines the chunks not in use by a difference of those owned and those in use. This difference dataset is used to garbage collect owned, unused chunks. Garbage collection via this technology is able to be performed in a single cycle.

Abstract: Provided are a memory controller, a non-volatile memory system, and a method of operating the same. A method of operating a memory system includes selecting a plurality of source blocks to be garbage-collected, copying selected valid data from two or more source blocks among the plurality of source blocks into a destination block, storing changed mapping information in an update cache according to a result of the copying, and updating a mapping table by using the mapping information stored in the update cache.

Abstract: An information management device includes a memory, and processing circuitry coupled to the memory and configured to convert said spatio-temporal information in storage object information into a one-dimensional bit string, split the converted one-dimensional bit string into an upper bit string and a lower bit string, and cause a storage target node to store at least the split upper bit string in a key and to store the split lower bit string and said associated data in a value of that key, and convert a range condition of spatio-temporal information of an object to be retrieved into one-dimensional bit string, split the converted one-dimensional bit string into an upper bit string and a lower bit string, retrieve a key from a search target node using at least the split upper bit string, and retrieve a value corresponding to the split lower bit string from values of the retrieved key.

Abstract: Data segment-based indexing includes identifying data segments of a column of a database based on a data distribution of data of the column, indexing the data segments, including, for each data segment, determining an index type and creating an index of the determined index type, and building a composite link between indexes of a common index type, which indexes of the common index type include a created index, from indexing the data segments of the column, of the common index type and at least one other index, of the common index type, which is for other data segment(s), of other column(s) of the database, that have been indexed using the common index type. The composite link provides for parallel searching against the indexes in the group to search corresponding different data segments, in different columns of the database, indexed using the common index type.

Abstract: Embodiments use a phantom apex node to graphically illustrate a plurality of hierarchical records. Each record includes a parent field, and an entry in the parent field identifies a parent record of a given record. The parent record is higher in hierarchy than the given record. Embodiments identify record(s) that have no entry in the parent field. A phantom apex record is added to the database. A reference to the phantom apex record is inserted for each record that did not have an entry in the parent field. An x-y coordinate position is determined for all hierarchical records based on the parent field in each record. Once the positions are determined, all references to the phantom apex record are removed from all of the parent fields, and the phantom apex record itself is removed from the database. The plurality of records are then graphically rendered on a target output medium.

Abstract: A computer is to obtain specification concept graphs of nodes spec1, spec2, . . . , specm including concept nodes and relation nodes according to at least one of a plurality of digitized data from a plurality of computerized data sources forming a first set of evidences U and obtain concept graphs of nodes c?1, c?2, . . . , c?n including concept nodes and relation nodes for corresponding obtained plurality of information and knowledge (IKs) ?1, ?2, . . . , ?n forming a second set of evidences U. A subset of concept graphs of nodes is selected from c?1, c?2, . . . , c?n according to a computable measure of consistency, inconsistency and/or priority threshold between c?j in c?1, c?2, . . . , c?n can to specification concept graph speck in spec1, spec2, . . . , specm. Knowledge fragments are generated for corresponding subset of concept graphs c?i1, c?i2, . . .

Abstract: Methods, systems, and computer-readable storage media for online defragmentation of memory in database systems by applying an IX-lock to each table having data stored in a marked page in a set of marked pages, generating a record map including key-value pairs, each being associated with a record location in a marked page, a value of each key-value pair initially set to a first value, iteratively executing the online defragmentation to delete data from marked pages and add the data to non-sparse pages, at least one iteration including applying a try-lock to a record in a marked page, and at iterations of the online defragmentation, updating the record map to change the value of at least one key-value pair from the first value to the second value, the second value representing that data of a marked page has been deleted from the marked page and added to a non-sparse page.

Abstract: A packet identifying method includes: connecting to an IP telephone device under test and querying to a current device information of the IP telephone device under test; determining if there is any instruction set in a database matched with the current device information, wherein the database includes a plurality of instruction sets, and each instruction set corresponds to existing device information of an IP telephone device; and executing a packet identifying procedure by using an executing instruction set.

Abstract: Methods and apparatuses to improve the performance of a video game engine using an Entity Component System (ECS) are described herein. In accordance with an embodiment, the ECS creates and uses entities, to represent game objects, which are constructed entirely using value data types. The ECS constructs the entities within a memory in a densely packed linear way, and whereby the ECS constantly monitors (e.g., during game play) objects within a game and adjusts the entity distribution within the memory so that a maximum density of memory usage is maintained in real time as the game is being played.

Abstract: Presenting and manipulating task items includes creating a task item within a productivity application in association with a content item created with the productivity application and assigning the task item to one or more users. When the task item has been assigned, the task item is displayed to each user when each users opens the productivity application, or when the productivity application is already open to the user. User activity is then monitored in relation to the content item that is associated with the task item such that metadata for the user activity is captured. Based on the captured metadata, the users are alerted to the user activity that has occurred on the content item.

Abstract: The invention discloses a data storage access method, device and apparatus for persistent memory. The method includes: enabling a file system in device to receive, in a kernel space, an access request of a user library, where the user library operates in user mode, and the access request is initiated by third-party application through user library and carries operation type; if the operation type is read operation, enabling the file system to allow third-party application to directly access persistent memory space of device through user library; and if the operation type is not read operation, enabling the file system to allow third-party application to access persistent memory space of device through user library and kernel thread, where kernel thread operates in kernel mode. In this way, the present invention can achieve both high performance and data security of persistent memory, and provide technical support for scalability in multi-core scenario.

Abstract: In a case where updated data using a first logical address as a write destination and existing data using a second logical address as a write destination duplicate with each other, a computer system writes predetermined data instead of updated data to a memory segment associated with a first physical address, and dynamically maps the first logical address to a second physical address. The computer system transmits a write command of the predetermined data or an unmapping command that designates a virtual address that complies with the first physical address, to a storage device that corresponds to the first physical address. The first and second logical addresses are logical addresses that belong to a logical address range which is at least a part of a logical address space. The first physical address is a physical address that belongs to a physical address range which is at least a part of a physical address space, and is a physical address statically mapped to the first logical address.

Abstract: Systems and methods are provided for interfacing multiple layers of optimization for a model of one or more processes in a processing environment to achieve increased or maximized stability in the underlying layer. To improve consistency between the solutions at the different model levels, the lower level of optimization can have extra constraints added to the optimization problem which target variables at their unconstrained values in the upper layer of optimization. The systems and methods can facilitate selection of variables to receive an external target such that stability of the solution is improved or maximized. This can be achieved, at least in part, by identifying variables that provide a reduced or minimized condition number for a sub-matrix in the lower level model when an additional external constraint is applied.