Abstract: A cloud network server system, a method, and a software program product for experiencing a three-dimensional (3D) model are provided. 3D model data associated with a 3D video game is uploaded to the cloud network server system. The system and method are used to design for example a computer game that renders non-spatial characteristics such as, smell, reflection and/or refraction of light, wind direction, sound reflection, etc., along with spatial and visibility information associated with 3D objects displayed in the 3D video game. Different versions of the 3D model are created based on memory, streaming bandwidth, and/or processing power requirements of different user terminal computers. Based on a virtual location of a user in the 3D model, parts of at least one version of the 3D model are rendered to the user.

Abstract: In response to a request of a first user, identity information for users is searched to retrieve a portion of the identity information corresponding to the first user. The identity information including fields, where a first subset of the fields is schemaless, and a second subset of the fields is interpreted according to a specified schema. Searching the identity information includes searching the first subset and the second subset of fields. An action for the request is authorized by using information included in at least one field of the first subset included in the retrieved portion of the identity information.

Abstract: The present invention provides for a computerized method for generation an action instruction based on cognitive learning. The present method and apparatus provides for accessing at least one neural network having a data set stored therein. The present method and apparatus determines at least one meaning data map of the data set. The meaning data map includes a plurality of cognitive frames that are embedded within a nine dimensional hypercube. For example, one embodiment may include a four frames making up a four dimensional cognitive dimension grammar that is embedded within the nine dimensional hypercube. The method and apparatus calculates a data meaning based on the at least one meaning data map. From this data meaning, the method and system then generates an action instruction.

Abstract: Techniques are described for executing an analytical query with a top-N clause. In an embodiment, a stream of tuples are received by each of the processing units from a data source identified in the query. The processing unit uses a portion of a received tuple to identify the partition that the tuple is assigned to. For each partition, the processing unit maintains a top-N data store that stores an N number of received tuples that match the criteria of top N tuples according to the query. The received tuple is compared to the N number of tuples to determine whether to store the received tuple and discard an already stored tuple, or to discard the received tuple. After all the tuples have been similarly processed by the processing units, all the top-N data stores for each partition are merged, yielding the top N number of tuples for each partition to return as a result of the query.

Abstract: The back-end data storage system of an e-commerce system receives a replicated transaction from the data storage system of another e-commerce system and makes a determination or decision whether to commit the replicated transaction based upon a comparison of information parsed from the transaction with predetermined commit criteria.

Abstract: Provided are a computer program product, system, and method for generating sub-indexes from an index to compress the index. An index has levels of nodes for a composite key comprised of component keys. Each node includes at least one composite key value comprised of component key values. A plurality of sub-indexes is generated including one sub-index for each component key of the composite key. Nodes are generated in each sub-index corresponding to nodes in the index. In each node of the nodes of the sub-index, a component key value is generated, for the component key for which the sub-index was generated, from at least one composite key value in the corresponding node of the index. The sub-indexes are used to search for a record matching a search composite key value in the database using component key values of the search composite key value.

Abstract: A heterogeneous database storage system based on optical disk includes a magnetic disk storage device and an optical disk storage device connecting, via a data connection, to a server. A relational database management system, a non-relational database management system, a data processor and a database connector are installed on the server. Fields of a record are divided into two parts by the data processor. A part of the fields are in a relational database, and the other part of the fields are in a non-relational database. Fields of the relational database constitute a subrecord of the relational database, and Fields of the non-relational database constitute a subrecord of the non-relational database. The subrecord of the relation database and the corresponding subrecord of the non-relational database form an integral record by the database connector.

Abstract: The subject matter of this specification can be implemented in, among other things, a method that includes storing a plurality of references to one or more first videos and at least one second video at a content hosting system for a first playlist. The method further includes receiving one or more first interactions with the first videos from one or more first user accounts. The method further includes selecting, by at least one processing device, the second video based on the second video belonging to the same first playlist as the first videos and on the first interactions with the first videos from the first user accounts. The method further includes providing, for presentation in a user interface, a recommendation to view the second video to a second user account other than the first user accounts.

Abstract: Techniques for processing write operations may include: receiving, at a first data storage system, a write operation that writes first data to a first device, wherein the first device is configured for replication on a second device of a second data storage system; writing the first data to the first device of the first data storage system; performing first processing that converts the first data to a deduplicated data representation; transmitting the deduplicated data representation from the first data storage system to the second data storage system; and responsive to receiving the deduplicated data representation, performing second processing on the second data storage system that converts the deduplicated data representation to its original form in accordance with the first data.

Abstract: Method, apparatus and computer program product for querying a group-based communication platform are described herein. For example, the apparatus comprises at least one processor and at least one non-transitory memory including program code. The at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to at least store a plurality of electronic messages to a message corpus; receive a search query associated with the message corpus, wherein the search query comprises reaction metadata criteria; and apply the search query to the message corpus to generate a reaction search results set.

Abstract: In one embodiment, a method includes receiving a query input, parsing the query input to identify one or more n-grams, determining a search bias of the first user with respect to the query input, the search bias being determined based on an explicit bias and an implicit bias of the first user, wherein the explicit bias is based on an analysis of the entities associated with the online social networking matching n-grams in the query input, and wherein the implicit bias is based on an analysis of user-profile information of a plurality of second users sharing one or more user attributes with the first user, identifying content objects matching the query input based at least in part on the search bias of the first user, and sending instructions for presenting a search-results interface comprising references to the identified content objects.

Abstract: Described here in are systems, methods and, software to verify storage media and storage subsystems upon deployment. In one example, a computer apparatus to test storage media in a storage subsystem includes processing instructions that direct a computing system to identify initiation of a storage subsystem, initiate a testing process of the storage media, and identify a partition availability event for the storage media. The processing instructions also direct the computing system to, in response to the partition availability event, make a partition of the storage media available to a host processing system, wherein the partition comprises storage locations in the storage media tested via the testing process, and continue the testing process on the storage media. The computer apparatus also includes one or more non-transitory computer readable media that store the processing instructions.

Abstract: Aspects of the present disclosure relate to systems and methods for multi-data source query implementation and aggregation. In embodiments, the query aggregation system comprises a data abstraction engine, a query controller or scheduler and an aggregator. In embodiments, the data abstraction engine normalizes data schemas from multiple data sources based on the parameter requirements. In embodiments, the query controller schedules and runs normalized queries against each data sources independently and securely. In embodiments, the aggregator collects and merges the aggregates of the results into a single analysis. In embodiments, the query aggregation system communicates to various data sources including enterprise data silo(s) and personal data silo(s) to send queries and receive query results. In embodiments, the query sent to each data source may be specialized or tailored for the specific requirement of the data source.

Abstract: A content management system for collecting files from one or more authenticated submitters in a collection folder. A collector, who generates the collection folder, can invite one or more submitters to submit one or more files to the collection folder. The one or more submitters have limited rights to the collection folder. The limited rights can include uploading rights and prohibiting a submitter from viewing files that other submitters associated with the collection folder submitted. Thus, the collection folder is able to store files from the one or more submitters, but prevent them from viewing other's submissions.

Abstract: Automated systems and methods for optimizing a model are disclosed. For example, in an embodiment, a method for optimizing a model may comprise receiving a data input that includes a desired outcome and an input dataset identifier. The method may include retrieving an input dataset based on the identifier and receiving an input model based on the desired outcome. The method may also comprise using a data synthesis model to create a synthetic dataset based on the input dataset and a similarity metric. The method may also comprise debugging the input model using synthetic dataset to create a debugged model. The method may also comprise selecting an actual dataset based on the input dataset and the desired outcome. In some aspects, the method may comprise optimizing the debugged model using the actual dataset and storing the optimized model.

Abstract: According to one aspect, methods and systems are provided for creating partial indexes in a distributed database environment. The database includes an index engine configured to receive at least one index field, a criteria field, and a criteria condition, wherein the criteria field is not included in the at least one index field; and generate an index comprising the at least one index field from at least one record of the plurality of records and a pointer to the at least one record of the plurality of records, wherein the criteria field of the at least one record of the plurality of records satisfies the criteria condition. The database further includes a query engine configured to receive a search query containing the at least one index field; and search the index for the at least one index field.

Abstract: Multi-user computer search system with methodology for bypassing instant indexing of documents. In some embodiments, for example, a system for bypassing instant indexing includes a token store storing a set of token for a current version of a document and a tokenizer server configured to tokenize a new version of the document and to generate a set of tokens for the new version of the document.

Abstract: The current document is directed to a dimensional shuffle transform (“DST”) that maps a 3D space to a one-dimensional space that preserves 3D neighborhoods within ID neighborhoods within a recursive hierarchical structure. The search for points in a 3D subspace is reduced, by the DST, to one or more searches in the transformed ID space. The search is performed by either recursive decomposition of the 3D space indexed by the transform into subspaces, exploiting the transformed space structure, or by direct indexing into the region of interest. The searches over the subspaces generated by recursive decomposition are independent from one another, providing many opportunities for a variety of parallel, DST-enabled search methods. The DST provides a basis for fast and efficient compression of point clouds while avoiding construction and traversal of tree-like data structures.

Abstract: A method, a device, and a non-transitory storage medium are described in which a priming-based search and discovery service for contents uses a weighted graph that stores metadata pertaining to the contents, activation values, threshold values, and a distance parameter that limits the search space relative to primed nodes of the weighted graph that are relevant to search terms.

Abstract: A data table production device includes an aggregate production unit, a database information file storage, a position information production unit, an aggregate storage, a database information image display, a change command receiver, and an aggregate changer. The aggregate production unit produces a prototype of a data table. The database information file storage stores a database information file therein. The position information production unit produces intra-file position information. The aggregate storage stores the prototype of the data table therein. The database information image display forms and displays a database information image. The change command receiver receives input of a change command. The aggregate changer changes a display position of position specification database information and changes a content of the prototype of the data table so as to be matched with a content of the change command.

Abstract: A method to efficiently create a consistent image of a database index at any point-in-time by reversing the effect of uncommitted updates by applying database transaction logs to an index page set in a single pass. The created image can be used to recover the database index to a point in time that is consistent with its associated table, or for physical migration where data and indexes are migrated to another database that may or may not be on the same DBMS and the indexes and data must be consistent as of the same point in time.

Abstract: A non-volatile memory includes: at least one parent node; and at least one child node that stores a data object and has a variable size of n multiple of the parent node, n being a natural number, when a target child node to insert at least one new data object is fully filled, wherein the data objects of the target child node are split and reinserted into newly created at least one child node.

Abstract: An online system stores media files (i.e., stored media files) and receives a user request to upload a video file (i.e., a requested media file). The online system determines whether the requested media file matches one of the stored media files based on hash values. If there is a mismatch in hash value, the online system may determine the match based on fingerprints. If it is determined that the requested media file does not match any stored media file, the online system stores the requested media file. Even if there is a match, the online system compares a quality of the requested media file with the matched media file and replaces the matched media file with the requested media file having a higher quality metric.

Abstract: A computer system, method, and computer-readable product for automatically generating a hierarchy of concepts described in a video using semantic concept matching that assists persons in searching for specific types of content within videos. A video segment is obtained, with the segment having a distinct running time with discrete information related to one or more topics within its content. The discrete information of the video segment is then parsed out and related to a predetermined relevant topic, and then one or more attributes for weighting each discrete information relevant topic within the video segment are determined. A hierarchy of concepts of the video segments is then created, based upon, at least, the weighting of the information topic within the running time of the video segment based upon the presence of the one or more attributes. Other information related to the video segment can also be used to modify the hierarchy.

Abstract: The present invention may be a system for creating indexes for information retrieval comprises a processor and a memory. The memory has program instructions embodied therewith. The program instructions are executable by the processor to cause the system to read a document having hinting information into a memory, where the hinting information is associated with each unique expression in an original document. The program instructions are further executable to create the indexes from the document, where a first analysis method for generating a contiguous sequence of items from a text in the document is used for creating the indexes for each sequence in the unique expression with which the hinting information is associated and a second analysis method for dividing the text into meaningful units is used for creating the indexes for each word in the text other than the unique expression.

Abstract: A computer-implemented method is provided for mapping IP addresses and domain names to organizations. The method includes receiving, by a mapping system from an data provider, a dataset related to a plurality of users of the data provider. The dataset includes (a) an IP address for a user device of each user of the plurality of users, and (b) a domain name for a user account of each user of the plurality of users; enriching, by an analytics engine of the mapping system, the received dataset with enrichment data from an enrichment source; receiving, by the analytics engine from a storage medium, historical data relevant to the enriched dataset; and mapping, by the analytics engine, (i) the IP address and/or (ii) the domain name of each user of a portion of the plurality of users to an organization based on the enriched dataset and the historical data.

Abstract: Embodiments of the present invention provide systems and methods for visualizing and querying data. Data subsets within an original table are examined. Values within the data subsets are extracted. Based on the extracted values, a new table is generated. The data contents of the original table differ from the data contents of the new table. Thus, the resulting visualization of the original table differs from the resulting visualization of the new table.

Abstract: A request identifier is employed with various systems and methods in order to enable an application to pause execution during a failure and subsequently resume execution and communication with a storage system once the failure is resolved. An application residing on a node may attempt to access target data on a storage system. The application sends a request to access the target data. The request may be associated with a request identifier that identifies the application. When the storage system experiences a failure, the application receives a failure notification. The application pauses execution as a result of the notification. When the node reestablishes a connection to the storage system, the application resumes execution using the same request identifier. If the resume request is granted, the application is guaranteed that the target data was not modified during the failure.

Abstract: A data placement device creates a similarity index for each of computational resources based on a similarity between each of the pieces of acquired data and each of the pieces of data stored in the computational resources. The data placement device allocates on the basis of the similarity index of each of the computational resources with respect to the pieces of the data, the pieces of the data to each of the computational resources by using a matching system in which the similarity index associated with each allocation becomes stable in a direction in which the similarity index is small. The placement device places the pieces of the acquired data into the computational resources on the basis of the allocation result.

Abstract: A first data table and a second table to be joined is determined. The first data table and the second data table have a join attribute. Data blocks of the first data table are stored on a storage device. An attribute value information for the join attribute for the data block of the first data table is determined. At least one partition for the first data table and the second table is defined using at least he attribute value information on the join attribute. Each partition of the at least one partition has a respective partition range of values of the join attribute. A pair wise partition join is processed on a first partition range of the determined partition ranges.

Abstract: A method to analyze a facial image includes: inputting a facial image to a residual network including residual blocks that are sequentially combined and arranged in a direction from an input to an output; processing the facial image using the residual network; and acquiring an analysis map from an output of an N-th residual block among the residual blocks using a residual deconvolution network, wherein the residual network transfers the output of the N-th residual block to the residual deconvolution network, and N is a natural number that is less than a number of all of the residual blocks, and wherein the residual deconvolution network includes residual deconvolution blocks that are sequentially combined, and the residual deconvolution blocks correspond to respective residual blocks from a first residual block among the residual blocks to the N-th residual block.

Abstract: A system provides of data islands of a federated environment storing scalable data used to efficiently search for data and/or other objects across the federated environment and access details of any objects while minimizing the data replicated across all of the data islands. The scalable data may be replicated across all of the data islands and allow a local search for any object across the federated environment. The scalable data may be a subset of data and/or configured meta data that stores a limited subset of data that enables the local search, at each data island, for objects stored in the federated environment.

Abstract: An encoding device 100 encodes a target file by using a static dictionary 121 and a dynamic dictionary 122. The encoding device 100 generates index information of the target file by folding a file axis and a word axis of the target file utilizing base numbers, respectively, the index information indicates presence information of words registered in the static dictionary 121 and the dynamic dictionary 122. The encoding device 100 generates, when the target file is updated, the difference information indicating difference of the index information with respect to the file axis direction or the word axis direction.

Abstract: A file system stores directories and files in a file system directory that uses case sensitive names. The same file system directory can support directory and file name lookups that treat the directory and file names in a case sensitive manner or in a case insensitive manner. The search criteria used for the lookup can be based on case-folding the name to produce a case-neutral name and on the original name with its case preserved. Search criteria can be generated for a case sensitive name lookup or for a case insensitive name lookup on the same file system directory, thus avoiding having to support separate file systems or separate file system directories for case sensitive and case insensitive file access.

Abstract: A system for curating digital objects of a digital platform. In various embodiments, the digital platform may include one or more processors configured to index digital objects of the digital platform to identify semantic information of each digital object, and associate a plurality of digital objects based on matching semantic information.

Abstract: The systems and methods described herein can use multiple fields with dynamically determined priorities based on field values for node resolution. The system can generate activity field-value pairs including an activity value associated with an activity field from an electronic activity. The system can determine a frequency score based on a first count of node field-value pairs that match the activity value. The system can assign a weight to the activity value based on the frequency score. The system can generate a match score of a candidate node profile indicating a likelihood that the electronic activity is transmitted or received by an account corresponding to the candidate node profile. The system can store an association between the electronic activity and the node profile selected based on the match score.

Abstract: A first data table and a second table to be joined is determined. The first data table and the second data table have a join attribute. Data blocks of the first data table are stored on a storage device. An attribute value information for the join attribute for the data block of the first data table is determined. At least one partition for the first data table and the second table is defined using at least he attribute value information on the join attribute. Each partition of the at least one partition has a respective partition range of values of the join attribute. A pair wise partition join is processed on a first partition range of the determined partition ranges.

Abstract: Embodiments disclosed herein are related to systems and methods for a scheduling manager or other element of a distributed computing system to schedule events performed by a various computing systems based on a priority of the events. The distributed computing system includes one or more processors and system memory having stored thereon executable instructions. When the executable instructions are executed by the processors, the computing system receives a new event that is to be added to a queue of events that are to be executed by the distributed computing system, determines that there is a current active event in the queue, compares a priority of the new event with a priority of the current active event, and based on the comparison, modifies an order of the events in the queue by updating the event in the queue that is to be the current active event.

Abstract: The invention is a method and system which uses photogrammetric data and functions to perform image-based deconstruction of 3D point cloud data sets. These standard image formats from associated metadata can be easily serialized, transmitted, and subsequently reconstructed using established stereo photogrammetric methods.

Abstract: A method includes identifying, by a computing device of a dispersed storage network (DSN), a delegate device of a plurality of delegate devices of the DSN for processing a change to a node of a plurality of nodes of a hierarchical index structure. The method further includes sending, by the computing device, a change type specific request to the delegate device regarding the change to the node. The method further includes determining, by the delegate device, whether the delegate device is responsible for executing the change type specific request. When the delegate device is responsible for executing the change type specific request, the method further includes sending, by the delegate device, a response message to the computing device indicating that the delegate device is responsible for executing the change type specific request. The method further includes executing, by the delegate device, the change type specific request.

Abstract: A system including an associative memory and an input device configured to receive a first query or comparison request. The associative memory is configured to: responsive to receiving the first query or comparison request, locate an entity value having an attribute value matching a term of the first query or comparison request; responsive to locating the entity value, return a first list of results including the entity value; add, as a required search term, at least one of first results from the first list to a second query or comparison request, the second query or comparison request further including all terms of the first query or comparison request; perform the second query or comparison request and, as a result, return a second list of resource references; use the second list to retrieve source data; combine the entity value with the source data to form a combination; and return the combination.

Abstract: A semi-complete secure data container is associated with a unique identifier by a requesting entity but is void of data. The data container, and a request to add data to the container, are combined into a message that is sent to a client. Upon receipt of the request, the client need not do anything to create a secure environment by which to protect the data. The secure environment, or data container, is already created and is merely awaiting data; data supplied by the client. Once the client places the requested data into the data container, the container closes and encrypts the data. The container, now closed and containing encrypted data, returns to the original requesting entity which solely possesses the key to decrypt the contents.

Abstract: Various examples are directed to systems and methods for managing a database organized according to a schema. The database may comprise a database file corresponding to a table described by the schema. The database file may comprise a first row entry corresponding to a first row of the table. The first row entry may comprise at least one data item. A command may be received. The command may modify a first data item in the first row of the table. An indication of the modified value for the first data item may be written to a change location at the first file. The first entry may be modified to include a pointer to the indication of the modified value for the first data item.

Abstract: A set of documents is parsed. Members of the set of documents include a set of text elements and a set of visual elements. A text content stream based on the set of text elements and a visual content stream based on the set of visual elements are produced. For respective documents, a set of respective visual element summarizations is built from the visual content stream. Each visual summarization includes a text description of a respective visual element in the respective document. A holistic index is created by indexing the text content from the text content stream and the text descriptions of the visual elements in a single search index. The indexing uses a set of semantic relationships between the text content from the text content stream and the textual descriptions of the visual elements. A user interface allows a user to selectively search text content and visual content.

Abstract: Systems and methods of providing search capabilities for data backups by indexing multiple time-based versions of the data backups such that the multiple time-based versions of each of the data backups are factored into a search result. First data associated with a first backup of a data set is received, the first data including a list of changes associated with the data set between a first backup and a second backup. For each of the first backup, second backup and one or more intermediary backups an index representative of difference data is created. Second data associated with a search request is received. A version of the file is retrieved based on the search request, thereby providing search capabilities for data backups by indexing data backups at a plurality of backup times such that multiple versions of each of the data backups are factored into a search result.

Abstract: Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for receiving a key, the key corresponding to an object that is stored in a hybrid memory system, searching a SPLAY tree based on the key to identify a node of the SPLAY tree, determining a type of memory that the object is stored on in the hybrid memory system, the type of memory including one of a first type of memory and a second type of memory, selectively adjusting an endurance counter associated with the object based on a location of the node within the SPLAY tree, and the type of memory that the object is stored on in the hybrid memory system, and selectively migrating the object between the first memory type and the second memory type based on the EC associated with the object.

Abstract: Provided are methods comprising receiving a query for information from the database, determining particular data element types and data element values that are the subject of the query, instantiating a query data structure containing the data element types and the data element values that are the subject of the query, identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure, and instantiating a results data structure comprising information relating to the identified records.

Abstract: Differential health-check systems and accompanying methods provide health-checking and reporting of one or more information management systems in reference to a first time period before and a second time period after a triggering event. A triggering event may be an upgrade of at least part of the information management system, or a restore operation completed in the information management system for example following a disaster, or any number of other events, etc. The health-checking and reporting may comprise a comparison of one or more performance metrics of one or more components and/or operations of the information management system during the first and second time periods.

Abstract: The present invention provides a system, method and apparatus for electronically searching for an item by receiving a search request comprising a requested category and one or more requested attributes of the item and storing the search request in a search index based on the requested category and the requested attribute(s). The search index includes one or more categories and each category is defined by a taxonomy of attributes. The search index is then searched for any previously stored search requests that match the requested category and the requested attribute(s), a result of the search is determined and a search response that includes the result of the search is sent.

Abstract: Method of searching an inverted index having a plurality of posting lists, comprising: receiving a search query to be searched including search terms; effecting a search of posting lists to yield search results, the posting lists associated with the search terms and including a plurality of a first type of postings being a reference to a data item actually containing the search term with which that posting list is associated, the search results including result items missing one of the search terms; sending the first search results; receiving an indication of a user-selected result item, the user-selected result item being the result item missing one of the search terms; effecting insertion, into the posting list associated with the missing one of the search terms in the user-selected result item, of a second-type of posting being a reference to the user-selected result item missing that search term.