Abstract: A multitenant deployment includes a computing cluster that executes multiple containerized instances of a software application. Each containerized instance is associated with one or more datastores that can be assigned to different tenants. A registry store maintains a mapping between tenants and datastores, thereby allowing a registry manager to properly route tenant requests to the correct datastores. A capacity manager tracks tenant usage of datastores in the registry store and then scales computing resources for each tenant in proportion to usage. The capacity manager also migrates tenant resources in response to catastrophic failures or upgrades. In this fashion, the multitenant deployment can adapt a single-tenant software application for multi-tenancy in a manner that is both transparent and secure for the tenant.

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: This disclosure provides methods, apparatuses, and computer-readable mediums for managing network devices in a telecommunication network using dynamically modifiable graph data schema. The method may be executed by one or more processors and may include creating an entity model specification file; validating a syntax of the entity model specification file based on parsing the entity model specification file; based on the syntax being valid, validating the entity model specification file, wherein validating the entity model specification file comprises converting the entity model specification file into a graph data schema; and initiating the graph data schema associated with the entity model specification file, wherein the initiating comprises changing the graph data schema to a ready state.

Abstract: Integrated circuits that perform offset-based memory management using offset values for allocated, de-allocated, and free memory portions. An example method includes receiving a first request for allocating a first portion of a memory module coupled to an integrated circuit, and determining a first address space for allocating the first portion of the memory module based on one or more offset values.

Abstract: A cognate specification system manages and enforces digital, canonical representations of entities that are added to and in the system by creating a composite entity key (“EntityKey”) that uniquely and immutably identifies each entity within the system, and that is created based upon the attributes of the entity rather than being arbitrarily assigned. Entities may be organized into various types or cognates, each associated with distinct sets of attributes. A physical or digital referent may be added to the system as an entity by specifying attributes. In such a system, any entity, whether a physical or digital referent, a process, or other type, is uniquely and verifiably identifiable, and may be linked to or associated with other entities, allowing users of the system to produce and access specification granularity beyond traditional approaches focused on systems interoperability.

Abstract: An enterprise resource planning system server comprising a SQL database and an executing module to execute an SQL query according to an execution plan to generate execution data relative to the execution of each SQL query; a monitoring module to determine an estimated execution plan metric associated with executing the SQL query according to the execution plan, and to determine whether a hardware performance metric associated with executing the query plan exceeds a hardware performance metric threshold. The monitoring module also determines whether the SQL query is invalid by comparing an execution plan metric associated with executing the execution plan with the estimated execution plan metric in response to determining that the server performance metric exceeds the server performance metric threshold.

Abstract: A text data analysis information generation device includes: a dependence relationship tree information generation unit configured to generate dependence relationship tree information that indicates, in a tree structure, a dependence relationship between words in text data to be analyzed; a graph information generation unit configured to extract a subject, a predicate, and an object from the text data based on the generated dependence relationship tree information, and generate graph information that indicates, in a graph structure, triple information of ontology that consists of them; and a hierarchical concept information adding unit configured to extract two suitable components from the text data, acquire broader concept information that is common between the two components, and add the acquired broader concept information to the graph information as a parent node that is common between the two components so as to generate text data analysis information.

Abstract: A method for providing metadata sharing service may include obtaining a sharing event for a predetermined range path based on a current location of a first target object, determining whether a second original name of a second target object previously registered with a name duplicating with a first original name of the first target object according to the sharing event exists in a sharing table, generating and registering a first unique name different from a second unique name for the second original name of the second target object in the sharing table in response to the existence of a second original name previously registered with a name duplicating with the first original name, and sharing a predetermined range path based on a current location of a first target object of the first unique name according to the sharing event through a virtual drive.

Abstract: In one aspect, a computerized method useful for installing and managing a DevTool web-browser extension comprising: determining a web element selector using the DevTool web-browser extension; performing a specified action on a specified web element, wherein an address of the webpage element is ascertained using the specified selector output; with the DevTool web-browser extension, generating the address for specified web element automatically with a single click operation from a user into the web browser; with the address, generating a relative XPath selector, an absolute XPath selector or a Cascading Style Sheets (CSS) selector; and utilizing the DevTool web-browser extension as an editor tool for the relative XPath selector, the absolute XPath selector or the CSSs selector.

Abstract: Systems, apparatuses, and methods to identify an electronic control unit transmitting a message on a communication bus, such as an in-vehicle network bus, are provided. ECUs transmit messages by manipulating voltage on conductive lines of the bus. Observation circuitry can observe voltage transitions associated with the transmission at a point on the in-vehicle network bus. A domain bitmap can be generated from the observed voltage transitions. ECUs can be identified and/or fingerprinted based on the domain bitmaps.

Abstract: Aspects of the present disclosure are directed to prediction models that match stored parameters to a new data analytics task. A data analytics task can refer to a task that analyzes and queries data sources to retrieve target data. Example parameters for a data analytics task include a task description, assigned individuals, relevant databases, relevant data tables, search queries, data table joins, etc. Implementations can store historical data analytics tasks and their task parameters. Prediction model(s) can be provided new data analytics task parameters and predict matching historical data analytics tasks for the new task. The matching data analytics tasks can then be analyzed to select data tables common among them, and the common data tables can be provided to a user. Implementations can also group additional parameters according to a selected common data table and provide the grouped additional parameters to the user.

Abstract: Methods and systems are provided for automatically, via an artificial-intelligence bot, receiving a query made by a participant in a conference meeting, determine one or more subject matter experts to contact outside of the conference meeting, receive a response to the query from at least one of the subject matter experts, and present the response to the query to the participants of the conference meeting. The artificial-intelligence bot presents the response to the query while the conference meeting is in progress without any participant of the conference meeting communicating with the subject matter expert, without ever connecting a client device of the subject matter expert to the conference meeting, and without ever including the subject matter expert in the conference meeting.

Abstract: Redundancy in a malware signature list is reduced by processing a plurality of pairs of records in a known malware signature list, where each pair of records comprises a file identifier and an associated malware detection. At least one of the file identifiers and the associated malware detections are mapped to symbols representing the file identifiers and the associated malware detections, the symbols taking less memory than the file identifiers and the associated malware detections. The mapped symbols representing the file identifiers and the associated malware detections are processed to remove at least some malware detections that are not needed to provide a desired degree of representation of each file identifier in the processed known malware signature list, and a processed known malware signature list is stored.

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: 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.