Abstract: A network device may receive a request for content; determine a bandwidth of a communication link between a client device and the network device; select a download speed based on the determined bandwidth; and choose, for transmission from the network device to the client device, a content segment among a plurality of content segments in a directory associated with the download speed based on an amount of the content already downloaded. The plurality of content segments may include variable bit rate content segments. The network device may stream the chosen content segment to the client device.

Abstract: A quick response (QR) proxy and protocol gateway for interfacing with a carrier network, a QR-equipped device, and a contact center and contact center database is disclosed. A data link is connected to a carrier network to receive QR codes and other data. Additional data links are connected to a contact center database and a QR-equipped device to obtain information used in determining routing and tagging instructions. A user interface is connected to the gateway to accept configurable conditions for determining routing instructions. There is a text conversion function and speech conversion function for each target enterprise contact center. Synchronization between stored user preferences to automated or semi-automated customer service routes is provided by a consumer preference template system.

Abstract: A process for creating a media sequence, for example video or audio, and an associated device includes the stages of: obtaining a selection of media files; regrouping the chosen media files into a plurality of groups according to at least one coherence criterion; selecting, for each group of media files assembled in this way, a media motif among a plurality of predefined media motifs, the chosen media motif being able to define a media rendering for the set of media files of the group; and assembling the media motifs selected in this way and their associated media files in such a way as to form at least one definition of the media sequence. The process can relate to automated video editing as implemented on Web servers.

Abstract: A method and system for recommending multimedia content includes collecting consumption information for a plurality of consumers. The consumption information may be used to generate collections of recommended multimedia content, including obtainable multimedia assets. The collections may be offered to a consumer for purchase. The consumer may be provided access to the multimedia assets. A unified storefront application, providing access to multimedia content via an Internet-protocol television portal, a web portal, and a mobile portal, may be used to offer and provide access to the multimedia assets.

Abstract: Methods, systems, and computer program products for automatically associating data with a resource as metadata based on a characteristic of the resource are disclosed. According to one method, a metadata association rule is defined for a metadata associator. The metadata association rule specifies a data value to be associated with a resource as metadata based on a characteristic of the resource. A user interface is provided for associating at least one resource with a metadata associator. In response to a resource being associated with the metadata associator via a user interface, the data value is associated with the resource as metadata based on the metadata association rule. The specified data value may be defined prior to the resource being associated with the metadata and independently of both the resource and a file system with which the resource is associated.

Abstract: Exemplary methods, apparatus, and systems are disclosed for capturing, organizing, sharing, and/or displaying media. For example, using embodiments of the disclosed technology, a unified playback and browsing experience for a collection of media can be created automatically. For instance, heuristics and metadata can be used to assemble and add narratives to the media data. Furthermore, this representation of media can recompose itself dynamically as more media is added to the collection. While a collection may use a single user's content, sometimes media that is desirable to include in the collection is captured by friends and/or others at the same event. In certain embodiments, media content related to the event can be automatically collected and shared among selected groups. Further, in some embodiments, new media can be automatically incorporated into a media collection associated with the event, and the playback experience dynamically updated.

Abstract: A content-presenting system present digital content for a local user, and facilitates sharing a presentation state for digital content with remote devices. During operation, the system can detect a presentation-controlling event, which alters the presentation of the digital content at the content-presenting device. In response to detecting the presentation-controlling event, the system generates content-control information for the digital content. This content-control information can include a location-independent structured name associated with the digital content, and includes a presentation state for the digital content.

Abstract: Support of end-user to view and operate computing resources through logically organized and graphically represented multi-layered item list (“hierarchical list”) has been fully realized on native window based computer user work environment with modern operating system such as Windows Explore of Microsoft. The present invention has implemented such a hierarchical list to represent structured resources, such as for a central controlled distributed scalable virtual machine (CCDSVM), and to be displayable and operable via a browser on an end-user device for user to access and manage the actual structured resources. The implementation of the hierarchical list is accomplished by creating the hierarchical list in memory to mirror the actual structure resource, where the mirrored hierarchical list is sent to the end-user device, where the end-user device executes the browser to display the hierarchical list to allow the user to access the actual structured resources via the displayed hierarchical list.

Abstract: A method may include identifying a media file to be retrieved from storage, transmitting a request for information identifying a location of the media file and identifying the location of the media file. The method may also include forwarding the identified location, transmitting a request for the media file and receiving the request for the media file. The method may further include creating a copy of the media file, storing a first virtual location corresponding to a location of the copy and forwarding a message indicating that the identified media file is available for processing.

Abstract: A method, system, and computer program product to process data in a streaming application are disclosed. The method, system, and computer program product may include receiving a stream of tuples to be processed by a plurality of processing elements operating on a plurality of compute nodes. The method, system, and computer program product may determine whether a first processing element has additional processing capacity. In some embodiments, the method, system, and computer program product determine whether a second processing element, which receives its input from the first processing element, also has additional processing capacity. The method, system, and computer program product may employ compression at the first processing element if one of the first and the second processing element has additional processing capacity.

Abstract: A method, article of manufacture, and apparatus for transferring data from a source tier to a target tier. In some embodiments, this may include dividing an object stored in the source tier into a plurality of segments, determining if the target tier is missing at least one of the segments, writing the missing segments to the target tier, and deleting the object from the source tier. In some embodiments, the object's metadata is updated to indicate that the object is in the target tier.

Abstract: Assignment of files to a de-duplication domain. Address space of data files is divided into multiple containers. For each of the containers, a file metadata scan is performed to obtain file system metadata, which is aggregated and summarized in a content feature summary. A content feature summary prediction measurement is measured between containers from the generated content feature summary, and files from each container are assigned to a de-duplication domain based upon the content similarity predication measurement.

Abstract: A plurality of workers is configured for parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times, the calculated required sleep times being calculated as a best fit between a maximum allowable sleep time, a delta vector, and a limit per time vector, wherein the required sleep time is one of the plurality of calculated required sleep times.

Abstract: A server is implemented with a modified file open action, which, when a user performs the modified open, initially opens a file without locking the file. When a user indicates (either explicitly or implicitly) that the user is attempting to or intending to open the file, the file can then be locked for editing. In this way, the default action when a user requests a file is to open the file without denying other users access to the file. Then, when the user indicates that editing should occur, the lock for the file is obtained.

Abstract: A system, computer implemented method, and computer program product for analyzing an installation to determine a file system promotion path during an online patching cycle. The method commences by identifying an initial file system and a shadow file system, the shadow file system being at least some duration older than the initial run file system, then analyzing a history of events that occurred in or on the installation during the duration to determine a degree of confidence. Based on the degree of confidence, then selecting the initial file system to be used on the online patching cycle when the confidence value is equal or above a threshold, or selecting the shadow file system to be used in the online patching cycle when the confidence value is below a threshold. The history of events is recorded in forms of a patch list, a log file, or a list of configuration events.

Abstract: A technique for protecting host data using, for example, snaps, asynchronous replication, and/or synchronous replication, includes storing both block-based objects and file-based objects in a common form—as files. With both block-based objects and file-based objects represented as the same type of underlying objects, data protection of both block-based and file-based objects is accomplished using a single set of data protection technologies, which are configured to perform data protection operations on files.

Abstract: A mechanism is provided for generating enumerated information in which a plurality of files is enumerated except entirely-invalidated files on a sequential medium. Management information for managing locations where the plurality of files on the sequential medium are recorded is acquired from the sequential medium. The enumerated information in which the plurality of files are enumerated is generated in an order according to the locations where the plurality of files are recorded on the basis of the acquired management information.

Abstract: Virtual file system virtual nodes are grouped in subpools in response to identified resource components and managed as a function of their subpool groupings. Virtual nodes are decomposed into individual components linked to each other within each node. The components that have repetitive accesses by applications within the virtual file system and their respective frequencies of repetitive access are identified. Modules of linked occurrences of the repetitive components within each of the plurality of virtual nodes are formed, and subsets of the virtual nodes sharing common modules are grouped into subpools. Accordingly, in response to an application of the virtual file system requesting a service that is satisfied by a subpool common module, selection of a virtual node for reinitiating for reuse by the application is restricted to virtual nodes within the subpool associated with the common module.

Abstract: Revising a map area based on user feedback data is disclosed. In some embodiments, an initial map area corresponding to a prescribed location identifier is obtained from a third-party mapping service, and a revised map area corresponding to the location identifier is determined based on the initial map area and user feedback data associated with the location identifier.

Abstract: Systems and methods for creating a database of geofences and registering geofences, with each geofence in the database being associated with an IP address, preferably an IPV6 address. Each geofence is defined using at least one geographic designator, preferably real property boundaries. Entitlements can be associated with geofences relating to permissive and prohibitive activities within the geofences.

Abstract: Various embodiments may increase scalability of image representations stored in a database for use in image matching and retrieval. For example, a system providing image matching can obtain images of a number of inventory items, extract features from each image using a feature extraction algorithm, and transform the same into their feature descriptor representations. These feature descriptor representations can be subsequently stored and used to compare against query images submitted by users. Though the size of each feature descriptor representation isn't particularly large, the total number of these descriptors requires a substantial amount of storage space. Accordingly, feature descriptor representations are compressed to minimize storage and, in one example, machine learning can be used to compensate for information lost as a result of the compression.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for automatically extracting logos from images. Methods include generating a query list including a plurality of logo search queries, for each logo search query of the plurality of logo search queries: generating a plurality of image search results, each image search result including image data, and clustering the plurality of image search results into a plurality of clusters, each cluster including a plurality of images of the plurality of image search results, extracting, for each cluster of the plurality of clusters, a representative image to provide a plurality of representative images, and a name corresponding to the representative image to provide a plurality of names, and providing the plurality of representative images and the plurality of names to a logo index, the logo index being accessible to identify one or more logo images in a query image.

Abstract: Systems and Methods for multi-modal or multimedia image retrieval are provided. Automatic image annotation is achieved based on a probabilistic semantic model in which visual features and textual words are connected via a hidden layer comprising the semantic concepts to be discovered, to explicitly exploit the synergy between the two modalities. The association of visual features and textual words is determined in a Bayesian framework to provide confidence of the association. A hidden concept layer which connects the visual feature(s) and the words is discovered by fitting a generative model to the training image and annotation words. An Expectation-Maximization (EM) based iterative learning procedure determines the conditional probabilities of the visual features and the textual words given a hidden concept class. Based on the discovered hidden concept layer and the corresponding conditional probabilities, the image annotation and the text-to-image retrieval are performed using the Bayesian framework.

Abstract: A system and method, which may be an offline method, extracts relevant image features about images in a network-based publication system for enabling image similarity searching of such images. An image is uploaded and may be sent to a picture processing service, which generates digests. The digests are compressed data structures each representing a particular image feature such as edge, color, texture, or words. These digests are then stored in a search database, where the digests can be used to retrieve images by image similarity at scale. A similar process can be performed for an image query for searching the search database for images similar to the image.

Abstract: An information processing device includes a memory, a receiving unit, a decision unit, and a concealment unit. The memory stores a history of performing, on an image having an attribute, a process that conceals an area within the image. The receiving unit receives an image. The decision unit extracts from the memory a history of a process performed on an image having an attribute that matches an attribute of the received image, and on the basis of the extracted history of a process, decides a concealment area within the received image. The concealment unit conceals the concealment area decided by the decision unit.

Abstract: A system, method, and computer program product for displaying a plurality of images. A method of the present invention includes storing image-associated metadata for each image. The method further includes storing user-associated metadata for each user. The method further includes creating a graph comprising the plurality of images, based on the image-associated and user-associated metadata. The method further includes processing the plurality of images based on the graph to generate a subset of the plurality of images. The method further includes displaying the subset of the plurality of images.

Abstract: The system and method of visual role engineering uses a visual assessment tool to identify clusters of users and to define roles. A “cluster image” is generated that visually depicts the cluster tendencies of users and permissions. An operator of the visual assessment tool can visually identify clusters of users with the same permissions. The operator may select a cluster representing a subset of users, define a role for the subset of users, and assign permissions to the role. The process may be repeated in an iterative fashion until it is determined that no more roles are needed.

Abstract: A technique of structuring a navigation database is provided, wherein the navigation database includes at least route link data for a predetermined geographic area. A method implementation of the technique includes organizing route link data associated with the predetermined geographic area into at least one routing cluster; providing the at least one routing cluster with a cluster identifier; and storing the at least one routing cluster together with the cluster identifier in the navigation database.

Abstract: A method for updating a database schema may include maintaining a database, database schema and a first version of an application. The method may include generating application schema for the first version of the application, the application schema including a mapping of one or more classes of the application to a respective table in the database. The method may include executing the first version of the application and storing an application data object in the database in accordance with the application schema. While the first version of the application is executing, the method may include receiving a request to update the first version of the application to a different version, identifying application metadata for the different version of the application, comparing the application metadata for the different version of the application with the database schema for the database, and updating the database schema based on the comparison.

Abstract: Embodiments include a system for matching an element of a source schema to an element of a target schema. The system includes a processing unit and a communication unit. The processing unit may be configured to: identify a sample data item of the element of the target schema; match a part of the sample data item to a part of a sample instance of the source schema; and match the element of the source schema to which the part of the sample instance of the source schema belongs to the element of the target schema. The communication unit may be configured to: provide the sample data item through an interface and receive the sample instance of the source schema.

Abstract: System and method to compact a NoSQL database, the method including: receiving, by a receiver coupled to a processor, an indication of a record to delete in the NoSQL database; for each file in the NoSQL database, perform the steps of: if said file does not contain the record to delete, placing said file in a first memory; if said file contains the record to delete: placing said file in a second memory; searching whether the record to delete from said file in the second memory matches a record in one or more files in the first memory; and if a searched files in the first memory contain the record to delete from said file in the second memory, compacting said file in the second memory with the files in the first memory that contain the record to delete.

Abstract: A method performed in a system that has a plurality of volumes stored to storage hardware, the method including generating, for each of the volumes, a respective space saving potential iteratively over time and scheduling space saving operations among the plurality of volumes by analyzing each of the volumes for space saving potential and assigning priority of resources based at least in part on space saving potential.

Abstract: Systems and methods for managing versions of product attribute information are described. A database management system that manages a database for storing attribute information of a product is described. The database management system in this implementation comprises a version control system and a querying system. The version control system is configured to enable a user to insert one or more versions of product information in the database. Each version has an effective date and is divided into a plurality of attribute groups, each attribute group containing a plurality of attributes. One or more attribute groups are modified with respect to a previous version. The version control system is further configured to record which attributes of a modified attribute group are changed. The querying system is configured to enable a user to search the database based on the effective dates of the versions.

Abstract: Provided are computer devices and methods for effectively generating and updating a sorted array for quick data access. The array allocates more space than required by the elements it stores. In other words, the array leaves empty spaces between elements such that insertion of a new element only requires the shifting of a small number, or even none, of the existing elements in the array.

Abstract: Systems and methods for use in presenting a plurality of data nodes that include one or more data sets and one or more data objects, wherein each data set includes zero or more data objects and zero or more other data sets. The method includes determining, by a computing device, a data node of interest from the plurality of data nodes, wherein the data node of interest is included in one or more data sets. The computing device depicts the data node of interest as a primary node and depicts at least one of the data sets that includes the data node of interest as a secondary node that is subordinate to the primary node. The computing device also depicts an edge between the primary node and the secondary node.

Abstract: A system includes generation of an encoding for each of a hierarchy of nodes, each of the nodes associated with one or more attributes, and the encoding for each node including a first pointer and a second pointer, and generation of an order tree comprising a hierarchy of entries, where each pointer of the encoding points to a respective one of the entries, wherein the encoding and the order tree indicate a position of each node in the hierarchy of nodes.

Abstract: The invention generally relates to enabling the management of survey data. One embodiment includes providing an upload description that describes characteristics of survey data to be uploaded, assigning a thread to process a group of files that store aspects of the survey data, dividing the file into data chunks, deriving from a given data chunk a corresponding data-integrity value and respectively associating the same with the given data chunk, communicating the data chunks to a remote storage device, utilizing the corresponding data-integrity values to ensure successful communication of the data chunk, and spatially storing the survey data such that it is retrievable upon a request that describes a geographic area of interest.

Abstract: In a computer-implemented method for normalizing media metadata, a directory containing media (e.g., music) files, which have metadata, is accessed. The metadata associated with the music files is accessed. The metadata for the music files is checked for an artist name in a “last name, first name” format, for a mixed up track title and artist name, and for artists that appear in multiple genres. Using approximate string matching, the metadata is checked to identify potential matches for known artists with other known artists in a database, and to identify approximate matches for a combination of the artist name and an album. In the event an operation identifies an error or inconsistency in the metadata, a report is generated. Further, a report of all unique artists and albums found in the metadata is generated.

Abstract: Techniques are provided involving combining several concurrent changes into one consistent condensed transaction within a metadata transaction log using an accumulation list that can be processed to generate a single transaction which may be quickly stored in the metadata transaction log. The improved techniques thus reduce latencies for later concurrent changes and save space within the metadata transaction log.

Abstract: An improved system and method for query processing in a distributed column chunk data store is provided. A distributed column chunk data store may be provided by multiple storage servers operably coupled to a network. A storage server provided may include a database engine for partitioning a data table into the column chunks for distributing across multiple storage servers, a storage shared memory for storing the column chunks during processing of semantic operations performed on the column chunks, and a storage services manager for striping column chunks of a partitioned data table across multiple storage servers. Query processing may be performed by storage servers or query processing servers operably coupled by a network to storage servers in the column chunk data store. To do so, a hierarchy of servers may be dynamically determined to process execution steps of a query transformed for distributed processing.

Abstract: Techniques for customizing search may include the following operations: outputting, to a computing device of a user, a Web page that enables selection of signals that are usable to generate search results; during a search session, receiving, through the Web page, a query and a selection corresponding to one or more of the signals, where the selection differs from a default set of search signals used by the search system for searching; obtaining, for output to the computing device, search results that are based on the query and the selection; and following the search session, configuring the search system to use the default set of search signals for searching.

Abstract: A system, method and computer program product capable of determining data completeness associated with an analysis based on a data model at the same time that the data in the data model is being analyzed. A root node may be determined, and all paths from the root node discovered. Each path is decomposed into steps, and a ratio is calculated for each step. The ratios may be multiplied for each path, and the aggregate of the paths may determine a measure of the data completeness corresponding to the analysis and return the results of the analysis and the measure of data completeness at the same time.

Abstract: Embodiments of the present invention disclose a method, computer program product, and system for optimizing execution of a query that includes a JOIN against a system utilizing data relationship concepts. A computer determines whether one or more data structures in JOIN include a parent/child relationship. The one or more data structures can be one or more tables. Responsive to determining that the one or more data structures in JOIN include a parent/child relationship, the computer determines whether the query that includes the JOIN includes a filter applied on one or more data structures in the JOIN with an OR condition between filters. Responsive to determining that the query that includes the JOIN does not include the filter applied on one or more data structures in JOIN with an OR condition between filters, the computer modifies the query that includes the JOIN into a query utilizing relationship constructs.

Abstract: Multiquery optimization is performed in the context of RDF/SPARQL. Heuristic algorithms partition an input batch of queries into groups such that each group of queries can be optimized together. The optimization incorporates an efficient algorithm to discover the common sub-structures of multiple SPARQL queries and an effective cost model to compare candidate execution plans. No assumptions are made about the underlying SPARQL query engine. This provides portability across different RDF stores.

Abstract: Systems and methods for optimizing a query, and more particularly, systems and methods for finding optimal plans for graph queries by casting the task of finding the optimal plan as an integer programming (ILP) problem. A method for optimizing a query, comprises building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern, determining a plurality of flows of query variables between the plurality of components, and determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query.

Abstract: A semantic query over an RDF database is received with RDF database statistics and access methods for evaluating triple patterns in the query. The semantic query is expressed as a parse tree containing triple patterns and logical relationships among the triple patterns. The parse tree and access methods create a data flow graph containing a plurality of triple pattern and access method pair nodes connected by a plurality of edges, and an optimal flow tree through the data flow graph is determined such that costs are minimized and all triple patterns in the semantic query are contained in the optimal flow tree. A structure independent execution tree defining a sequence of evaluation through the optimal flow tree is created and is transformed into a database structure dependent query plan. This is used to create an SQL query that is used to evaluate the semantic query over the RDF database.

Abstract: Disclosed in an electronic database which enables athletes to see a dynamic list of colleges where the athlete's specific sports times would qualify them to compete. As the athlete's times improve over the course of their high school career, the list of colleges changes as more and more colleges become candidates for the athlete. The athletes can easily communicate their times to the college coaches, and monitor the status of schools of interest. Likewise, high schools and clubs can also assist students in the college search process given access to the same data as the athletes. College coaches can also have access to the athlete times and other recruiting information, and can customize their search so that athletes meeting the college recruiting guidelines (i.e. minimum times in specific events, grade point average of athlete, etc) are highlighted across the sea of recruits, while those not meeting the recruiting guidelines can be ignored.

Abstract: A retrieval method on a database of documents including text and names of participants associated with the documents includes: receiving a text query facet of keywords and a persons query facet of participant names; computing an enriched text query as an aggregation of the text query facet, a monomodal expansion of the text query facet based on the keywords, a cross-modal expansion of the text query facet based on the participant names, and a topic expansion of the text query facet based on a topic model associating words and topics; computing an enriched persons query as an aggregation of the persons query facet, a monomodal expansion of the persons query facet based on the participant names, a cross-modal expansion of the persons query facet based on the keywords, and a community expansion of the persons query facet based on a community model associating persons and communities.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing search result page previews. In one aspect, a method includes receiving data that specify a set of search results responsive to a search query. Query-relevant content is selected to be included in a page preview for at least one of the search results. In turn, data that cause presentation of the page preview are provided. The data provided can cause presentation of the query-relevant content at an initial zoom level and at a higher zoom level, where the initial zoom level is a zoom level at which both the query-relevant content and other content from the resource are presented. The page preview can include a page tear that defines multiple portions of the page preview for a resource.

Abstract: Methods and apparatus, including computer program products, are provided for user interfaces. In one aspect, there is provided a method. The method may include generating a virtual desktop including a plurality of objects organized in accordance with at least one of a theme and a structure; providing a navigation pane on the virtual desktop to navigate through the plurality of objects; and providing a controller to enable a multi-level zoom on at least one of the plurality of objects on the virtual desktop. Related systems, methods, and articles of manufacture are also disclosed.