Abstract: In one preferred form of the present invention, there is provided a computer implemented art gallery system (10) for use by a community of users (12), the system (10) comprising: a data collector (14) for storing representations (16) of artworks (18) that have been created by artists; and a timeline facility (20) configured for attempting to ensure that, upon user requests (22) for representations (16) of the artworks (18), each representation (16) corresponding with a respective one of the artworks (18) is able to be used to provide a time line reveal (26) of a special component (28) of the corresponding artwork (18); the special component (28) of each artwork (18) comprising a hidden or inconspicuous component of the artwork (18).

Abstract: A method includes calculating, for each unique pair of search results of a plurality of search results, a first similarity value; automatically determining that the determined first similarity value for one or more of the unique pairs exceeds a similarity value threshold; iterating through similarity value calculations, until a similarity value is recalculated for each of the one or more unique pairs for which the first similarity value exceeded the similarity value threshold; and displaying the plurality of search results, each search result including display of data corresponding to default fields, and data corresponding to any looked up field that was necessary to cause a recalculated similarity value to fall below a threshold similarity value for any unique pair that search result belongs to.

Abstract: Method of retrieving event information is presented. Memento objects can be recognized by an archive engine. Based on the recognition, the archive engine obtains information related to the memento object, possibly one or more recognizable features, and uses the information to search for events associated with a timeline that have corresponding tags. The archive engine can then return the event information as a result set to a user.

Abstract: In an aspect, provided are methods, systems, and apparatuses comprising receiving a query specifying one or more materials of a floor/ceiling assembly and/or a classification or result, determining one or more media files responsive to the query, and providing the one or more media files for playback.

Abstract: A method for managing files is provided. The method includes steps of: a file managing device (a) detecting a system call corresponding to a file access request from a program executed by the device; and (b) performing, by referring to the detected system call and parameters thereof, at least one of (i) execution of a procedure corresponding to the system call and (ii) supporting execution of the procedure corresponding to the system call, based on at least one file management policy; wherein the policy includes a local file naming policy to determine at least one of a file name and a file path among the parameters, by referring to an attribute thereof, which has at least part of a creation date and time, a modification date and time, a type, a name, an owner, a creator, an access privilege, origin information, version, situational information, a keyword and a subtitle.

Abstract: A new snapshot of a storage volume is created by instructing computing nodes to suppress write requests. Once pending write requests from the computing nodes are completed, storage nodes create a new snapshot for the storage volume by allocating a new segment to the new snapshot and finalizes and performs garbage collection with respect to segments allocated to the previous snapshot. Subsequent write requests to the storage volume are then performed on the segments allocated to the new snapshot. A segment maps segments to a particular snapshot and metadata stored in the segment indicates storage volume addresses of data written to the segment. The snapshots may be represented by a storage manager in a hierarchy that identifies an ordering of snapshots and branches to clone snapshots.

Abstract: A system and method for a secure and scalable data collection and ingestion data pipeline is discussed. The data pipeline provides secure ingestion of data into internet-of-things (IoT) platform, while providing high throughput, replication, and fault-tolerance, which makes it suitable for large scale systems where data can be received from millions or billions of devices, sensors, or clients. In addition, the data pipeline provides a platform for real time event generation and data analysis. Further the data pipeline reduces operational costs and platform-as-a-service (PAAS) vendor dependencies.

Abstract: [Solving Means] An information processing apparatus (10) includes: a compressing-and-writing unit (103) that compresses a file-to-be-written, and writes the compressed-file in a memory area; and a total-file-size calculating unit (102) that calculates a total-file-size, the total-file-size being a total value of file-sizes of one or more already-written compressed-files, and updates the total-file-size with a sum of a compressed-file-size and the total-file-size, the compressed-file-size being a file-size of the written compressed-file.

Abstract: In one embodiment, a method includes receiving a query related to a first data extent. The method also includes determining whether the first data extent is eligible for deletion based on a first sliding window time period equal to a predetermined retention period added to a predetermined deletion cushion in response to the query requesting a deletion operation for the first data extent. The method also includes determining whether the first data extent is eligible for linkage based on a second sliding window time period equal to the retention period less a predetermined linkage cushion in response to the query requesting a linkage operation for the first data extent. The linkage cushion includes less time than the deletion cushion.

Abstract: Device-specific chunked hash size tuning to maximize synchronization throughput is described. A synchronization client application or similar program may employ hashing to detect changes to content of remotely stored files and synchronize those (as opposed to synchronizing all files, for example). Instead of using static hash chunk sizes for all client applications of a cloud storage service, the synchronization client application may determine the size of hash buffer by baselining throughput of hashing on each synchronization device and finding the number of bytes hashed in a given amount of time. Thus, hash chunk size may be optimized on a machine by machine basis.

Abstract: Some examples include optimizing system performance by generating a version vector that includes a plurality of attributes associated with a computing device. For instance, the plurality of attributes associated with the computing device may include a device type of the computing device. The plurality of attributes from the version vector may be analyzed to determine a usage pattern of a user of the computing device. In addition, a configuration of the computing device may be adjusted based on the usage pattern. In some cases, adjusting of the configuration of the computing device may include adjusting, based on the usage pattern, one or more of a power consumption of the computing device or a CPU running time of the computing device.

Abstract: Metadata of a root node from a serialized representation of a file system metadata tree data structure is obtained. A representation of the root node that references a stub intermediate node that is a placeholder for an intermediate node stored in the serialized representation is created. A request to access data of a leaf node in a tree path including the intermediate node is received. In response to the request, metadata of the intermediate node is obtained from serialized metadata representation.

Abstract: Method and apparatus are disclosed for a system and method for managing and retrieving disparate geographically coded data in a database. An example system for processing a search query for geocoded data includes a database with the geocoded data associated with first and second geographic subdivisions and a computing device. When new geocoded data associated with the first geographic subdivision is not associated with the second geographic subdivision, the computing device generates values associated with the second geographic subdivision for the new geocoded data based on geographic overlap of the first and second geographic subdivisions and inserts the values into the entity-attribute-value database. In response to receiving a query from one of the end-user devices for the new geocoded data associated with the second geographic subdivisions, the computing device provides the values in a query response.

Abstract: A method is performed at a computing system having one or more processors and storage media storing instructions for execution by the one or more processors. The method includes obtaining a digital version of a state filing pertaining to a deal involving transacted acreage. The method further includes obtaining metes and bounds or other like description of the transacted acreage from the digital version and using the metes and bounds or the other like description to generate a geographic information system shapefile specifying non-topological geometry of the transacted acreage; and using the shapefile to cause the geographic information system to display a map that visually indicates at least boundaries of the transacted acreage as one or more polygons overlaid on the map display.

Abstract: A user device monitors geo-locations inside and outside of a geographic radius boundary. The user device records geo-locations and information outside of the geographic radius boundary and inside after an elapsed time period. Information and geo-locations from the user device may be shared with others. An application server obtains geo-tagged information from the user device and determines whether geo-tagged information of other user devices share similar characteristics. The server generates a list of geo-locations the user of the user device may want to visit based on related attributes of other user devices.

Abstract: A data capturing system for use with aerial spherical imagery is provided. The system allows for capturing and tracking of data with respect to those accessing and viewing particular aerial spherical imagery, such as the imagery on a GIS map. The data capturing system may include a server having a processor and a memory and a software application providing instruction to the server to display aerial spherical imagery, such as spherical imagery, to a user through a network connection, such as through the Internet. For example the system may provide the map as a website to the user that is displayed on a remote computing device accessible by the user in order to view the spherical imagery. Data related to the interaction of the user with the website is captured and tracked in order to use such data for other purposes.

Abstract: Methods, systems, and media for performing personalized actions on mobile devices associated with a media presentation device are provided.

Abstract: A method for automatically managing a plurality of slides associated with a slide-deck is provided. The method may include adding the plurality of slides to a computing system. The method may also include analyzing at least one slide within the plurality of slides. The method may further include generating a list including at least one key word or at least one tag based on the analyzing. The method may include matching the at least one key word or the at least one tag against at least one key word or at least one tag saved on a presentation server. The method may also include fetching at least one slide or at least one slide-deck from the presentation server based on the matching. The method may further include displaying the at least one fetched slide or the at least one fetched slide-deck on a user interface.

Abstract: A computer-implemented method for connecting to digital groups using machine-readable code may include (1) using an image sensor on a user's mobile device to digitally scan a machine-readable code associated with a digital social group organized via a social-networking platform and (2) using a system processor of the user's mobile device to (i) decode a data item, encoded in the machine-readable code, that includes a hash string to be sent to a server managed by the social-networking platform, (ii) send, to the server, the hash string encoded in the machine-readable code, and (iii) present, via a display element of the user's mobile device, a group page of the digital social group sent by the server in response to the server receiving the hash string. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: A method, an apparatus, and a computer program product conduct online visual searches through an augmented reality (AR) device having an optical see-through head mounted display (HMD). An apparatus identifies a portion of an object in a field of view of the HMD based on user interaction with the HMD. The portion includes searchable content, such as a barcode. The user interaction may be an eye gaze or a gesture. A user interaction point in relation to the HMD screen is tracked to locate a region of the object that includes the portion and the portion is detected within the region. The apparatus captures an image of the portion. The identified portion of the object does not encompass the entirety of the object. Accordingly, the size of the image is less than the size of the object in the field of view. The apparatus transmits the image to a visual search engine.

Abstract: In accordance with an embodiment, described herein is a system and method for connection concentration in a database environment. A transparency engine provided between client applications and a database can include a connection pool (e.g., UCP connection pool). The transparency engine can operate as a proxy engine for the database and as a session abstraction layer for the client applications, to enable the client applications to utilize features provided by the connection pool without code changes. The transparency engine can receive application connections from the client applications, and concentrate the application connections on a smaller number of database connections maintained in the connection pool.

Abstract: The present invention relates to a method for constructing a database schema model by a user by means of a computer, comprising the steps of: providing a set of collections and/or optionally one or more relationships linking at least two of said set of collections; editing one or more of said set of collections, each of which associated with a schema definition displayed by a single table on an entity relationship diagram on a graphical interface on said computer and comprising at least one object and/or one field, said schema definition editable via a tree diagram on said graphical user interface on said computer; automatically generating by means of said computer said database schema model for a database system or a REST API; characterized in that, said set of collection comprises at least one collection comprising a nested object editable via said tree diagram with two levels or more.

Abstract: A data processing system generates a mapping between entries in an index to determine an object represented by digital content of a network address. The system includes a network interface system that receives script data and a content title of digital content; a data retrieval interface that retrieves executable logic; a parsing engine that executes the executable logic to extract an identifier of an object; a search engine that searches an index to identify a first entry with indexed data representing a descriptor of the object for which the identifier is extracted; and a mapping engine that generates, in the index, a second entry with data representing the content title of the digital content and with data representing the identifier of the object that is referenced by the digital content accessible at the network address, and a mapping between the first entry and the second entry.

Abstract: This disclosure provides a computer-implemented method for data storage in a non-relational database. The method comprises receiving a data item to be inserted into a table in the non-relational database. The method further comprises determining a dynamic data section and a static data section of the received data item. The method further comprises in response to the static data section not existing in the static data storage area, storing the static data section in the static data storage area. The method further comprises storing the dynamic data section in the dynamic data storage area.

Abstract: A data migration system and method operate within a database platform system, which includes first and second databases, to provide data migration between databases. The data migration includes automatically generating a globally unique identifier for each record of the first database, such as upon creation of each record. Records in the second database are updated or inserted according to whether or not records in the second database have globally unique identifiers that correspond to globally unique identifiers of records in the first database.

Abstract: Systems and Methods for dispersed data structures (DDS) in a distributed storage network are disclosed. A dispersed storage processing unit handling a request to insert a key value pair into a DDS could lookup what the most up to date DDS is, which could be held by a single source with a pointer to the current DDS root. The processing unit could then descend the DDS until it finds the leaf node that owns the requester's key and make a copy of the leaf with the key inserted. The processing unit could then make a copy of the parent of the node, replacing the pointer to the copied node with a pointer to the new copy, repeat this step until the root is reached, and make a copy of the root in a similar fashion but also including a pointer to the original DDS root.

Abstract: Described herein is a computer implemented method. The method comprises receiving a content item record in respect of a content item generated at a collaboration system and processing the received content item record to determine if the content item record includes any designated content. In response to determining that the received content item record includes designated content the method further comprises generating a designated content record in respect of the identified designated content and saving the designated content record to a data store.

Abstract: A method for aggregating data in database tables. A computer receives a request to create an aggregation object comprising a set of related tables and aggregation rules. The computer system creates an aggregation object comprising multiple tables with related key and data columns and managed as a single entity with a single definition. Upon receiving data in the form of a new, inserted, or updated row, the computer system automatically aggregates the data to all objects in the aggregation object hierarchy by creating a summarized row for the current table using the inserted, merged or updated row and defined aggregation rules for each object.

Abstract: A method is described. The method includes receiving a request to search meta data for objects stored within a large scale object storage system. The request identifies a looked for value of the meta data. The objects belong to a same bucket used to identify a subset of objects stored by the large scale object storage system. The method includes forwarding the request to a meta data database system that contains pages listing all objects within the bucket and the associated meta data for each of the objects within the bucket. The method includes forwarding the pages from the meta data database system over a network to a high performance computing resource that concurrently processes multiple ones of the pages to identify matching ones of the objects whose meta data matches the looked for value.

Abstract: A method, system and computer program product for storing a sub-table by deciding one of a plurality of table storage areas, the sub-tables resulting from partitioning of a table in a database. To provide efficient table partitioning, a database is described for distributively locating a plurality of sub-tables resulting from partitioning of a table in a database. This includes an acquiring section that monitors access occurrences to each of the sub-tables to acquire a history of access occurrences. Also a deciding section decides a table storage area in which a sub-table is to be located, based on the history of access occurrences to each of the sub-tables.

Abstract: An apparatus for joining records from a plurality of database tables, the apparatus including: a processor; and a memory storing computer readable instructions that, when executed by the processor, control the processor to: select, as a current join attribute, a first join attribute from an ordered sequence of join attributes; and join records according to each join attribute in the ordered sequence by: identifying tables in the plurality of tables that include the current join attribute; iterating, based on a tree index structure, through each of the identified tables in current join attribute order; for each matched value located during the iterating, appending the matched value to a join scope; and in response to the ordered sequence containing a next join attribute, for each matched value in the join scope, setting the next join attribute as the current join attribute and recursively invoking the identifying, iterating, and appending.

Abstract: A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.

Abstract: A method and apparatus for managing hierarchical relationships in a relational database system is provided. An “orderkey” data type, which is native within a relational database system, is disclosed. The orderkey type is designed to contain values that represent the position of an entity relative to the positions of other entities within a hierarchy. Such values represent hierarchical relationships between those entities. Values that are of the orderkey type have properties that allow hierarchy-oriented functions to be performed in an especially efficient manner. Database functions, which operate on and/or produce values that are of the orderkey type, are also disclosed. Such functions can be placed within SQL statements that a database server executes, for example. In response to executing SQL statements that contain such functions, the database server performs hierarchy-oriented operations in a highly efficient manner.

Abstract: A computer-implemented method, computer program product, and computing system is provided for providing contextual information associated with a post in an activity stream. In an implementation, a method may include determining a need for contextual information relative to a post within an activity stream. The method may also include searching one or more contextual information sources relative to at least a portion of the post within the activity stream. The method may further include associating contextual information with the post within the activity stream.

Abstract: Systems and methods are disclosed herein for identifying a category of a search term and providing search results subject to the identified category. These systems and methods may be performed by a media guidance application. The media guidance application may receive a search term that may correspond to different categories of items, and the media guidance application may identify a category that the search term is most likely related to using a hierarchical structure. The media guidance application may limit the search to the identified category of items.

Abstract: A method of displaying data visualizations includes retrieving a dataset from a multidimensional database, where the dataset includes a plurality of fields, including first and second fields, and the first field is a data hierarchy that includes multiple subfields. The method further includes displaying a GUI with a first region displaying the plurality of fields (with the first field in a collapsed state), a second region with a plurality of shelves, and a third region. In response to receiving a user action to display the first field in an expanded state, the method displays the first field and the multiple subfields in a hierarchical structure. The method receives additional user actions to: (i) associate a first subfield of the plurality with a first shelf, and (ii) associate the second field with a second shelf, and then displays, in accordance with the user actions, a data visualization in the third region.

Abstract: A method, a system, and a computer program product for querying data are disclosed. A query to a database is received. The data in the database is arranged using a master terminology data model. The master terminology data model contains a mapping of one or more terminology structures. Data responsive to the query is generated.

Abstract: Method, computer program and apparatus are disclosed in which search phrases are arranged multi-dimensionally in a relevance map pointing which the user can define weights of the search phrases. Documents are correspondingly ranked based on the weights and a result list is formed and presented accordingly.

Abstract: A method for communicating data includes interfacing content transformation agents customized for different source data repositories with the different source data repositories. The method also includes the content transformation agents constructing first first-stage data feed in a neutral format in accordance with the customization by dynamically selecting and transforming, within the source data repositories, selected source data in the first-stage data feed in the neutral format. The method also includes the content transformation agents sending the first first-stage data feeds to an aggregation agent. The aggregation agent generates for a user and based on specified criteria, a second-stage data feed as a composite of selected source data from the first-stage data feeds.

Abstract: A method and system are provided for processing computer log messages for log visualization and log retrieval. The method includes collecting log messages from one or more computer system components, performing a log tokenization process on the log messages to generate tokens, transforming the tokens into log vectors associated with a metric space, performing dimensionality reduction on the metric space to project the metric space into a lower dimensional sub-space, storing similarity distances between respective pairs of the log vectors, and in response to receiving a query associated with a query log message for reducing operational inefficiencies of the one or more computer system components, employing the similarity distances to retrieve one or more similar log messages corresponding to the query log message for reducing the operational inefficiencies of the one or more computer system components.

Abstract: Some examples of the disclosure include adjusting the frequency of network access to synchronize data on a mobile device based on the usage of the mobile device to optimize data synchronization and battery usage. One example includes increasing the time between data synchronization operations when the mobile device is not being frequently accessed.

Abstract: An electronic device is disclosed. The electronic device stores metadata associated with a content item, the metadata including first metadata from a first source and second metadata from a second source. Both the first and second metadata are associated with a particular attribute of the content item. Based on the first and second metadata, preferred metadata is generated for a particular attribute of the content item.

Abstract: Systems and methods for search result replication in a search head cluster of a data aggregation and analysis system. An example method may comprise maintaining a replication count in a data store associated with at least one of the plurality of search heads, the replication count corresponding to how many of the replicas of the search result are stored in the search head cluster, determining that the replication count is greater than a target replication count, based on determining that the replication count is greater than the target replication count, initiating a deletion of at least one replica of the replicas of the search result from a target search head of the plurality of search heads storing the replicas, receiving an indication that the deletion is complete, and based on receiving the indication that the deletion is complete, decreasing the replication count corresponding to the search result.

Abstract: Techniques are described for network data analysis and graph clustering analysis to determine clusters of users publishing on networks. Network data, such as items published on social networks or other online networks, is analyzed to determine categories for the published items, and a strength of a correlation between the category and the user who published the item. The category and/or correlation strength are determined based on an analysis (e.g., natural language analysis) of text data included in the published item. Based the various correlations between users and categories, correlations may be determined between pairs of users. A graph may be generated that graphically depicts the various category correlations and/or user correlations as determined based on a set of network data. Clustering is performed to determine cluster(s) of users who are (e.g., strongly) correlated and similar to one another with regard to their category correlations.

Abstract: Techniques are described for network data analysis and graph clustering analysis to determine clusters of users publishing on networks. Network data, such as items published on social networks or other online networks, is analyzed to determine categories for the published items, and a strength of a correlation between the category and the user who published the item. The category and/or correlation strength are determined based on an analysis of image data included in the published item. Based the various correlations between users and categories, correlations may be determined between pairs of users. A graph may be generated that graphically depicts the various category correlations and/or user correlations as determined based on a set of network data. Clustering is performed to determine cluster(s) of users who are (e.g., strongly) correlated and similar to one another with regard to their category correlations.

Abstract: A method and a device for personalized automatic tagging are provided. The method includes obtaining a plurality of context-based tags based on interactions between a user of the electronic device and a plurality of data items on the electronic device. The obtained plurality of context-based tags are associated with the plurality of data items. In response to detecting at least one context-based search input, at least one context-based tag corresponding to the at least one context-based search input is determined. At least one data item associated with the at least one context-based tag identified. A display of the electronic device is caused to display the at least one data item to the user.

Abstract: A system and process for trading securities based on sentiment, including a computer, at least one keyword related to an investor's objective, a database of tradeable securities and an index generated by tagging individual securities with at least one of the keywords, stream of news items received by the computer and a database of tagged news items created by software parsing individual news items when matching one or more of the keywords of the indexed securities, having a benchmark portfolio associated with at least one of the keywords and analyzing the database of tagged news items to detect changes in sentiment over time, having a software on identify trades minimizing the difference between investor holdings, based on at least one of the keywords, and the benchmark portfolio on a periodic basis and initiating trades and updating said holding database after initiation.

Abstract: According to an aspect, automatically linking text to concepts in a knowledge base using differential analysis includes receiving a text string and selecting, based on contents of the text string, a plurality of data sources that correspond to concepts in the knowledge base. In a further aspect, automatically linking the text to the concepts includes calculating, for each of the selected data sources, a probability that the text string is output by a language model built using the selected data source, calculating a probability that the text string is output by a generic language model, calculating link confidence scores for each concept based on a differential analysis of the probabilities, and creating a link from the text string to one of the concepts in the knowledge base. The creating is based on a link confidence score of the concept being more than a threshold value away from a prescribed threshold.

Abstract: According to an aspect, automatically linking text to concepts in a knowledge base using differential analysis includes receiving a text string and selecting, based on contents of the text string, a plurality of data sources that correspond to concepts in the knowledge base. In a further aspect, automatically linking the text to the concepts includes calculating, for each of the selected data sources, a probability that the text string is output by a language model built using the selected data source, calculating a probability that the text string is output by a generic language model, calculating link confidence scores for each concept based on a differential analysis of the probabilities, and creating a link from the text string to one of the concepts in the knowledge base. The creating is based on a link confidence score of the concept being more than a threshold value away from a prescribed threshold.

Abstract: The present invention provides a method and a device for processing question clustering in an automatic question and answering system. The method comprises: receiving a clustering request input by a writer; acquiring a question set to be clustered from a database of unanswered questions based on the clustering request; performing feature extraction on the question set to be clustered with a text feature extraction algorithm to output a question feature set; determining whether the question feature set meets a preset splitting condition; performing segmenting clustering on the question feature set with a segmenting clustering algorithm if the preset splitting condition is met to output at least two question feature subsets; updating the question feature subsets to a question feature set, determining whether the question feature set meets the preset splitting condition; and outputting the question feature set as a clustering class cluster if the preset splitting condition is not met.