Abstract: A similar design case example search apparatus includes a design case example storage unit that manages such information as specification values of design case examples of past products and costs and period for manufacturing the products; a recommended weight storage unit that stores recommended weight for every requirement specification categories; a requirement specification receiving unit that receives requirement specification values; a requirement specification satisfaction degree calculation unit that calculates a requirement specification satisfaction degree which is the degree that the specification values of each design case example stored in the design case example storage unit satisfy the requirement specification values; a recommended degree calculation unit that calculates a recommended value of a searched design case example based on the recommended weight stored in the recommended weight storage unit; and a search result display unit that displays searched products with similarity and recommend

Abstract: A digital magazine server allows its users to create digital magazines by including content items in sections of one or more digital magazines. For various pairs of digital magazines, the digital magazine server determines a score based on a number of content items added to a digital magazine that were previously added to an additional digital magazine in a pair. The score indicates a frequency that the additional digital magazine added content items before the digital magazine. Digital magazines may be ranked for a user based on the scores, with the ranking used to recommend digital magazines or other users to the user. Further, the scores and connections between digital magazines may be used to create an influence score for various digital magazines.

Abstract: Methods and arrangements for identifying related data in different data sets to assist in searching the data sets. A first data asset and a second data asset are accessed. Common entities are identified between the first and second data assets. A score is determined for the relationship between the first and second data assets, based on the identified common entities. One or more relationship contexts are determined for the relationship between the first and second data assets, and the relationship score and one or more relationship contexts are used to join at least a portion of each of the first and second data assets as a basis for subsequent searching. Other variants and embodiments are broadly contemplated herein.

Abstract: A database may provide a visualization of restoration operation granularity. Information may be obtained describing possible restoration points within a given period of time for a database. The information may include a respective state of the database associated with a point in time and a respective restoration operation type for the possible restoration points. A graphical representation may be generated illustrating the possible restoration points ordered within the given time period according to the points in time associated with the respective states of the database. The graphical representation may be provided via network-based interface to a client of the database. The graphical representation of the possible restoration points may be updated in response to changes to the given time period or database volume events that modify the possible restoration points.

Abstract: Methods and systems for a topology service providing an interface for specifying a topology and answering queries regarding the topology. Further, the topology service may create, from a specified topology, a directed acyclic graph and corresponding closure table. The topology service may also provide an interface for receiving metadata regarding the topology. In this way, the topology service, based at least in part on connections between nodes in the entries of the closure table and based at least in part on the metadata regarding the topology, may answer queries in regard to the specified topology.

Abstract: A mechanism is provided for retrieving candidate answers from a corpus of documents. The mechanism receives an input question for which an answer is sought. The mechanism extracts features of the input question based on a natural language processing. The mechanism executes a first search of the corpus of documents based on a first subset of the extracted features of the input question and an initial evaluation of a utility of the first subset of extracted features to generate a subset of documents. The mechanism executes a second search of a set of passages extracted from the subset of documents based on a second subset of the extracted features of the input question and a reevaluation of the utility of the second subset of extracted features thereby forming a subset of passages. The mechanism generates query results from the subset of passages matching from which candidate answers are identified.

Abstract: In accordance with disclosed embodiments, there are provided methods, systems, and apparatuses for fixing logical or physical corruption in databases using LSM trees including, for example, means for storing records in a LSM database at the host organization; processing transactions to the LSM database by writing the transactions into immutable extents for subsequent merge into the LSM database; recording a history of the transactions in a log; identifying corruption in at least one of the records of the LSM database represented within the immutable extents prior to use of the immutable extents in the LSM database; and correcting the identified corruption to the at least one of the records of the LSM database based at least in part on the recorded history of the transactions in the log during live operation of the LSM database. Other related embodiments are disclosed.

Abstract: Managing confidence data in a question-answering environment is disclosed. Managing confidence data can include sorting, based on a set of answer categories for a subject matter, a first set of a plurality of answers into a first answer category. The first set can correspond to at least one of a third set of a plurality of confidence scores and the second set can correspond to at least one of a fourth set of the plurality of confidence scores. Managing confidence data can include classifying confidence scores of the third set into one of a plurality of confidence buckets using a first threshold and determining a fifth set of a plurality of thresholds using the plurality of confidence scores. Managing confidence data can include classifying unclassified confidence scores of the third set into one of the plurality of confidence buckets using the fifth set of the plurality of thresholds.

Abstract: In accordance with disclosed embodiments, there are provided methods, systems, and apparatuses for fixing logical or physical corruption in databases using LSM trees including, for example, means for storing records in a LSM database at the host organization; processing transactions to the LSM database by writing the transactions into immutable extents for subsequent merge into the LSM database; recording a history of the transactions in a log; identifying corruption in at least one of the records of the LSM database represented within the immutable extents prior to use of the immutable extents in the LSM database; and correcting the identified corruption to the at least one of the records of the LSM database based at least in part on the recorded history of the transactions in the log during live operation of the LSM database. Other related embodiments are disclosed.

Abstract: A device may communicate with a first server to obtain first information regarding a plurality of groups of entities. The device may process the first information to generate a data model relating to attributes of the plurality of groups of entities. The device may communicate with a second server to obtain second information regarding a particular group of entities. The device may process the second information using the data model to identify a set of recommendations relating to the particular group of entities. The device may select a particular recommendation, of the set of recommendations, based on a corresponding score of the set of scores. The device may generate a user interface including the particular recommendation based on selecting the particular recommendation. The device may communicate with a plurality of client devices to cause the particular recommendation to be provided for display.

Abstract: Disclosed here are methods, devices, paradigms and structures for creating, displaying and facilitating the selection of art, design and décor. A digital art device (“device”) facilitates creating and displaying a digital art in accordance with the relationship to a viewer. The device can include sensors such as cameras, gyroscopes, audio processor, photometer, eye-tracking sensors, etc., to identify various types of human interaction, and the environment around the device. The device displays, adapts, or transforms the digital art according to the observed human interaction and/or surroundings of the device. Tools will allow developers to create new applications for displaying and creating digital art to be viewed on the device. Developers can access underlying décor discovery and visualization tools to process color, style and other décor-related attributes.

Abstract: A system and method are disclosed for scoring an interaction over one or more channels by an end user and an entity by monitoring the communications over the channels and assigning penalties and scores based on topics associated with the communications.

Abstract: A method sorts data in data visualizations. The method is performed at a computing device having one or more processors and memory. The method retrieves a set of tuples from a database according to user selection. Each tuple includes a same set of fields. The method identifies a relation between tuples. The relation is a non-empty set of ordered pairs of tuples from the set of tuples. The method receives user selection of the relation to specify a dimensional position of visual marks corresponding to the tuples. The dimensional position is either the x-position of the y-position. The method generates and displays a data visualization with each tuple represented by a visible mark. The dimensional position of each displayed visual mark is based on a network traversal of the tuples using the relation.

Abstract: Systems and methods to identify and present filters are described. The system receives a query from a client machine, the query including at least one keyword. The system further identifies a filter context based on the query, the filter context including a first set of filters including attribute-value pairs, the attribute-value pairs including a first attribute-value pair including a first filter and a second attribute-value pair including a second filter. The system further identifies a second set of filters responsive to receiving the query, the identifying the second set of filters is based on the filter context and probabilities describing occurrences of attribute-value pairs in listings that respectively describe items that were previously transacted on a network-based marketplace. The system further generates a user interface including search results that are identified based on the filter context and communicates the user interface to the client machine.

Abstract: A user interface for searching records in a database is provided. Each record may contain information regarding one or more categories. The user interface may receive search criteria of one or more categories and provide search results comprising exact and/or inexact matching records. An inexact matching record may have a relevance value representing the relevance of the record to the search query, and inexact matching records may be displayed in an ordering based on the relevance values. The user interface may provide slider tools for receiving changes in a weight value or search criterion of an associated category. A new ordering of the inexact matching records may be displayed in real-time based on newly received weight values or search criterion. The user interface may also provide a mapping tool, a search-result selection function, and/or one or more drill down tools. The user interface may provide any tool or function alone or in any combination.

Abstract: In order to manage stale data on a network of computer systems, a file harvester agent may be configured with a list of stale data files to be deleted. The file harvester agent may be deployed to the computer systems of a network. When executed in a computer system, the file harvester agent searches the file system of the computer system to locate any files or data indicated in the file list. Any located data files are deleted. Once the agent has finished processing the file list on a computer system, the agent can copy or replicate itself to other computer systems of the network in accordance with a pre-configured itinerary.

Abstract: A method and system for sharing and synchronizing content between a content repository and a file sharing service. A connector engine is configured between the content repository and the file sharing service. A new snapshot of the content repository is divided into smaller snapshots, and each smaller snapshot is paired and compared with the prior snapshot to identify new and changed objects. Likewise, the prior snapshot is divided into smaller snapshots, and each smaller snapshot is paired and compared with the new snapshot to identify deleted objects.

Abstract: A plurality of streams of tuples is received by processing elements operating on computer processors, the processing element having one or more stream operators. A first stream of tuples is processed at a receiving stream operator. A streaming condition is then identified. The streaming condition is determined to be satisfied and an alternate stream of tuples is processed at the receiving stream operator.

Abstract: Methods and systems of dynamic content analysis for categorizing media contents are provided. Data regarding the media contents that a user is watching on one or more devices is obtained, and the environment in which the user is watching the media contents may be captured. Metadata categorizing the events and the media contents can be generated, and the metadata may be further associated with a corresponding event.

Abstract: A metadata updating method based on columnar storage in a distributed file system includes acquiring to-be-updated metadata in a data table, splitting data records of the data table into multiple row groups on a row basis, converting the data table into global file metadata and multiple row group files, where the row group file includes an actual data block, a data index block, a local metadata block, a metadata index block, and a file footer, determining whether the to-be-updated metadata belongs to the global file metadata, updating local metadata when the to-be-updated metadata does not belong to the global file metadata, and adding an updated local metadata block, an updated metadata index block, and an updated file footer to the multiple row group files according to updated local metadata. Dynamic updating of metadata saves time of executing an updating operation of this type and needed computing resources.