Abstract: Systems and methods are provided for dynamic selection of anomaly detection options for particular metric data. Metric data corresponding to one or more configuration items of an information technology (IT) infrastructure is collected. A selected anomaly detection action option that applies to the metric data is identified. An action is performed using the metric data, based upon the selected anomaly detection action option. A dashboard graphical user interface (GUI) display results of the action.

Abstract: A method for checking at least one surroundings detection sensor of a vehicle involves localizing the vehicle on a digital map and identifying features of stored stationary objects of the surroundings of the vehicle in the digital map, of which it is expected that they are recognized by the surroundings detection sensor. The surroundings of the vehicle are detected by the surroundings detection sensor and it is concluded that there has been a degradation of the surroundings detection sensor when the features to be recognized according to expectations are not recognized by the surroundings detection sensor or when features actually detected by the surroundings detection sensor deviate greatly from the features to be recognized according to expectation. The digital map with the stored features of the stationary objects is retrieved for a predetermined projection horizon of a central storage unit external to the vehicle.

Abstract: Example resource management systems and methods are described. In one implementation, a system includes a memory and a processing device operatively coupled to the memory. The processing device is to: provide a plurality of execution nodes, each execution node comprising a cache and a processor, each execution node communicatively coupled to a storage platform; determine at least one task associated with processing a received query referencing database data stored in the storage platform; and create a new execution node within the plurality of execution nodes to process the at least one task associated with processing the received query.

Abstract: A system (100) for monitoring a controlled spatial volume (102) includes a lighting fixture (104) with one or more embedded sensors (106), a communication device (108) to provide monitored sensor data (142) for storage within a data store (140), a server (130) including a data analytic unit (136) in communication with the data store, the data analytic unit accessing the monitored sensor data to analyze the monitored data and provide status information on the spatial volume. The server can include a machine vision unit (138) to analyze the monitored data and create augmented reality renditions (520), which are rendered for display to a user by an augmented reality application (160).

Abstract: A financial close automation (FCA) system receives or retrieves account data from one or more enterprise resource planning products (ERPs). The FCA examines the balance sheet for a given account and determines whether the account is auto-certifiable, and whether the unknown balance is below a threshold amount. If the answer to either inquiry is no, the FCA generates a task for the general ledger owner to provide an explanation for the discrepancy. A task is the created for a manager to review the provided explanation. If the manager does not approve of the provided explanation, additional information may be required. Once the manager approves the provided explanation for the discrepancy, the account is certified. If the account is auto-certifiable and the unknown balance is below the threshold amount, the account is auto-certified.

Abstract: One example provides an integrated computing device, comprising one or more computing clusters, and one or more network controllers, each network controller comprising a local data notification queue to queue send message notifications originating from the computing clusters on the integrated computing device, a remote data notification queue to queue receive message notifications originating from network controllers on remote integrated computing devices, a local no-data notification queue to queue receive message notifications originating from computing clusters on the integrated computing device, and a connection scheduler configured to schedule sending of data from memory on the integrated computing device when a send message notification in the local data notification queue is matched with a receive message notification in the remote data notification queue, and to schedule sending of receive message notifications from the local no-data notification queue.

Abstract: Methods, systems, apparatuses, and computer program products are provided for coordinating a distributed database transaction. A transaction driver, such as a client machine, may initiate a distributed transaction. The transaction driver may transmit to a transaction coordinator a driver report that includes identifying information related to the distributed transaction, including an identification of participants involved in the transaction. The coordinator may determine whether participant reports, which include a status of the portion of the distributed database transaction of a particular participant, are received from each of the participants. Participant reports may also identify participants that are descendants of the reporting participant. The transaction coordinator may store, in a table, information to track the progress of the distributed transaction. Using the table, an outcome of the distributed transaction may be determined and transmitted to one or more of the involved participants.

Abstract: A legal document analysis platform is described. The platform uses an AI model to evaluate the favorability of sentences within a proposed legal document. The platform also suggests alternative sentences for one or more sentences in the proposed legal document.

Abstract: Methods and systems for execution of data operations in a queue are described. One method includes loading a pointer to a record in a lock-free ring buffer by an executing thread, as well as calculating an index from the pointer to a record to be processed and obtaining a header of the record to be processed. Based on the header, a state of the record to be processed is determined from among: a filled state, a filling state, a drained state, and a draining state. A candidate header is created which includes an updated state indicating that the record is in use by the executing thread. An atomic operation is performed to update the header of the record to the candidate header. Upon successful completion of the atomic operation to update the header of the record to the candidate header, a data operation is performed on the record.

Abstract: A dataset formatted in a first format is generated, wherein the dataset formatted in the first format includes at least a plurality of data elements that comprise data. A selection is made of machine learning framework, wherein the machine learning framework operates on datasets formatted in a second format that is different from the first format. The dataset is converted from the first format to the second format and links are generated from the converted dataset formatted in the second format to the plurality of data elements of the dataset formatted in the first format to avoid creating additional copies of the plurality of data elements.

Abstract: A cloud-based, geospatially-enabled data recording, notification, and rendering system.

Abstract: A first table has more than one key column, and a hash array is built for the table, which includes computing hash indices for respective rows of the first table based on more than one key column. Building the hash array also includes writing in the hash array for each row at a respective location in the hash array, wherein each location is indicated by each row's respective hash index computed from the more than one key column. The hash array is probed responsive to the second table. In the building of the hash array for the first table, the writing in the hash array for each row at a respective location in the hash array writes only one of the key columns as a single key field in the hash array for each row.

Abstract: A method is provided for use in computing system, comprising: instantiating a plurality of scheduler queues; instantiating a plurality of type-1 threads; assigning each of the plurality of type-1 threads to a respective scheduler queue; allocating a plurality of budgets to the plurality of scheduling of queues, each of the plurality of budgets being allocated to a different one of the plurality of scheduling queues; selecting one of the plurality of scheduling queues; retrieving a type-1 thread from the selected scheduling queue when one of a first condition or a second condition is satisfied, the first condition being satisfied when the respective budget of the queue is not exhausted, and the second condition being satisfied when another one of the plurality of scheduling queues are empty; and executing the retrieved type-1 thread.

Abstract: A financial close automation (FCA) system receives or retrieves account data from one or more enterprise resource planning products (ERPs). The FCA examines the balance sheet for a given account and determines whether the account is auto-certifiable, and whether the unknown balance is below a threshold amount. If the answer to either inquiry is no, the FCA generates a task for the general ledger owner to provide an explanation for the discrepancy. A task is the created for a manager to review the provided explanation. If the manager does not approve of the provided explanation, additional information may be required. Once the manager approves the provided explanation for the discrepancy, the account is certified. If the account is auto-certifiable and the unknown balance is below the threshold amount, the account is auto-certified.

Abstract: Methods, systems, and computer-readable media for segmentation of maintenance on distributed systems are disclosed. A data set is partitioned according to a hash function into a plurality of segments. A maintenance activity is initiated on a first segment. During the maintenance activity, a first request to perform a first action on the data set is received. Based at least in part on determining that the first request is associated with the first segment using the hash function, the first action is performed using additional processing associated with the maintenance activity. During the maintenance activity, a second request to perform a second action on the data set is received. Based at least in part on determining that the second request is associated with a second segment using the hash function, the second action is performed without the additional processing associated with the maintenance activity.

Abstract: Performing late binding of a social network identification (ID) to a guest ID for use in an identity platform. A guest ID is created for a second user that gives access to a shared application of an identity platform that is associated with a first user. Subsequent to creating the guest ID, permission is requested from the second user to bind social network IDs of social networks of which the second user is a member to the guest ID. In response to receiving permission, binding the social network IDs to the guest ID is performed. The binding gives the identity platform access to profile attributes of the second user from the social networks, and allows it to write information such as a merit badge back on the second user's social network profile. A federation binding may also be created that allows the second user to sign into the shared application using their social network ID.

Abstract: An apparatus, computer-readable medium, and computer-implemented method for ingesting semi-structured data in a columnar format, including parsing a data record, the data record comprising semi-structured data including one or more data fields and one or more data values corresponding to the one or more data fields, generating a schema corresponding to the data record, the schema comprising the one or more data fields and one or more data types corresponding to the one or more data fields, determining whether the schema corresponding to the data record is homogenous with a schema corresponding to a current row group, wherein the current row group comprises one or more current column names and one or more current column types, and storing the data record as a new record in the current row group based at least in part on a determination that the schema is homogenous.

Abstract: Provided herein are techniques for processing a database query aggregating data. Data tuples of a database object each including a grouping element and a data element are analyzed to determine a length of the data element for each data tuple. A plurality of tables each accommodate a successively greater length for the data element. A corresponding table of the plurality of tables to store each data tuple is determined based on the length of the data element of that data tuple relative to the accommodated lengths of the plurality of tables. Each data tuple in the determined corresponding table is stored to group the data tuples within each of the plurality of tables based on the grouping element, and an indication of corresponding tables containing members for each group is provided. The groups are combined across the plurality of tables to aggregate the data tuples for a database query.

Abstract: The disclosed computer-implemented method may include (1) sampling links from an online system, (2) receiving, from a human labeler for each of the links, a label indicating whether the human labeler considers a landing page of the link to be a low-quality webpage, (3) generating a link graph from a crawl of the links, (4) using the link graph to derive a graph-based feature for each of the links, (5) using the label and the graph-based feature of each of the links to train a model configured to predict a likelihood that a link is to a low-quality webpage, (6) identifying content items that are candidates for a content feed of a user, (7) applying the model to the content items to determine a ranking, and (8) displaying the content items in the content feed based on the ranking. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Techniques to reduce database fragmentation are disclosed. In various embodiments, an indication is received to store an attribute value for an entity that has a row or other entry in a first database table, wherein the first database table does not have a column for the attribute. It is determined that the value corresponds to a mapped value that is associated with not having an entry in a separate, second database table configured to store the attribute. Entries are made in the second database table only for values of the attribute other than the mapped value. Application level software code is configured to associate absence of a row in the second database table with the mapped value for the attribute.

Abstract: The methods and systems for transferring structural data over a network are provided. An example method includes providing storage operable to store a plurality of objects. The objects of the plurality of objects are immutable and include a data object or a metadata object including a list of references to further objects. The plurality of objects includes at least one root associated with a creation or an addition to the plurality of objects. The method also includes providing a further storage communicatively coupled with the storage via a network and configured to store a copy of the plurality of objects. The method includes determining a presence of a difference between the plurality of the objects and the copy. In response to the determination, the method transfers at least one object associated with the difference from the storage to the further storage.

Abstract: The design and implementation of databases within enterprises is a crucial process, but is often resource intensive and often times unnecessary as existing databases may be utilized to serve the same goals. Tracking existing databases and assessing the design specifications of proposed databases is a complex decision making process. Disclosed is a system and computer-based method for systematically controlling the approval, creation and modification of databases. The system provides a policy for enterprise governance control for database proliferation and a tool for comparing database requests to and against existing database assets.

Abstract: A memory system for a network device is described. The memory system includes a main memory configured to store one or more data elements. Further, the memory system includes a link memory that is configured to maintain one or more pointers to interconnect the one or more data elements stored in the main memory. The memory system also includes a free-entry manager that is configured to generate an available bank set including one or more locations in the link memory. In addition, the memory system includes a context manager that is configured to maintain metadata for a list of the one or more data elements.

Abstract: Methods, apparatuses, and computer program products are provided for graphical display of hierarchical hardlinks to files in a file system that includes identifying multiple hardlinks for a file, wherein a hardlink comprises a link to a file directly mapping the file into a namespace; displaying relationships among the multiple hardlinks and the file; and providing an option to modify the hardlinks to the file via a button, including: following a pointer from the file having multiple hardlinks to a list of hardlinks to the file by following a Master Hardlink Pointer which is contained in the file and provides a pointer to the hardlink list for the file.

Abstract: A method and system for correlating events with social media is provided. The method includes retrieving from a social network, social network data associated with users of the social network. The social network data is associated with event data associated with a user of the users. Temporary actions associated with a social network account of the user are enabled and a notification is transmitted to a group of users. In response, confirmation data associated with enabling the temporary actions is received from the group of users and permanent actions associated with the temporary actions are enabled.

Abstract: Systems and methods are provided for dynamic analysis tracking objects for application dataflow. A system receives a data object from a data source, creates a source tracking object for the data object, and records information associated with the data source into the source tracking object. The system creates a copy of the data object for a tracking event in the application program, creates a flow tracking object for the tracking event, and records information associated with the tracking event into the flow tracking object as the tracking event processes the copy of the data object. The system outputs the copy of the data object to a data sink, creates a sink tracking object for the data sink, and records information associated with the data sink into the sink tracking object. The system outputs the source tracking object, the flow tracking object, and the sink tracking object as dynamic analysis of dataflow in the application program.

Abstract: Systems and methods are provided for dynamic analysis wrapper objects for application dataflow. A system creates a wrapper object that points to a data object received from a data source, creates a source tracking object for the wrapper object, and records information associated with the data source into the source tracking object. The system creates a copy of the wrapper object for a tracking event in an application program, creates a flow tracking object for the tracking event, and records information associated with the tracking event into the flow tracking object as the tracking event processes the copy of the wrapper object. The system outputs the copy of the wrapper object to a data sink for the application program, creates a sink tracking object for the data sink, and records information associated with the data sink into the sink tracking object.

Abstract: Managing content is disclosed. An indication is received that a content item comprising a body of managed content is associated with a business object not included in the body of managed content. The content item is linked with the business object.

Abstract: A method comprises creating a first node, determining whether an indicator associated with a head node is present, and designating the first node as a head node, defining and associating a head node identifier with the first node, define a link from the first node to the first node, and create and save an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present.

Abstract: An information processing device includes a storage area creation unit that creates a storage area containing a search condition for searching for data items in response to an input operation, a search unit that searches for, when the storage area containing the search condition is created, data items which match the search condition contained in the storage area from among data items stored in a database, a link information creation unit that creates link information for accessing the matching data items searched for by the search unit, and an arranging unit that arranges the link information created by the link information creation unit into the created storage area.

Abstract: A network management method is provided, which includes creating one or more networks defined by a closed loop based on unidirectional links among basic memory units, and creating a new network based on a new closed loop which is constructed based on two or more networks. Accordingly, it is possible to read information regarding another associated networks, upon reading about information regarding one of the created networks.

Abstract: Data is retrieved from a linked-list by locking the linked-list, retrieving data from an element in the linked-list, advancing to a subsequent element in the linked-list while a breakpoint is not encountered and marking the subsequent element as “in-use” when a breakpoint is encountered. A reference to the subsequent element is then created before the linked-list is unlocked.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for generating modified web documents. In one aspect, a method includes retrieving a web document including markup language code and having references to resources external to the web document and parsing the retrieved web document to interpret the markup language code and identify references to resources external to the retrieved web document. Data relating to at least a portion of the resources external to the retrieved web document are retrieved, and a modified web document including the retrieved data is generated and stored for use in responding to a request for retrieval of content of the web document.

Abstract: A method and apparatus for facilitating answering a query on a database. Example embodiments include: accessing a database tree having a plurality of nodes; receiving a set of input variable values, a non-empty set of output variables, and information indicative of a node in the database tree; determining a traversal cost based on the node and the set of input variable values; determining a lower bound based on the node and the set of input variable values, wherein the lower bound corresponds to an upper-bound probability estimate based on one or more of the plurality of nodes and the set of input variable values; pruning one or more of the plurality of nodes based on the traversal cost, the lower bound, and a pruning bound; and returning a result including a non-empty set of output variable values based on the set of input variable values, the node, the traversal cost, and the lower bound.

Abstract: A method of generating a skip list is disclosed. The skip list comprises a data structure for referencing a plurality of ordered nodes, the data structure having a plurality of linked lists, a total number of the plurality of linked lists being constrained by an available memory of a memory system, the method comprising the steps of: inserting a first node of the plurality of nodes into a predetermined linked list of the plurality of linked lists of the data structure of the skip list in the available memory; promoting the first node to one or more other linked lists based on a first set of criteria; and generating the skip list by inserting at least a second node of the plurality of nodes into the data structure and promoting the second node based on a second set of criteria, said second set of criteria being different from the first set of criteria.

Abstract: Techniques for establishing a files system that exposes a virtual file system for backup operations are presented. Changes to files of a file system are maintained separately or collected and presented as a VFS. The VFS is then used to perform backup operations. Moreover, the files identified in the VFS can be customized based on search parameters, criterion, and/or criteria supplied by a user or supplied as parameters to backup and VFS mount operations.

Abstract: The present application is directed to a data management system. The data management system is implemented within a computer system that includes one or more processors, one or more electronic memories, and a memory-mapped file facility that electronically stores data. The data management system, implemented by data management system control routines that are executed by the one or more processors, retrieves a particular projection of a multi-level, multi-dimension data set stored within the ONP-tree data structure that contains the multi-level, multi-dimension data set.

Abstract: Methods, systems, and computer program products for memory garbage collection via object grouping are disclosed. Normative objects are allocated in a non-native memory referencing respective one or more native objects in a native memory. The non-native objects are grouped into non-native object groups based upon information regarding object references associated with respective ones of the native objects. Objects in respective ones of the one or more non-native object groups are provided one or more references to other said objects of the non-native object groups to create connected object groups. Unused ones of the connected object groups are detected. And objects of the detected unused ones of the connected object groups are de-allocated.

Abstract: Systems and methods are disclosed for providing devices capable of the reception and playback of one or more crafted media channels transmitted over an intermittent connection. An exemplary method of personalized rendering of media content includes receiving media files and file metadata defining attributes of the media files over a data link at a receiver. The method further includes executing, using a processor of the receiver, instructions stored in a memory of the receiver. The instructions cause the processor to store certain ones of the media files characterized by file metadata consistent with one or more channel profiles in the memory, remove certain of the ones of the media files stored within the memory, and sequence the ones of the media files stored within the memory for rendering based upon one or more of the channel profiles.

Abstract: A mechanism is provided for multi-part aggregated variables in structured external storage. The shared external storage provides a serialized, aggregated structure update capability. The shared external storage identifies each local value for which a group value is needed by name. Each time a member writes out its value, the member specifies the name of the object, the member's current value, and the type of aggregate function to apply (e.g., minimum, maximum, etc.). The structured external storage in one atomic operation updates the member's value, recalculates the aggregate of all of the individual values, and returns the aggregate to the member. The advantage of this approach is that it requires only one write operation to the structured external storage. The update operation does not require locking, because the operation is atomic.

Abstract: A method and system for discovering keys in a database. A minimal set of non-keys of the database are found. The database includes at least two entities and at least two attributes. The minimal set of non-keys includes at least two non-keys. Each entity independently includes a value of each attribute. A set of keys of the database is generated from the minimal set of non-keys. Each key of the generated set of keys independently is a unitary key consisting of one attribute or a composite key consisting of at least two attributes.

Abstract: A table update component may perform updates on a dynamic linear hash table, the updates requested by clients based on request item values. A table capacity status component may determine first capacity indicators associated with the dynamic linear hash table, based on results of the update requests. A table maintenance component may initiate lock-free merges and lock-free splits of hash table buckets associated with the dynamic linear hash table, based on initiating lock-free merges and lock-free splits of linked lists included in hash table buckets associated with the dynamic linear hash table, based on the determined first capacity indicators, the linked lists including hashed items stored in the dynamic linear hash table.

Abstract: A cluster file system is disclosed. A plurality of disk servers, operating as a single distributed disk server layer, are connected to the one or more physical disks. Each disk server stores metadata for each of the files. A plurality of lock servers, having one or more locks for each file and associated file system metadata operates as a single centralized distributed lock server to coordinate access to the files stored by the disk server layer. A plurality of asynchronous file servers, operating as a single distributed file server layer in response to a request for a file from a user program: (i) retrieves the requested file from the disk server layer and at least one lock, associated with the retrieved file, from the lock server, and (ii) retrieves metadata for at least one file that is related to the requested files, and at least one lock, for each file that has had its metadata retrieved.

Abstract: Techniques are disclosed for a policy driven cloud storage management broker and a cloud storage policy router, along with methods for registering tenant applications with the cloud storage management broker and for sending (and retrieving) files to/from a cloud storage service. A tenant application may be configured to generate a user interface that allows a user to specify metadata to associate with a file along with a link to a cloud storage service to which the file is uploaded. The tenant application may collect and store the metadata attributes (along with a reference to the file stored in the cloud) in an enterprise database, while the file itself may be transmitted to the cloud storage service directly. The cloud storage policy router may learn the capabilities of different cloud storage providers using an advertisement routing protocol.

Abstract: A system, method and computer program product for resizing a hash table while supporting hash table scalability and concurrency. The hash table has one or more hash buckets each containing one or more items that are chained together in a linked list. Each item in the hash table is processed to determine if the item requires relocation from a first bucket associated with a first table size to second bucket associated with a second table size. If the item requires relocation, it is linked to the second bucket without moving or copying the item in memory. The item is unlinked from the first bucket after waiting until there is no current hash table reader whose search of the hash table could be affected by the unlinking, again without moving or copying the item in memory.

Abstract: A system, method and data structure for processing basic client application data types to add thereto extension types and priority levels adapted for use by each of a plurality of set top box classes.

Abstract: Improved systems and methods are provided for identifying financial relationships. In particular, financial relationships may be identified by associating tradelines with one or more people who sign or co-sign on the tradeline. In various embodiments a method is provided comprising, receiving, at a computer-based system for credit data analysis comprising a processor and a tangible, non-transitory memory, credit reporting data relating to a tradeline, parsing, by the computer-based system, the credit reporting data to yield primary debtor data and secondary debtor data, and linking, by the computer-based system, the tradeline with the primary debtor data and the secondary debtor data.

Abstract: A logical network directory database compliant with the X.500 standard for a directory data system is disclosed. The network directory database provides a source of subscriber and service data accessible by various control and management processes that require subscriber information. The network directory database may be extensible across various communications service providers and IT domain. Further, the disclosed network directory database may be applied to new and existing services, such as, IP Multimedia Subsystem, Unlicensed Mobile Access (UMA) and other IP services.

Abstract: A tool for scheduling a project review meeting based on monitoring of one or more documents required for the project review meeting. The documents/files are identified along with criteria that the documents must meet prior to scheduling the review meeting. The criteria can be default criteria or specifically defined and entered by a user. The tool monitors the documents and in response to finding that the criteria has been met, determines meeting participants, generally collaborators working on the documents, determines the meeting participants' individual schedules, and determines a meeting time based on the meeting participants' individual schedules.

Abstract: A method, apparatus, and system are described for list texturing being performed over a data path of a graphics pipeline. Input data is received at a graphics pipeline of a graphics processing unit to be processed and generated into a final image to be displayed on a display device of a computer system. Geographic primitives are obtained from processing the input data, and neighbor aggregation of pixels within the geographic primitives is performed. The neighbor aggregation of the pixels includes rendering list texture of the pixels by merging the geographic primitives.